Solvability of multi robot motion planning problems on trees

Authors:
Ellips Masehian;Azadeh H. Nejad
Affiliations:
Faculty of Engineering, Tarbiat Modares University, Tehran, Iran;Faculty of Engineering, Tarbiat Modares University, Tehran, Iran
Venue:
IROS'09 Proceedings of the 2009 IEEE/RSJ international conference on Intelligent robots and systems
Year:
2009

Citing 3
Cited 0

A New Approach to Optimal Planning of Robot Motion on a Tree with Obstacles

ESA '96 Proceedings of the Fourth Annual European Symposium on Algorithms
Coordinating Pebble Motion On Graphs, The Diameter Of Permutation Groups, And Applications

SFCS '84 Proceedings of the 25th Annual Symposium onFoundations of Computer Science, 1984
Exploiting subgraph structure in multi-robot path planning

Journal of Artificial Intelligence Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

Multi robot motion planning problems can be solved very efficiently when the Configuration Space is mapped onto a Graph. Before planning, however, it must be assured that the constructed graph is reachable (solvable) for the given number and configuration of robots. Solvable Trees are types of trees that let any arrangement of a specified number of robots be reached from any initial arrangement through sequential moves of robots on vertices of the tree. In this paper the properties of Solvable Trees are investigated, and Minimal Solvable Trees, which are the smallest solvable trees in terms of the number of vertices, are introduced as a new concept. Also, a new algorithm with linear time complexity is proposed for deciding whether a multi robot motion planning problem has a solution on a tree, without explicitly solving it.