Mapping and Pursuit-Evasion Strategies For a Simple Wall-Following Robot

This paper defines and analyzes a simple robot with local sensors that moves in an unknown polygonal environment. The robot can execute wall-following motions and can traverse the interior of the environment only when following parallel to an edge. The robot has no global sensors that would allow precise mapping or localization. Special information spaces are introduced for this particular model. Using these, strategies are presented to solve several tasks: 1) counting vertices, 2) computing the path winding number, 3) learning a combinatorial map, which is called the cut ordering, that encodes partial geometric information, and 4) solving pursuit-evasion problems.

[1]  Masafumi Yamashita,et al.  Bushiness and a Tight Worst-Case Upper Bound on the Search Number of a Simple Polygon , 1998, Inf. Process. Lett..

[2]  S. Sitharama Iyengar,et al.  Robot navigation in unknown terrains: Introductory survey of non-heuristic algorithms , 1993 .

[3]  Elon Rimon,et al.  Competitive Complexity of Mobile Robot on-Line Motion Planning Problems , 2010, Int. J. Comput. Geom. Appl..

[4]  Masafumi Yamashita,et al.  Searching a Polygonal Region from the Boundary , 2001, Int. J. Comput. Geom. Appl..

[5]  Leonidas J. Guibas,et al.  Finding an unpredictable target in a workspace with obstacles , 1997, Proceedings of International Conference on Robotics and Automation.

[6]  Masafumi Yamashita,et al.  Searching for Mobile Intruders in a Polygonal Region by a Group of Mobile Searchers , 2001, SCG '97.

[7]  Alan C. Schultz,et al.  Mobile robot exploration and map-building with continuous localization , 1998, Proceedings. 1998 IEEE International Conference on Robotics and Automation (Cat. No.98CH36146).

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

[9]  Russell H. Taylor,et al.  Automatic Synthesis of Fine-Motion Strategies for Robots , 1984 .

[10]  Michael A. Erdmann,et al.  Randomization for robot tasks: Using dynamic programming in the space of knowledge states , 1993, Algorithmica.

[11]  W. Marsden.  I and J , 2012 .

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

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

[14]  Paul Newman,et al.  Using incomplete online metric maps for topological exploration with the Gap Navigation Tree , 2008, 2008 IEEE International Conference on Robotics and Automation.

[15]  Sebastian Thrun,et al.  Probabilistic robotics , 2002, CACM.

[16]  M. Yamashita,et al.  On-Line Polygon Search by a Six-State Boundary 1-Searcher , 2003 .

[17]  Nils J. Nilsson,et al.  A mobius automation: an application of artificial intelligence techniques , 1969, IJCAI 1969.

[18]  Steven M. LaValle,et al.  Visibility-Based Pursuit-Evasion in an Unknown Planar Environment , 2004, Int. J. Robotics Res..

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

[20]  Giora Slutzki,et al.  A complete pursuit-evasion algorithm for two pursuers using beam detection , 2002, Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292).

[21]  T. Başar,et al.  Dynamic Noncooperative Game Theory , 1982 .

[22]  Amitava Datta,et al.  Competitive Searching in Polygons - Beyond Generalised Streets , 1995, ISAAC.

[23]  Giora Slutzki,et al.  An algorithm for searching a polygonal region with a flashlight , 2000, SCG '00.

[24]  Joel W. Burdick,et al.  An autonomous sensor-based path-planner for planetary microrovers , 1999, Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C).

[25]  Andrea S. LaPaugh,et al.  Recontamination does not help to search a graph , 1993, JACM.

[26]  Subhash Suri,et al.  Simple Robots with Minimal Sensing: From Local Visibility to Global Geometry , 2007, Int. J. Robotics Res..

[27]  Steven M. LaValle,et al.  A pursuit-evasion BUG algorithm , 2001, Proceedings 2001 ICRA. IEEE International Conference on Robotics and Automation (Cat. No.01CH37164).

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

[29]  Giora Slutzki,et al.  An Algorithm for Searching a Polygonal Region with a Flashlight , 2002, Int. J. Comput. Geom. Appl..

[30]  Steven M. LaValle,et al.  An objective-based stochastic framework for manipulation planning , 1994, Proceedings of IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS'94).

[31]  Ehud Rivlin,et al.  Range-sensor based navigation in three dimensions , 1999, Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C).

[32]  T. D. Parsons,et al.  Pursuit-evasion in a graph , 1978 .

[33]  Steven M. LaValle,et al.  Pursuit-evasion in an unknown environment using gap navigation trees , 2004, 2004 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) (IEEE Cat. No.04CH37566).

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

[35]  Giora Slutzki,et al.  Pursuit-evasion using beam detection , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).

[36]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

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

[38]  J. O'Rourke.  Art gallery theorems and algorithms , 1987 .

[39]  Paul D. Seymour,et al.  Monotonicity in Graph Searching , 1991, J. Algorithms.

