Motion planning in dynamic environments using the velocity space

This paper addresses a method for robot motion planning in dynamic environments, avoiding the moving and static obstacles while the robot drives towards the goal. The method maps the dynamic environment into a velocity space, using the concept of estimated arriving time to compute the times to potential collision and potential escape. The problem of finding the best motion command is directly treated in the velocity space, providing the trajectory which satisfies an optimization criterium (typically the minimum time or the shortest path). In this work the method is applied to robots which are subject to both kinematic constraints (i.e. involving the configuration parameters of the robot and their derivatives), and dynamic constraints, (i.e. the constraints imposed by the dynamics of the robot and the limits of its actuators). Some experimental results are discussed.

[1]  Anthony Stentz,et al.  Optimal and efficient path planning for partially-known environments , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.

[2]  Tomás Lozano-Pérez,et al.  On multiple moving objects , 1986, Proceedings. 1986 IEEE International Conference on Robotics and Automation.

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

[4]  Iwan Ulrich,et al.  VFH/sup */: local obstacle avoidance with look-ahead verification , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).

[5]  G. Swaminathan Robot Motion Planning , 2006 .

[6]  Paolo Fiorini,et al.  Robot Motion Planning in Dynamic Environments , 1996 .

[7]  Sebastian Thrun,et al.  Motion planning through policy search , 2002, IEEE/RSJ International Conference on Intelligent Robots and Systems.

[8]  Panos E. Trahanias,et al.  Predictive control of robot velocity to avoid obstacles in dynamic environments , 2003, Proceedings 2003 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2003) (Cat. No.03CH37453).

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

[10]  Javier Minguez,et al.  Nearness diagram (ND) navigation: collision avoidance in troublesome scenarios , 2004, IEEE Transactions on Robotics and Automation.

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

[12]  Reid G. Simmons,et al.  The curvature-velocity method for local obstacle avoidance , 1996, Proceedings of IEEE International Conference on Robotics and Automation.

[13]  Wolfram Burgard,et al.  The dynamic window approach to collision avoidance , 1997, IEEE Robotics Autom. Mag..

[14]  Thierry Fraichard,et al.  Trajectory planning in a dynamic workspace: a 'state-time space' approach , 1998, Adv. Robotics.

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

[16]  Zvi Shiller,et al.  Motion planning in dynamic environments: obstacles moving along arbitrary trajectories , 2001, Proceedings 2001 ICRA. IEEE International Conference on Robotics and Automation (Cat. No.01CH37164).