DocumentCode
2804201
Title
Parallel-processable recursive and heuristic method for path planning
Author
Suzuki, Hisashi ; Arimoto, Suguru
Author_Institution
Fac. of Comput. Sci. & Syst. Eng., Kyushu Inst. of Technol., Fukuoka, Japan
fYear
1991
fDate
3-5 Nov 1991
Firstpage
616
Abstract
A problem of task planning of a robot can result in, another problem of finding a path that connects some given initial point and final point. The article suggests prospect of a `wave front method´ that can find one of the shortest paths in a computation time being proportional to the length of the shortest paths. This wave front method is based on an analogy of the Huygens´ principle known in physics, and can be extended into the time dimension
Keywords
computational complexity; parallel algorithms; planning (artificial intelligence); robots; Huygens´ principle; computational complexity; heuristic method; parallel algorithms; path planning; recursive method; robot; shortest paths; task planning; time dimension; wave front method; Computer science; Hypercubes; Joining processes; Orbital robotics; Path planning; Physics; Space technology; State-space methods; Systems engineering and theory; Technology planning;
fLanguage
English
Publisher
ieee
Conference_Titel
Intelligent Robots and Systems '91. 'Intelligence for Mechanical Systems, Proceedings IROS '91. IEEE/RSJ International Workshop on
Conference_Location
Osaka
Print_ISBN
0-7803-0067-X
Type
conf
DOI
10.1109/IROS.1991.174545
Filename
174545
Link To Document