Autonomous-Vehicle Maneuver Planning Using Segmentation and the Alternating Augmented Lagrangian Method
(2020) 21st IFAC World Congress In IFAC-PapersOnLine 53(2). p.15558-15565- 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 Lagrangianmethod 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... (More)
- 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 Lagrangianmethod 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 benecial. 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. (Less)
Please use this url to cite or link to this publication:
https://lup.lub.lu.se/record/7ed7b30d-df2d-4e3b-9e3a-56d33bfa9f65
- author
- Anistratov, Pavel ; Olofsson, Björn LU ; Burdakov, Oleg and Nielsen, Lars
- organization
- publishing date
- 2020
- type
- Contribution to journal
- publication status
- published
- subject
- in
- IFAC-PapersOnLine
- volume
- 53
- issue
- 2
- pages
- 8 pages
- publisher
- IFAC Secretariat
- conference name
- 21st IFAC World Congress
- conference location
- Berlin, Germany
- conference dates
- 2020-07-13 - 2020-07-17
- external identifiers
-
- scopus:85119326566
- ISSN
- 2405-8963
- DOI
- 10.1016/j.ifacol.2020.12.2400
- project
- ELLIIT LU P11: Online Optimization and Control towards Autonomous Vehicle Maneuvering
- RobotLab LTH
- language
- English
- LU publication?
- yes
- id
- 7ed7b30d-df2d-4e3b-9e3a-56d33bfa9f65
- date added to LUP
- 2020-12-27 18:31:55
- date last changed
- 2023-04-24 21:09:40
@article{7ed7b30d-df2d-4e3b-9e3a-56d33bfa9f65,
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 Lagrangianmethod 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 benecial. 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.}},
author = {{Anistratov, Pavel and Olofsson, Björn and Burdakov, Oleg and Nielsen, Lars}},
issn = {{2405-8963}},
language = {{eng}},
number = {{2}},
pages = {{15558--15565}},
publisher = {{IFAC Secretariat}},
series = {{IFAC-PapersOnLine}},
title = {{Autonomous-Vehicle Maneuver Planning Using Segmentation and the Alternating Augmented Lagrangian Method}},
url = {{http://dx.doi.org/10.1016/j.ifacol.2020.12.2400}},
doi = {{10.1016/j.ifacol.2020.12.2400}},
volume = {{53}},
year = {{2020}},
}