Finding the shortest path between two positions is a fundamental problem in transportation, routing, and communications applications. In robot motion planning, the robot should pass around the obstacles touching none of them, i.e. the goal is to find a collision-free path from a starting to a target position. This task has many specific formulations depending on the shape of obstacles, allowable directions of movements, knowledge of the scene, etc. Research of path planning has yielded many fundamentally different approaches to its solution, mainly based on various decomposition and roadmap methods. In this paper, we show a possible use of visibility graphs in point-to-point motion planning in the Euclidean plane and an alternative approach using Voronoi diagrams that decreases the probability of collisions with obstacles. The second application area, investigated here, is focused on problems of finding minimal networks connecting a set of given points in the plane using either only straight connections between pairs of points (minimum spanning tree) or allowing the addition of auxiliary points to the set to obtain shorter spanning networks (minimum Steiner tree).
Geometric Data Structures and Their Selected Applications
2007-11-21
oai:zenodo.org:1071866
Aufsatz (Zeitschrift)
Elektronische Ressource
Englisch
DDC: | 629 |
Selected papers on reticles and their applications
TIBKAT | 1999
|Springer Verlag | 2017
|Springer Verlag | 2014
|Geometric Moments and Their Invariants
British Library Online Contents | 2012
|Reti-Hedral Structures and their Applications
British Library Conference Proceedings | 1994
|