Control of dynamical systems with temporal logic specifications

This thesis is motivated by safety-critical applications involving autonomous air, ground, and space vehicles carrying out complex tasks in uncertain and adversarial environments. We use temporal logic as a language to formally specify complex tasks and system properties. Temporal logic specifications generalize the classical notions of stability and reachability that are studied in the control and hybrid systems communities. Given a system model and a formal task specification, the goal is to automatically synthesize a control policy for the system that ensures that the system satisfies the specification. This thesis presents novel control policy synthesis algorithms for optimal and robust control of dynamical systems with temporal logic specifications. Furthermore, it introduces algorithms that are efficient and extend to high-dimensional dynamical systems.

The first contribution of this thesis is the generalization of a classical linear temporal logic (LTL) control synthesis approach to optimal and robust control. We show how we can extend automata-based synthesis techniques for discrete abstractions of dynamical systems to create optimal and robust controllers that are guaranteed to satisfy an LTL specification. Such optimal and robust controllers can be computed at little extra computational cost compared to computing a feasible controller.

The second contribution of this thesis addresses the scalability of control synthesis with LTL specifications. A major limitation of the standard automaton-based approach for control with LTL specifications is that the automaton might be doubly-exponential in the size of the LTL specification. We introduce a fragment of LTL for which one can compute feasible control policies in time polynomial in the size of the system and specification. Additionally, we show how to compute optimal control policies for a variety of cost functions, and identify interesting cases when this can be done in polynomial time. These techniques are particularly relevant for online control, as one can guarantee that a feasible solution can be found quickly, and then iteratively improve on the quality as time permits.

The final contribution of this thesis is a set of algorithms for computing feasible trajectories for high-dimensional, nonlinear systems with LTL specifications. These algorithms avoid a potentially computationally-expensive process of computing a discrete abstraction, and instead compute directly on the system's continuous state space. The first method uses an automaton representing the specification to directly encode a series of constrained-reachability subproblems, which can be solved in a modular fashion by using standard techniques. The second method encodes an LTL formula as mixed-integer linear programming constraints on the dynamical system. We demonstrate these approaches with numerical experiments on temporal logic motion planning problems with high-dimensional (10+ states) continuous systems.

The steady-state response of multidegree-of-freedom systems with a spatially localized nonlinearity

This thesis is concerned with the dynamic response of a General multidegree-of-freedom linear system with a one dimensional nonlinear constraint attached between two points. The nonlinear constraint is assumed to consist of rate-independent conservative and hysteretic nonlinearities and may contain a viscous dissipation element. The dynamic equations for general spatial and temporal load distributions are derived for both continuous and discrete systems. The method of equivalent linearization is used to develop equations which govern the approximate steady-state response to generally distributed loads with harmonic time dependence.

The qualitative response behavior of a class of undamped chainlike structures with a nonlinear terminal constraint is investigated. It is shown that the hardening or softening behavior of every resonance curve is similar and is determined by the properties of the constraint. Also examined are the number and location of resonance curves, the boundedness of the forced response, the loci of response extrema, and other characteristics of the response. Particular consideration is given to the dependence of the response characteristics on the properties of the linear system, the nonlinear constraint, and the load distribution.

Numerical examples of the approximate steady-state response of three structural systems are presented. These examples illustrate the application of the formulation and qualitative theory. It is shown that disconnected response curves and response curves which cross are obtained for base excitation of a uniform shear beam with a cubic spring foundation. Disconnected response curves are also obtained for the steady-state response to a concentrated load of a chainlike structure with a hardening hysteretic constraint. The accuracy of the approximate response curves is investigated.

Random propagation in complex systems : nonlinear matrix recursions and epidemic spread

This dissertation studies long-term behavior of random Riccati recursions and mathematical epidemic model. Riccati recursions are derived from Kalman filtering. The error covariance matrix of Kalman filtering satisfies Riccati recursions. Convergence condition of time-invariant Riccati recursions are well-studied by researchers. We focus on time-varying case, and assume that regressor matrix is random and identical and independently distributed according to given distribution whose probability distribution function is continuous, supported on whole space, and decaying faster than any polynomial. We study the geometric convergence of the probability distribution. We also study the global dynamics of the epidemic spread over complex networks for various models. For instance, in the discrete-time Markov chain model, each node is either healthy or infected at any given time. In this setting, the number of the state increases exponentially as the size of the network increases. The Markov chain has a unique stationary distribution where all the nodes are healthy with probability 1. Since the probability distribution of Markov chain defined on finite state converges to the stationary distribution, this Markov chain model concludes that epidemic disease dies out after long enough time. To analyze the Markov chain model, we study nonlinear epidemic model whose state at any given time is the vector obtained from the marginal probability of infection of each node in the network at that time. Convergence to the origin in the epidemic map implies the extinction of epidemics. The nonlinear model is upper-bounded by linearizing the model at the origin. As a result, the origin is the globally stable unique fixed point of the nonlinear model if the linear upper bound is stable. The nonlinear model has a second fixed point when the linear upper bound is unstable. We work on stability analysis of the second fixed point for both discrete-time and continuous-time models. Returning back to the Markov chain model, we claim that the stability of linear upper bound for nonlinear model is strongly related with the extinction time of the Markov chain. We show that stable linear upper bound is sufficient condition of fast extinction and the probability of survival is bounded by nonlinear epidemic map.

