By Topic

Comments on "Dynamic path planning for a mobile automation with limited information on the environment" [with reply]

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

3 Author(s)
Lucas, C. ; Dept. of Electr. Eng., Tehran Univ., Iran ; Lumelsky, V. ; Stepanov, A.

Two path-planning algorithms are presented for the case of an uncertain environment, and a bound for the length of path generated by each algorithm is given. Lucas shows that the least upper bound corresponding to the first algorithm is incorrect, and suggests a revised algorithm which has that upper bound for its generated path lengths. However, Lumelsky et al. points out that the modification by Lucas, which requires the automaton to try to stick to the M-line, would defect the main idea behind the algorithm and thus cannot be accepted.<>

Published in:

Automatic Control, IEEE Transactions on  (Volume:33 ,  Issue: 5 )