-
作者：Riedinger, Pierre; Daafouz, Jamal
作者单位：Universite de Lorraine
摘要：In this article, we address the problem of solving infinite-dimensional harmonic algebraic Lyapunov and Riccati equations up to an arbitrary small error. This question is of major practical importance for analysis and stabilization of periodic systems including tracking of periodic trajectories. We first give a closed form of a Floquet factorization in the general setting of L-2 matrix functions and study the spectral properties of infinite-dimensional harmonic matrices and their truncated ver...
-
作者：Yan, Zhiguo; Zhou, Xiaomin; Chang, Gaizhen; Gao, Zhiwei
作者单位：Qilu University of Technology; Qilu University of Technology; Northumbria University
摘要：In this article, finite-time annular domain stability and stabilization of It & ocirc; stochastic systems with semi-Markovian switching are investigated, where the switching frequency is time varying, and satisfies a unfixed polytope. A new inequality called reverse differential Gronwall inequality is proposed to address less conservative sufficient conditions for testing the finite-time annular domain stability, and its superiority to modified Gronwall inequality is analyzed. Moreover, suffic...
-
作者：Liu, Rongjian; Lu, Jianquan; Hadjicostis, Christoforos N.
作者单位：Chongqing Normal University; Southeast University - China; Southeast University - China; University of Cyprus
摘要：The enforcement of opacity, a security property concerning information-flow, has been investigated using edit functions, which are capable of manipulating the output of the system via insertion, replacement, and erasure operations on its symbols, in order to ensure that an outside observer (the intruder) does not gain access to critical system information. In this article, we consider situations where an intended receiver may be present and develop attribute-based edit functions, which not onl...
-
作者：Nguyen, Hoai-Nam
作者单位：IMT - Institut Mines-Telecom; Institut Polytechnique de Paris; Telecom SudParis
摘要：The purposes of this paper are twofold. The first is to derive a convex formulation for optimizing the fictitious dynamics of the extended command governor strategy recently proposed in Gilbert and Ong (2011). The second purpose is to provide an efficient procedure to solve online the optimization problem of the ellipsoidal set-based command governor or the extended command governor. Two numerical examples with comparison to earlier solutions from the literature illustrate the effectiveness of...
-
作者：Kitsos, Constantinos; Bajodek, Mathieu; Baudouin, Lucie
作者单位：Universite de Toulouse; Centre National de la Recherche Scientifique (CNRS)
摘要：The estimation of an unknown source coefficient and of the solution to a 1-D wave equation via exponentially convergent state observers is the problem under consideration in this work. The coefficient is assumed to depend on the space variable only and to be polynomial. The main observation information for this inverse problem is the value of the solution to the wave equation in a subinterval of the domain, including also some of its higher order spatial derivatives. In order to estimate the s...
-
作者：Sadana, Utsav; Reddy, Puduru Viswanadha; Zaccour, Georges
作者单位：McGill University; Universite de Montreal; Indian Institute of Technology System (IIT System); Indian Institute of Technology (IIT) - Madras; Universite de Montreal; HEC Montreal
摘要：In this article, we study a class of deterministic finite-horizon two-player nonzero-sum differential games where players are endowed with different kinds of controls. We assume that Player 1 uses piecewise-continuous controls, whereas Player 2 uses impulse controls. For this class of games, we seek to derive conditions for the existence of feedback Nash equilibrium strategies for the players. More specifically, we provide a verification theorem for identifying such equilibrium strategies, usi...
-
作者：Shi, Xinli; Wen, Guanghui; Cao, Jinde; Yu, Xinghuo
作者单位：Southeast University - China; Southeast University - China; Royal Melbourne Institute of Technology (RMIT)
摘要：In distributed optimization (DO), the designed algorithms are expected to have a fast convergence rate but less computation cost. Moreover, the boundedness of the control inputs is generally required for practical networking agent systems with actuator limitations. Motivated by these observations, we first revisit the well-known finite-time distributed average tracking (FTDAT) problem where a novel sufficient condition on the control gain and the finite settling time estimation are derived bas...
-
作者：Sinyakov, Vladimir; Girard, Antoine
作者单位：Universite Paris Saclay; Centre National de la Recherche Scientifique (CNRS)
摘要：In this article, we consider the problem of the computation of efficient symbolic abstractions for continuous-time control systems. The new abstraction algorithm builds symbolic models with the same number of states but fewer transitions in comparison to the one produced by the standard algorithm. At the same time, the new abstract system is at least as controllable as the standard one. The proposed algorithm is based on the solution of a region-to-region control synthesis problem. This soluti...
-
作者：Mukherjee, Mousumi; Pal, Debasattam
作者单位：Indian Institute of Technology System (IIT System); Indian Institute of Technology (IIT) - Bombay
摘要：The issue of initial/boundary conditions for a general system of partial difference equations (PDEs)-called a discrete n-D system-is resolved through the notion of characteristic sets: the restriction of a solution trajectory to a minimal characteristic set can be considered to be the initial/boundary condition to the corresponding trajectory. In the recent paper (Mukherjee and Pal, 2021), it has been shown that every autonomous n-D system admits a minimal characteristic set that is the union ...
-
作者：Mavridis, Christos N.; Baras, John S.
作者单位：University System of Maryland; University of Maryland College Park; University System of Maryland; University of Maryland College Park
摘要：In this work, we introduce a learning model designed to meet the needs of applications in which computational resources are limited, and robustness and interpretability are prioritized. Learning problems can be formulated as constrained stochastic optimization problems, with the constraints originating mainly from model assumptions that define a tradeoff between complexity and performance. This tradeoff is closely related to overfitting, generalization capacity, and robustness to noise and adv...
