Loading...

Walking in streets with minimal sensing

Tabatabaei, A ; Sharif University of Technology | 2013

557 Viewed
  1. Type of Document: Article
  2. DOI: 10.1007/978-3-319-03780-6_32
  3. Publisher: 2013
  4. Abstract:
  5. We consider the problem of walking in an unknown street, starting from a point s, to reach a target t by a robot which has a minimal sensing capability. The goal is to decrease the traversed path as short as possible. The robot cannot infer any geometric properties of the environment such as coordinates, angles or distances. The robot is equipped with a sensor that can only detect the discontinuities in the depth information (gaps) and can locate the target point as soon as it enters in its visibility region. In addition, a pebble as an identifiable point is available to the robot to mark some position of the street. We offer a data structure similar to Gap Navigation Tree to maintain the essential sensed data to explore the street. We present an online strategy that guides such a robot to navigate the scene to reach the target, based only on what is sensed at each point and is saved in the data structure. Although the robot has a limited capability, we show that the detour from the shortest path can be restricted such that generated path by our strategy is at most 11 times as long as the shortest path to target
  6. Keywords:
  7. Depth information ; Gap navigation trees ; Geometric properties ; Shortest path ; Target point ; Online Strategy ; Data structures ; Combinatorial optimization ; Graph theory ; Trees (mathematics) ; Robots
  8. Source: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Chengdu ; Volume 8287 LNCS , 2013 , Pages 361-372 ; 03029743 (ISSN); 9783319037790 (ISBN)
  9. URL: http://link.springer.com/chapter/10.1007%2F978-3-319-03780-6_32