14 search results - page 1 / 3 » Exploiting Subgraph Structure in Multi-Robot Path Planning |
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...
AUSAI
2008
Springer
13 years 6 months ago
2008
Springer
Planning collision-free paths for multiple robots traversing a shared space is a problem that grows combinatorially with the number of robots. The naive centralised approach soon ...
CMOT
2010
13 years 1 months ago
2010
Planning a path to a destination, given a number of options and obstacles, is a common task. We suggest a two-component cognitive model that combines retrieval of knowledge about t...
IJRR
2002
13 years 4 months ago
2002
We study the path planning problem, without obstacles, for closed kinematic chains with n links connected by spherical joints in space or revolute joints in the plane. The configu...
BMCBI
2010
13 years 4 months ago
2010
Background: Finding the subgraphs of a graph database that are isomorphic to a given query graph has practical applications in several fields, from cheminformatics to image unders...