Path-Planning Strategies for a Point Mobile Automaton Moving Amidst Unknown Obstacles of Arbitrary Shape

Abstract

The problem of path planning for an automaton moving in a two-dimensional scene filled with unknown obstacles is considered. The automaton is presented as a point; obstacles can be of an arbitrary shape, with continuous boundaries and of finite size; no restriction on the size of the scene is imposed. The information available to the automaton is limited to its own current coordinates and those of the target position. Also, when the automaton hits an obstacle, this fact is detected by the automaton's "tactile sensor." This information is shown to be sufficient for reaching the target or concluding in finite time that the target cannot be reached. A worst-case lower bound on the length of paths generated by any algorithm operating within the framework of the accepted model is developed; the bound is expressed in terms of the perimeters of the obstacles met by the automaton I in the scene. Algorithms that guarantee reaching the target (if the target is reachable), and tests for target reachability are presented. The efficiency of the algorithms is studied, and worst-case upper I bounds on the length of generated paths are produced.

Hybrid control of a constrained velocity unicycle with local sensing

“…The trajectories of R start in (q, x) ∈ X 0 and consist of discrete transitions in D, the absolutely continuous evolutions in C governed by (1), and the (not necessarily continuous) evolution of the virtual states τ, ζ and η governed byτ = 1,ζ = 0,η = 0 respectively. The continuous vector field ω = F (q i , ·) provides the control action to steer our system.…”

“…Lumelsky and Stepanov [1] introduced a class of algorithms known as Bug algorithms for navigating unknown environments. Kamon et.…”

Online Routing in Faulty Meshes with Sub-linear Comparative Time and Traffic Ratio

“…The motion planning problem for an unknown environment is also known as "online searching" or "online navigation" (see [2] for a survey). It has been addressed by Lumelsky and Stepanov [11] that the performance of navigation strategies depends on the obstacles in the scenario. The proposed strategies are also suitable for traversing mazes.…”

“…This complies with the most common definition of the competitive ratio. Lumelsky and Stepanov [11] as well as Angluin, Westbrook and Zhu [1] use a modified competitive measure that uses the sum of the perimeters of the obstacles in the scene instead of the optimal path length as a benchmark. In this paper we use the competitive ratio for the length of the routing path -which is, here, regarded as routing time.…”

An Equivalence Relation for Local Path Sets

“…Obstacle avoidance methods, such as potential fields [12], are purely reactive. The bug algorithm [18], which generates a path to the goal using only a contact sensor, is complete in 2D. Choset and Burdick [5] present the hierarchical generalized Voronoi graph, a roadmap with global line-of-sight accessibility that achieves completeness in higher dimensions using range readings of the environment.…”