Date
2022Metadata
Show full item record
Dissertation
Consistent Hierarchical Control in Cooperative Autonomous Driving
Abstract
This thesis is set within the context of the problem of motion planning in autonomous driving. Due to nonlinear system dynamics and non-convex constraints, this problem is challenging even under simplifying assumptions (e.g. non-cooperating traffic participants obey traffic rules, lossless inter-vehicle communication, absence of measuring errors). Typical solution approaches rely on a decomposition of the problem into subproblems which are easier to solve. This decomposition often results in a hierarchy of subproblems which are to be solved sequentially, where succeeding problems rely on the solution of preceding ones, such that dependencies between subproblems exist. Existing procedures for the design of such approaches have in common that these dependencies are not accounted for by the solution methodology. This can lead to situations where succeeding problems cannot be solved due to unsuitable solutions of preceeding subproblems.
This thesis presents a design methodology which is able to account for such dependencies in a hierarchical solution approach. The methodology is developed under the assumption of a three-layer hierarchical solution approach comprising trajectory planning, tracking control, and a high-level controller which is to determine cooperating groups and their actions. While the major focus of the thesis is on hierarchical consistency, i.e., safe interaction of the framework's layers, computational efficiency is also a main concern.
The basis of the planning problem is its formulation as a mixed-integer optimization problem, whose globally optimal solution guarantees constraint compliance. This approach uses predictions of future values and conducts the optimization frequently anew in the spirit of receding horizon control in order to limit the impact of uncertainty.
The so-called maneuver concept is introduced in order to improve computational efficiency by exploiting structure in on-road traffic. A maneuver characterizes a set of qualitatively similar trajectories of a group of vehicles and is modeled as a hybrid automaton. This allows to compute controllable sets, containing initial states for which a maneuver can be executed. Given these, the high-level controller can assess the feasibility of many different options without computing plans when choosing the most promising one. Approximative set computations allow for both the application to typically high-dimensional state spaces in cooperative autonomous driving and for the approximation of solutions to the planning problem. Thus, no optimization is required online, which reduces computation times.
As vehicles often fail to perfectly follow a reference trajectory, safety margins to obstacles must be provided during planning. Safe interaction between planning and tracking layer then requires to only plan trajectories for which the maximum tracking error does not violate the pre-defined safety margins. The maximum error is determined based on computation of an invariant set of the tracking error dynamics, accounting for a set of possible reference trajectories, constraints on states and inputs, and uncertainty in a vehicle's tire model. This step is only carried out during offline design, while online operation of the tracking controller only requires computationally efficient algebraic operations. Both theoretical results and numerical simulations demonstrate the efficacy of the framework.
This thesis presents a design methodology which is able to account for such dependencies in a hierarchical solution approach. The methodology is developed under the assumption of a three-layer hierarchical solution approach comprising trajectory planning, tracking control, and a high-level controller which is to determine cooperating groups and their actions. While the major focus of the thesis is on hierarchical consistency, i.e., safe interaction of the framework's layers, computational efficiency is also a main concern.
The basis of the planning problem is its formulation as a mixed-integer optimization problem, whose globally optimal solution guarantees constraint compliance. This approach uses predictions of future values and conducts the optimization frequently anew in the spirit of receding horizon control in order to limit the impact of uncertainty.
The so-called maneuver concept is introduced in order to improve computational efficiency by exploiting structure in on-road traffic. A maneuver characterizes a set of qualitatively similar trajectories of a group of vehicles and is modeled as a hybrid automaton. This allows to compute controllable sets, containing initial states for which a maneuver can be executed. Given these, the high-level controller can assess the feasibility of many different options without computing plans when choosing the most promising one. Approximative set computations allow for both the application to typically high-dimensional state spaces in cooperative autonomous driving and for the approximation of solutions to the planning problem. Thus, no optimization is required online, which reduces computation times.
As vehicles often fail to perfectly follow a reference trajectory, safety margins to obstacles must be provided during planning. Safe interaction between planning and tracking layer then requires to only plan trajectories for which the maximum tracking error does not violate the pre-defined safety margins. The maximum error is determined based on computation of an invariant set of the tracking error dynamics, accounting for a set of possible reference trajectories, constraints on states and inputs, and uncertainty in a vehicle's tire model. This step is only carried out during offline design, while online operation of the tracking controller only requires computationally efficient algebraic operations. Both theoretical results and numerical simulations demonstrate the efficacy of the framework.
Citation
@phdthesis{doi:10.17170/kobra-202205116162,
author={Eilbrecht, Jan Michael},
title={Consistent Hierarchical Control in Cooperative Autonomous Driving},
school={Kassel, Universität Kassel, Fachbereich Elektrotechnik / Informatik},
year={2022}
}
0500 Oax
0501 Text $btxt$2rdacontent
0502 Computermedien $bc$2rdacarrier
1100 2022$n2022
1500 1/eng
2050 ##0##http://hdl.handle.net/123456789/13884
3000 Eilbrecht, Jan Michael
4000 Consistent Hierarchical Control in Cooperative Autonomous Driving / Eilbrecht, Jan Michael
4030
4060 Online-Ressource
4085 ##0##=u http://nbn-resolving.de/http://hdl.handle.net/123456789/13884=x R
4204 \$dDissertation
4170
5550 {{Kontrolltheorie}}
5550 {{Autonomes Fahrzeug}}
5550 {{Planung}}
5550 {{Objektverfolgung}}
5550 {{Fahrdynamik}}
5550 {{Regelungstechnik}}
7136 ##0##http://hdl.handle.net/123456789/13884
<resource xsi:schemaLocation="http://datacite.org/schema/kernel-2.2 http://schema.datacite.org/meta/kernel-2.2/metadata.xsd"> 2022-06-01T10:03:54Z 2022-06-01T10:03:54Z 2022 doi:10.17170/kobra-202205116162 http://hdl.handle.net/123456789/13884 eng Urheberrechtlich geschützt https://rightsstatements.org/page/InC/1.0/ Control Theory Autonomous Driving Planning Tracking Control Vehicle Dynamics Cooperative Autonomous Driving Regelungstechnik Autonomes Fahren Kooperation 620 Consistent Hierarchical Control in Cooperative Autonomous Driving Dissertation This thesis is set within the context of the problem of motion planning in autonomous driving. Due to nonlinear system dynamics and non-convex constraints, this problem is challenging even under simplifying assumptions (e.g. non-cooperating traffic participants obey traffic rules, lossless inter-vehicle communication, absence of measuring errors). Typical solution approaches rely on a decomposition of the problem into subproblems which are easier to solve. This decomposition often results in a hierarchy of subproblems which are to be solved sequentially, where succeeding problems rely on the solution of preceding ones, such that dependencies between subproblems exist. Existing procedures for the design of such approaches have in common that these dependencies are not accounted for by the solution methodology. This can lead to situations where succeeding problems cannot be solved due to unsuitable solutions of preceeding subproblems. This thesis presents a design methodology which is able to account for such dependencies in a hierarchical solution approach. The methodology is developed under the assumption of a three-layer hierarchical solution approach comprising trajectory planning, tracking control, and a high-level controller which is to determine cooperating groups and their actions. While the major focus of the thesis is on hierarchical consistency, i.e., safe interaction of the framework's layers, computational efficiency is also a main concern. The basis of the planning problem is its formulation as a mixed-integer optimization problem, whose globally optimal solution guarantees constraint compliance. This approach uses predictions of future values and conducts the optimization frequently anew in the spirit of receding horizon control in order to limit the impact of uncertainty. The so-called maneuver concept is introduced in order to improve computational efficiency by exploiting structure in on-road traffic. A maneuver characterizes a set of qualitatively similar trajectories of a group of vehicles and is modeled as a hybrid automaton. This allows to compute controllable sets, containing initial states for which a maneuver can be executed. Given these, the high-level controller can assess the feasibility of many different options without computing plans when choosing the most promising one. Approximative set computations allow for both the application to typically high-dimensional state spaces in cooperative autonomous driving and for the approximation of solutions to the planning problem. Thus, no optimization is required online, which reduces computation times. As vehicles often fail to perfectly follow a reference trajectory, safety margins to obstacles must be provided during planning. Safe interaction between planning and tracking layer then requires to only plan trajectories for which the maximum tracking error does not violate the pre-defined safety margins. The maximum error is determined based on computation of an invariant set of the tracking error dynamics, accounting for a set of possible reference trajectories, constraints on states and inputs, and uncertainty in a vehicle's tire model. This step is only carried out during offline design, while online operation of the tracking controller only requires computationally efficient algebraic operations. Both theoretical results and numerical simulations demonstrate the efficacy of the framework. open access Eilbrecht, Jan Michael 2022-04-22 ix, 157 Seiten Kassel, Universität Kassel, Fachbereich Elektrotechnik / Informatik Stursberg, Olaf (Prof. Dr.) Flaßkamp, Kathrin (Prof. Dr.) Kontrolltheorie Autonomes Fahrzeug Planung Objektverfolgung Fahrdynamik Regelungstechnik publishedVersion false true </resource>
The following license files are associated with this item:
:Urheberrechtlich geschützt