By Topic

On leader election in multi-agent control systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Theodor Borsche ; Control Systems Group, Berlin Institute of Technology, Germany ; Sid Ahmed Attia

In this contribution, we discuss the election of an optimal leader out of a network of agents described by first integrator dynamics and running a consensus algorithm. The network of agents may be a group of autonomous robots or more generally communicating vehicles, and the target is, for instance, to move the formation to a new location. A leader is said to be optimal if it leads to a controllable network, and minimizes a quadratic cost of reaching a target for all the other agents of the network. In the first part, controllability conditions and a decentralized way of checking them are discussed. We then study the correlation between the value of a quadratic cost function measuring the leader performance and the network properties. Strong correlation is found between closeness and degree centrality indices of the agents and the cost of achieving the assigned tasks. This allows us to run the optimal leader election process without a central authority and without the nodes having full knowledge of the network topology.

Published in:

2010 Chinese Control and Decision Conference

Date of Conference:

26-28 May 2010