-
作者:Tian, Ye; Jia, Peng; MirTabatabaei, Anahita; Wang, Long; Friedkin, Noah E.; Bullo, Francesco
作者单位:Xidian University; University of California System; University of California Santa Barbara; University of California System; University of California Santa Barbara; Peking University; University of California System; University of California Santa Barbara
摘要:This article studies the evolution of social power in influence networks with stubborn individuals. We formulate two models grounded on the Friedkin-Johnsen opinion dynamics and the reflected appraisal mechanism; the models are defined over issue sequences and over a single issue, respectively. The key advance over the original DeGroot-Friedkin dynamics is that the proposed models include the empirically observed phenomenon of stubbornness and are, therefore, more realistic. We obtain various ...
-
作者:Guo, Yuqian; Li, Zhitao; Liu, Yang; Gui, Weihua
作者单位:Central South University; Zhejiang Normal University
摘要:Discrete-time probabilistic logic networks (DT-PLNs), of which probabilistic Boolean networks (PBNs) are a special type, are an important qualitative model for gene regulatory networks (GRNs). Although a DT-PLN can predict the long-term behavior of a GRN, using it to describe the transient kinetics at the microtimescale level remains inconvenient. In this article, we investigate the problems associated with the stability and stabilization of continuous-time probabilistic logic networks (CT-PLN...
-
作者:Kulikov, Gennady Yu; Kulikova, Maria, V
作者单位:Universidade de Lisboa
摘要:This article aims at presenting novel square-root un-scented Kalman filters (UKFs) for treating various continuous-discrete nonlinear stochastic systems, including target tracking scenarios. These new methods are grounded in the commonly used singular value decomposition (SVD), that is, they propagate not the covariance matrix itself but its SVD factors instead. The SVD based on orthogonal transforms is applicable to any UKF with only nonnegative weights, whereas the remaining ones, which can ...
-
作者:Berberich, Julian; Koehler, Johannes; Mueller, Matthias A.; Allgoewer, Frank
作者单位:University of Stuttgart; Swiss Federal Institutes of Technology Domain; ETH Zurich; Leibniz University Hannover
摘要:In this article, we develop a tracking model predictive control (MPC) scheme for nonlinear systems using the linearized dynamics at the current state as a prediction model. Under reasonable assumptions on the linearized dynamics, we prove that the proposed MPC scheme exponentially stabilizes the optimal reachable equilibrium w.r.t. a desired target setpoint. Our theoretical results rely on the fact that, close to the steady-state manifold, the prediction error of the linearization is small, an...
-
作者:Berberich, Julian; Koehler, Johannes; Mueller, Matthias A.; Allgoewer, Frank
作者单位:University of Stuttgart; Swiss Federal Institutes of Technology Domain; ETH Zurich; Leibniz University Hannover
摘要:In this article, we present a novel data-driven model predictive control (MPC) approach to control unknown nonlinear systems using only measured input-output data with closed-loop stability guarantees. Our scheme relies on the data-driven system parameterization provided by the fundamental lemma of Willems et al. We use new input-output measurements online to update the data, exploiting local linear approximations of the underlying system. We prove that our MPC scheme, which only requires solv...
-
作者:Mo, Yanfang; Chen, Wei; Khong, Sei Zhen; Qiu, Li
作者单位:City University of Hong Kong; Peking University; Peking University; Hong Kong University of Science & Technology
摘要:Indivisible resource allocation motivates us to study the matrix completion concerning the class of (0,1)-matrices with prescribed row/column sums and preassigned zeros. We illustrate and generalize the (0,1)-matrix completion in the following two scenarios: a demand-response application involving nonnegative integer matrices with different bounds across rows and an edge caching matching problem allowing row and column sums to vary within separately designated bounds. The applications require ...
-
作者:Pasandi, Venus; Sadeghian, Hamid; Keshmiri, Mehdi; Pucci, Daniele
作者单位:Istituto Italiano di Tecnologia - IIT; Isfahan University of Technology; Technical University of Munich
摘要:Cyclic motions are fundamental patterns in robotic applications, including industrial manipulation and robot locomotion. This article proposes an approach for the online modulation of cyclic motions in robotic applications. For this purpose, we present an integrated programmable central pattern generator (CPG) for the online generation of the reference joint trajectory of a robotic system out of a library of desired periodic motions. The reference trajectory is then followed by the lower level...
-
作者:Kamanchi, Chandramouli; Diddigi, Raghuram Bharadwaj; Bhatnagar, Shalabh
作者单位:Indian Institute of Science (IISC) - Bangalore
摘要:Value iteration is a fixed point iteration technique utilized to obtain the optimal value function and policy in a discounted reward Markov decision process (MDP). Here, a contraction operator is constructed and applied repeatedly to arrive at the optimal solution. Value iteration is a first-order method and, therefore, it may take a large number of iterations to converge to the optimal solution. Successive relaxation is a popular technique that can be applied to solve a fixed point equation. ...
-
作者:Qi, Qingyuan; Xie, Lihua; Zhang, Huanshui
作者单位:Qingdao University; Nanyang Technological University; Shandong University of Science & Technology
摘要:The linear-quadratic (LQ) optimal control and stabilization problems for mean-field systems with input delay (MFSID) are investigated in this article. The necessary and sufficient solvability conditions for LQ control of MFSID are first given in terms of a convexity condition and the solvability of equilibrium conditions. Consequently, by solving the associated mean-field forward and backward stochastic difference equations, the optimal control is derived in terms of the solution of a modified...
-
作者:Fiacchini, Mirko
作者单位:Communaute Universite Grenoble Alpes; Institut National Polytechnique de Grenoble; Universite Grenoble Alpes (UGA); Centre National de la Recherche Scientifique (CNRS)
摘要:This article presents a computational method to test the stabilizability of discrete-time switched linear systems. The existence of a conic cover of the space on whose elements a convex condition holds is proved to be necessary and sufficient for stabilizability. An algorithm for computing a conic partition that satisfies the new necessary and sufficient condition is given. The algorithm, which allows us to determine bounds on the exponential convergence rate, is proved to overcome the conserv...