Convex Tours of Bounded Curvature

Abstract

We consider the motion planning problem for a point constrained to move along a smooth closed convex path of bounded curvature. The workspace of the moving point is bounded by a convex polygon with m vertices, containing an obstacle in a form of a simple polygon with $n$ vertices. We present an O(m+n) time algorithm finding the path, going around the obstacle, whose curvature is the smallest possible.

11 pages, 5 figures, abstract presented at European Symposium on Algorithms 1993

Cited by in corpus (6)

• Shortest Paths in Graphs of Convex Sets
• Optimal Exploration of Terrains with Obstacles
• A Survey on Open Problems for Mobile Robots
• Correlated Orienteering Problem and it Application to Persistent Monitoring Tasks
• Persistent Monitoring of Events with Stochastic Arrivals at Multiple Stations
• Adaptive Evolutionary Optimization of Team Work