liu.seSearch for publications in DiVA
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
An Optimization-Based Receding Horizon Trajectory Planning Algorithm
Linköping University, Department of Electrical Engineering, Automatic Control. Linköping University, Faculty of Science & Engineering.ORCID iD: 0000-0002-8354-6249
Linköping University, Department of Electrical Engineering, Automatic Control. Linköping University, Faculty of Science & Engineering.ORCID iD: 0000-0002-1795-5992
Linköping University, Department of Electrical Engineering, Automatic Control. Linköping University, Faculty of Science & Engineering.
Linköping University, Department of Electrical Engineering, Automatic Control. Linköping University, Faculty of Science & Engineering.ORCID iD: 0000-0001-6957-2603
2020 (English)In: IFAC-PapersOnLine, Elsevier, 2020, Vol. 53, p. 15550-15557Conference paper, Published paper (Refereed)
Abstract [en]

This paper presents an optimization-based receding horizon trajectory planning algorithm for dynamical systems operating in unstructured and cluttered environments. The proposed approach is a two-step procedure that uses a motion planning algorithm in a first step to efficiently find a feasible, but possibly suboptimal, nominal solution to the trajectory planning problem where in particular the combinatorial aspects of the problem are solved. The resulting nominal trajectory is then improved in a second optimization-based receding horizon planning step which performs local trajectory refinement over a sliding time window. In the second step, the nominal trajectory is used in a novel way to both represent a terminal manifold and obtain an upper bound on the cost-to-go online. This enables the possibility to provide theoretical guarantees in terms of recursive feasibility, objective function value, and convergence to the desired terminal state. The established theoretical guarantees and the performance of the proposed algorithm are verified in a set of challenging trajectory planning scenarios for a truck and trailer system.   

Place, publisher, year, edition, pages
Elsevier, 2020. Vol. 53, p. 15550-15557
Series
IFAC PAPERSONLINE, ISSN 2405-8963 ; 53
Keywords [en]
Trajectory & Path Planning, Optimal Control, Autonomous Vehicles
National Category
Control Engineering
Identifiers
URN: urn:nbn:se:liu:diva-175159DOI: 10.1016/j.ifacol.2020.12.2399ISI: 000652593600371OAI: oai:DiVA.org:liu-175159DiVA, id: diva2:1546066
Conference
21st IFAC World Congress
Funder
Wallenberg AI, Autonomous Systems and Software Program (WASP)Available from: 2021-04-21 Created: 2021-04-21 Last updated: 2024-11-29
In thesis
1. Exploiting Direct Optimal Control for Motion Planning in Unstructured Environments
Open this publication in new window or tab >>Exploiting Direct Optimal Control for Motion Planning in Unstructured Environments
2021 (English)Doctoral thesis, comprehensive summary (Other academic)
Abstract [en]

During the last decades, motion planning for autonomous systems has become an important area of research. The high interest is not the least due to the development of systems such as self-driving cars, unmanned aerial vehicles and robotic manipulators. The objective in optimal motion planning problems is to find feasible motion plans that also optimize a performance measure. From a control perspective, the problem is an instance of an optimal control problem. This thesis addresses optimal motion planning problems for complex dynamical systems that operate in unstructured environments, where no prior reference such as road-lane information is available. Some example scenarios are autonomous docking of vessels in harbors and autonomous parking of self-driving tractor-trailer vehicles at loading sites. The focus is to develop optimal motion planning algorithms that can reliably be applied to these types of problems. This is achieved by combining recent ideas from automatic control, numerical optimization and robotics.

The first contribution is a systematic approach for computing local solutions to motion planning problems in challenging unstructured environments. The solutions are computed by combining homotopy methods and direct optimal control techniques. The general principle is to define a homotopy that transforms, or preferably relaxes, the original problem to an easily solved problem. The approach is demonstrated in motion planning problems in 2D and 3D environments, where the presented method outperforms a state-of-the-art asymptotically optimal motion planner based on random sampling.

The second contribution is an optimization-based framework for automatic generation of motion primitives for lattice-based motion planners. Given a family of systems, the user only needs to specify which principle types of motions that are relevant for the considered system family. Based on the selected principle motions and a selected system instance, the framework computes a library of motion primitives by simultaneously optimizing the motions and the terminal states.

The final contribution of this thesis is a motion planning framework that combines the strengths of sampling-based planners with direct optimal control in a novel way. The sampling-based planner is applied to the problem in a first step using a discretized search space, where the system dynamics and objective function are chosen to coincide with those used in a second step based on optimal control. This combination ensures that the sampling-based motion planner provides a feasible motion plan which is highly suitable as warm-start to the optimal control step. Furthermore, the second step is modified such that it also can be applied in a receding-horizon fashion, where the proposed combination of methods is used to provide theoretical guarantees in terms of recursive feasibility, worst-case objective function value and convergence to the terminal state. The proposed motion planning framework is successfully applied to several problems in challenging unstructured environments for tractor-trailer vehicles. The framework is also applied and tailored for maritime navigation for vessels in archipelagos and harbors, where it is able to compute energy-efficient trajectories which complies with the international regulations for preventing collisions at sea.

Place, publisher, year, edition, pages
Linköping: Linköping University Electronic Press, 2021. p. 60
Series
Linköping Studies in Science and Technology. Dissertations, ISSN 0345-7524 ; 2133
National Category
Control Engineering
Identifiers
urn:nbn:se:liu:diva-174175 (URN)10.3384/diss.diva-174175 (DOI)9789179296773 (ISBN)
Public defence
2021-05-06, Online through Zoom (contact ninna.stensgard@liu.se) and Ada Lovelace, B Building, Campus Valla, Linköping, 15:15 (English)
Opponent
Supervisors
Funder
Wallenberg AI, Autonomous Systems and Software Program (WASP)
Available from: 2021-03-16 Created: 2021-03-15 Last updated: 2021-04-21Bibliographically approved

Open Access in DiVA

fulltext(551 kB)421 downloads
File information
File name FULLTEXT01.pdfFile size 551 kBChecksum SHA-512
4861afaed271c78291650502bb65593a3d2873a4f1bd2661f3bf53db071333b1a6a4ab39453a9a8939591fcbe518a185c6ab8b79abe1a689f589dd2111846f32
Type fulltextMimetype application/pdf

Other links

Publisher's full text

Authority records

Bergman, KristofferLjungqvist, OskarGlad, TorkelAxehill, Daniel

Search in DiVA

By author/editor
Bergman, KristofferLjungqvist, OskarGlad, TorkelAxehill, Daniel
By organisation
Automatic ControlFaculty of Science & Engineering
Control Engineering

Search outside of DiVA

GoogleGoogle Scholar
Total: 421 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 472 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf