By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Hao Ding ; Institute of Control and System Theory, Dept. of Electrical Eng. and Computer Science, University of Kassel, Germany ; Mingxiang Zhou ; Olaf Stursberg

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.

Published in:

2009 IEEE/RSJ International Conference on Intelligent Robots and Systems

Date of Conference:

10-15 Oct. 2009