TY - JOUR
T1 - Extracting Visibility Information by Following Walls
AU - Yershova, Anna
AU - Tovar, Benjamín
AU - LaValle, Steven M.
N1 - Publisher Copyright:
© 2007 Dagstuhl Seminar Proceedings. All rights reserved.
PY - 2007
Y1 - 2007
N2 - This paper presents an analysis of a simple robot model, called Bitbot. The Bitbot has limited capabilities; it can reliably follow walls and sense a contact with a wall. Although the Bitbot does not have a range sensor or a camera, it is able to acquire visibility information from the environment, which is then used to solve a pursuit-evasion task. Our developments are centered on the characterization of the information the Bitbot acquires. At any given moment, due to the sensing uncertainty, the robot does not know the current state. In general, uncertainty in the state is one of the central issues in robotics; therefore, the Bitbot model serves as an example of how the notion of information space naturally handles uncertainty. We show that state estimation with the Bitbot is a challenging problem, related to the well-known open problem of characterizing visibility graphs in computational geometry. However, state estimation becomes unnecessary to the achievement of the Bitbot’s visibility tasks. We show how pursuit-evasion strategy is derived from a careful manipulation with histories of observations, and present analysis of the algorithm and experimental results.
AB - This paper presents an analysis of a simple robot model, called Bitbot. The Bitbot has limited capabilities; it can reliably follow walls and sense a contact with a wall. Although the Bitbot does not have a range sensor or a camera, it is able to acquire visibility information from the environment, which is then used to solve a pursuit-evasion task. Our developments are centered on the characterization of the information the Bitbot acquires. At any given moment, due to the sensing uncertainty, the robot does not know the current state. In general, uncertainty in the state is one of the central issues in robotics; therefore, the Bitbot model serves as an example of how the notion of information space naturally handles uncertainty. We show that state estimation with the Bitbot is a challenging problem, related to the well-known open problem of characterizing visibility graphs in computational geometry. However, state estimation becomes unnecessary to the achievement of the Bitbot’s visibility tasks. We show how pursuit-evasion strategy is derived from a careful manipulation with histories of observations, and present analysis of the algorithm and experimental results.
UR - https://www.scopus.com/pages/publications/85174419984
UR - https://www.scopus.com/pages/publications/85174419984#tab=citedBy
M3 - Conference article
AN - SCOPUS:85174419984
SN - 1862-4405
VL - 6421
JO - Dagstuhl Seminar Proceedings
JF - Dagstuhl Seminar Proceedings
T2 - Robot Navigation 2006
Y2 - 15 October 2006 through 20 October 2006
ER -