A Long-Short-Term Mixed-Integer Formulation for Highway Lane Change Planning

Abstract--This work considers the problem of optimal lane changing in a structured multi-agent road environment. The long-term decision variables account for selecting gaps between SVs on each lane. These lane transitions are used for I. N recent years many approaches have been proposed for vehicle motion planning in structured multi-lane road transition gaps on consecutive lanes are modeled by disjunctive environments. LTF are formulated consistently, i.e., a transition point constrains In fact, even deterministic two-dimensional motion planning the point-mass model trajectory to the corresponding problems with rectangular obstacles are NP-hard [1], [2]. Contrary to strict hierarchical decomposition, the coarser This work proposes a novel iterative planning algorithm, approximation of the high-level plan cannot be infeasible for referred to as long-short-term motion planner (LSTMP) that the low-level planner. The STF aims at optimizing a fourstate Within the formulation of the LTF, the locations of transitions discrete-time trajectory of a point-mass model including in time and position are continuous.