3D rectilinear motion planning with minimum bend paths

IEEE International Conference on Intelligent Robots and Systems

Volumn 3, Issue , 2001, Pages 1491-1498

  Fitch, Robert ^a   Butler, Zack ^a   Rus, Daniela ^a  

^a Dartmouth Department of Computer Science_Dartmouth College   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; C (PROGRAMMING LANGUAGE); COLLISION AVOIDANCE; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; OPTIMIZATION; ROBOTS; THREE DIMENSIONAL;

MINIMUM BEND PATHS; SELF-RECONFIGURABLE ROBOTS; THREE-DIMENSIONAL RECTILINEAR MOTION PLANNING;

MOTION PLANNING;

EID: 0035559677     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. Rectilinear geodesics in 3-space (extended abstract)
2. A basis for self-repair robots using self-reconfiguring crystal modules
3. Cellular robotic system (CEBOT) as one of the realization of self-organizing intelligent universal manipulator
4. Locomotion versatility through self-reconfiguration
5. On bends and distances of paths among obstacles in two-layer interconnection model
6. Rectilinear paths among rectilinear obstacles
7. Link distance problems
8. 1 shortest paths among polygonal obstacles in the plane
9. Geometric shortest paths and network optimization
10. Hardware design of modular robotic system
11. Design and implementation of metamorphic robots
12. Geometric bicriteria optimal path problems
13. Rectilinear shortest paths in the presence of rectangular barriers
14. Crystalline robots: Self-reconfiguration with unit-compressible modules
15. On bends and lengths of rectilinear paths: A graph-theoretic approach
16. PolyBot: A modular reconfigurable robot
17. An experimental study on a self-repairing modular machine