By Topic

On the moving-obstacle path-planning algorithm of Shih, Lee, and Gruver

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)
R. A. Conn ; Data Fusion Lab., Drexel Univ., Philadelphia, PA, USA ; M. Kam

We analyze a motion planning algorithm proposed by Shih, Lee, and Gruver (1990). In particular, we discuss the case of motion planning among moving obstacles, for which an algorithm is presented by Shih, Lee, and Gruver (1990). The algorithm is claimed to always yield a collision-free path when one exists. We provide a specific counter-example to this claim, examine the possibility of repairing the algorithm, and discuss the computational complexity of a corrected algorithm

Published in:

IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics)  (Volume:27 ,  Issue: 1 )