Dynamic Trajectory Planning Path-Velocity Decomposition and Adjacent Paths

| This paper addresses Dynamic Trajectory Planning, which is deened as Motion Planning for a robot A moving in a dynamic workspace W, i.e. with moving obstacles. Besides A is subject both to kinematic constraints and dynamic constraints. We consider the case of a car-like robot A with bounded velocity and acceleration, moving in a dynamic workspace W = IR 2. Our approach is an extension to the Path-Velocity Decomposition Kant and Zucker, 1986]. We introduce the concept of adjacent paths and we use it within a novel planning schema which operates in two complementary stages: (a) Paths Planning and (b) Trajectory Planning. In Paths Planning, a set of adjacent paths, one of which leading A to its goal, are computed. These paths are collision-free with the stationary obstacles and respect A's kinematic constraints. In Trajectory Planning, knowing that A is able to shift from one path to an adjacent one freely, we determine the motion of A along and between these paths so as to avoid the moving obstacles while respecting A's dynamic constraints. Abstract | This paper addresses Dynamic Trajectory Planning, which is deened as Motion Planning for a robot A moving in a dynamic workspace W, i.e. with moving obstacles. Besides A is subject both to kinematic constraints and dynamic constraints. We consider the case of a car-like robot A with bounded velocity and acceleration, moving in a dynamic workspace W = IR 2. Our approach is an extension to the Path-Velocity Decomposition Kant and Zucker, 1986]. We introduce the concept of adjacent paths and we use it within a novel planning schema which operates in two complementary stages: (a) Paths Planning and (b) Trajectory Planning. In Paths Planning, a set of adjacent paths, one of which leading A to its goal, are computed. These paths are collision-free with the stationary obstacles and respect A's kinematic constraints. In Trajectory Planning , knowing that A is able to shift from one path to an adjacent one freely, we determine the motion of A along and between these paths so as to avoid the moving obstacles while respecting A's dynamic constraints.

[1]  Thierry Fraichard,et al.  Dynamic trajectory planning with dynamic constraints: A 'state-time space' approach , 1993, Proceedings of 1993 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS '93).

[2]  Jean-Paul Laumond,et al.  Feasible Trajectories for Mobile Robots with Kinematic and Environment Constraints , 1986, IAS.

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

[4]  Thierry Fraichard.  Smooth trajectory planning for a car in a structured world , 1991, Proceedings. 1991 IEEE International Conference on Robotics and Automation.

[5]  Patrick Gordon Xavier.  Provably-good approximation algorithms for optimal kinodynamic robot motion plans , 1992 .

[6]  J. Bobrow,et al.  Time-Optimal Control of Robotic Manipulators Along Specified Paths , 1985 .

[7]  William A. Gruver,et al.  Motion planning with time-varying polyhedral obstacles based on graph search and mathematical programming , 1990, Proceedings., IEEE International Conference on Robotics and Automation.

[8]  Pierre Tournassoud,et al.  Motion planning for a mobile robot with a kinematic constraint , 1988, Proceedings. 1988 IEEE International Conference on Robotics and Automation.

[9]  John F. Canny,et al.  Planning smooth paths for mobile robots , 1989, Proceedings, 1989 International Conference on Robotics and Automation.

[10]  Jean-Paul Laumond,et al.  Finding Collision-Free Smooth Trajectories for a Non-Holonomic Mobile Robot , 1987, IJCAI.

[11]  J. Latombe,et al.  Controllability of Mobile Robots with Kinematic Constraints. , 1990 .

[12]  John F. Canny,et al.  An exact algorithm for kinodynamic planning in the plane , 1991, Discret. Comput. Geom..

[13]  L. Shepp,et al.  OPTIMAL PATHS FOR A CAR THAT GOES BOTH FORWARDS AND BACKWARDS , 1990 .

[14]  Jean-Claude Latombe,et al.  Robot motion planning , 1970, The Kluwer international series in engineering and computer science.

[15]  L. Dubins.  On Curves of Minimal Length with a Constraint on Average Curvature, and with Prescribed Initial and Terminal Positions and Tangents , 1957 .

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

[17]  Lakmal D. Seneviratne,et al.  A Motion Strategy For A Mobile Robot With Holonomic And Nonholonomic Constraints , 1992, Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems.

[18]  Ren C. Luo,et al.  Motion planning for mobile robots in a dynamic environment with moving obstacles , 1990, Proceedings., IEEE International Conference on Robotics and Automation.

[19]  Gordon T. Wilfong.  Motion planning for an autonomous vehicle , 1988, Proceedings. 1988 IEEE International Conference on Robotics and Automation.

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

[21]  John M. Hollerbach,et al.  Planning of Minimum- Time Trajectories for Robot Arms , 1986 .

[22]  Steven Dubowsky,et al.  Global time optimal motions of robotic manipulators in the presence of obstacles , 1988, Proceedings. 1988 IEEE International Conference on Robotics and Automation.

[23]  Nils J. Nilsson,et al.  A Mobile Automaton: An Application of Artificial Intelligence Techniques , 1969, IJCAI.