A unified approach for robot motion planning with moving polyhedral obstacles

A unified approach suitable for path planning with moving polyhedral obstacles is presented. The planner views the space-time configuration of free space as disjoint polytopes that represent a time-dependent environment consisting of moving and stationary objects. Each point in the space-time domain is mapped into a unique polytope set. The planner then constructs a family of feasible collision-free trajectories by searching connected polytopes between the start polytope and the goal polytope that satisfy the speed and time constraints. Finally, a near-optimal trajectory is determined by constrained optimization. This approach does not require that obstacles be nonoverlapping or noncolliding. In addition, the obstacle is allowed to move faster than the planned robot. However, the speed of the obstacle must be piecewise-constant. The proposed approach can be easily extended to motion planning in higher dimensional spaces. >

[1]  Tomás Lozano-Pérez,et al.  An algorithm for planning collision-free paths among polyhedral obstacles , 1979, CACM.

[2]  ARISTIDES A. G. REQUICHA,et al.  Representations for Rigid Solids: Theory, Methods, and Systems , 1980, CSUR.

[3]  J. Schwartz,et al.  On the “piano movers'” problem I. The case of a two‐dimensional rigid polygonal body moving amidst polygonal barriers , 1983 .

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

[5]  Elmer G. Gilbert,et al.  Distance functions and their application to robot path planning in the presence of obstacles , 1985, IEEE J. Robotics Autom..

[6]  Micha Sharir,et al.  Motion Planning in the Presence of Moving Obstacles , 1985, FOCS.

[7]  Oussama Khatib,et al.  Real-Time Obstacle Avoidance for Manipulators and Mobile Robots , 1986 .

[8]  S. Zucker,et al.  Toward Efficient Trajectory Planning: The Path-Velocity Decomposition , 1986 .

[9]  John F. Canny,et al.  New lower bound techniques for robot motion planning problems , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[10]  Elmer G. Gilbert,et al.  A new algorithm for detecting the collision of moving objects , 1989, Proceedings, 1989 International Conference on Robotics and Automation.

[11]  Hanan Samet,et al.  A hierarchical strategy for path planning among moving obstacles [mobile robot] , 1989, IEEE Trans. Robotics Autom..

[12]  Charles E. Buckley,et al.  A Foundation for the "Flexible-Trajectory" Approach to Numeric Path Planning , 1987, Int. J. Robotics Res..

[13]  James E. Bobrow,et al.  A Direct Minimization Approach for Obtaining the Distance between Convex Polyhedra , 1989, Int. J. Robotics Res..

[14]  Hanan Samet,et al.  Time-minimal paths among moving obstacles , 1989, Proceedings, 1989 International Conference on Robotics and Automation.

[15]  Stephen J. Buckley,et al.  Fast motion planning for multiple moving robots , 1989, Proceedings, 1989 International Conference on Robotics and Automation.