Motion planning of objects in contact by the silhouette algorithm

Describes motion planning of objects in contact by the silhouette algorithm. The problem is formulated to meet the pre-requisites of the silhouette algorithm, and numeric-symbolic algebraic algorithms are given to solve it. As an example, we have been implementing the algorithm for motion planning of polygons in contact, but it can be extended to that of polyhedra in contact.

[1]  E. Feron,et al.  Robust hybrid control for autonomous vehicle motion planning , 2000, Proceedings of the 39th IEEE Conference on Decision and Control (Cat. No.00CH37187).

[2]  H. Inoue,et al.  Dynamic walking pattern generation for a humanoid robot based on optimal gradient method , 1999, IEEE SMC'99 Conference Proceedings. 1999 IEEE International Conference on Systems, Man, and Cybernetics (Cat. No.99CH37028).

[3]  Jean-Claude Latombe,et al.  Autonomous agents for real-time animation , 1999 .

[4]  Steven M. LaValle,et al.  RRT-connect: An efficient approach to single-query path planning , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).

[5]  Nancy M. Amato,et al.  A Kinematics-Based Probabilistic Roadmap Method for Closed Chain Systems , 2001 .

[6]  Masayuki Inaba,et al.  Graphical simulation and high-level control of humanoid robots , 2000, Proceedings. 2000 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2000) (Cat. No.00CH37113).

[7]  Masayuki Inaba,et al.  Simulating High-Level Robot Behaviors , 2000 .

[8]  Jean-Claude Latombe,et al.  Robot Motion Planning: A Distributed Representation Approach , 1991, Int. J. Robotics Res..

[9]  Micha Sharir,et al.  Davenport-Schinzel sequences and their geometric applications , 1995, Handbook of Computational Geometry.

[10]  Brian Mirtich,et al.  V-Clip: fast and robust polyhedral collision detection , 1998, TOGS.

[11]  John F. Canny,et al.  Computing Roadmaps of General Semi-Algebraic Sets , 1991, Comput. J..

[12]  Zvi Shiller,et al.  Dynamic motion planning of autonomous vehicles , 1991, IEEE Trans. Robotics Autom..

[13]  Piotr Indyk,et al.  Approximate nearest neighbors: towards removing the curse of dimensionality , 1998, STOC '98.

[14]  Jean-Claude Latombe,et al.  Planning motions with intentions , 1994, SIGGRAPH.

[15]  Mark H. Overmars,et al.  A random approach to motion planning , 1992 .

[16]  T. Flash,et al.  The coordination of arm movements: an experimentally confirmed mathematical model , 1985, The Journal of neuroscience : the official journal of the Society for Neuroscience.

[17]  Rajeev Motwani,et al.  Path planning in expansive configuration spaces , 1997, Proceedings of International Conference on Robotics and Automation.

[18]  John H. Reif,et al.  Complexity of the mover's problem and generalizations , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[19]  Jean-Claude Latombe,et al.  Kinodynamic motion planning amidst moving obstacles , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).

[20]  Miomir Vukobratović,et al.  Biped Locomotion: Dynamics, Stability, Control and Application , 1990 .

[21]  Pierre Bessière,et al.  The Ariadne's Clew Algorithm , 1993, J. Artif. Intell. Res..

[22]  Randy C. Brost,et al.  Computing metric and topological properties of configuration-space obstacles , 1989, Proceedings, 1989 International Conference on Robotics and Automation.

[23]  Leonidas J. Guibas,et al.  H-Walk: hierarchical distance computation for moving convex bodies , 1999, SCG '99.

[24]  Jean-Daniel Boissonnat,et al.  Polygon Placement Under Translation and Rotation , 1988, RAIRO Theor. Informatics Appl..

[25]  S. LaValle.  Rapidly-exploring random trees : a new tool for path planning , 1998 .

[26]  David E. Orin,et al.  Efficient Dynamic Computer Simulation of Robotic Mechanisms , 1982 .

