-
作者：Zhu, Shuaibing; Zhou, Jin; Lu, Jun-An
作者单位：Wuhan University; Wuhan University
摘要：The importance of estimating the region of attraction (ROA) on complex networks has drawn attention very recently. However, challenging problems arise when applying the existing theory to networks with delay. In this article, we estimate the ROA on controlled complex networks with time-varying delay. A delay-independent ROA estimation method is derived at first. This method can deal with general delay and is convenient to use due to its independence of the delay. Accordingly, it may cause cons...
-
作者：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:...
-
作者：Maghenem, Mohamed; Sanfelice, Ricardo G.
作者单位：Communaute Universite Grenoble Alpes; Institut National Polytechnique de Grenoble; Universite Grenoble Alpes (UGA); Centre National de la Recherche Scientifique (CNRS); University of California System; University of California Santa Cruz
摘要：This article presents converse theorems for safety in terms of barrier functions for unconstrained continuous-time systems modeled as differential inclusions. Via a counterexample, we show the lack of existence of autonomous and continuous barrier functions certifying safety for a nonlinear system that is not only safe but also has a smooth right-hand side. Guided by converse Lyapunov theorems for (nonasymptotic) stability, time-varying barrier functions and appropriate infinitesimal condition...
-
作者：Majumdar, Rupak; Schmuck, Anne-Kathrin
摘要：In this article, we present a new algorithm to solve the supervisory control problem over nonterminating processes modeled as $\omega$-regular automata. A solution to this problem was obtained by Thistle in 1995, which uses complex manipulations of automata. We show a new solution to the problem through a reduction to obliging games, which, in turn, can be reduced to $\omega$-regular reactive synthesis. Therefore, our reduction results in a symbolic algorithm based on manipulating sets of stat...
-
作者：Lu, Jingyi; Quevedo, Daniel E. E.; Gupta, Vijay; Dey, Subhrakanti
作者单位：East China University of Science & Technology; Queensland University of Technology (QUT); University of Notre Dame; Maynooth University
摘要：We study the maximum information gain that an adversary may obtain through hacking without being detected. Consider a dynamical process observed by a sensor that transmits a local estimate of the system state to a remote estimator according to some reference transmission policy across a packet-dropping wireless channel equipped with acknowledgments (ACK). An adversary overhears the transmissions and proactively hijacks the sensor to reprogram its transmission policy. We define perfect secrecy ...
-
作者：Cai, Mingyu; Xiao, Shaoping; Li, Zhijun; Kan, Zhen
作者单位：Lehigh University; University of Iowa; Chinese Academy of Sciences; University of Science & Technology of China, CAS
摘要：This paper studies optimal motion planning subject to motion and environment uncertainties. By modeling the system as a probabilistic labeled Markov decision process (PL-MDP), the control objective is to synthesize a finite-memory policy, under which the agent satisfies complex high-level tasks expressed as linear temporal logic (LTL) with desired satisfaction probability. In particular, the cost optimization of the trajectory that satisfies infinite horizon tasks is considered, and the trade-...
-
作者：Massambone, Rafael; Costa, Eduardo Fontoura; Helou, Elias Salomao
作者单位：Universidade de Sao Paulo
摘要：In this article, a stochastic incremental subgradient algorithm for the minimization of a sum of convex functions is introduced. The method sequentially uses partial subgradient information, and the sequence of partial subgradients is determined by a general Markov chain. This makes it suitable to be used in networks, where the path of information flow is stochastically selected. We prove convergence of the algorithm to a weighted objective function, where the weights are given by the Cesaro l...
-
作者：McInerney, Ian; Kerrigan, Eric C.; Constantinides, George A.
作者单位：Imperial College London; Imperial College London
摘要：First-order optimizationsolvers, such as the fast gradient method (FGM), are increasingly being used to solve model predictive control problems in resource-constrained environments. Unfortunately, the convergence rate of these solvers is significantly affected by the conditioning of the problem data, with ill-conditioned problems requiring a large number of iterations. To reduce the number of iterations required, we present a simple method for computing a horizon-independent preconditioning ma...
-
作者：Pereira, Renan L.; de Oliveira, Matheus S.
作者单位：Comando-Geral de Tecnologia Aeroespacial (CTA); Instituto Tecnologico de Aeronautica (ITA)
摘要：This technical article presents novel robust stabilization conditions for discrete-time linear parameter-varying (LPV) systems with linear fractional representation (LFR). The proposed conditions rely on the use of slack variables and decision matrices associated with the LFR approach to provide new controller designs. In addition, we address parameter-dependent Lyapunov functions and full-block multipliers to obtain less conservative synthesis conditions for discrete-time LPV/LFR systems. Des...
-
作者：Bisoffi, Andrea; De Persis, Claudio; Tesi, Pietro
作者单位：University of Groningen; University of Florence
摘要：For an unknown linear system, starting from noisy input-state data collected during a finite-length experiment, we directly design a linear feedback controller that guarantees robust invariance of a given polyhedral set of the state in the presence of disturbances. The main result is a necessary and sufficient condition for the existence of such a controller, and amounts to the solution of a linear program. The benefits of large and rich datasets for the solution of the problem are discussed. ...
