By Topic

Locally efficient path planning in an uncertain, dynamic environment using a probabilistic model

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

1 Author(s)
R. Sharma ; Comput. Vision Lab., Maryland Univ., College Park, MD, USA

The problem addressed is that of efficiently planning a path for a robot between two points when the path is forced to change dynamically by the occurrence of certain events in the environment. An event or an alarm, for example, may be the discovery of another moving object on a collision course with the robot and would require some evasive action. A probabilistic model is given that represents the robot's dynamic behavior in response to alarms that have a Poisson distribution, and safety rules that assume that some regions are safe. A provably optimal expected solution for the problem is given, and the variation of the optimal path with two parameters that represent the alarm rate and the safety rule, respectively, is discussed

Published in:

IEEE Transactions on Robotics and Automation  (Volume:8 ,  Issue: 1 )