Path planning for everyday robotics with SANDROS

We discuss the integration of the SANDROS path planner into a general robot simulation and control package with the inclusion of a fast geometry engine for distance calculations. This creates a single system that allows the path to be computed, simulated, and then executed on the physical robot. The architecture and application procedures are presented. Also, we present examples of its usage in typical environments found in our organization. The resulting system is as easy to use as the general simulation system and is fast enough to be used interactively on an everyday basis.

[1]  Yong K. Hwang,et al.  SANDROS: a motion planner with performance proportional to task difficulty , 1992, Proceedings 1992 IEEE International Conference on Robotics and Automation.

[2]  S. Cameron,et al.  Towards efficient motion planning for manipulators with complex geometry , 1995, Proceedings. IEEE International Symposium on Assembly and Task Planning.

[3]  Pang C. Chen.  Adaptive path planning: algorithm and analysis , 1995, Proceedings of 1995 IEEE International Conference on Robotics and Automation.

[4]  Lydia E. Kavraki,et al.  Randomized preprocessing of configuration for fast path planning , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.

[5]  Dinesh Manocha,et al.  OBBTree: a hierarchical structure for rapid interference detection , 1996, SIGGRAPH.

[6]  Kamal K. Gupta,et al.  Practical global motion planning for many degrees of freedom: a novel approach within sequential framework , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.

[7]  E. Mazer,et al.  On manipulation planning , 1995, Proceedings. IEEE International Symposium on Assembly and Task Planning.

[8]  Roderic A. Grupen,et al.  The applications of harmonic functions to robotics , 1993, J. Field Robotics.

[9]  Narendra Ahuja,et al.  Gross motion planning—a survey , 1992, CSUR.

[10]  Kamal K. Gupta,et al.  Motion planning for many degrees of freedom: sequential search with backtracking , 1995, IEEE Trans. Robotics Autom..

[11]  Tomás Lozano-Pérez,et al.  Spatial Planning: A Configuration Space Approach , 1983, IEEE Transactions on Computers.

[12]  David P. Dobkin,et al.  The quickhull algorithm for convex hulls , 1996, TOMS.

[13]  El-Ghazali Talbi,et al.  The "Ariadne's clew" algorithm: global planning with local methods , 1993, Proceedings of 1993 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS '93).

[14]  Kamal K. Gupta,et al.  Fast collision avoidance for manipulator arms: a sequential search strategy , 1990, Proceedings., IEEE International Conference on Robotics and Automation.

[15]  Koichi Kondo,et al.  Motion planning with six degrees of freedom by multistrategic bidirectional heuristic free-space enumeration , 1991, IEEE Trans. Robotics Autom..