-
作者：Franceschelli, Mauro; Frasca, Paolo
作者单位：University of Cagliari; Communaute Universite Grenoble Alpes; Institut National Polytechnique de Grenoble; Universite Grenoble Alpes (UGA); Centre National de la Recherche Scientifique (CNRS); Inria
摘要：In this article, we consider a class of multiagent network systems that we refer to as open multiagent systems (OMASs): in these multiagent systems, an indefinite number of agents may join or leave the network at any time. Focusing on discrete-time evolutions of scalar agents, we provide a novel theoretical framework to study the dynamical properties of OMASs. Specifically, we propose a suitable notion of stability and derive sufficient conditions for it. Our analysis regards the arrival/depar...
-
作者：Lai, Aiwen; Lahaye, Sebastien; Giua, Alessandro
作者单位：Universite d'Angers; University of Cagliari
摘要：In this article, we deal with the detectability problem for unambiguous weighted automata (UWAs). The problem is to determine if, after a finite number of observations, the set of possible states is reduced to a singleton. Four types of detectabilities, namely, strong detectability, detectability, strong periodic detectability, and periodic detectability are defined in terms of different requirements for current state estimation. We first construct a deterministic finite state automaton (calle...
-
作者：Niu, Luyao; Fu, Jie; Clark, Andrew
作者单位：Worcester Polytechnic Institute
摘要：Temporal logic provides a rigorous and expressive way to model specifications for cyber-physical systems (CPS). Such systems, which are playing increasingly important roles in various domains, are also subject to malicious attacks initiated by intelligent adversaries. Malicious attacks may prevent the system from satisfying the desired specification. In this article, we introduce a control synthesis method to minimize deviations from the desired specification due to adversaries. We consider th...
-
作者：Wang, Bohui; Chen, Weisheng; Wang, Jingcheng; Zhang, Bin; Shi, Peng
作者单位：Xidian University; Shanghai Jiao Tong University; Xi'an Technological University; University of South Carolina System; University of South Carolina Columbia; University of Adelaide; Victoria University
摘要：This article proposes a multiple saturation levels framework to investigate the semiglobal tracking cooperative control problem of multiagent systems with switching communication topologies. This problem is solving by proposing a switching parametric Lyapunov approach and constructing a three-layer nodes model with mirroring nodes to reduce the complexity of controller design in which control inputs for different layers of nodes are with different saturation levels. A metamorphic low-gain feed...
-
作者：Wang, Jun-Wei; Wang, Jun-Min
作者单位：University of Science & Technology Beijing; Beijing Institute of Technology
摘要：This article employs the observer-based output feedback control technique to deal with dynamic compensator design for a linear N-D parabolic partial differential equation (PDE) with multiple local piecewise control inputs and multiple non-collocated local piecewise observation outputs. These control inputs and observation outputs are provided by only few actuators and noncollocated sensors active over partial areas (or entire) of the spatial domain. An observer-based dynamic feedback compensat...
-
作者：Bisoffi, Andrea; Dimarogonas, Dimos V.
作者单位：Royal Institute of Technology
摘要：In this article, we formulate the problem of satisfying a linear temporal logic formula on a linear plant with output feedback, through a recent hybrid systems formalism. We relate this problem to the notion of recurrence introduced for the considered formalism, and we then extend Lyapunov-like conditions for recurrence of an open, unbounded set. One of the proposed relaxed conditions allows certifying recurrence of a suitable set, and this guarantees that the high-level evolution of the plant...
-
作者：Cong, Yirui; Zhou, Xiangyun; Kennedy, Rodney A.
作者单位：National University of Defense Technology - China; Australian National University
摘要：In this article, we consider the minimum data rate problem for linear system stabilization under noiseless communication channels. Previous results indicated that having a data rate very approaching the entropy bound leads to large delays and data buffer sizes. In analogy, the entropy bound in Shannon's source coding theorem in traditional information theory displays this behavior, where the data rate can be arbitrarily close to the entropy bound but only at the cost of boundlessly enlarging t...
-
作者：De, Souradip; Sahoo, Soumya Ranjan; Wahi, Pankaj
作者单位：Indian Institute of Technology System (IIT System); Indian Institute of Technology (IIT) - Kanpur; Indian Institute of Technology System (IIT System); Indian Institute of Technology (IIT) - Kanpur
摘要：In this article, we present a consensus strategy based on cyclic pursuit that ensures rendezvous at any desired point in 2-D space (R-2 reachability) starting with any nonsingular initial configuration of the agents. Choice of a negative gain expands the reachable set beyond the convex hull of the initial configuration of agents. However, the entire R-2 is not reachable in general. We first find the necessary and sufficient condition for the initial configuration of the agents, which ensures R...
-
作者：Laurenti, Luca; Lahijanian, Morteza; Abate, Alessandro; Cardelli, Luca; Kwiatkowska, Marta
作者单位：University of Oxford; University of Colorado System; University of Colorado Boulder
摘要：Stochastic processes are expressive mathematical tools for modeling real-world systems that are subject to uncertainty. It is hence crucial to be able to formally analyze the behavior of these processes, especially in safety-critical applications. Most of the existing formal methods are not designed for continuous-time processes, and those that are typically suffering from state explosion in practice. This article introduces a theoretical framework and a scalable computational method for forma...
-
作者：Nie, Yuanbo; Kerrigan, Eric C.
作者单位：Imperial College London; Imperial College London
摘要：We propose a general approach to directly implement rate constraints on the discretization mesh for all collocation methods, for both state and input variables. Unlike conventional approaches that may lead to singular control arcs, the solution of this on-mesh implementation has better properties. Moreover, computational speedups of more than 30% can be achieved by exploiting the properties of the resulting linear constraint equations.
