Sensor Beams, Obstacles, and Possible Paths

This paper introduces a problem in which an agent (robot, human, or animal) travels among obstacles and binary detection beams. The task is to determine the possible agent path based only on the binary sensor data. This is a basic filtering problem encountered in many settings, which may arise from physical sensor beams or virtual beams that are derived from other sensing modalities. Methods are given for three alternative representations: 1) the possible sequences of regions visited, 2) path descriptions up to homotopy class, and 3) numbers of times winding around obstacles. The solutions are adapted to the minimal sensing setting; therefore, precise estimation, distances, and coordinates are replaced by topological expressions. Applications include sensor-based forensics, assisted living, security, and environmental monitoring.

[1]  Masafumi Yamashita,et al.  Online polygon search by a seven-state boundary 1-searcher , 2006, IEEE Transactions on Robotics.

[2]  Masafumi Yamashita,et al.  Searching for a Mobile Intruder in a Polygonal Region , 1992, SIAM J. Comput..

[3]  Jason M. O'Kane,et al.  Sloppy motors, flaky sensors, and virtual dirt: Comparing imperfect ill-informed robots , 2007, Proceedings 2007 IEEE International Conference on Robotics and Automation.

[4]  Stephen G. Kobourov,et al.  Computing homotopic shortest paths efficiently , 2002, Comput. Geom..

[5]  Leonidas J. Guibas,et al.  A Visibility-Based Pursuit-Evasion Problem , 1999, Int. J. Comput. Geom. Appl..

[6]  R. E. Kalman,et al.  A New Approach to Linear Filtering and Prediction Problems , 2002 .

[7]  J. Singh,et al.  Tracking Multiple Targets Using Binary Proximity Sensors , 2007, 2007 6th International Symposium on Information Processing in Sensor Networks.

[8]  Keiji Nagatani,et al.  Topological simultaneous localization and mapping (SLAM): toward exact localization without explicit localization , 2001, IEEE Trans. Robotics Autom..

[9]  Jack Snoeyink,et al.  Testing Homotopy for Paths in the Plane , 2002, SCG '02.

[10]  Hugh F. Durrant-Whyte,et al.  A solution to the simultaneous localization and map building (SLAM) problem , 2001, IEEE Trans. Robotics Autom..

[11]  Leonidas J. Guibas,et al.  Visibility-Based Pursuit-Evasion in a Polygonal Environment , 1997, WADS.

[12]  R. Ho.  Algebraic Topology , 2022 .

[13]  Leonidas J. Guibas,et al.  The Robot Localization Problem , 1995, SIAM J. Comput..

[14]  Charles F. Miller,et al.  Combinatorial Group Theory , 2002 .

[15]  David B. A. Epstein,et al.  Word processing in groups , 1992 .

[16]  Steven M. LaValle,et al.  Tracking hidden agents through shadow information spaces , 2008, 2008 IEEE International Conference on Robotics and Automation.

[17]  Frédo Durand,et al.  3d visibility: analytical study and applications , 1999 .

[18]  Max Dehn,et al.  Papers on Group Theory and Topology , 1987 .

[19]  Kenneth Y. Goldberg,et al.  Orienting polygonal parts without sensors , 1993, Algorithmica.

[20]  Steven M. LaValle,et al.  Planning algorithms , 2006 .

[21]  J. M. M. Montiel,et al.  The SPmap: a probabilistic framework for simultaneous localization and map building , 1999, IEEE Trans. Robotics Autom..

[22]  Jeung-Yoon Choi,et al.  On target tracking with binary proximity sensors , 2005, IPSN 2005. Fourth International Symposium on Information Processing in Sensor Networks, 2005..

[23]  R. Bertram,et al.  Stochastic Systems , 2008, Control Theory for Physicists.

[24]  Matthew T. Mason,et al.  An exploration of sensorless manipulation , 1986, IEEE J. Robotics Autom..

[25]  Sebastian Thrun,et al.  FastSLAM: a factored solution to the simultaneous localization and mapping problem , 2002, AAAI/IAAI.

[26]  Steven M. LaValle,et al.  Mapping and Navigation from Permutations of Landmarks , 2006 .

[27]  Steven M. LaValle,et al.  Distance-Optimal Navigation in an Unknown Environment Without Sensing Distances , 2007, IEEE Transactions on Robotics.

[28]  Gregory Dudek,et al.  Localizing a robot with minimum travel , 1995, SODA '95.

[29]  Wolfram Burgard,et al.  A Probabilistic Approach to Concurrent Mapping and Localization for Mobile Robots , 1998, Machine Learning.

[30]  Ronald Parr,et al.  DP-SLAM: Fast, Robust Simultaneous Localization and Mapping Without Predetermined Landmarks , 2003, IJCAI.

[31]  Sung Yong Shin,et al.  Visibility-based pursuit-evasion in a polygonal room with a door , 1999, SCG '99.

[32]  T. Başar,et al.  A New Approach to Linear Filtering and Prediction Problems , 2001 .

[33]  W. Magnus,et al.  Combinatorial Group Theory: COMBINATORIAL GROUP THEORY , 1967 .

[34]  Nisheeth Shrivastava,et al.  Target tracking with binary proximity sensors: fundamental limits, minimal descriptions, and algorithms , 2006, SenSys '06.