An Overview of Recent Progress in the Study of Distributed Multi-Agent Coordination
read more
Citations
Learning multiagent communication with backpropagation
An Overview of Recent Advances in Event-Triggered Consensus of Multiagent Systems
QMIX: Monotonic Value Function Factorisation for Deep Multi-Agent Reinforcement Learning
Recent Advances in Consensus of Multi-Agent Systems: A Brief Survey
An Overview and Deep Investigation on Sampled-Data-Based Event-Triggered Control and Filtering for Networked Systems
References
Consensus problems in networks of agents with switching topology and time-delays
Consensus and Cooperation in Networked Multi-Agent Systems
Algebraic Graph Theory
Coordination of groups of mobile autonomous agents using nearest neighbor rules
Flocks, herds and schools: A distributed behavioral model
Related Papers (5)
Consensus problems in networks of agents with switching topology and time-delays
Consensus seeking in multiagent systems under dynamically changing interaction topologies
Frequently Asked Questions (16)
Q2. What are the common methods used to show consensus in multi-agent systems?
In order to show consensus in multi-agent systems with time-varying network structures, stochastic matrix theory [5]–[7], [10] and convexity analysis [11] are often applied.
Q3. What are some of the potential applications of distributed surveillance?
Distributed surveillance has a number of potential applications, such as board security guarding, forest fire monitoring, and oil spill patrolling.
Q4. How can the authors solve flocking with a dynamic group reference?
If enough information of the group reference is known, such as acceleration and/or velocity information of the group reference, flocking with a dynamic group reference can be solved by employing a gradient-based control law [203]–[205].
Q5. What is the meaning of distributed task assignment?
Distributed task assignment refers to the study of task assignment of a group of dynamical agents in a distributed manner, which can be roughly categorized into coverage control, scheduling, and surveillance.
Q6. What is the main reason for the study of consensus under various system dynamics?
Although the study of consensus under various system dynamics is due to the existence of complex dynamics in practical systems, it is also interesting to observe that system dynamics play an important role in determining the final consensus state.
Q7. What is the purpose of the formation tracking problem?
An interesting problem in formation tracking is to design a distributed control algorithm to drive a team of agents to track some desired state.
Q8. How can the authors convert a formation tracking problem to a traditional stability problem?
The formation tracking problem can be converted to a traditional stability problem by redefining the variables as the errors between each agent’s state and the group reference.
Q9. Why is it important to study the effects of time delay on the stability of consensus?
Because time delay might affect the system stability, it is important to study under what conditions consensus can still be guaranteed even if time delay exists.
Q10. What is the consensus problem in the deterministic setting?
Some other times, when considering random communication failures, random packet drops, communication channel instabilities inherited in physical communication channels, etc., it is necessary and important to study consensus problem in the stochastic setting where a network topology evolves according to some random distributions.
Q11. What is the main research question for consensus in a sampled-data framework?
Note that the existing research on consensus in a sampled-data framework mainly focuses on the simple system dynamics and thus the closed-loop system can be represented in terms of a linear matrix equation.
Q12. What is the main approach to maintaining the connectivity of a team of agents?
The main approach to maintaining the connectivity of a team of agents is to define some artificial potentials (between any pair of agents) in a proper way such that if two agents are neighbors initially then they will always communicate with each other thereafter [206], [219]–[228].
Q13. What is the common approach to solve the optimization problem for a ring type of network?
In [233], an incremental subgradient approach was used to solve the optimizationJuly 31, 2011 DRAFT26problem for a ring type of network.
Q14. Why is formation tracking more difficult than the group reference?
Due to the existence of the group reference, formation tracking is usually much more challenging than formation producing and control algorithms for the latter might not be useful for the former.
Q15. What are the main advantages of the distributed approach?
Although both approaches are considered practical depending on the situations and conditions of the real applications, the distributed approach is believed more promising due to many inevitable physical constraints such as limited resources and energy, short wireless communication ranges, narrow bandwidths, and large sizes of vehicles to manage and control.
Q16. What is the difficult problem to incorporate into a unified methodology?
it remains a challenging problem to incorporate both dynamics of consensus and probabilistic filtering (Kalman) into a unified methodology.