Time and acceleration constraints have been extensively considered in flight vehicle path planning area. However, the limits of the required acceleration guaranteeing the existence of a path has not been fully studied yet. This paper presents an algebraic proof of the minimax curvature path connecting two oriented points with one inflection point, and then the minimal required acceleration and flight time are analyzed for all planar scenarios. It is revealed that for some geometry conditions, there exists a specific combination of curvature and range limits, while for other conditions, this combination can change continuously by increasing one and decreasing another. For all cases, the optimal paths are concatenations of circular arcs of equivalent radii in different forms, which means that to reduce the acceleration and flight time to the utmost, the overload should be evenly distributed along the whole path. The results in this paper can support fast on-line path planning in the presence of incident direction constraint with limited maneuverability and fuel.
Minimal Curvature and Range Path Connecting Two Oriented Points
Lect. Notes Electrical Eng.
International Conference on Autonomous Unmanned Systems ; 2021 ; Changsha, China September 24, 2021 - September 26, 2021
Proceedings of 2021 International Conference on Autonomous Unmanned Systems (ICAUS 2021) ; Chapter : 62 ; 619-628
2022-03-18
10 pages
Article/Chapter (Book)
Electronic Resource
English
Online Contents | 2012
On the Path Curvature of Vehicles
British Library Conference Proceedings | 1995
|Paths of Bounded Curvature with Minimal Number of Maneuvers
British Library Conference Proceedings | 2000
|