By Topic

A shortest path algorithm for a nonrotating object among obstacles of arbitrary shapes

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
$31 $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)
Lin, P.L. ; Dept. of Electr. Eng., Nat. Tsing Hua Univ., Hsinchu ; Shyang Chang

A shortest path algorithm for motion planning problem via mathematical morphology is proposed. The moving object and obstacles can be of arbitrary shapes of finite size. To speed up the computation of the free positions of a moving object, the idea of shape decomposition is developed. It is proven that the decomposition always reduces the number of iterations. In addition, a simple geometric algorithm is proposed to check the existence of safe paths between the given initial and final positions. Once the existence condition is verified, a modified grass fire algorithm via the grayscale morphology is then used to compute the shortest path. Finally, examples of various descriptions of moving objects among obstacles are demonstrated

Published in:

Systems, Man and Cybernetics, IEEE Transactions on  (Volume:23 ,  Issue: 3 )