Price Premium for High-Efficiency Refrigerators and Calculation of Price-Elasticities for Close-Substitutes: Combining Hedonic Pricing and Demand Systems

21 p.

Convex model predictive control for vehicular systems

In this work, the author presents a method called Convex Model Predictive Control (CMPC) to control systems whose states are elements of the rotation matrices SO(n) for n = 2, 3. This is done without charts or any local linearization, and instead is performed by operating over the orbitope of rotation matrices. This results in a novel model predictive control (MPC) scheme without the drawbacks associated with conventional linearization techniques such as slow computation time and local minima. Of particular emphasis is the application to aeronautical and vehicular systems, wherein the method removes many of the trigonometric terms associated with these systems’ state space equations. Furthermore, the method is shown to be compatible with many existing variants of MPC, including obstacle avoidance via Mixed Integer Linear Programming (MILP).

Information-theoretic Studies and Capacity Bounds: Group Network Codes and Energy Harvesting Communication Systems

Network information theory and channels with memory are two important but difficult frontiers of information theory. In this two-parted dissertation, we study these two areas, each comprising one part. For the first area we study the so-called entropy vectors via finite group theory, and the network codes constructed from finite groups. In particular, we identify the smallest finite group that violates the Ingleton inequality, an inequality respected by all linear network codes, but not satisfied by all entropy vectors. Based on the analysis of this group we generalize it to several families of Ingleton-violating groups, which may be used to design good network codes. Regarding that aspect, we study the network codes constructed with finite groups, and especially show that linear network codes are embedded in the group network codes constructed with these Ingleton-violating families. Furthermore, such codes are strictly more powerful than linear network codes, as they are able to violate the Ingleton inequality while linear network codes cannot. For the second area, we study the impact of memory to the channel capacity through a novel communication system: the energy harvesting channel. Different from traditional communication systems, the transmitter of an energy harvesting channel is powered by an exogenous energy harvesting device and a finite-sized battery. As a consequence, each time the system can only transmit a symbol whose energy consumption is no more than the energy currently available. This new type of power supply introduces an unprecedented input constraint for the channel, which is random, instantaneous, and has memory. Furthermore, naturally, the energy harvesting process is observed causally at the transmitter, but no such information is provided to the receiver. Both of these features pose great challenges for the analysis of the channel capacity. In this work we use techniques from channels with side information, and finite state channels, to obtain lower and upper bounds of the energy harvesting channel. In particular, we study the stationarity and ergodicity conditions of a surrogate channel to compute and optimize the achievable rates for the original channel. In addition, for practical code design of the system we study the pairwise error probabilities of the input sequences.

Equivalent differential equations for nonlinear dynamical systems

A technique for obtaining approximate periodic solutions to nonlinear ordinary differential equations is investigated. The approach is based on defining an equivalent differential equation whose exact periodic solution is known. Emphasis is placed on the mathematical justification of the approach. The relationship between the differential equation error and the solution error is investigated, and, under certain conditions, bounds are obtained on the latter. The technique employed is to consider the equation governing the exact solution error as a two point boundary value problem. Among other things, the analysis indicates that if an exact periodic solution to the original system exists, it is always possible to bound the error by selecting an appropriate equivalent system.

Three equivalence criteria for minimizing the differential equation error are compared, namely, minimum mean square error, minimum mean absolute value error, and minimum maximum absolute value error. The problem is analyzed by way of example, and it is concluded that, on the average, the minimum mean square error is the most appropriate criterion to use.

A comparison is made between the use of linear and cubic auxiliary systems for obtaining approximate solutions. In the examples considered, the cubic system provides noticeable improvement over the linear system in describing periodic response.

A comparison of the present approach to some of the more classical techniques is included. It is shown that certain of the standard approaches where a solution form is assumed can yield erroneous qualitative results.

Stationary random response of multidegree-of-freedom systems

An approximate approach is presented for determining the stationary random response of a general multidegree-of-freedom nonlinear system under stationary Gaussian excitation. This approach relies on defining an equivalent linear system for the nonlinear system. Two particular systems which possess exact solutions have been solved by this approach, and it is concluded that this approach can generate reasonable solutions even for systems with fairly large nonlinearities. The approximate approach has also been applied to two examples for which no exact or approximate solutions were previously available.

Also presented is a matrix algebra approach for determining the stationary random response of a general multidegree-of-freedom linear system. Its derivation involves only matrix algebra and some properties of the instantaneous correlation matricies of a stationary process. It is therefore very direct and straightforward. The application of this matrix algebra approach is in general simpler than that of commonly used approaches.

