Landmark-based robot navigation:

Abstract: "Achieving goals despite uncertainty in control and sensing may require robots to perform complicated motion planning and execution monitoring. This paper describes a reduced version of the general planning problem in the presence of uncertainty and a complete polynomial algorithm sol...

Full description

Saved in:
Bibliographic Details
Main Authors: Lazanas, Anthony (Author), Latombe, Jean-Claude (Author)
Format: Book
Language:English
Published: Stanford, Calif. 1992
Series:Stanford University / Computer Science Department: Report STAN CS 1428
Subjects:
Summary:Abstract: "Achieving goals despite uncertainty in control and sensing may require robots to perform complicated motion planning and execution monitoring. This paper describes a reduced version of the general planning problem in the presence of uncertainty and a complete polynomial algorithm solving it. The planner computes a guaranteed plan (for given uncertainty bounds) by backchaining non-directional preimages of the goal until one fully contains the set of possible initial positions of the robot. The planner assumes that landmarks are scattered across the workspace, that robot control and sensing are perfect within the fields of influence of these landmarks, and that control is imperfect and sensing null outside these fields.
Physical Description:56 S.

There is no print copy available.

Interlibrary loan Place Request Caution: Not in THWS collection!