This paper considers the problem of systematically exploring an unfamiliar environment in search of one or more recognizable targets. The proposed exploration algorithm is based on a novel representation of environments containing visual landmarks called the boundary place graph. This representation records the set of recognizable objects (landmarks) that are visible from the boundary of each con guration space obstacle. No metric information about the scene geometry is recorded nor are explicit prescriptions for moving between places stored. The exploration algorithm constructs the boundary place graph incrementally from sensor data. Once the robot has completely explored an environment, it can use the constructed representation to carry out further navigation tasks. In order to precisely characterize the set of environments in which this algorithm is expected to succeed, we p r o vide a necessary and su cient condition under which the algorithm is guaranteed to discover all landmarks. This algorithm has been implemented on our mobile robot platform RJ, and results from these experiments are presented. Importantly, this research demonstrates that it is possible to design and implement p r o vably correct exploration and navigation algorithms that do not require global positioning systems or metric representations of the environment.
The problem of exploring an unknown environment for searching of one or more recognizable targets is considered in REF .
Vision-Based Motion Planning and Exploration Algorithms for Mobile Robots
Workshop on the Algorithmic Foundations of Robotics
Computer Science