Name
Abstract | ||
|---|---|---|
We present a motion planner for the classical mover's problem in three dimensions that is both resolution-complete and efficient in that it has performance commensurate with task difficulty. It is based on the SANDROS search strategy, which uses a hierarchical, multi-resolution representation of the configuration space along with a generate-and-test paradigm for solution paths. This planner can control the trade-offs between the computation resource and algorithmic completeness/solution path quality, and thus can fully utilize the available computing power. It is useful for navigation of mobile robots, submarines and spacecraft, or part motion feasibility in assembly planning |
Year | DOI | Venue |
|---|---|---|
1995 | 10.1109/ROBOT.1995.525370 | Robotics and Automation, 1995. Proceedings., 1995 IEEE International Conference |
Keywords | Field | DocType |
heuristic programming,optimisation,path planning,robots,search problems,SANDROS search strategy,algorithmic completeness,classical mover's problem,computation resource,configuration space,heuristic,motion planner,navigation,robots | Motion planning,Mathematical optimization,Heuristic,Computer science,Planner,Control engineering,Artificial intelligence,Robot,Completeness (statistics),Mobile robot,Configuration space,Spacecraft | Conference |
Volume | ISSN | ISBN |
1 | 1050-4729 | 0-7803-1965-6 |
Citations | PageRank | References |
18 | 2.59 | 14 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yong K. Hwang | 1 | 18 | 2.59 |
| Pang C. Chen | 2 | 85 | 20.60 |