Coordination arrival control for multi‐agent systems |
| |
| Authors: | Rui Li YingJing Shi Kok Lay Teo |
| |
| Affiliation: | 1. School of Automation Engineering, University of Electronic Science and Technology of China, Chengdu, China;2. School of Aeronautics and Astronautics, University of Electronic Science and Technology of China, Chengdu, China;3. Department of Mathematics and Statistics, Curtin University, Perth, Western Australia, Australia |
| |
| Abstract: | 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. |
| |
| Keywords: | multi‐agent systems distributed control coordination arrival obstacle avoidance arriving structure |
|
|
