Visible to the public Biblio

Filters: Keyword is control synthesis  [Clear All Filters]
2021-09-09
Kolesnikov, A.A., Kuzmenko, A. A..  2020.  Use of ADAR Method and Theory of Optimal Control for Engineering Systems Optimal Control. 2020 International Conference on Industrial Engineering, Applications and Manufacturing (ICIEAM). :1–5.
This paper compares the known method of Analytical Design of Aggregated Regulators (ADAR) with the method of Analytical Design of Optimal Regulators (ADOR). Both equivalence of these methods and the significant difference in the approaches to the analytical synthesis of control laws are shown. It is shown that the ADAR method has significant advantages associated with a simpler and analytical procedure of design of nonlinear laws for optimal control, clear physical representation of weighting factors of optimality criteria, validity and unambiguity of selecting regulator setting parameters, more simple approach to the analysis of the closed-loop system asymptotic stability. These advantages are illustrated by the examples of synthesis.
2021-01-25
Niu, L., Ramasubramanian, B., Clark, A., Bushnell, L., Poovendran, R..  2020.  Control Synthesis for Cyber-Physical Systems to Satisfy Metric Interval Temporal Logic Objectives under Timing and Actuator Attacks*. 2020 ACM/IEEE 11th International Conference on Cyber-Physical Systems (ICCPS). :162–173.
This paper studies the synthesis of controllers for cyber-physical systems (CPSs) that are required to carry out complex tasks that are time-sensitive, in the presence of an adversary. The task is specified as a formula in metric interval temporal logic (MITL). The adversary is assumed to have the ability to tamper with the control input to the CPS and also manipulate timing information perceived by the CPS. In order to model the interaction between the CPS and the adversary, and also the effect of these two classes of attacks, we define an entity called a durational stochastic game (DSG). DSGs probabilistically capture transitions between states in the environment, and also the time taken for these transitions. With the policy of the defender represented as a finite state controller (FSC), we present a value-iteration based algorithm that computes an FSC that maximizes the probability of satisfying the MITL specification under the two classes of attacks. A numerical case-study on a signalized traffic network is presented to illustrate our results.
2018-09-28
Prabhakar, Pavithra, García Soto, Miriam.  2017.  Formal Synthesis of Stabilizing Controllers for Switched Systems. Proceedings of the 20th International Conference on Hybrid Systems: Computation and Control. :111–120.
In this paper, we describe an abstraction-based method for synthesizing a state-based switching control for stabilizing a family of dynamical systems. Given a set of dynamical systems and a set of polyhedral switching surfaces, the algorithm synthesizes a strategy that assigns to every surface the linear dynamics to switch to at the surface. Our algorithm constructs a finite game graph that consists of the switching surfaces as the existential nodes and the choices of the dynamics as the universal nodes. In addition, the edges capture quantitative information about the evolution of the distance of the state from the equilibrium point along the executions. A switching strategy for the family of dynamical systems is extracted by finding a strategy on the game graph which results in plays having a bounded weight. Such a strategy is obtained by reducing the problem to the strategy synthesis for an energy game, which is a well-studied problem in the literature. We have implemented our algorithm for polyhedral inclusion dynamics and linear dynamics. We illustrate our algorithm on examples from these two classes of systems.