TY - GEN
T1 - Safe decentralized and reconfigurable multi-agent control with guaranteed convergence
AU - Vrohidis, Constantinos
AU - Bechlioulis, Charalampos P.
AU - Kyriakopoulos, Kostas J.
N1 - Publisher Copyright:
© 2017 IEEE.
PY - 2017/7/21
Y1 - 2017/7/21
N2 - In this paper, we consider a networked multi-robot system operating in an obstacle populated planar workspace under a single leader-multiple followers architecture. We propose a decentralized reconfiguration strategy of the set of connectivity and formation specifications that assures convergence to the desired point, while guaranteeing global connectivity. In particular, we construct a low-level Decentralized Navigation Functions based controller that encodes the goals and safety requirements of the system. However, owing to topological obstructions, stable critical points other than the desired one may appear. In such case, we employ a high-level distributed discrete procedure which attempts to solve a Distributed Constraint Satisfaction Problem on a local Voronoi partition, providing the necessary reconfiguration for the system to progress towards its goal. Eventually, we show that the system either converges to the desired point or attains a tree configuration with respect to the formation topology, in which case the system switches to a novel controller based on the Prescribed Performance technique, that eventually guarantees convergence. Finally, a simulation study clarifies and verifies the approach.
AB - In this paper, we consider a networked multi-robot system operating in an obstacle populated planar workspace under a single leader-multiple followers architecture. We propose a decentralized reconfiguration strategy of the set of connectivity and formation specifications that assures convergence to the desired point, while guaranteeing global connectivity. In particular, we construct a low-level Decentralized Navigation Functions based controller that encodes the goals and safety requirements of the system. However, owing to topological obstructions, stable critical points other than the desired one may appear. In such case, we employ a high-level distributed discrete procedure which attempts to solve a Distributed Constraint Satisfaction Problem on a local Voronoi partition, providing the necessary reconfiguration for the system to progress towards its goal. Eventually, we show that the system either converges to the desired point or attains a tree configuration with respect to the formation topology, in which case the system switches to a novel controller based on the Prescribed Performance technique, that eventually guarantees convergence. Finally, a simulation study clarifies and verifies the approach.
UR - http://www.scopus.com/inward/record.url?scp=85027996719&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85027996719&partnerID=8YFLogxK
U2 - 10.1109/ICRA.2017.7989034
DO - 10.1109/ICRA.2017.7989034
M3 - Conference contribution
AN - SCOPUS:85027996719
T3 - Proceedings - IEEE International Conference on Robotics and Automation
SP - 267
EP - 272
BT - ICRA 2017 - IEEE International Conference on Robotics and Automation
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2017 IEEE International Conference on Robotics and Automation, ICRA 2017
Y2 - 29 May 2017 through 3 June 2017
ER -