The astrophysics of strongly interacting systems

This thesis presents investigations in four areas of theoretical astrophysics: the production of sterile neutrino dark matter in the early Universe, the evolution of small-scale baryon perturbations during the epoch of cosmological recombination, the effect of primordial magnetic fields on the redshifted 21-cm emission from the pre-reionization era, and the nonlinear stability of tidally deformed neutron stars.

In the first part of the thesis, we study the asymmetry-driven resonant production of 7 keV-scale sterile neutrino dark matter in the primordial Universe at temperatures T >~ 100 MeV. We report final DM phase space densities that are robust to uncertainties in the nature of the quark-hadron transition. We give transfer functions for cosmological density fluctuations that are useful for N-body simulations. We also provide a public code for the production calculation.

In the second part of the thesis, we study the instability of small-scale baryon pressure sound waves during cosmological recombination. We show that for relevant wavenumbers, inhomogenous recombination is driven by the transport of ionizing continuum and Lyman-alpha photons. We find a maximum growth factor less than ≈ 1.2 in 10⁷ random realizations of initial conditions. The low growth factors are due to the relatively short duration of the recombination epoch.

In the third part of the thesis, we propose a method of measuring weak magnetic fields, of order 10^-19 G (or 10^-21 G if scaled to the present day), with large coherence lengths in the inter galactic medium prior to and during the epoch of cosmic reionization. The method utilizes the Larmor precession of spin-polarized neutral hydrogen in the triplet state of the hyperfine transition. We perform detailed calculations of the microphysics behind this effect, and take into account all the processes that affect the hyperfine transition, including radiative decays, collisions, and optical pumping by Lyman-alpha photons.

In the final part of the thesis, we study the non-linear effects of tidal deformations of neutron stars (NS) in a compact binary. We compute the largest three- and four-mode couplings among the tidal mode and high-order p- and g-modes of similar radial wavenumber. We demonstrate the near-exact cancellation of their effects, and resolve the question of the stability of the tidally deformed NS to leading order. This result is significant for the extraction of binary parameters from gravitational wave observations.

Performance calculations of new propellant systems

The purpose of this thesis is to investigate the effect on performance and chamber temperature of adding hydrogen to a propellant system. The systems investigated are:

(1) RFNA-Aniline

(2) Nitromethane

(3) Anhydrous hydrazene-liquid oxygen

Since a systematic investigation of the performance parameters of the RFNA-Aniline system over a wide range of mixture ratios has never been made, it was decided to make these calculations, in addition to the investigations stated above.

The results of the calculations can best be summarized by a study of the figures at the end of the thesis. A few generalizations can be made. The effect of adding hydrogen in small quantities to a high temperature system is to increase the performance considerably without too much change in the chamber temperature. As more hydrogen is added, the percentage increase in performance. If hydrogen is added in large quantities, both the performance curve (effective exhaust velocity) and the chamber temperature curve flatten out.

The behavior discussed above is characteristic of hot propellant systems such as RFNA-Aniline and anhydrous hydrazene. In a low temperature system, such as nitromethane, the effect is quite different. The addition of hydrogen in small quantities causes a rapid decrease in chamber temperature, but the increase in performance is considerably less on a percentage basis. As more hydrogen is added the changes in performance and chamber temperature are almost linear.

Digital-Analog Quantum Simulation of Spin Systems in Trapped Ions

65 p.

A Data Dropout Compensation Algorithm Based on the Iterative Learning Control Methodology for Discrete-Time Systems

This paper deals with the convergence of a remote iterative learning control system subject to data dropouts. The system is composed by a set of discrete-time multiple input-multiple output linear models, each one with its corresponding actuator device and its sensor. Each actuator applies the input signals vector to its corresponding model at the sampling instants and the sensor measures the output signals vector. The iterative learning law is processed in a controller located far away of the models so the control signals vector has to be transmitted from the controller to the actuators through transmission channels. Such a law uses the measurements of each model to generate the input vector to be applied to its subsequent model so the measurements of the models have to be transmitted from the sensors to the controller. All transmissions are subject to failures which are described as a binary sequence taking value 1 or 0. A compensation dropout technique is used to replace the lost data in the transmission processes. The convergence to zero of the errors between the output signals vector and a reference one is achieved as the number of models tends to infinity.

Hyers-Ulam-Rassias Stability of Functional Differential Systems with Point and Distributed Delays

This paper investigates stability and asymptotic properties of the error with respect to its nominal version of a nonlinear time-varying perturbed functional differential system subject to point, finite-distributed, and Volterra-type distributed delays associated with linear dynamics together with a class of nonlinear delayed dynamics. The boundedness of the error and its asymptotic convergence to zero are investigated with the results being obtained based on the Hyers-Ulam-Rassias analysis.