scispace - formally typeset
Open AccessJournal ArticleDOI

An Overview of Recent Progress in the Study of Distributed Multi-Agent Coordination

TLDR
In this article, the authors reviewed some main results and progress in distributed multi-agent coordination, focusing on papers published in major control systems and robotics journals since 2006 and proposed several promising research directions along with some open problems that are deemed important for further investigations.
Abstract
This paper reviews some main results and progress in distributed multi-agent coordination, focusing on papers published in major control systems and robotics journals since 2006. Distributed coordination of multiple vehicles, including unmanned aerial vehicles, unmanned ground vehicles, and unmanned underwater vehicles, has been a very active research subject studied extensively by the systems and control community. The recent results in this area are categorized into several directions, such as consensus, formation control, optimization, and estimation. After the review, a short discussion section is included to summarize the existing research and to propose several promising research directions along with some open problems that are deemed important for further investigations.

read more

Content maybe subject to copyright    Report

Please do not remove this page
An overview of recent progress in the study of
distributed multi-agent coordination
Cao, Yongcan; Yu, Wenwu; Ren, Wei; Chen, Guanrong
https://researchrepository.rmit.edu.au/discovery/delivery/61RMIT_INST:ResearchRepository/12246869400001341?l#13248385820001341
Cao, Y., Yu, W., Ren, W., & Chen, G. (2013). An overview of recent progress in the study of distributed
multi-agent coordination. IEEE Transactions on Industrial Informatics, 9(1), 427–438.
https://doi.org/10.1109/TII.2012.2219061
Published Version: https://doi.org/10.1109/TII.2012.2219061
Downloaded On 2022/08/09 23:55:43 +1000
© 2005-2012 IEEE.
Repository homepage: https://researchrepository.rmit.edu.au
Please do not remove this page

Thank
7KH5
0
RXWSXW
V
50,75
Citati
o
See th
Versio
n
Copyri
Link t
o

you for do
0
,75HVHDU
F
V
RI50,78
5HVHDUFK5H
o
n:
is record
i
n
:
ght State
m
o
Publishe
d
wnloading
F
K5HSRVLW
R
QLYHUVLW\UH
V
HSRVLWRU\KWWSUHVHDUFKEDQNUPLWHGXDX
i
n the RM
I
m
ent: ©
Version:
this docu
m
R
U\LVDQRS
H
V
HDUFKHUV
I
T Resear
c
m
ent from
HQDFFHVV
G
c
h Reposit
the RMIT
R
G
DWDEDVHV
K
ory at:
R
esearch
R
K
RZFDVLQJ
W
R
epositor
y
WKHUHVHDU
F

F
K
PLEASE DO NOT REMOVE THIS PAGE
Cao, Y, Yu, W, Ren, W and Chen, G 2013, 'An overview of recent progress in the study of
distributed multi-agent coordination', IEEE Transactions on Industrial Informatics, vol. 9, no.
1, pp. 427-438.
http://researchbank.rmit.edu.au/view/rmit:20438
A
ccepted Manuscript
2005-2012 IEEE.
http://researchbank.rmit.edu.au/view/rmit:20438

1
An Overview of Recent Progress in the Study
of Distributed Multi-agent Coordination
Yongcan Cao, Member, IEEE, Wenwu Yu, Member, IEEE,
Wei Ren, Member, IEEE, and Guanrong Chen Fellow, IEEE
Abstract
This article reviews some main results and progress in distributed multi-agent coordination, with
the focus on papers published in major control systems and robotics journals since 2006. Distributed
coordination of multiple vehicles, including unmanned aerial vehicles (UAVs), unmanned ground vehicles
(UGVs) and unmanned underwater vehicles (UUVs), has been a very active research subject studied
extensively by the systems and control community. The recent results in this area are categorized into
several directions, such as consensus, formation control, optimization, distributed task assignment, and
estimation. After the review, a short discussion section is included to summarize the existing research
and to propose several promising research directions along with some open problems that are deemed
important therefore deserving further investigations.
Index Terms
Distributed coordination, formation control, sensor network, multi-agent system
I. INTRODUCTION
Control theory and practice may date back to the beginning of the last century when Wright Brothers
attempted their first test flight in 1903. Since then, control theory has gradually gained popularity, receiving
more and wider attention especially during the World War II when it was developed and applied to fire-
control systems, missile navigation and guidance, as well as various electronic automation devices. In
This work was supported by ......, and the Hong Kong RGC under GRF Grant CityU1114/11E.
Y. Cao and W. Ren are with the Department of Electrical and Computer Engineering, Utah State University, Logan, Utah
84322, USA. W. Yu is with the Department of Mathematics, Southeast University, Nanjing 210096, China. G. Chen is with the
Department of Electronic Engineering, City University of Hong Kong, Hong Kong SAR, China.
Manuscript submitted to IEEE Transactions on Industrial Informatics on 31 July 2011.
July 31, 2011 DRAFT

