Tight Upper Bound for the Scrambling Constant of Uniformly Jointly Connected Directed Graphs With Application to Consensus of Multiagent Systems.
Chao HuangGang FengHao ZhangHuaicheng YanPublished in: IEEE Trans. Control. Netw. Syst. (2021)
Keyphrases
- multiagent systems
- upper bound
- directed graph
- lower bound
- autonomous agents
- multi agent
- worst case
- multi agent systems
- distributed artificial intelligence
- random walk
- directed acyclic graph
- coalition formation
- design methodologies
- machine learning
- undirected graph
- decentralized control
- multiagent reinforcement learning
- multiagent architecture