[40]  Ming-Yang Kao,et al.  Searching in an unknown environment: an optimal randomized algorithm for the cow-path problem , 1996, SODA '93.

[41]  M. Dufwenberg.  Game theory. , 2011, Wiley interdisciplinary reviews. Cognitive science.

[42]  Philip Wolfe,et al.  Contributions to the theory of games , 1953 .

[43]  Jérôme Barraquand,et al.  Motion planning with uncertainty: the information space approach , 1995, Proceedings of 1995 IEEE International Conference on Robotics and Automation.

[44]  Ehud Rivlin,et al.  Sensory-based motion planning with global proofs , 1997, IEEE Trans. Robotics Autom..

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

[46]  Nils J. Nilsson,et al.  A Mobile Automaton: An Application of Artificial Intelligence Techniques , 1969, IJCAI.

[47]  Elon Rimon,et al.  Competitive Complexity of Mobile Robot On Line Motion Planning Problems , 2004, WAFR.

[48]  Sándor P. Fekete,et al.  Online Searching with an Autonomous Robot , 2004, WAFR.

[49]  Xiaotie Deng,et al.  How to learn an unknown environment. I: the rectilinear case , 1998, JACM.

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

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

[52]  Steven M. LaValle,et al.  Bitbots: Simple Robots Solving Complex Tasks , 2005, AAAI.

[53]  Simeon Ntafos,et al.  Watchman routes under limited visibility , 1992 .

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

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

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

[57]  Gert Vegter,et al.  In handbook of discrete and computational geometry , 1997 .

[58]  H. W. Kuhn,et al.  11. Extensive Games and the Problem of Information , 1953 .

[59]  Manuel Blum,et al.  On the power of the compass (or, why mazes are easier to search than graphs) , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).

[60]  Yanina Landa,et al.  Visibility of point clouds and exploratory path planning in unknown environments , 2008 .

[61]  Rufus Isaacs,et al.  Differential Games , 1965 .

[62]  Vladimir J. Lumelsky,et al.  Path-planning strategies for a point mobile automaton moving amidst unknown obstacles of arbitrary shape , 1987, Algorithmica.

[63]  Bruce Randall Donald.  The complexity of planar compliant motion planning under uncertainty , 1988, SCG '88.

[64]  Bruce Randall Donald,et al.  Sensor interpretation and task-directed planning using perceptual equivalence classes , 1991, Proceedings. 1991 IEEE International Conference on Robotics and Automation.

[65]  Dimitri P. Bertsekas,et al.  Dynamic Programming and Optimal Control, Two Volume Set , 1995 .

[66]  Lyle A. McGeoch,et al.  Competitive algorithms for on-line problems , 1988, STOC '88.

[67]  J. M. Kleinberg,et al.  On-Line Algorithms for Robot Navigation and Server Problems , 1994 .

[68]  Steven M. LaValle,et al.  Visibility-based pursuit-evasion: the case of curved environments , 2001, IEEE Trans. Robotics Autom..

[69]  Simeon C. Ntafos,et al.  Optimum watchman routes , 1986, SCG '86.

[70]  Kenneth Y. Goldberg,et al.  Bayesian grasping , 1990, Proceedings., IEEE International Conference on Robotics and Automation.

[71]  Svetlana Lazebnik,et al.  Visibility-Based Pursuit-Evasion in Three-Dimensional Environments , 2011 .

[72]  Masafumi Yamashita,et al.  Searching for a mobile intruder in a corridor: the open edge variant of the polygon search problem , 1995, Int. J. Comput. Geom. Appl..

[73]  Mohammad Ghodsi,et al.  α-Visibility , 2012, Comput. Geom..

[74]  Ivan Hal Sudborough,et al.  Min Cut is NP-Complete for Edge Weigthed Trees , 1986, ICALP.

[75]  Kyung-Yong Chwa,et al.  Visibility-Based Pursuit-Evasion in a Polygonal Region by a Searcher , 2001, ICALP.

[76]  Steven M. LaValle,et al.  An Objective-Based Framework for Motion Planning under Sensing and Control Uncertainties , 1998, Int. J. Robotics Res..

[77]  Bruce Randall Donald,et al.  On Information Invariants in Robotics , 1995, Artif. Intell..

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

[79]  Baruch Schieber,et al.  Navigating in unfamiliar geometric terrain , 1991, STOC '91.

[80]  Michael A. Bender,et al.  The power of a pebble: exploring and mapping directed graphs , 1998, STOC '98.

[81]  Michel Pocchiola,et al.  The visibility complex , 1993, SCG '93.

[82]  Wolfram Burgard,et al.  The Interactive Museum Tour-Guide Robot , 1998, AAAI/IAAI.

[83]  Leonidas J. Guibas,et al.  Sweeping simple polygons with a chain of guards , 2000, SODA '00.

[84]  Michael A. Erdmann,et al.  On Motion Planning with Uncertainty , 1984 .

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

[86]  Mihalis Yannakakis,et al.  Shortest Paths Without a Map , 1989, Theor. Comput. Sci..