Rao, Sachit and Ghose, Debasish (2011) Sliding mode control-based algorithms for consensus in connected swarms. In: International Journal of Control, 84 (9). pp. 1477-1490.
2011-SRao-DG-IJC.pdf - Published Version
Restricted to Registered users only
Download (461Kb) | Request a copy
In this article, finite-time consensus algorithms for a swarm of self-propelling agents based on sliding mode control and graph algebraic theories are presented. Algorithms are developed for swarms that can be described by balanced graphs and that are comprised of agents with dynamics of the same order. Agents with first and higher order dynamics are considered. For consensus, the agents' inputs are chosen to enforce sliding mode on surfaces dependent on the graph Laplacian matrix. The algorithms allow for the tuning of the time taken by the swarm to reach a consensus as well as the consensus value. As an example, the case when a swarm of first-order agents is in cyclic pursuit is considered.
|Item Type:||Journal Article|
|Additional Information:||Copyright of this article belongs to Taylor and Francis Group.|
|Keywords:||multi-agent systems;consensus;sliding mode control;algebraic graphs|
|Department/Centre:||Division of Mechanical Sciences > Aerospace Engineering (Formerly, Aeronautical Engineering)|
|Date Deposited:||25 Oct 2011 09:57|
|Last Modified:||26 Oct 2011 05:19|
Actions (login required)