TY - JOUR
T1 - An Analytical Method for Finding All Dynamically Admissible Paths Around an Obstacle that Maximize Friction Utilization
AU - Pagan, Michael A.
AU - Harnett, Stephen J.
AU - Pentzer, Jesse L.
AU - Reichard, Karl M.
AU - Brennan, Sean N.
N1 - Publisher Copyright:
© 2024 The Authors.
PY - 2024/10/1
Y1 - 2024/10/1
N2 - Path planning through obstacle fields is critically important for advancing the safety and utility of autonomous off-road vehicles. This paper describes the development of an analytical method for modifying point-to-point paths into high-speed paths. The method starts by using, as an input, a point-to-point path plan through an obstacle field such as one generated from an Atype algorithm. This point-to-point method represents the shortest path solution as a series of waypoints that the vehicle must reach in sequence, with each waypoint typically constrained by a nearby obstacle. Because the waypoints produce a C0 continuous but non-differentiable path, the implementation of a waypoint-following method at high speed often requires a vehicle to slow almost completely to a stop, turn, and then speed up at every waypoint. To generate a high-speed path, the point-to-point path must be modified into line segments connected by C1+ smooth curves to maximize vehicle speed while keeping the constraint of avoiding all obstacle collisions. This paper develops such a high-speed path-planning algorithm. The algorithm designs a path consisting of straight line and constant-radius arcs that meet acceleration and speed limits. These line segments and arcs optimize the utilization of available surface friction or, via straightforward transformations, user-defined limits on lateral or longitudinal accelerations including powertrain limits, rollover limits, etc.
AB - Path planning through obstacle fields is critically important for advancing the safety and utility of autonomous off-road vehicles. This paper describes the development of an analytical method for modifying point-to-point paths into high-speed paths. The method starts by using, as an input, a point-to-point path plan through an obstacle field such as one generated from an Atype algorithm. This point-to-point method represents the shortest path solution as a series of waypoints that the vehicle must reach in sequence, with each waypoint typically constrained by a nearby obstacle. Because the waypoints produce a C0 continuous but non-differentiable path, the implementation of a waypoint-following method at high speed often requires a vehicle to slow almost completely to a stop, turn, and then speed up at every waypoint. To generate a high-speed path, the point-to-point path must be modified into line segments connected by C1+ smooth curves to maximize vehicle speed while keeping the constraint of avoiding all obstacle collisions. This paper develops such a high-speed path-planning algorithm. The algorithm designs a path consisting of straight line and constant-radius arcs that meet acceleration and speed limits. These line segments and arcs optimize the utilization of available surface friction or, via straightforward transformations, user-defined limits on lateral or longitudinal accelerations including powertrain limits, rollover limits, etc.
UR - http://www.scopus.com/inward/record.url?scp=85217999007&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85217999007&partnerID=8YFLogxK
U2 - 10.1016/j.ifacol.2025.01.032
DO - 10.1016/j.ifacol.2025.01.032
M3 - Conference article
AN - SCOPUS:85217999007
SN - 2405-8971
VL - 58
SP - 606
EP - 611
JO - IFAC-PapersOnLine
JF - IFAC-PapersOnLine
IS - 28
T2 - 4th Modeling, Estimation, and Control Conference, MECC 2024
Y2 - 27 October 2024 through 30 October 2024
ER -