-
作者：Li, Zhongguo; Chen, Wen-Hua; Yang, Jun
作者单位：Loughborough University
摘要：A concurrent learning framework is developed for source search in an unknown environment using autonomous platforms equipped with onboard sensors. Distinct from the existing solutions that require significant computational power for Bayesian estimation and path planning, the proposed solution is computationally affordable for onboard processors. A new concept of concurrent learning using multiple parallel estimators is proposed to learn the operational environment and quantify estimation uncer...
-
作者：Tsiamis, Anastasios; Pappas, George J.
作者单位：Swiss Federal Institutes of Technology Domain; ETH Zurich; University of Pennsylvania
摘要：In this article, we consider the problem of predicting observations generated online by an unknown, partially observable linear system, which is driven by Gaussian noise. In the linear Gaussian setting, the optimal predictor in the mean square error sense is the celebrated Kalman filter, which can be explicitly computed when the system model is known. When the system model is unknown, we have to learn how to predict observations online based on finite data, suffering possibly a nonzero regret ...
-
作者：Zhu, Jingxuan; Liu, Ji
作者单位：State University of New York (SUNY) System; Stony Brook University; State University of New York (SUNY) System; Stony Brook University
摘要：This article studies a distributed multiarmed bandit problem with heterogeneous observations of rewards. The problem is cooperatively solved by N agents assuming each agent faces a common set of M arms yet observes only local biased rewards of the arms. The goal of each agent is to minimize the cumulative expected regret with respect to the true rewards of the arms, where the mean of each arm's true reward equals the average of the means of all agents' observed biased rewards. Each agent recur...
-
作者：Teranishi, Kaoru; Sadamoto, Tomonori; Chakrabortty, Aranya; Kogiso, Kiminao
作者单位：University of Electro-Communications - Japan; Japan Society for the Promotion of Science; North Carolina State University
摘要：In the state-of-the-art literature on cryptography and control theory, there has been no systematic methodology of constructing cyber-physical systems that can achieve the desired control performance while being protected against eavesdropping attacks. In this article, we tackle this challenging problem. We first propose two novel notions referred to as sample identifying complexity and sample deciphering time in an encrypted control framework. The former explicitly captures the relation betwe...
-
作者：Bhavsar, Nirav; Prashanth, L. A.
作者单位：Indian Institute of Technology System (IIT System); Indian Institute of Technology (IIT) - Madras
摘要：We introduce biased gradient oracles to capture a setting where the function measurements have an estimation error that can be controlled through a batch size parameter. Our proposed oracles are appealing in several practical contexts, for instance, risk measure estimation from a batch of independent and identically distributed samples, or simulation optimization, where the function measurements are biased due to computational constraints. In either case, increasing the batch size reduces the ...
-
作者：Wu, Xuyang; Wang, He; Lu, Jie
作者单位：Royal Institute of Technology; ShanghaiTech University
摘要：In this article, we investigate distributed convex opti-mization with both inequality and equality constraints, where the objective function can be a general nonsmooth convex function and all the constraints can be both sparsely and densely cou-pling. By strategically integrating ideas from primal-dual, proxi-mal, and virtual-queue optimization methods, we develop a novel distributed algorithm, referred to as IPLUX, to address the prob-lem over a connected, undirected graph. We show that IPLUX...
-
作者：Zou, Yao; Xia, Kewei; Zuo, Zongyu; Ding, Zhengtao
作者单位：University of Science & Technology Beijing; University of Science & Technology Beijing; Beijing Institute of Technology; Beihang University; University of Manchester
摘要：Rather than the conventional pure consensus, this article proposes a pulsewidth modulation (PWM) protocol for an improved interval consensus of multiagent systems from the distributed perspective. In particular, the consensus of all the agents is achieved within a prescribed interval, which is merely available to partial agents, though. The PWM protocol effectively relieves the running burden of the agents without the additional analogue-to-digital conversion. The modulation periods of differe...
-
作者：Belgioioso, Giuseppe; Grammatico, Sergio
作者单位：Swiss Federal Institutes of Technology Domain; ETH Zurich; Delft University of Technology
摘要：We address the generalized Nash equilibrium seeking problem for a population of agents playing aggregative games with affine coupling constraints. We focus on semi-decentralized communication architectures, where there is a central coordinator able to gather and broadcast signals of aggregative nature to the agents. By exploiting the framework of monotone operator theory and operator splitting, we first critically review the most relevant available algorithms and then design two novel schemes:...
-
作者：Chen, Xiaomeng; Huang, Lingying; Ding, Kemi; Dey, Subhrakanti; Shi, Ling
作者单位：Hong Kong University of Science & Technology; Southern University of Science & Technology; Southern University of Science & Technology; Uppsala University
摘要：Average consensus is extensively used in distributed networks for computation and control, where all the agents constantly communicate with each other and update their states in order to reach an agreement. Under a general average consensus algorithm, information exchanged through wireless or wired communication networks could lead to the disclosure of sensitive and private information. In this article, we propose a privacy-preserving push-sum approach for directed networks that can protect th...
-
作者：Deplano, Diego; Franceschelli, Mauro; Giua, Alessandro
作者单位：University of Cagliari
摘要：We introduce a novel definition of monotonicity, termed type-K in honor of Kamke, and study nonlinear type-K monotone dynamical systems possessing the plus-subhomogeneity property, which we call K-subtopical systems after Gunawardena and Keane. We show that type-K monotonicity, which is weaker than strong monotonicity, is also equivalent to monotonicity for smooth systems evolving in continuous-time but not in discrete-time. K-subtopical systems are proved to converge toward equilibrium points...