[27]  Lydia E. Kavraki,et al.  A Random Sampling Scheme for Path Planning , 1997, Int. J. Robotics Res..

[28]  Christian Laugier,et al.  Motion planning of autonomous off-road vehicles under physical interaction constraints , 1995, Proceedings of 1995 IEEE International Conference on Robotics and Automation.

[29]  Steven M. LaValle,et al.  Rapidly-Exploring Random Trees: Progress and Prospects , 2000 .

[30]  B. Faverjon,et al.  Probabilistic Roadmaps for Path Planning in High-Dimensional Con(cid:12)guration Spaces , 1996 .

[31]  Lydia E. Kavraki,et al.  Path planning using lazy PRM , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).

[32]  Bernard Mourrain,et al.  A symbolic-numeric silhouette algorithm , 2000, Proceedings. 2000 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2000) (Cat. No.00CH37113).

[33]  Sunil Arya,et al.  An optimal algorithm for approximate nearest neighbor searching fixed dimensions , 1998, JACM.

[34]  J. Pratt,et al.  Exploiting Natural Dynamics in the Control of a 3 D Bipedal Walking Simulation , 1999 .

[35]  Steven M. LaValle,et al.  Randomized Kinodynamic Planning , 1999, Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C).

[36]  Hirohisa Hirukawa,et al.  A motion planning algorithm for convex polyhedra in contact under translation and rotation , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.

[37]  Mark H. Overmars,et al.  The Gaussian sampling strategy for probabilistic roadmap planners , 1999, Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C).

[38]  Brian Mirtich,et al.  Impulse-based dynamic simulation of rigid body systems , 1996 .

[39]  John Canny,et al.  The complexity of robot motion planning , 1988 .

[40]  David Baraff,et al.  Analytical methods for dynamic simulation of non-penetrating rigid bodies , 1989, SIGGRAPH.

[41]  Masayuki Inaba,et al.  AutoBalancer: An Online Dynamic Balance Compensation Scheme for Humanoid Robots , 2000 .

[42]  Lydia E. Kavraki,et al.  A probabilistic roadmap approach for systems with closed kinematic chains , 1999, Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C).

[43]  Marc H. Raibert,et al.  Legged Robots That Balance , 1986, IEEE Expert.

[44]  John F. Canny,et al.  Some algebraic and geometric computations in PSPACE , 1988, STOC '88.

[45]  P. Svestka,et al.  A probabilistic approach to motion planning for car-like robots , 1993 .

[46]  N. Kita,et al.  V-HRP : Virtual Humanoid Robot Platform , 2000 .

[47]  Tomás Lozano-Pérez,et al.  Parallel robot motion planning , 1991, Proceedings. 1991 IEEE International Conference on Robotics and Automation.

[48]  J. T. Shwartz,et al.  On the Piano Movers' Problem : III , 1983 .

[49]  Bernard Mourrain,et al.  Computing the Isolated Roots by Matrix Methods , 1998, J. Symb. Comput..

[50]  Masayuki Inaba,et al.  Dynamically-Stable Motion Planning for Humanoid Robots , 2002, Auton. Robots.

[51]  J. Schwartz,et al.  On the “piano movers” problem. II. General techniques for computing topological properties of real algebraic manifolds , 1983 .

[52]  Atsuo Takanishi,et al.  Development of a bipedal humanoid robot having antagonistic driven joints and three DOF trunk , 1998, Proceedings. 1998 IEEE/RSJ International Conference on Intelligent Robots and Systems. Innovations in Theory, Practice and Applications (Cat. No.98CH36190).

[53]  Jean-Daniel Boissonnat,et al.  A practical exact motion planning algorithm for polygonal object amidst polygonal obstacles , 1988, Geometry and Robotics.

[54]  Nancy M. Amato,et al.  A randomized roadmap method for path and manipulation planning , 1996, Proceedings of IEEE International Conference on Robotics and Automation.

[55]  Henning Tolle,et al.  Motion planning with many degrees of freedom-random reflections at C-space obstacles , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.

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