By Topic

Probabilistic analysis of some navigation strategies in a dynamic environment

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

3 Author(s)
R. Sharma ; Beckman Inst. for Adv. Sci. & Technol., Illinois Univ., Urbana, IL, USA ; D. M. Mount ; Y. Aloimonos

The problem of efficient path planning for a point robot in a partially known dynamic environment is considered. The static known part of the environment consists of point shelters distributed in planar terrain, and the dynamic, unknown part is abstracted in the form of alarms that cause the robot to leave its current (preplanned) path and divert to the nearest shelter. We give a probabilistic analysis of the expected times for the dynamic paths generated when the alarms follow a Poisson distribution with parameter λ. A case study with three shelters serves to illustrate the dependence of the expected travel times on λ for two alternate static paths. Two different strategies are presented for the general case of n shelters and shown to be superior for different ranges of values of the alarm rate λ (very low and very high values, respectively). We also discuss some ways of generalizing the approach and possible applications

Published in:

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