Matching Items (2)
Filtering by
- All Subjects: robust motion planning
- Creators: Rivera, Daniel
Description
The introduction of assistive/autonomous features in cyber-physical systems, e.g., self-driving vehicles, have paved the way to a relatively new field of system analysis for safety-critical applications, along with the topic of controlling systems with performance and safety guarantees. The different works in this thesis explore and design methodologies that focus on the analysis of nonlinear dynamical systems via set-membership approximations, as well as the development of controllers and estimators that can give worst-case performance guarantees, especially when the sensor data containing information on system outputs is prone to data drops and delays. For analyzing the distinguishability of nonlinear systems, building upon the idea of set membership over-approximation of the nonlinear systems, a novel optimization-based method for multi-model affine abstraction (i.e., simultaneous set-membership over-approximation of multiple models) is designed. This work solves for the existence of set-membership over-approximations of a pair of different nonlinear models such that the different systems can be distinguished/discriminated within a guaranteed detection time under worst-case uncertainties and approximation errors. Specifically, by combining mesh-based affine abstraction methods with T-distinguishability analysis in the literature yields a bilevel bilinear optimization problem, whereby leveraging robust optimization techniques and a suitable change of variables result in a sufficient linear program that can obtain a tractable solution with T-distinguishability guarantees. Moreover, the thesis studied the designs of controllers and estimators with performance guarantees, and specifically, path-dependent feedback controllers and bounded-error estimators for time-varying affine systems are proposed that are subject to delayed observations or missing data. To model the delayed/missing data, two approaches are explored; a fixed-length language and an automaton-based model. Furthermore, controllers/estimators that satisfy the equalized recovery property (a weaker form of invariance with time-varying finite bounds) are synthesized whose feedback gains can be adapted based on the observed path, i.e., the history of observed data patterns up to the latest available time step. Finally, a robust kinodynamic motion planning algorithm is also developed with collision avoidance and probabilistic completeness guarantees. In particular, methods based on fixed and flexible invariant tubes are designed such that the planned motion/trajectories can reject bounded disturbances using noisy observations.
ContributorsHassaan, Syed Muhammad (Author) / Yong, Sze Zheng (Thesis advisor) / Rivera, Daniel (Committee member) / Marvi, Hamidreza (Committee member) / Lee, Hyunglae (Committee member) / Berman, Spring (Committee member) / Arizona State University (Publisher)
Created2023
Description
In this thesis, we focus on some of the NP-hard problems in control theory. Thanks to the converse Lyapunov theory, these problems can often be modeled as optimization over polynomials. To avoid the problem of intractability, we establish a trade off between accuracy and complexity. In particular, we develop a sequence of tractable optimization problems - in the form of Linear Programs (LPs) and/or Semi-Definite Programs (SDPs) - whose solutions converge to the exact solution of the NP-hard problem. However, the computational and memory complexity of these LPs and SDPs grow exponentially with the progress of the sequence - meaning that improving the accuracy of the solutions requires solving SDPs with tens of thousands of decision variables and constraints. Setting up and solving such problems is a significant challenge. The existing optimization algorithms and software are only designed to use desktop computers or small cluster computers - machines which do not have sufficient memory for solving such large SDPs. Moreover, the speed-up of these algorithms does not scale beyond dozens of processors. This in fact is the reason we seek parallel algorithms for setting-up and solving large SDPs on large cluster- and/or super-computers.
We propose parallel algorithms for stability analysis of two classes of systems: 1) Linear systems with a large number of uncertain parameters; 2) Nonlinear systems defined by polynomial vector fields. First, we develop a distributed parallel algorithm which applies Polya's and/or Handelman's theorems to some variants of parameter-dependent Lyapunov inequalities with parameters defined over the standard simplex. The result is a sequence of SDPs which possess a block-diagonal structure. We then develop a parallel SDP solver which exploits this structure in order to map the computation, memory and communication to a distributed parallel environment. Numerical tests on a supercomputer demonstrate the ability of the algorithm to efficiently utilize hundreds and potentially thousands of processors, and analyze systems with 100+ dimensional state-space. Furthermore, we extend our algorithms to analyze robust stability over more complicated geometries such as hypercubes and arbitrary convex polytopes. Our algorithms can be readily extended to address a wide variety of problems in control such as Hinfinity synthesis for systems with parametric uncertainty and computing control Lyapunov functions.
We propose parallel algorithms for stability analysis of two classes of systems: 1) Linear systems with a large number of uncertain parameters; 2) Nonlinear systems defined by polynomial vector fields. First, we develop a distributed parallel algorithm which applies Polya's and/or Handelman's theorems to some variants of parameter-dependent Lyapunov inequalities with parameters defined over the standard simplex. The result is a sequence of SDPs which possess a block-diagonal structure. We then develop a parallel SDP solver which exploits this structure in order to map the computation, memory and communication to a distributed parallel environment. Numerical tests on a supercomputer demonstrate the ability of the algorithm to efficiently utilize hundreds and potentially thousands of processors, and analyze systems with 100+ dimensional state-space. Furthermore, we extend our algorithms to analyze robust stability over more complicated geometries such as hypercubes and arbitrary convex polytopes. Our algorithms can be readily extended to address a wide variety of problems in control such as Hinfinity synthesis for systems with parametric uncertainty and computing control Lyapunov functions.
ContributorsKamyar, Reza (Author) / Peet, Matthew (Thesis advisor) / Berman, Spring (Committee member) / Rivera, Daniel (Committee member) / Artemiadis, Panagiotis (Committee member) / Fainekos, Georgios (Committee member) / Arizona State University (Publisher)
Created2016