Optimal path planning in the workspace for articulated robots using mixed integer programming

This paper considers the task of path planning for articulated robots such that the end effector is driven optimally between two points in the workspace while collision with dynamic obstacles is avoided. Compared to path planning in the configuration space, approaches in the workspace save the computationally expensive step of mapping obstacles from the workspace into the configuration space. The method presented here builds on a problem formulation as a mixed-integer program considering time-varying constraints resulting from moving obstacles, as well as state and input constraints depending on the region of the work space. The method is applied to a two-link robot with static and moving obstacles and is evaluated for different situations.

[1]  Richard C. Larson,et al.  Model Building in Mathematical Programming , 1979 .

[2]  Jean-Claude Latombe,et al.  Nonholonomic multibody mobile robots: Controllability and motion planning in the presence of obstacles , 2005, Algorithmica.

[3]  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).

[4]  B. Moor,et al.  Mixed integer programming for multi-vehicle path planning , 2001, 2001 European Control Conference (ECC).

[5]  Ken Goldberg,et al.  Completeness in robot motion planning , 1995 .

[6]  Peter Norvig,et al.  Artificial Intelligence: A Modern Approach , 1995 .

[7]  Lydia E. Kavraki,et al.  Probabilistic roadmaps for path planning in high-dimensional configuration spaces , 1996, IEEE Trans. Robotics Autom..

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

[9]  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.

[10]  Simon Parsons,et al.  Principles of Robot Motion: Theory, Algorithms and Implementations by Howie Choset, Kevin M. Lynch, Seth Hutchinson, George Kantor, Wolfram Burgard, Lydia E. Kavraki and Sebastian Thrun, 603 pp., $60.00, ISBN 0-262-033275 , 2007, The Knowledge Engineering Review.

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

[12]  Brian W. Kernighan,et al.  AMPL: A Modeling Language for Mathematical Programming , 1993 .

[13]  Oussama Khatib,et al.  Real-Time Obstacle Avoidance for Manipulators and Mobile Robots , 1985, Autonomous Robot Vehicles.

[14]  Jonathan P. How,et al.  Aircraft trajectory planning with collision avoidance using mixed integer linear programming , 2002, Proceedings of the 2002 American Control Conference (IEEE Cat. No.CH37301).

[15]  J. How,et al.  Mixed-integer programming for control , 2005, Proceedings of the 2005, American Control Conference, 2005..

[16]  L. Blackmore,et al.  Optimal manipulator path planning with obstacles using disjunctive programming , 2006, 2006 American Control Conference.