The velocity planner for autonomous vehicles proposed in this paper is designed for the automatic generation of trajectories characterized by bounded velocities, accelerations and jerks. Differently from similar planners, velocity bounds are not constant but, more realistically, they depend on the path shape. The problem poses feasibility issues which are analyzed in the paper: conditions for the existence of a solution are proposed. A procedure is then designed for the synthesis of a feasible profile, that is subsequently used for the initialization of a minimum-time nonlinear programming algorithm. Particular attention has been given to the algorithmic efficiency, since the planner is conceived for the management of real-time planning scenarios, where reactivity to unforeseen events represents an important requirement. The algorithm has been tested by designing the velocity functions for a set of 50 randomly chosen paths. Performance comparisons are made with alternative planning schemes.
Jerk bounded velocity planner for the online management of autonomous vehicles / Perri, Simone; GUARINO LO BIANCO, Corrado; Locatelli, Marco. - CD-ROM. - (2015), pp. 618-625. (Intervento presentato al convegno IEEE International Conference on Automation Science and Engineering (CASE 2015) tenutosi a Gothenburg, Sweden nel Aug 24-28, 2015) [10.1109/CoASE.2015.7294147].
Jerk bounded velocity planner for the online management of autonomous vehicles
PERRI, SIMONE;GUARINO LO BIANCO, Corrado;LOCATELLI, Marco
2015-01-01
Abstract
The velocity planner for autonomous vehicles proposed in this paper is designed for the automatic generation of trajectories characterized by bounded velocities, accelerations and jerks. Differently from similar planners, velocity bounds are not constant but, more realistically, they depend on the path shape. The problem poses feasibility issues which are analyzed in the paper: conditions for the existence of a solution are proposed. A procedure is then designed for the synthesis of a feasible profile, that is subsequently used for the initialization of a minimum-time nonlinear programming algorithm. Particular attention has been given to the algorithmic efficiency, since the planner is conceived for the management of real-time planning scenarios, where reactivity to unforeseen events represents an important requirement. The algorithm has been tested by designing the velocity functions for a set of 50 randomly chosen paths. Performance comparisons are made with alternative planning schemes.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
