Premium
Coordination arrival control for multi‐agent systems
Author(s) -
Li Rui,
Shi YingJing,
Teo Kok Lay
Publication year - 2015
Publication title -
international journal of robust and nonlinear control
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.361
H-Index - 106
eISSN - 1099-1239
pISSN - 1049-8923
DOI - 10.1002/rnc.3359
Subject(s) - computer science , obstacle , arrival time , construct (python library) , point (geometry) , distributed computing , control (management) , mathematical optimization , time of arrival , real time computing , computer network , artificial intelligence , engineering , mathematics , geometry , transport engineering , political science , law , channel (broadcasting)
Summary The coordination arrival problems of first‐order multi‐agent systems with the arriving structure and the time structure requirements are considered for the cases with no obstacle and obstacle. To describe the distributed coordination arrival problems, we first introduce needed definitions, such as coordination arrival, threat point, and arrival structure. By selecting the estimated value of the arriving time of the agent as variable, we then develop a central estimating algorithm, which is used to construct the arriving protocols. Based on the estimating algorithm, we build and analyze coordination arriving protocols for the proposed coordination arrival problems. Several simulation examples are presented to validate the proposed algorithms. Copyright © 2015 John Wiley & Sons, Ltd.