14 search results - page 1 / 3 » Exploiting Subgraph Structure in Multi-Robot Path Planning |
100
Voted
JAIR
2008
14 years 10 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...
106
Voted
AUSAI
2008
Springer
15 years 5 days 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
14 years 7 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...
88
Voted
IJRR
2002
14 years 10 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...
100
click to vote
BMCBI
2010
14 years 10 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...