作者: Amélia CD Caldeira , Luís Tiago Paiva , Dalila BMM Fontes , Fernando ACC Fontes , None
DOI: 10.1109/CONTROLO.2018.8516407
关键词: Holonomic 、 Mobile robot 、 Shortest path problem 、 Topology 、 Nonholonomic system 、 Position (vector) 、 Computer science 、 Nonholonomic mobile robot
摘要: In this work we address the problem of switching shape a formation undistinguishable nonholonomic mobile robots. Each agent moves from current to its target oriented position using shortest path. We combine results previous on optimal when agents are holonomic with structure path for agents.