Chance-Constrained Programming for Autonomous Vehicles in Uncertain Environments
Gespeichert in:
Verfasser / Beitragende:
[Vasileios Lefkopoulos, Maryam; id_orcid 0000-0003-0230-3518 Kamgarpour (Supervisor)]
Ort, Verlag, Jahr:
Zurich :
Automatic Control Laboratory (IfA), ETH Zurich,
2018
Beschreibung:
69 p.; updated version also 69 p.
Format:
Repository-Daten
Online Zugang:
| LEADER | cam a22 4500 | ||
|---|---|---|---|
| 001 | 528782002 | ||
| 005 | 20190606031707.0 | ||
| 007 | cr unu---uuuuu | ||
| 008 | 180924e20180627xx s 000 0 eng | ||
| 024 | 7 | 0 | |a 10.3929/ethz-b-000272614 |2 doi |
| 035 | |a (ETHRESEARCH)oai:www.research-collecti.ethz.ch:20.500.11850/272614 | ||
| 100 | 1 | |a Lefkopoulos |D Vasileios | |
| 245 | 1 | 0 | |a Chance-Constrained Programming for Autonomous Vehicles in Uncertain Environments |h [Elektronische Daten] |c [Vasileios Lefkopoulos, Maryam; id_orcid 0000-0003-0230-3518 Kamgarpour (Supervisor)] |
| 260 | |a Zurich |b Automatic Control Laboratory (IfA), ETH Zurich |c 2018 | ||
| 300 | |a 69 p.; updated version also 69 p. | ||
| 506 | |a Open access |2 ethresearch | ||
| 520 | 3 | |a Trajectory planning in uncertain environments arises in several autonomous system applications including robotics, air traffic and autonomous driving. An approach to handle uncertainties with sufficiently high safety guarantees is through chance-constrained optimization. In this work, we consider the problem of trajectory planning for an autonomous vehicle in an uncertain environment comprised of a number of obstacles. First, we explore existing chance-constrained optimization techniques and their efficiency in handling this problem. Second, we model the uncertain moving obstacles as polyhedra and deal with the non-convex optimization problem of not colliding with them using mixed-integer chance-constrained optimization. We transform this optimization problem into a tractable form using Boole's inequality followed by an analytic reformulation based on the sample estimates of the uncertainty's moments. We derive concentration bounds on the estimation error of these moments. As such, we provide high confidence guarantees on the chance-constrained solution. We finally demonstrate the framework with three motion-planning case studies in finite and receding horizon frameworks. | |
| 540 | |a In Copyright - Non-Commercial Use Permitted |u http://rightsstatements.org/page/InC-NC/1.0 |2 ethresearch | ||
| 700 | 1 | |a Kamgarpour |D Maryam; id_orcid 0000-0003-0230-3518 |e Supervisor |4 dgs | |
| 856 | 4 | 0 | |u http://hdl.handle.net/20.500.11850/272614 |q text/html |z WWW-Backlink auf das Repository (Open access) |
| 908 | |D 1 |a Student Paper |2 ethresearch | ||
| 950 | |B ETHRESEARCH |P 856 |E 40 |u http://hdl.handle.net/20.500.11850/272614 |q text/html |z WWW-Backlink auf das Repository (Open access) | ||
| 950 | |B ETHRESEARCH |P 100 |E 1- |a Lefkopoulos |D Vasileios | ||
| 950 | |B ETHRESEARCH |P 700 |E 1- |a Kamgarpour |D Maryam; id_orcid 0000-0003-0230-3518 |e Supervisor |4 dgs | ||
| 898 | |a CL050000 |b XL050000 |c XC000500 | ||
| 949 | |B ETHRESEARCH |F ETHRESEARCH |b ETHRESEARCH |j Student Paper |c Open access | ||