Optimal temporal logic control of autonomous vehicles
Thesis (Ph.D.)--Boston University === Temporal logics, such as Linear Temporal Logic (LTL) and Computation Tree Logic (CTL), are extensions of propositional logic that can capture temporal relations. Even though temporal logics have been used in model checking of finite systems for quite some time,...
Main Author: | |
---|---|
Language: | en_US |
Published: |
Boston University
2015
|
Online Access: | https://hdl.handle.net/2144/12242 |
id |
ndltd-bu.edu-oai-open.bu.edu-2144-12242 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-bu.edu-oai-open.bu.edu-2144-122422019-05-09T03:11:12Z Optimal temporal logic control of autonomous vehicles Ulusoy, M. Alphan Thesis (Ph.D.)--Boston University Temporal logics, such as Linear Temporal Logic (LTL) and Computation Tree Logic (CTL), are extensions of propositional logic that can capture temporal relations. Even though temporal logics have been used in model checking of finite systems for quite some time, they have gained popularity as a means for specifying complex mission requirements in path planning and control synthesis problems only recently. This dissertation proposes and evaluates methods and algorithms for optimal path planning and control synthesis for autonomous vehicles where a high-level mission specification expressed in LTL (or a fragment of LTL) must be satisfied. In summary, after obtaining a discrete representation of the overall system, ideas and tools from formal verification and graph theory are leveraged to synthesize provably correct and optimal control strategies. The first part of this dissertation focuses on automatic planning of optimal paths for a group of robots that must satisfy a common high level mission specification. The effect of slight deviations in traveling times on the behavior of the team is analyzed and methods that are robust to bounded non-determinism in traveling times are proposed. The second part focuses on the case where a controllable agent is required to satisfy a high-level mission specification in the presence of other probabilistic agents that cannot be controlled. Efficient methods to synthesize control policies that maximize the probability of satisfaction of the mission specification are presented. The focus of the third part is the problem where an autonomous vehicle is required to satisfy a rich mission specification over service requests occurring at the regions of a partitioned environment. A receding horizon control strategy that makes use of the local information provided by the sensors on the vehicle in addition to the a priori information about the environment is presented. For all of the automatic planning and control synthesis problems that are considered, the proposed algorithms are implemented, evaluated, and validated through experiments and/or simulations. 2015-08-04T16:06:42Z 2015-08-04T16:06:42Z 2014 2014 Thesis/Dissertation https://hdl.handle.net/2144/12242 en_US Boston University |
collection |
NDLTD |
language |
en_US |
sources |
NDLTD |
description |
Thesis (Ph.D.)--Boston University === Temporal logics, such as Linear Temporal Logic (LTL) and Computation Tree Logic (CTL), are extensions of propositional logic that can capture temporal relations. Even though temporal logics have been used in model checking of finite systems for quite some time, they have gained popularity as a means for specifying complex mission requirements in path planning and control synthesis problems only recently. This dissertation proposes and evaluates methods and algorithms for optimal path planning and control synthesis for autonomous vehicles where a high-level mission specification expressed in LTL (or a fragment of LTL) must be satisfied. In summary, after obtaining a discrete representation of the overall system, ideas and tools from formal verification and graph theory are leveraged to synthesize provably correct and optimal control strategies.
The first part of this dissertation focuses on automatic planning of optimal paths for a group of robots that must satisfy a common high level mission specification. The effect of slight deviations in traveling times on the behavior of the team is analyzed and methods that are robust to bounded non-determinism in traveling times are proposed. The second part focuses on the case where a controllable agent is required to satisfy a high-level mission specification in the presence of other probabilistic agents that cannot be controlled. Efficient methods to synthesize control policies that maximize the probability of satisfaction of the mission specification are presented. The focus of the third part is the problem where an autonomous vehicle is required to satisfy a rich mission specification over service requests occurring at the regions of a partitioned environment. A receding horizon control strategy that makes use of the local information provided by the sensors on the vehicle in addition to the a priori information about the environment is presented. For all of the automatic planning and control synthesis problems that are considered, the proposed algorithms are implemented, evaluated, and validated through experiments and/or simulations. |
author |
Ulusoy, M. Alphan |
spellingShingle |
Ulusoy, M. Alphan Optimal temporal logic control of autonomous vehicles |
author_facet |
Ulusoy, M. Alphan |
author_sort |
Ulusoy, M. Alphan |
title |
Optimal temporal logic control of autonomous vehicles |
title_short |
Optimal temporal logic control of autonomous vehicles |
title_full |
Optimal temporal logic control of autonomous vehicles |
title_fullStr |
Optimal temporal logic control of autonomous vehicles |
title_full_unstemmed |
Optimal temporal logic control of autonomous vehicles |
title_sort |
optimal temporal logic control of autonomous vehicles |
publisher |
Boston University |
publishDate |
2015 |
url |
https://hdl.handle.net/2144/12242 |
work_keys_str_mv |
AT ulusoymalphan optimaltemporallogiccontrolofautonomousvehicles |
_version_ |
1719045151673810944 |