-
作者：Zhou, Yuan; Liu, Yongfang; Zhao, Yu; Li, Zhongkui
作者单位：Hong Kong Polytechnic University; Northwestern Polytechnical University; Peking University
摘要：Pursuing faster convergence rates and smaller input magnitudes seem to be two conflicting goals in studying multiagent systems. To give a tradeoff between the two, this article focuses on the bipartite synchronization problems over signed topologies and aims to achieve finite-time control for general linear agents subject to input saturation constraints. First, this article considers homogeneous agents and presents a class of bipartite synchronization protocols with saturation constraint, whic...
-
作者：Lin, Haoyan; Huang, Jie
作者单位：Chinese University of Hong Kong
摘要：The leader-following consensus problem for multiple uncertain Euler-Lagrange (EL) systems has been extensively studied by two approaches: robust control approach and adaptive control approach. The adaptive control approach has the advantage that it does not require the bounds of unknown parameters be known but has the shortcoming that the control law is of high dimension as every unknown parameter has to be estimated by the local control law of every follower. On the other hand, the robust con...
-
作者：Chang, Hyeong Soo
作者单位：Sogang University
摘要：A recent theoretical analysis of a Monte-Carlo tree search (MCTS) method properly modified from the upper confidence bound applied to trees (UCT) algorithm established a surprising result, due to a great deal of empirical successes reported from heuristic usage of UCT with relevant adjustments for various problem domains in the literature, that its rate of convergence of the expected absolute error to zero is O(1/root n) in estimating the optimal value at an initial state in a finite-horizon M...
-
作者：Zhu, Jingxuan; Mulle, Ethan; Smith, Christopher S.; Koppel, Alec; Liu, Ji
作者单位：State University of New York (SUNY) System; Stony Brook University; University of California System; University of California Santa Cruz; State University of New York (SUNY) System; Stony Brook University; State University of New York (SUNY) System; Stony Brook University
摘要：This article studies a decentralized homogeneous multiarmed bandit problem in a multiagent network. The problem is simultaneously solved by N agents assuming that they face a common set of M arms and share the same arms' reward distributions. Each agent can receive information only from its neighbors, where the neighbor relationships among the agents are described by a fixed graph. Two fully decentralized upper confidence bound (UCB) algorithms are proposed for undirected graphs, respectively,...
-
作者：Wang, Shengxian; Cao, Ming; Chen, Xiaojie
作者单位：Anhui Normal University; University of Electronic Science & Technology of China; University of Groningen
摘要：Combined prosocial incentives, integrating reward for cooperators and punishment for defectors, are effective tools to promote cooperation among competing agents in population games. Existing research concentrated on how to adjust reward or punishment, as two mutually exclusive tools, during the evolutionary process to achieve the desired proportion of cooperators in the population, and less attention has been given to exploring a combined incentive-based control policy that can steer the syst...
-
作者：Zhang, Jing; Liu, Shuai; Xie, Lihua
作者单位：Shandong University; Liaocheng University; Nanyang Technological University
摘要：This article is devoted to the distributed convex optimization problem for a class of nonlinear multiagent systems under set constraints. The optimization objective function is composed of the cost function of each agent, where the individual cost function is only accessible by itself. Due to the complexity of nonlinear dynamics of agents, it is very difficult to solve the optimization problem directly. Therefore, we first propose an auxiliary system for each agent, which is used to seek the s...
-
作者：Liu, Zexiang; Ozay, Necmiye
作者单位：University of Michigan System; University of Michigan
摘要：Safety-critical systems, such as autonomous vehicles, often incorporate perception modules that can anticipate upcoming disturbances to system dynamics, expecting that such preview information can improve the performance and safety of the system in complex and uncertain environments. However, there is a lack of formal analysis of the impact of preview information on safety. In this work, we introduce a notion of safety regret, a properly defined difference between the maximal invariant set of ...
-
作者：Jin, Kaijing; Ye, Dan
作者单位：Northeastern University - China; Northeastern University - China
摘要：To reveal the security vulnerabilities of distributed estimation systems, we investigate the existence of false data injection attacks in this article, where attacks can corrupt sensor data and filter data. Considering the innovation-based and consensus-based strict stealthiness, a successful attack should ensure the divergence of each local estimation and not affect innovation and consensus signals. By analyzing the null space of system matrices, the necessary and sufficient conditions for th...
-
作者：Wan, Hexiang; Wang, Guangchen; Xiong, Jie
作者单位：Shandong University; Southern University of Science & Technology; Southern University of Science & Technology
摘要：This article investigates a broad category of McKean-Vlasov type discrete-time partially observable stochastic optimal control problems. The first goal is to prove the dynamic programming principle (DPP) by means of the measurable selection argument, which provides a methodology for finding both the value function as well as the optimal control. Here, we employ the Nisio semigroup technology, which is an intrinsic characterization of the DPP. Then, we derive the recursive formula for the filte...
-
作者：Bemporad, Alberto
作者单位：IMT School for Advanced Studies Lucca
摘要：In this article, we propose a very efficient numerical method based on the Limited-memory Broyden-Fletcher-Goldfarb-Shanno with Box constraints (L-BFGS-B) algorithm for identifying linear and nonlinear discrete-time state-space models, possibly under L-1 and group-Lasso regularization for reducing model complexity. For the identification of linear models, we show that, compared to classical methods, the approach often provides better results, is much more general in terms of the loss and regul...
