-
作者：Bartosiewicz, Zbigniew; Kaldmae, Arvo; Kotta, Ulle; Wyrwas, Malgorzata
作者单位：Bialystok University of Technology; Tallinn University of Technology
摘要：In the article, accessibility of an analytic discrete-time control system given by a set of difference equations is studied. Ideals of germs of analytic functions and modules of germs of one-forms, associated with the considered system and invariant with respect to shift operators defined by the state equations, are used to present sufficient and necessary conditions for accessibility. The conditions are given both in terms of germs of analytic functions and germs of one-forms.
-
作者：Zhao, Dan; Ho, Daniel W. C.; Wen, Guanghui
作者单位：Southeast University - China; City University of Hong Kong
摘要：This article addresses the isolation problem of collusive false data injection attacks and covert attacks for interconnected systems, particularly in establishing generalized graph-dependent conditions responsible for attack isolation. Two algorithms involving inclusive neighbor information and neighbor information are introduced to accomplish attack isolation. By exploring the mechanism of attack collusion, it is found that both the number of subsystems' one-hop neighbors and the size of cycl...
-
作者：Guo, Kai-Yuan; Wang, Yan-Wu; Luo, Yun-Feng; Xiao, Jiang-Wen; Liu, Xiao-Kang
作者单位：Huazhong University of Science & Technology; Huazhong University of Science & Technology
摘要：Due to the transmission of information during seeking the Nash equilibrium and the possible leaking of sensitive information deduced from the transmitted information, it is urgent to propose privacy-preserving seeking algorithms for aggregative games. This article proposes two & varepsilon;-differentially private distributed Nash equilibrium seeking algorithms for aggregative games under directed communication graphs with row- and column-stochastic adjacency matrices, respectively. By utilizin...
-
作者：Li, Zihan; Shen, Dong; Yu, Xinghuo
作者单位：Renmin University of China; Renmin University of China; Royal Melbourne Institute of Technology (RMIT)
摘要：Using the proportional-type update rule (PTUR) is the most common update approach for iterative learning control. By combining PTUR and a newly proposed fractional-power-type update rule (FTUR), a fractional-proportional-type update rule is proposed to achieve fast convergence for scenarios where the tracking errors can be large or small. The nonlinearity of fractional power term and tracking error accumulation along the time axis introduce considerable challenges in convergence analysis and c...
-
作者：Zhu, Shouchong; Tian, Ye; Chen, Wei
作者单位：Peking University; Peking University
摘要：In this note, we study the relationships among semiconvergence, eventual exponential positivity, and accretiveness of repelling signed Laplacians in a broader context from a spectral abscissa versus logarithmic norm (log-norm) perspective. We give both algebraic and geometrical characterizations of when spectral abscissa equals log-norm for a general real matrix. Furthermore, we characterize the interplay among spectral abscissa, eventual exponential positivity, and log-norm. These results, wh...
-
作者：Hashemi, Abolfazl
作者单位：Purdue University System; Purdue University
摘要：Calculating fixed points of a nonlinear function is a central problem in many areas of science and engineering with applications ranging from the study of dynamical systems to optimization and game theory. Fixed-point iteration methods provide a simple way to calculate the fixed point of nonexpansive mappings and they have been studied extensively. Emerging applications, however, necessitate the study of fixed-point calculation under various perturbations. For instance, in the data-driven iden...
-
作者：Wang, Jin; Yang, Hongjiu; Zuo, Zhiqiang; Mu, Chaoxu
作者单位：Tianjin University
摘要：In this article, switching model predictive control (MPC) is proposed for a perturbed max-plus linear system with a reference signal. The lack of stability guarantee for MPC brings difficulties in reducing tracking errors caused by perturbations in the perturbed max-plus linear system. To reduce tracking errors, the perturbed max-plus linear system is partitioned into a switching max-plus linear system by a permutation matrix. Based on a local maximum terminal set, each mode of the switching m...
-
作者：Jiang, Xia; Zeng, Xianlin; Xie, Lihua; Sun, Jian; Chen, Jie
作者单位：Chinese University of Hong Kong; Beijing Institute of Technology; Nanyang Technological University
摘要：This article proposes a distributed stochastic projection-free algorithm for large-scale constrained finite-sum optimization whose constraint set is complicated such that the projection onto the constraint set can be expensive. The global cost function is allocated to multiple agents, each of which computes its local stochastic gradients and communicates with its neighbors to solve the global problem. Stochastic gradient methods enable low computational complexity, while they are hard and slow...
-
作者：Shi, Ji; Jiao, Xiaopei; Yau, Stephen S. -T.
作者单位：Capital Normal University; University of Twente; Tsinghua University
摘要：The optimal filtering problem for general nonlinear and continuous state-observation systems attracts lots of attention in the control theory. The essence of optimal filtering requires solving the Duncan-Mortensen-Zakai (DMZ) equation in a computationally feasible way. Under the pioneering work of Yau-Yau filtering, the DMZ equation is reduced to a pathwise computation of a forward Kolmogorov equation with time-varying initial conditions, which is very challenging. To overcome the computationa...
-
作者：von Esch, Maximilian Pierer; Volz, Andreas; Graichen, Knut
作者单位：University of Erlangen Nuremberg
摘要：This article presents a sensitivity-based algorithm for distributed optimal control problems (OCP) of multi-agent systems with nonlinear dynamics and state/input couplings, as they arise, for instance, in distributed model predictive control. The algorithm relies on first-order sensitivities to cooperatively solve the distributed OCP in parallel. The solutions to the resulting local OCPs are computed with a fixed-point scheme and communicated within one communication step per algorithm iterati...
