By Topic

Time optimal navigation via slack time sets

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

2 Author(s)
S. C. Zaharakis ; Dept. of Electr. Eng., Drexel Univ., Philadelphia, PA, USA ; A. Guez

An algorithm for determining the minimum-time obstacle avoidance trajectory for a robot is presented. Since different joints, when moved independently, may reach their desired end values at different times, any delay of a joint, other than the slowest, will not affect the total time of motion. This natural redundancy is used with obstacle avoidance to simplify any path search algorithm by at least one order of magnitude (one degree of freedom less). By neglecting the presence of all obstacles and assigning to each actuator maximum control torque (bang-bang), a lower-bound estimate of the time Ttask needed to complete a task is calculated. The A* heuristic search is used to search the subset of the state space which contains only those states which are members of a trajectory with a task time equal to Ttask. If no trajectory is found during the initial search, the subset of the state space being examined is sequentially increased until a valid trajectory is found. Since, in general, the minimum-time obstacle avoidance trajectory is not unique, secondary constraints such as minimum distance in the state space and others can also be satisfied

Published in:

Robotics and Automation, 1988. Proceedings., 1988 IEEE International Conference on

Date of Conference:

24-29 Apr 1988