2
the past several decades, modern control theory was further advanced due to the booming of aerospace
technology based on large-scale engineering systems.
During the rapid and sustained development of the modern control theory, technology for controlling
a single vehicle, albeit higher-dimensional and complex, has become relatively mature and has produced
many effective control tools such as PID control, adaptive control, nonlinear control, intelligent control,
and robust control methodologies. In the past two decades in particular, control of multiple vehicles
has received increasing demands spurred by the fact that many benefits can be obtained when a single
complicated vehicle is equivalently replaced by multiple yet simpler vehicles. In this endeavor, two ap-
proaches are commonly adopted for controlling multiple vehicles: a centralized approach and a distributed
approach. The centralized approach is based on a basic assumption that a central station is available and
powerful enough to control a whole group of vehicles. Essentially, the centralized approach is a direct
extension of the traditional single-vehicle-based control philosophy and strategy. On the contrary, the
distributed approach does not require a central station for control, at the cost of becoming far more
complex than the centralized one in structure and organization. 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. Therefore, the focus of this overview is placed on the distributed approach.
In distributed control of a group of autonomous vehicles such as UAVs, UGVs and UUVs, the main
objective typically is to have the whole group of vehicles working in a cooperative fashion throughout
a distributed protocol. Here, cooperative refers to a close relationship among all vehicles in the group
where information sharing plays a central role. The distributed approach has many advantages in achiev-
ing cooperative group performances, especially with low operational costs, less system requirements,
high robustness, strong adaptivity, and flexible scalability, therefore has been widely recognized and
appreciated.
The study of distributed control of multiple vehicles was perhaps first motivated by the work in
distributed computing [1], management science [2], [3], and statistical physics [4]. In the control systems
society, some pioneering works are generally referred to [5], [6], where an asynchronous agreement
problem was studied for distributed decision-making problems. Thereafter, some consensus algorithms
were studied under various information-flow constraints [7]–[11]. There are several journal special issues
on the related topics published after 2006, including the IEEE Transactions on Control Systems Technol-
ogy (vol. 15, no. 4, 2007), Proceedings of the IEEE (vol. 94, no. 4, 2007), ASME Journal of Dynamic
July 31, 2011 DRAFT

3
Systems, Measurement, and Control (vol. 129, no. 5, 2007), SIAM Journal of Control and Optimization
(vol. 48, no.1, 2009), and International Journal of Robust and Nonlinear Control (Vol. 21, no. 12, 2011).
In addition, there are some more recent reviews and progress reports given in the surveys [12]–[15] and
the books [16]–[21].
This article reviews some main results and recent progress in distributed multi-agent coordination,
published in major control systems and robotics journals since 2006. For results before 2006, the readers
are referred to [12]–[15].
Specifically, this article reviews the recent research results in the following directions, which are not
independent but actually may have overlapping to some extent:
1. Consensus and the like (synchronization, rendezvous). Consensus refers to the group behavior that
all the agents asymptotically reach a certain common agreement through a local distributed protocol,
with or without predefined common speed and orientation.
2. Distributed formation and the like (flocking). Distributed formation refers to the group behavior
that all the agents form a pre-designed geometrical configuration through local interactions with or
without a common reference.
3. Distributed optimization. This refers to algorithmic developments for the analysis and optimization
of large-scale distributed systems.
4. Distributed task assignment. This refers to the implementation of a task-assignment algorithm in a
distributed fashion based on local information.
5. Distributed estimation and control. This refers to distributed control design based on local estimation
about the needed global information.
The rest of this article is organized as follows. In Section II, basic notations of graph theory and
stochastic matrices are introduced. Sections III, IV, V, VI, and VII describe the recent research results
and progress in consensus, formation control, optimization, task assignment, and estimation, respectively.
Finally, the article is concluded by a short section of discussions with future perspectives.
II. PRELIMINARIES
This section introduces basic concepts and notations of graph theory and stochastic matrices.
A. Graph Theory
For a system of n connected agents, its network topology may be modeled as a directed graph denoted
G = (V, W), where V = {v
1
, v
2
, ··· , v
n
} and W V ×V are, respectively, the set of agents and the set
July 31, 2011 DRAFT

