Autonomous-Vehicle Maneuver Planning Using Segmentation and the Alternating Augmented Lagrangian Method⁎This work was partially supported by the Wallenberg AI, Autonomous Systems and Software Program (WASP) funded by the Knut and Alice Wallenberg Foundation. Issue 2 (2020)

• Record Type: Journal Article
• Authors: Anistratov, Pavel; Olofsson, Björn; Burdakov, Oleg; Nielsen, Lars
• Is Part Of: IFAC-PapersOnLine. Volume 53:Issue 2(2020)
• Page Start: 15558
• Page End: 15565
• Publication Date: 2020
• Subjects: trajectory -- path planning -- motion planning -- optimal control -- problem decomposition -- vehicle safety maneuvers; Automatic control -- Periodicals; 629.805
• DOI: 10.1016/j.ifacol.2020.12.2400
• Languages: English
• ISSNs: 2405-8963

Abstract

Abstract: Segmenting a motion-planning problem into smaller subproblems could be beneficial in terms of computational complexity. This observation is used as a basis for a new sub-maneuver decomposition approach investigated in this paper in the context of optimal evasive maneuvers for autonomous ground vehicles. The recently published alternating augmented Lagrangian method is adopted and leveraged on, which turns out to fit the problem formulation with several attractive properties of the solution procedure. The decomposition is based on moving the coupling constraints between the sub-maneuvers into a separate coordination problem, which is possible to solve analytically. The remaining constraints and the objective function are decomposed into subproblems, one for each segment, which means that parallel computation is possible and beneficial. The method is implemented and evaluated in a safety-critical double lane-change scenario. By using the solution of a low-complexity initialization problem and applying warm-start techniques in the optimization, a solution is possible to obtain after just a few alternating iterations using the developed approach. The resulting computational time is lower than solving one optimization problem for the full maneuver.