TY - GEN
T1 - Connectivity preserving distributed swarm aggregation for multiple kinematic agents
AU - Dimarogonas, Dimos V.
AU - Kyriakopoulos, Kostas J.
PY - 2007
Y1 - 2007
N2 - A distributed swarm aggregation algorithm is developed for a team of multiple kinematic agents. Each agent is assigned with a control law which is the sum of two elements: a repulsive potential field, which is responsible for the collision avoidance objective, and an attractive potential field, that drives the agents to a configuration where they are close to each other and forces the agents that are initially located within the sensing radius of an agent to remain within this area for all time. In this way, the connectivity properties of the initially formed communication graph are rendered invariant for the trajectories of the closed loop system. It is shown that agents converge to a configuration where each agent is located at a bounded distance from each of its neighbors. The results are also extended to the case of nonholonomic kinematic agents and to the dynamic edge addition case, for which we derive a better bound in the swarm size than in the static case.
AB - A distributed swarm aggregation algorithm is developed for a team of multiple kinematic agents. Each agent is assigned with a control law which is the sum of two elements: a repulsive potential field, which is responsible for the collision avoidance objective, and an attractive potential field, that drives the agents to a configuration where they are close to each other and forces the agents that are initially located within the sensing radius of an agent to remain within this area for all time. In this way, the connectivity properties of the initially formed communication graph are rendered invariant for the trajectories of the closed loop system. It is shown that agents converge to a configuration where each agent is located at a bounded distance from each of its neighbors. The results are also extended to the case of nonholonomic kinematic agents and to the dynamic edge addition case, for which we derive a better bound in the swarm size than in the static case.
UR - http://www.scopus.com/inward/record.url?scp=51649120674&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=51649120674&partnerID=8YFLogxK
U2 - 10.1109/CDC.2007.4434601
DO - 10.1109/CDC.2007.4434601
M3 - Conference contribution
AN - SCOPUS:51649120674
SN - 1424414989
SN - 9781424414987
T3 - Proceedings of the IEEE Conference on Decision and Control
SP - 2913
EP - 2918
BT - Proceedings of the 46th IEEE Conference on Decision and Control 2007, CDC
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 46th IEEE Conference on Decision and Control 2007, CDC
Y2 - 12 December 2007 through 14 December 2007
ER -