Matching Items (1)
Filtering by

Clear all filters

161727-Thumbnail Image.png
Description
In this thesis, the problem of designing model discrimination algorithms for unknown nonlinear systems is considered, where only raw experimental data of the system is available. This kind of model discrimination techniques finds one of its application in the estimation of the system or intent models under consideration, where all

In this thesis, the problem of designing model discrimination algorithms for unknown nonlinear systems is considered, where only raw experimental data of the system is available. This kind of model discrimination techniques finds one of its application in the estimation of the system or intent models under consideration, where all incompatible models are invalidated using new data that is available at run time. The proposed steps to reach the end goal of the algorithm for intention estimation involves two steps: First, using available experimental data of system trajectories, optimization-based techniques are used to over-approximate/abstract the dynamics of the system by constructing an upper and lower function which encapsulates/frames the true unknown system dynamics. This over-approximation is a conservative preservation of the dynamics of the system, in a way that ensures that any model which is invalidated against this approximation is guaranteed to be invalidated with the actual model of the system. The next step involves the use of optimization-based techniques to investigate the distinguishability of pairs of abstraction/approximated models using an algorithm for 'T-Distinguishability', which gives a finite horizon time 'T', within which the pair of models are guaranteed to be distinguished, and to eliminate incompatible models at run time using a 'Model Invalidation' algorithm. Furthermore, due the large amount of data under consideration, some computation-aware improvements were proposed for the processing of the raw data and the abstraction and distinguishability algorithms.The effectiveness of the above-mentioned algorithms is demonstrated using two examples. The first uses the data collected from the artificial simulation of a swarm of agents, also known as 'Boids', that move in certain patterns/formations, while the second example uses the 'HighD' dataset of naturalistic trajectories recorded on German Highways for vehicle intention estimation.
ContributorsBhagwat, Mohit Mukul (Author) / Yong, Sze Zheng (Thesis advisor) / Berman, Spring (Committee member) / Xu, Zhe (Committee member) / Arizona State University (Publisher)
Created2021