-
作者：Granichin, Oleg; Erofeeva, Victoria; Ivanskiy, Yury; Jiang, Yuming
作者单位：Saint Petersburg State University; Norwegian University of Science & Technology (NTNU)
摘要：We consider a setup where a distributed set of sensors working cooperatively can estimate an unknown signal of interest, whereas any individual sensor cannot fulfill the task due to lack of necessary information diversity. This article deals with these kinds of estimation and tracking problems and focuses on a class of simultaneous perturbation stochastic approximation (SPSA)-based consensus algorithms for the cases when the corrupted observations of sensors are transmitted between sensors wit...
-
作者：Lu, An-Yang; Yang, Guang-Hong
作者单位：Northeastern University - China; Northeastern University - China
摘要：This article investigates the distributed secure state estimation problem of distributed systems where a set of agents estimates the state cooperatively in the presence of malicious agents. First, a sufficient condition for the solvability of the distributed secure state estimation problem is proposed. Second, based on the obtained condition, a distributed switched gradient descent (DSGD) algorithm is designed to solve the considered problem which is transformed into a distributed optimization...
-
作者：Zhu, Yanan; Yu, Wenwu; Wen, Guanghui; Chen, Guanrong
作者单位：Southeast University - China; Southeast University - China; City University of Hong Kong
摘要：An aggregative game with local constraint sets is studied in this article, where each player's cost function is dependent on the aggregation function that is unavailable to all players. To compute the Nash equilibrium (NE) point of the game in a distributed manner, the players are endowed with several auxiliary state variables that are used to estimate the aggregation function by exchanging their estimates with local neighbors on a directed graph. In the two cases with strongly connected weigh...
-
作者：Garg, Kunal; Panagou, Dimitra
作者单位：University of Michigan System; University of Michigan
摘要：Continuous-time optimization is currently an active field of research in optimization theory; prior work in this area has yielded useful insights and elegant methods for proving stability and convergence properties of the continuous-time optimization algorithms. This article proposes novel gradient-flow schemes that yield convergence to the optimal point of a convex optimization problem within a fixed time from any given initial condition for unconstrained optimization, constrained optimizatio...
-
作者：Li, Xiuxian; Feng, Gang
作者单位：City University of Hong Kong
摘要：This article addresses the problem of seeking a common fixed point for a finite collection of nonexpansive operators over time-varying multi-agent networks in real Hilbert spaces. Each operator is assumed to be only privately and approximately known to each individual agent, and all agents need to cooperate to solve this problem by local communications over time-varying networks. To handle this problem, inspired by the centralized inexact Krasnoselski.i-Mann iteration, we propose a distributed...
-
作者：Mironchenko, Andrii; Prieur, Christophe; Wirth, Fabian
作者单位：University of Passau; Communaute Universite Grenoble Alpes; Institut National Polytechnique de Grenoble; Universite Grenoble Alpes (UGA); Centre National de la Recherche Scientifique (CNRS)
摘要：We derive a saturated feedback control, which locally stabilizes a linear reaction-diffusion equation. In contrast to most other works on this topic, we do not assume the Lyapunov stability of the uncontrolled system and consider general unstable systems. Using Lyapunov methods, we provide estimates for the region of attraction for the closed-loop system, given in terms of linear and bilinear matrix inequalities. We show that our results can be used with distributed as well as scalar boundary ...
-
作者：Cassano, Lucas; Yuan, Kun; Sayed, Ali H.
作者单位：University of California System; University of California Los Angeles; Swiss Federal Institutes of Technology Domain; Ecole Polytechnique Federale de Lausanne
摘要：This article develops a fully decentralized multiagent algorithm for policy evaluation. The proposed scheme can be applied to two distinct scenarios. In the first scenario, a collection of agents have distinct datasets gathered by following different behavior policies (none of which is required to explore the full state space) in different instances of the same environment and they all collaborate to evaluate a common target policy. The network approach allows for efficient exploration of the ...
-
作者：Rikos, Apostolos, I; Hadjicostis, Christoforos N.
作者单位：Royal Institute of Technology; University of Cyprus
摘要：We study the distributed average consensus problem in multiagent systems with directed communication links that are subject to quantized information flow. The goal of distributed average consensus is for the nodes, each associated with some initial value, to obtain the average (or some value close to the average) of these initial values. In this article, we present and analyze a novel distributed averaging algorithm that operates exclusively on quantized values (specifically, the information s...
-
作者：Guo, Ziyang; Ni, Yuqing; Wong, Wing Shing; Shi, Ling
作者单位：Hong Kong University of Science & Technology; Chinese University of Hong Kong
摘要：We consider time synchronization attack against multisystem scheduling in a remote state estimation scenario where a number of sensors monitor different linear dynamical processes and schedule their transmissions through a shared collision channel. We show that by randomly injecting relative time offsets on the sensors, the malicious attacker is able to make the expected estimation error covariance of the overall system diverge without any system knowledge. For the case that the attacker has f...
-
作者：Molloy, Timothy L.
作者单位：Queensland University of Technology (QUT); University of Melbourne
摘要：The problem of quickly diagnosing an unknown change in a stochastic process is studied. We establish novel bounds on the performance of misspecified diagnosis algorithms designed for changes that differ from those of the process, and pose and solve a new robust quickest change diagnosis problem in the asymptotic regime of few false alarms and false isolations. Simulations suggest that our asymptotically robust solution offers a computationally efficient alternative to generalised likelihood ra...
