-
作者：Hu, Zhongyao; Chen, Bo; Wang, Rusheng; Yu, Li
作者单位：Zhejiang University of Technology
摘要：In this article, the authors aim to study the state estimation problem under the stochastic event-triggered (SET) schedule. A posterior-based SET mechanism is proposed, which determines whether to transmit data by the effect of the measurement on the posterior estimate. Since this SET mechanism considers the whole posterior probability density function, it has better information screening capability and utilization than the existing SET mechanisms that only consider the first-order moment info...
-
作者：Polyakov, Andrey
作者单位：Centre National de la Recherche Scientifique (CNRS); Universite de Lille; Centrale Lille; Inria
摘要：The methodology of the unit sliding mode control design (known since 1970s) for linear systems is revised based on the concept of the generalized homogeneity. The restriction about a consistency of the number of control inputs with the dimension of the sliding surface is eliminated. A simple procedure of control parameters tuning based on a known maximal magnitude of matched perturbations is developed. To deal with perturbations of unknown magnitude, a homogeneous sliding mode control with int...
-
作者：Khoo, Mitchell; Wood, Tony A.; Manzie, Chris; Shames, Iman
作者单位：University of Melbourne; Swiss Federal Institutes of Technology Domain; Ecole Polytechnique Federale de Lausanne; Australian National University
摘要：We develop an algorithm to solve the bottleneck assignment problem (BAP) that is amenable to having computation distributed over a network of agents. This consists of exploring how each component of the algorithm can be distributed, with a focus on one component in particular, i.e., the function to search for an augmenting path. An augmenting path is a common tool used in most BAP algorithms and poses a particular challenge for this distributed approach. Given this significance, we compare the...
-
作者：Vincent, Tyrone L.; Yan, Shuhao; Bitar, Eilyan
作者单位：Colorado School of Mines; Cornell University
摘要：A predictor for a dynamic system that maps past inputs and outputs, along with future inputs, to future outputs is presented. The predictor models noise and disturbances as Gaussian random variables, and a maximum likelihood and minimum variance solution are provided. The novel element of this predictor is that it is defined directly in terms of the system impulse response, eliminating the need to find a state-space or transfer function realization.
-
作者：Akametalu, Anayo K.; Ghosh, Shromona; Fisac, Jaime F.; Rubies-Royo, Vicenc; Tomlin, Claire J.
作者单位：University of California System; University of California Berkeley
摘要：We propose a novel formulation for approximating reachable sets through a minimum discounted reward optimal control problem. The formulation yields a continuous solution that can be obtained by solving a Hamilton-Jacobi equation. Furthermore, the numerical approximation to this solution is the unique fixed-point to a contraction mapping. This allows for more efficient solution methods that are not applicable under traditional formulations for solving reachable sets. Lastly, this formulation pr...
-
作者：Cao, Kun; Xie, Lihua
作者单位：Nanyang Technological University
摘要：This article proposes a new unified inverse reinforcement learning framework based on trust-region methods and a recently proposed Pontryagin differential programming method in Jin et al.'s work (2020), which aims to learn the parameters in both the system model and the cost function for three types of problems, namely, N-player nonzero-sum multistage games, two-player zero-sum multistage games, and one-player optimal control, from demonstrated trajectories. Different from the existing framewo...
-
作者：Deng, Zhenhua; Luo, Jin
作者单位：Central South University
摘要：This article investigates the constrained nonsmooth distributed optimization problems (DOPs) of general linear multiagent systems. Our problem involves the general linear dynamics of agents, and the cost functions are nondifferentiable. Moreover, the decisions of agents are constrained by both local and coupled inequalities. Without considering the general linear dynamics, the nonsmooth cost functions, and/or the inequality constraints, existing distributed algorithms are ineffective for our p...
-
作者：Gao, Rui; Yang, Guang-Hong
作者单位：Northeastern University - China; Northeastern University - China; King Abdulaziz University
摘要：This article studies the distributed secure state estimation problem in unreliable multiagent networks through adversary detection. The agents are endowed with the capacity for detecting malicious neighbors and aim to collaboratively estimate the state variables of a dynamic system in the presence of malicious agents. A trust mechanism is first introduced to characterize the reliability of the information received from in-neighbors and identify the reliable information of two-hop in-neighbors....
-
作者：Lv, Xiaoxiao; Cao, Jinde; Rutkowski, Leszek; Duan, Peiyong
作者单位：Southeast University - China; Polish Academy of Sciences; Systems Research Institute of the Polish Academy of Sciences; AGH University of Krakow; Yantai University
摘要：In this article, the local consensus problem of nonlinear time-delay multiagent systems with switching topologies via distributed saturated impulsive control is discussed and the maximum domain of attraction is well estimated. Specifically, we develop a new estimation approach that is quite distinct from the contractive invariant set to estimate the domain of attraction. Moreover, a novel composite impulsive-instant-dependent Lyapunov function is constructed and an improved convex hull represe...
-
作者：Phogat, Karmvir Singh; Tsumura, Koji
作者单位：University of Tokyo
摘要：In automatic negotiation, an automated agent is trained to negotiate on behalf of a human negotiator. We consider that the domain of negotiations is known to both the agent and its opponents. In this setting, a greedy concession algorithm (GCA) is employed to find an optimal policy for the agent when the agent's belief about the opponent is known. However, the GCA is computationally expensive to certain class of policies. In this article, we propose a reverse GCA that is computationally less e...
