pith. sign in

arxiv: 2410.01589 · v1 · pith:OLHFT66Wnew · submitted 2024-10-02 · 📡 eess.SY · cs.SY

Min-Time Escape of a Dubins Car from a Polygon

classification 📡 eess.SY cs.SY
keywords polygonescapelinemin-timeminimumapproachcharacteristicsconstrained
0
0 comments X
read the original abstract

A turn constrained vehicle is initially located inside a polygon region and desires to escape in minimum time. First, the method of characteristics is used to describe the time-optimal strategies for reaching a line of infinite length. Next, the approach is extended to polygons constructed of a series of line segments. Using this construction technique, the min-time path to reach each edge is obtained; the resulting minimum of the set of optimal trajectories is then selected for escaping the polygon.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.