Motion Planning in the Plane with Polygonal Obstacles

Článek recenzovaný mimo WoS a Scopus

en

In robot motion planning the robot should pass around the obstacles, from a given starting position to a given target position, touching none of them, i.e. the goal is to find a collision-free path from the starting to the target position. This task has many specific formulations depending on the shape of obstacles, allowable directions of movements, knowledge of the scene, etc. Research on path planning has yielded many fundamentally different approaches to its solution that can be classified as roadmap methods (visibility graph method, Voronoi diagram) and methods based on cell decomposition. In the paper, an approach based on Voronoi diagrams is proposed, considering point, straight line and polygonal obstacles in a completely known scene.

2005-09-01

1210-2717

12

4

253–

6