-
作者：Taylor, Josh A.; Rapaport, Alain; Dochain, Denis
作者单位：University of Toronto; INRAE; Institut Agro; Universite de Montpellier; Universite Catholique Louvain
摘要：We optimize a general model of bioprocesses, which is nonconvex due to the microbial growth in the biochemical reactors. We formulate a convex relaxation and give conditions guaranteeing its exactness in both the transient and steady-state cases. When the growth kinetics are modeled by the Contois or, under constant biomass, Monod or Powell functions, the relaxation is a second-order cone program, which can be solved efficiently at large scales. We implement the model on a numerical example ba...
-
作者：Zhang, Hai-Tao; Cao, Haosen; Chen, Zhiyong
作者单位：Huazhong University of Science & Technology; University of Newcastle
摘要：A directed acyclic graph (DAG) is a common topology in biological, engineering, and social networks. A network topology is critical in determining a collective behavior of a network dynamic system. For example, the convergence rate of a consensus behavior in a multiagent system relies on the eigenvalues of the Laplacian associated with the network topology. This article aims to analyze the influence of adding a reverse edge into a DAG on convergence rate. It reveals the existence of the so-cal...
-
作者：Moon, Jun
作者单位：Hanyang University
摘要：We consider the state and control path-dependent stochastic optimal control problem for jump-diffusion models, where the dynamics and the objective functional are dependent on (current and past) paths of state and control processes. We prove the dynamic programming principle of the value functional, for which, unlike the existing literature, the Skorohod metric is necessary to maintain the separability of cadlag (state and control) spaces. We introduce the state and control path-dependent inte...
-
作者：Wu, Chengshuai; Pines, Raz; Margaliot, Michael; Slotine, Jean-Jacques
作者单位：Tel Aviv University; Tel Aviv University; Massachusetts Institute of Technology (MIT); Massachusetts Institute of Technology (MIT)
摘要：The k multiplicative and k additive compounds of a matrix play an important role in geometry, multilinear algebra, the asymptotic analysis of nonlinear dynamical systems, and in bounding the Hausdorff dimension of fractal sets. These compounds are defined for the integer values of k. Here, we introduce generalizations called the alpha multiplicative and alpha additive compounds of a square matrix, with alpha real. We study the properties of these new compounds and demonstrate an application in...
-
作者：Feng, Jun-E; Li, Yiliang; Fu, Shihua; Lyu, Hongli
作者单位：Shandong University; Liaocheng University; Liaocheng University; Lakehead University
摘要：The coordinate transformation technique is a traditional method for solving the disturbance decoupling problem (DDP) of Boolean control networks (BCNs). But under this technique, the obtained conditions are not necessary for the solvability of DDP of original systems. Thus, this article investigates the DDP of Boolean networks (BNs) and BCNs in a new perspective. Based on the new definition of disturbance decoupling, the one-step evolutionary dynamic of states of BNs, shown as a table, is pres...
-
作者：Li, Na; Li, Xun; Peng, Jing; Xu, Zuo Quan
作者单位：Shandong University of Finance & Economics; Hong Kong Polytechnic University
摘要：This article adopts a reinforcement learning (RL) method to solve infinite horizon continuous-time stochastic linear quadratic problems, where the drift and diffusion terms in the dynamics may depend on both the state and control. Based on the Bellman's dynamic programming principle, we presented an online RL algorithm to attain optimal control with partial system information. This algorithm computes the optimal control, rather than estimates the system coefficients, and solves the related Ric...
-
作者：Singh, Rahul; Haasler, Isabel; Zhang, Qinsheng; Karlsson, Johan; Chen, Yongxin
作者单位：University System of Georgia; Georgia Institute of Technology; Royal Institute of Technology
摘要：We consider inference (filtering) problems over probabilistic graphical models with aggregate data generated by a large population of individuals. We propose a new efficient belief propagation type algorithm over tree graphs with polynomial computational complexity as well as a global convergence guarantee. This is in contrast to previous methods that either exhibit prohibitive complexity as the population grows or do not guarantee convergence. Our method is based on optimal transport, or more...
-
作者：Sivaranjani, S.; Agarwal, Etika; Gupta, Vijay
作者单位：Purdue University System; Purdue University; University of Notre Dame; Purdue University System; Purdue University
摘要：We consider the problem of identifying a dissipative linear model of an unknown nonlinear system that is known to be dissipative, from time-domain input-output data. We first learn an approximate linear model of the nonlinear system using standard system identification techniques and then perturb the system matrices of the linear model to enforce dissipativity, while closely approximating the dynamical behavior of the nonlinear system. Further, we provide an analytical relationship between the...
-
作者：Zhao, Yu; Zhou, Yuan; Huang, Panfeng; Chen, Guanrong
作者单位：Northwestern Polytechnical University; City University of Hong Kong
摘要：This article derives a solution to the appointed-time and attack-free bipartite synchronization problem for generic linear multiagent systems over directed switching networks accommodating cooperative and antagonistic interactions. Herein, appointed-time means that the settling time is independent of any parameters and is preappointed in advance. Attack-free requires that the communication channel is protected, which means that no state and observer information exchange is allowed, and only me...
-
作者：Bobtsov, Alexey; Yi, Bowen; Ortega, Romeo; Astolfi, Alessandro
作者单位：ITMO University; University of Sydney; Instituto Tecnologico Autonomo de Mexico; Imperial College London; University of Rome Tor Vergata
摘要：The problem of estimating constant parameters from a standard vector linear regression equation in the absence of sufficient excitation in the regressor is addressed. The first step to solve the problem consists in transforming this equation into a set of scalar ones using the well-known dynamic regressor extension and mixing technique. Then, a novel procedure to generate new scalar exciting regressors is proposed. The superior performance of a classical gradient estimator using this new regre...
