211 search results - page 2 / 43 » An Algorithm for Robot Path Planning with Cellular Automata |
ICRA
2005
IEEE
13 years 11 months ago
2005
IEEE
Abstract— We present a novel algorithm for motion planning of a deformable robot in a static environment. Given the initial and final configuration of the robot, our algorithm ...
IWANN
1997
Springer
13 years 10 months ago
1997
Springer
: The path planning problem is relevant for all applications in which a mobil robot should autonomously navigate. Finding the shortest path in an environment that is only partialy ...
ICRA
2005
IEEE
13 years 11 months ago
2005
IEEE
— We continue our investigation into the application of pervasive, embedded networks to support multi-robot tasks. In this work we use a new a hardware platform, the GNATs, to ai...
IJRR
2002
13 years 5 months ago
2002
Exact cellular decompositions represent a robot's free space by dividing it into regions with simple structure such that the sum of the regions fills the free space. These de...
IJRR
2002
13 years 5 months ago
2002
The goal of coverage path planning is to determine a path that passes a detector over all points in an environment. This work prescribes a provably complete coverage path planner ...