28 search results - page 1 / 6 » Graph Decomposition for Efficient Multi-Robot Path Planning |
IJCAI
2007
13 years 6 months ago
2007
JAIR
2008
13 years 4 months ago
2008
Multi-robot path planning is difficult due to the combinatorial explosion of the search space with every new robot added. Complete search of the combined state-space soon intracta...
CORR
2010
Springer
13 years 1 months ago
2010
Springer
It is proven that the connected pathwidth of any graph G is at most 2
AIPS
2009
13 years 5 months ago
2009
Current state-of-the-art planners solve problems, easy and hard alike, by search, expanding hundreds or thousands of nodes. Yet, given the ability of people to solve easy problems...
MICS
2008
13 years 4 months ago
2008
Multi-level overlay graphs represent a speed-up technique for shortest paths computation which is based on a hierarchical decomposition of a weighted directed graph G. They have b...