-
作者：Shen, Hao; Peng, Chuanjun; Yan, Huaicheng; Xu, Shengyuan
作者单位：Anhui University of Technology; Anhui University of Technology; East China University of Science & Technology; Nanjing University of Science & Technology
摘要：The optimal control issue of fast sampling singularly perturbed systems is discussed throughout this article. As a new attempt, without using complete system dynamics, the composite controller is designed by using controller of the different subsystems along with the usage of the subsystem decomposition technique by means of singular perturbation theory. Compared with the existing policy iteration and value iteration algorithms, there is no enforced requirement for a stabilizing control strate...
-
作者：Colombo, Alessandro; Bahraini, Masoud; Zanon, Mario; Falcone, Paolo
作者单位：Polytechnic University of Milan; Chalmers University of Technology; IMT School for Advanced Studies Lucca; Universita di Modena e Reggio Emilia
摘要：Self-triggered feedback control is used as a means to reduce the energy and communication requirements of networked systems. Triggered-control schemes result in aperiodic communications, with the potential for communication conflicts when multiple feedback loops are closed over a shared network. In this article, we analyze the necessary/sufficient conditions for simultaneous stabilizability of a set of nonlinear systems over a network from the perspective of scheduling theory, using Lyapunov f...
-
作者：Li, Haitao; Wang, Shuling; Li, Wenrong
作者单位：Shandong Normal University
摘要：The study of large-size networked evolutionary matrix games (NEMGs) with general network structure is a challenging topic due to the inherent complexity of networks. This note analyzes the strategy consensus of large-size NEMGs. The considered large-size NEMG is partitioned into several small-size control subgames via aggregation method. Then, the strategy consensus analysis of large-size NEMGs is converted into the strategy synthesis of small-size control subgames. Based on the strategy profi...
-
作者：Ding, Yanling; Ma, Dan; Mao, Qi; Peng, Hui; Chen, Jie
作者单位：City University of Hong Kong; Northeastern University - China; Guangdong University of Technology
摘要：This article concerns robust consensus problems for continuous-time first-order multi-agent systems with respect to uncertain gain and phase of the agent's frequency response varying within certain ranges. We consider dynamic output feedback control protocol in the form of proportional-integral (PI) control. The agents can in general be nonminimum phase and unstable systems, which are interconnected by an undirected graph network. We seek to determine the largest ranges of gain and phase varia...
-
作者：Leung, Jordan; Permenter, Frank; Kolmanovsky, Ilya V.
作者单位：University of Michigan System; University of Michigan; Toyota Motor Corporation
摘要：This article introduces an approach for reducing the computational cost of implementing linear quadratic model predictive control (MPC) for set-point tracking subject to pointwise-in-time state and control constraints. The approach consists of the following three key components: First, a log-domain interior-point method used to solve the receding horizon optimal control problems; second, a method of warm-starting this optimizer by using the MPC solution from the previous timestep; and third, a...
-
作者：Wu, Chen; Dong, Jiu-Gang
作者单位：Dalian University of Technology
摘要：We study the effects of time delay on the Cucker-Smale (CS) model under hierarchical leadership (HL). It is well known that time delays are ubiquitous in both physical phenomena and engineering applications. In this article, we establish an easily verified flocking condition for the CS model under HL subject to both transmission and reaction delays. Precisely, for the long-range weight function, we show that the flock converges to flocking exponentially fast when the size of the reaction delay...
-
作者：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.
-
作者：Chang, Ting-Jui; Shahrampour, Shahin
作者单位：Northeastern University
摘要：Online optimization has recently opened avenues to study optimal control for time-varying cost functions that are unknown in advance. Inspired by this line of research, we study the distributed online linear quadratic regulator (LQR) problem for linear time-invariant (LTI) systems with unknown dynamics. Consider a multiagent network where each agent is modeled as an LTI system. The network has a global time-varying quadratic cost, which may evolve adversarially and is only partially observed b...
-
作者：Ghaderyan, Diyako; Aybat, Necdet Serhat; Aguiar, A. Pedro; Pereira, Fernando Lobo
作者单位：Universidade do Porto; Universidade do Porto; Pennsylvania Commonwealth System of Higher Education (PCSHE); Pennsylvania State University; Pennsylvania State University - University Park
摘要：In this article, we introduce a fast row-stochastic decentralized algorithm, referred to as FRSD, to solve consensus optimization problems over directed communication graphs. The proposed algorithm only utilizes row-stochastic weights, leading to certain practical advantages in broadcast communication settings over those requiring column-stochastic weights. Under the assumption that each node-specific function is smooth and strongly convex, we show that the FRSD iterate sequence converges with...
