21 search results - page 1 / 5 » On the complexity of optimal reconfiguration planning for mo... |
64
Voted
ICRA
2010
IEEE
14 years 8 months ago
2010
IEEE
— This paper presents a thorough analysis of the computational complexity of optimal reconfiguration planning problem for chain-type modular robots, i.e. finding the least number...
ISER
2000
Springer
15 years 1 months ago
2000
Springer
: We discuss the applications of modular self-reconfigurable robots to navigation. We show that greedy algorithms are complete for motion planning over a class of modular reconfigu...
ICRA
2002
IEEE
15 years 2 months ago
2002
IEEE
—Binary robotic devices with large degrees of freedom have been proposed by a number of researchers. However, experimental implementations of these concepts have been built with ...
CACM
2002
14 years 9 months ago
2002
: We discuss the applications of modular self-reconfigurable robots to navigation. We show that greedy algorithms are complete for motion planning over a class of modular reconfigu...
101
click to vote
DARS
2000
Springer
15 years 2 months ago
2000
Springer
In this paper, we address the issue of motion planning for a bipartite class of modular self-reconfiguring robotic system (I-Cubes) that is a collection of active elements providin...