TY - JOUR
T1 - Decentralized Reconfigurable Multi-Robot Coordination from Local Connectivity and Collision Avoidance Specifications
AU - Vrohidis, Constantinos
AU - Bechlioulis, Charalampos P.
AU - Kyriakopoulos, Kostas J.
N1 - Publisher Copyright:
© 2017
PY - 2017/7
Y1 - 2017/7
N2 - Multi-robot motion planning from local connectivity specifications in unknown workspaces necessitates for reconfigurability, since real-time obstacle detection is likely to raise contradictions between collision avoidance and local connectivity specifications. Thus, a key issue in control synthesis is to allow topological changes in the communication graph in case of infeasibility, while maintaining the global connectivity of the robotic network and guaranteeing collision-free motion. Towards this direction, we propose: i) a distributed algorithm that coordinates robots, whenever feasible, based on local connectivity as well as collision avoidance specifications and ii) a novel decentralized algorithm that dynamically reconfigures the communication topology in case of conflicts with the collision avoidance specifications, without compromising the global connectivity of the communication graph. In the continuous control system, provably correct collision avoidance and robust synchronized motion are secured, employing the prescribed performance control methodology that ensures predefined transient and steady state response. Finally, simulated examples clarify the proposed methodology and verify its efficiency.
AB - Multi-robot motion planning from local connectivity specifications in unknown workspaces necessitates for reconfigurability, since real-time obstacle detection is likely to raise contradictions between collision avoidance and local connectivity specifications. Thus, a key issue in control synthesis is to allow topological changes in the communication graph in case of infeasibility, while maintaining the global connectivity of the robotic network and guaranteeing collision-free motion. Towards this direction, we propose: i) a distributed algorithm that coordinates robots, whenever feasible, based on local connectivity as well as collision avoidance specifications and ii) a novel decentralized algorithm that dynamically reconfigures the communication topology in case of conflicts with the collision avoidance specifications, without compromising the global connectivity of the communication graph. In the continuous control system, provably correct collision avoidance and robust synchronized motion are secured, employing the prescribed performance control methodology that ensures predefined transient and steady state response. Finally, simulated examples clarify the proposed methodology and verify its efficiency.
KW - Multi-agent systems
KW - distributed coordination
KW - task specifications
UR - http://www.scopus.com/inward/record.url?scp=85044298989&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85044298989&partnerID=8YFLogxK
U2 - 10.1016/j.ifacol.2017.08.2319
DO - 10.1016/j.ifacol.2017.08.2319
M3 - Article
AN - SCOPUS:85044298989
SN - 2405-8963
VL - 50
SP - 15798
EP - 15803
JO - 20th IFAC World Congress
JF - 20th IFAC World Congress
IS - 1
ER -