Citations
More filters
Proceedings Article

Learning multiagent communication with backpropagation

TL;DR: A simple neural model is explored, called CommNet, that uses continuous communication for fully cooperative tasks and the ability of the agents to learn to communicate amongst themselves is demonstrated, yielding improved performance over non-communicative agents and baselines.
Journal ArticleDOI

An Overview of Recent Advances in Event-Triggered Consensus of Multiagent Systems

TL;DR: An overview of recent advances in event-triggered consensus of MASs is provided and some in-depth analysis is made on several event- Triggered schemes, including event-based sampling schemes, model-based event-Triggered scheme, sampled-data-basedevent-trIGgered schemes), and self- triggered sampling schemes.
Posted Content

QMIX: Monotonic Value Function Factorisation for Deep Multi-Agent Reinforcement Learning

TL;DR: In this article, the authors propose a value-based method that can train decentralised policies in a centralised end-to-end fashion in simulated or laboratory settings, where global state information is available and communication constraints are lifted.
Journal ArticleDOI

Recent Advances in Consensus of Multi-Agent Systems: A Brief Survey

TL;DR: Focusing on different kinds of constraints on the controller and the self-dynamics of each individual agent, as well as the coordination schemes, the recent results are categorized into consensus with constraints, event-based consensus, consensus over signed networks, and consensus of heterogeneous agents.
Journal ArticleDOI

An Overview and Deep Investigation on Sampled-Data-Based Event-Triggered Control and Filtering for Networked Systems

TL;DR: This paper provides an overview and makes a deep investigation on sampled-data-based event-triggered control and filtering for networked systems, finding that a sampled- Data-based Event-Triggered Scheme can ensure a positive minimum inter-event time and make it possible to jointly design suitable feedback controllers and event- triggered threshold parameters.
References
More filters
Journal ArticleDOI

Consensus problems in networks of agents with switching topology and time-delays

TL;DR: A distinctive feature of this work is to address consensus problems for networks with directed information flow by establishing a direct connection between the algebraic connectivity of the network and the performance of a linear consensus protocol.
Journal ArticleDOI

Consensus and Cooperation in Networked Multi-Agent Systems

TL;DR: A theoretical framework for analysis of consensus algorithms for multi-agent networked systems with an emphasis on the role of directed information flow, robustness to changes in network topology due to link/node failures, time-delays, and performance guarantees is provided.
Book

Algebraic Graph Theory

TL;DR: The Laplacian of a Graph and Cuts and Flows are compared to the Rank Polynomial.
Journal ArticleDOI

Coordination of groups of mobile autonomous agents using nearest neighbor rules

TL;DR: A theoretical explanation for the observed behavior of the Vicsek model, which proves to be a graphic example of a switched linear system which is stable, but for which there does not exist a common quadratic Lyapunov function.
Proceedings ArticleDOI

Flocks, herds and schools: A distributed behavioral model

TL;DR: In this article, an approach based on simulation as an alternative to scripting the paths of each bird individually is explored, with the simulated birds being the particles and the aggregate motion of the simulated flock is created by a distributed behavioral model much like that at work in a natural flock; the birds choose their own course.
Related Papers (5)
Frequently Asked Questions (16)
Q1. What are the contributions in "An overview of recent progress in the study of distributed multi-agent coordination" ?

This article reviews some main results and progress in distributed multi-agent coordination, with the focus on papers published in major control systems and robotics journals since 2006. Distributed coordination of multiple vehicles, including unmanned aerial vehicles ( UAVs ), unmanned ground vehicles ( UGVs ) and unmanned underwater vehicles ( UUVs ), has been a very active research subject studied extensively by the systems and control community. After the review, a short discussion section is included to summarize the existing research and to propose several promising research directions along with some open problems that are deemed important therefore deserving further investigations. 

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. 

Distributed surveillance has a number of potential applications, such as board security guarding, forest fire monitoring, and oil spill patrolling. 

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]. 

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. 

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. 

An interesting problem in formation tracking is to design a distributed control algorithm to drive a team of agents to track some desired state. 

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. 

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. 

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. 

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. 

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]. 

In [233], an incremental subgradient approach was used to solve the optimizationJuly 31, 2011 DRAFT26problem for a ring type of network. 

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. 

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. 

it remains a challenging problem to incorporate both dynamics of consensus and probabilistic filtering (Kalman) into a unified methodology.