Lateral Vehicle Trajectory Optimization Using Constrained Linear Time-Varying MPC
The DOI matches its Crossref record; 28 of the 28 references it cites were found in a registry or an index.
Abstract
In this paper, a trajectory optimization algorithm is proposed, which formulates the lateral vehicle guidance task along a reference curve as a constrained optimal control problem. The optimization problem is solved by means of a linear time-varying model predictive control scheme that generates trajectories for path following under consideration of various time-varying system constraints in a receding horizon fashion. Formulating the system dynamics linearly in combination with a quadratic cost function has two great advantages. First, the system constraints can be set up not only to achieve collision avoidance with both static and dynamic obstacles, but also aspects of human driving behavior can be considered. Second, the optimization problem can be solved very efficiently, such that the algorithm can be run with little computational effort. In addition, due to an elaborate problem formulation, reference curves with discontinuous, high curvatures will be effortlessly smoothed out by the algorithm. This makes the proposed algorithm applicable to different traffic scenarios, such as parking or highway driving. Experimental results are presented for different real-world scenarios to demonstrate the algorithm's abilities.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Potential field methods and their inherent limitations for mobile robot navigation
Koren, Y., & Borenstein, J. (2002) · Proceedings. 1991 IEEE International Conference on Robotics and Automation · doi:10.1109/robot.1991.131810 · Cited by 1,570 · cited 1×
“However, as shown in [22] there are still open issues as system dynamics and constraints are difficult to integrate within this approach.”
BackgroundThe theory of dynamic programming
Bellman, R. (1954) · Bulletin of the American Mathematical Society · doi:10.1090/s0002-9904-1954-09848-8 · Cited by 1,459
Predictive Control for Linear and Hybrid Systems
Borrelli, F., Bemporad, A., & Morari, M. (2017) · Cambridge University Press eBooks · doi:10.1017/9781139061759 · Cited by 1,443
Tutorial overview of model predictive control
(2000) · IEEE Control Systems · doi:10.1109/37.845037 · Cited by 1,108 · cited 9×
“As following a given reference curve is one of the most fundamental tasks for vehicle automation, a strong effort was made to apply LMPC to the lateral vehicle guidance problem.”
MethodInfluentialMobile robot positioning: Sensors and techniques
Borenstein, J., Everett, H. R., Feng, L., & Wehe, D. (1997) · Journal of Robotic Systems · doi:10.1002/(sici)1097-4563(199704)14:4<231::aid-rob2>3.0.co;2-r · Cited by 601
Trajectory planning for Bertha — A local, continuous method
Ziegler, J., Bender, P., Dang, T., & Stiller, C. (2014) · 2014 IEEE Intelligent Vehicles Symposium Proceedings · doi:10.1109/ivs.2014.6856581 · Cited by 443 · cited 1×
“Recent examples can be found in [14], [15], [39], and [41].”
BackgroundOptimal trajectories for time-critical street scenarios using discretized terminal manifolds
Werling, M., Kammel, S., Ziegler, J., & Gröll, L. (2012) · The International Journal of Robotics Research · doi:10.1177/0278364911423042 · Cited by 268
Self-citationAnderson, S. J., Peters, S. C., Pilutti, T. E., & Iagnemma, K. (2010) · International Journal of Vehicle Autonomous Systems · doi:10.1504/ijvas.2010.035796 · Cited by 255 · cited 4×
“On the contrary, as shown in [1], [16], [31], and [38], optimization techniques have been applied successfully and therefore became the established method for trajectory generation over the last years.”
BackgroundMethodInfluentialFalcone, P., Tufo, M., Borrelli, F., Asgari, J., & Tseng, H. E. (2007) · 2007 46th IEEE Conference on Decision and Control · doi:10.1109/cdc.2007.4434137 · Cited by 196 · cited 1×
“In order to reduce the computational effort, [10] for instance, suggests the formulation of linear-quadratic optimal control problems for trajectory generation.”
BackgroundA behavioral planning framework for autonomous driving
Wei, J., Snider, J. M., Gu, T., Dolan, J. M., & Litkouhi, B. B. (2014) · IEEE Intelligent Vehicles Symposium · doi:10.1109/ivs.2014.6856582 · Cited by 151
Cited by
Time-Varying Convex Optimization: Time-Structured Algorithms and Applications
Simonetto, A., Dall'Anese, E., Paternain, S., Leus, G., & Giannakis, G. B. (2020) · Proceedings of the IEEE · doi:10.1109/jproc.2020.3003156 · Cited by 177
“Recently, time-varying (and/or parameter-varying) algorithms for MPC have appeared for large-scale and embedded systems, e.g., [13], [50]–[52], which are a mix of continuous-time, discrete-time unstructured and structured algorithms.”
Background
Metadata
- Authors
- Gutjahr, B., Groll, L., & Werling, M.
- Venue
- IEEE Transactions on Intelligent Transportation Systems
- Published
- 2016
- Pages
- 1-10
- ISSN
- 1524-9050 (ISSN-L)
- 1558-0016
- OpenAlex
- W2538895738
- Cited by
- 227
- References
- 28
- FWCI
- 13.67
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.