MANIPULATION
SANDROS: A motion planner with performance proportional to task difficulty
Pang C Chen, Yong K. Hwang
- Year
- 1991
- Citations
- 7
Abstract
To address the need of a practical motion planner for manipulators, we present an efficient and resolution-complete algorithm that has performance commensurate with task difficulty. The algorithm uses SANDROS, a new search strategy that combines hierarchical, nonuniform-multi-resolution, and best-fit search to find a near-optimal solution in the configuration space. This algorithm can be applied to any manipulator, and has been tested with 5 and 6-degree-of-freedom robots, with execution time ranging from 20 seconds to 10 minutes on a 16 MIPS workstation. 14 refs., 3 figs., 1 tab.
Keywords
PlannerComputer scienceTask (project management)Motion (physics)Motion planningMotion controlArtificial intelligenceComputer visionRobotEngineering
Related papers
OTHER
📊 26,957 cites
Statistical Learning Theory
Yuhai Wu, Vladimir Vapnik
1999
PERCEPTION
📊 22,245 cites
Artificial intelligence: a modern approach
1995
OTHER
📊 18,993 cites
Applied Nonlinear Control
Jean-Jacques Slotine, Weiping Li
1991
SWARM
📊 14,853 cites
A new optimizer using particle swarm theory
R.C. Eberhart, James Kennedy
2002