Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
695082 | Automatica | 2016 | 5 Pages |
Abstract
This paper introduces a discontinuous rendezvous algorithm for multi-agent systems which allows a group of agents to achieve finite-time rendezvous with connectivity preservation as well as disturbance rejection. The proposed discontinuous rendezvous algorithm is based on a class of general communication functions with certain available information range. Nonsmooth stability analysis and graph theory are employed to obtain the finite-time rendezvous. An upper bound on the convergence time is also given. Our result simultaneously satisfies the three features: connectivity preservation, disturbance rejection and finite-time convergence.
Keywords
Related Topics
Physical Sciences and Engineering
Engineering
Control and Systems Engineering
Authors
Jiu-Gang Dong,