-
作者：Reveliotis, Spyros
作者单位：University System of Georgia; Georgia Institute of Technology
摘要：Opacity is a concept that has been studied extensively by the discrete event systems (DES) community. This work specializes this concept to the semantics and the dynamics of autonomous Boolean networks (BNs), which constitute a DES subclass. Focusing on the particular notion of strong infinite-step opacity, this article provides customized, streamlined verification algorithms and novel enforcement methods. The underlying analysis also reveals the affinity of this concept to the existing result...
-
作者：Reveliotis, Spyros
作者单位：University System of Georgia; Georgia Institute of Technology
摘要：Opacity is a concept that has been studied extensively by the discrete event systems (DES) community. This work specializes this concept to the semantics and the dynamics of autonomous Boolean networks (BNs), which constitute a DES subclass. Focusing on the particular notion of strong infinite-step opacity, this article provides customized, streamlined verification algorithms and novel enforcement methods. The underlying analysis also reveals the affinity of this concept to the existing result...
-
作者：Ortega, Juan-Pablo; Rossmannek, Florian
作者单位：Nanyang Technological University
摘要：Several topological and analytical notions of continuity and fading memory for causal and time-invariant filters are introduced, and the relations between them are analyzed. A significant generalization of the convolution theorem that establishes the equivalence between the fading memory property and the availability of convolution representations of linear filters is proved. This result extends a previous similar characterization to a complete array of weighted norms in the definition of the ...
-
作者：Tang, Michael; Javed, Umar; Chen, Xudong; Krstic, Miroslav; Poveda, Jorge I.
作者单位：University of California System; University of California San Diego; University of Colorado System; University of Colorado Boulder; Washington University (WUSTL); University of California System; University of California San Diego
摘要：In socio-technical multiagent systems, deception exploits privileged information to induce false beliefs in victims, keeping them oblivious and leading to outcomes detrimental to them or advantageous to the deceiver. We consider model-free Nash-equilibrium-seeking for noncooperative games with asymmetric information and introduce model-free deceptive algorithms with stability guarantees. In the simplest algorithm, the deceiver includes in his action policy the victim's exploration signal, with...
-
作者：Zhang, Xiwei; Li, Tao; Chen, Yan; Long, Qianyuan
作者单位：East China Normal University; Chinese Academy of Sciences; Academy of Mathematics & System Sciences, CAS; Chinese Academy of Sciences; University of Chinese Academy of Sciences, CAS; East China Normal University
摘要：We propose a decentralized online learning algorithm for distributed random inverse problems over network graphs with online measurements, and unify the distributed parameter estimation in Hilbert spaces and the least mean square problem in reproducing kernel Hilbert spaces (RKHS). We transform the convergence of the algorithm into the asymptotic stability of a class of inhomogeneous random difference equations in Hilbert spaces with L-2-bounded martingale difference terms and develop the L-2-...
-
作者：Kulmburg, Adrian; Schafer, Lukas; Althoff, Matthias
作者单位：Technical University of Munich
摘要：The zonotope containment problem, i.e., whether one zonotope is contained in another, is a central problem in control theory. Applications include detecting faults and robustifying controllers by computing invariant sets, and obtaining fixed points in reachability analysis. Despite the inherent $\mathsf {co}\text{-}\mathsf {NP}$-hardness of this problem, an approximation algorithm developed by Sadraddini and Tedrake (2019) has gained widespread recognition for its swift execution and consisten...
-
作者：Li, Xinran; Li, Xiuxian; Li, Li; Chen, Jie
作者单位：Tongji University; Tongji University
摘要：This article proposes a hierarchical leader-follower game, called Stackelberg aggregative games, with the consideration of an aggregative variable determined by all the players over a multiagent network. In this problem, a leader makes its decision first, followed by the followers in response to the leader's decision. Each follower aims to minimize its individual cost, which is determined by its own strategy, the leader's strategy, and the aggregative strategy of all the followers, through loc...
-
作者：Iannelli, Andrea; Postoyan, Romain
作者单位：University of Stuttgart; Universite de Lorraine; Centre National de la Recherche Scientifique (CNRS)
摘要：We consider the data-driven stabilization of discrete-time linear time-varying systems. The controller is defined as a linear state-feedback law whose gain is adapted to the plant changes through a data-based event-triggering rule. To do so, we monitor the evolution of a data-based Lyapunov function along the solution. When this Lyapunov function does not satisfy a designed desirable condition, an episode is triggered to update the controller gain and the corresponding Lyapunov function using ...
-
作者：Han, Dongyu; Liu, Kun; Xia, Yuanqing; Xie, Lihua
作者单位：Beijing Institute of Technology; Nanyang Technological University
摘要：In this article, we focused on a Byzantine-robust distributed stochastic nonconvex optimization problem with smooth local cost functions over unbalanced networks. In particular, the nodes in a network are to find a stationary solution minimizing a sum of smooth cost functions, while some of unreliable or malicious Byzantine nodes can spread faulty values in the network to disturb both the update of the algorithm and the computation of the weighted matrix. By using a robust clipping-based aggre...
-
作者：Lin, Yixuan; Zhu, Zeru; Liu, Ji
作者单位：State University of New York (SUNY) System; Stony Brook University; State University of New York (SUNY) System; Stony Brook University
摘要：This article establishes the explicit absolute probability sequence for the push-sum algorithm, and based on which, and constructs quadratic Lyapunov functions for push-sum-based distributed optimization algorithms. As illustrative examples, the proposed novel analysis tool can establish optimal convergence rates for the subgradient-push and stochastic gradient-push, two important algorithms for distributed convex optimization over directed graphs. Specifically, this article proves that the su...
