A dynamical system can exhibit structure on multiple levels. Different system representations can capture different elements of a dynamical system's structure. We consider LTI input-output dynamical systems and pr...
详细信息
Despite the pervasiveness of sum of squares (sos) techniques in Lyapunov analysis of dynamical systems, the converse question of whether sos Lyapunov functions exist whenever polynomial Lyapunov functions exist has re...
详细信息
ISBN:
(纸本)9781612848006
Despite the pervasiveness of sum of squares (sos) techniques in Lyapunov analysis of dynamical systems, the converse question of whether sos Lyapunov functions exist whenever polynomial Lyapunov functions exist has remained elusive. In this paper, we first show via an explicit counterexample that if the degree of the polynomial Lyapunov function is fixed, then sos programming can fail to find a valid Lyapunov function even though one exists. On the other hand, if the degree is allowed to increase, we prove that existence of a polynomial Lyapunov function for a homogeneous polynomial vector field implies existence of a polynomial Lyapunov function that is sos and that the negative of its derivative is also sos. The latter result is extended to develop a converse sos Lyapunov theorem for robust stability of switched linear systems.
This note is concerned with a class of differential inequalities in the literature that involve higher order derivatives of Lyapunov functions and have been proposed to infer asymptotic stability of a dynamical system...
详细信息
This note is concerned with a class of differential inequalities in the literature that involve higher order derivatives of Lyapunov functions and have been proposed to infer asymptotic stability of a dynamical system without requiring the first derivative of the Lyapunov function to be negative definite. We show that whenever a Lyapunov function satisfies these conditions, we can explicitly construct another (standard) Lyapunov function that is positive definite and has a negative definite first derivative. Our observation shows that a search for a standard Lyapunov function parameterized by higher order derivatives of the vector field is less conservative than the previously proposed conditions. Moreover, unlike the previous inequalities, the new inequality can be checked with a convex program. This is illustrated with an example where sum of squares optimization is used.
Recent years have witnessed great advancements in the science and technology of autonomy, robotics, and networking. This paper surveys recent concepts and algorithms for dynamic vehicle routing (DVR), that is, for the...
详细信息
We give a simple, explicit example of a two-dimensional polynomial vector field that is globally asymptotically stable but does not admit a polynomial Lyapunov function.
ISBN:
(纸本)9781612848006
We give a simple, explicit example of a two-dimensional polynomial vector field that is globally asymptotically stable but does not admit a polynomial Lyapunov function.
Despite the importance of voltage regulation to operational reliability and safety of power grids, little is understood about how the topology of the physical layer, and the architecture of the communication and contr...
详细信息
Despite the importance of voltage regulation to operational reliability and safety of power grids, little is understood about how the topology of the physical layer, and the architecture of the communication and control layer impact the ability of the system to regulate the voltages. In this paper, we apply spatial-invariance analysis to develop analytical upper and lower bounds for the Hi gain of a DC power grid with respect to voltage regulation. These bounds establish a relation between network architecture and performance, and reveal fundamental limits to performance that cannot be overcome using feedback control.
We propose a novel and natural architecture for decentralized control, that is applicable whenever the underlying system has the structure of a partially ordered set (poset). This controller architecture is based on t...
详细信息
ISBN:
(纸本)9781612848006
We propose a novel and natural architecture for decentralized control, that is applicable whenever the underlying system has the structure of a partially ordered set (poset). This controller architecture is based on the Mobius transform of the poset, and enjoys simple and appealing separation properties, since the closed-loop dynamics can be analyzed in terms of decoupled subsystems. The controller structure provides rich and interesting connections between concepts from order theory such as Mobius inversion and control-theoretic concepts such as state prediction, correction, and separability. In addition, using our earlier results on H_(2)-optimal decentralized control for arbitrary posets, we prove that the H_(2)-optimal controller in fact possesses the proposed structure, thereby establishing the optimality of the new controller architecture.
We consider a consensus algorithm in which every node in a time-varying undirected connected graph assigns equal weight to each of its neighbors. Under the assumption that the degree of any given node is constant in t...
详细信息
ISBN:
(纸本)9781612848006
We consider a consensus algorithm in which every node in a time-varying undirected connected graph assigns equal weight to each of its neighbors. Under the assumption that the degree of any given node is constant in time, we show that the algorithm achieves consensus within a given accuracy E on n nodes in time O(n~(3)ln(n/E)). Because there is a direct relation between consensus algorithms in time-varying environments and inhomogeneous random walks, our result also translates into a general statement on such random walks. Moreover, we give simple proofs that the convergence time becomes exponentially large in the number of nodes n under slight relaxations of the above assumptions. We prove that exponential convergence time is possible for consensus algorithms on fixed directed graphs, and we use an example of Cao, Spielman, and Morse to give a simple argument that the same is possible if the constant degrees assumption is even slightly relaxed.
We develop a semidefinite-programming-based approach to stochastic modeling with multiscale autoregressive (MAR) processes--a class of stochastic processes indexed by the vertices of a tree. Given a tree and the covar...
详细信息
ISBN:
(纸本)9781612848006
We develop a semidefinite-programming-based approach to stochastic modeling with multiscale autoregressive (MAR) processes--a class of stochastic processes indexed by the vertices of a tree. Given a tree and the covariance matrix of the variables corresponding to the leaves of the tree, our procedure aims to construct an MAR process with small state dimensions at each vertex that approximately realizes the given covariance at the leaves. Our method does not require prior specification of the state dimensions at each vertex. Furthermore, we establish a large class of MAR processes for which, given only the index tree and the leaf covariance of the process, our method can recover a parametrization that matches the leaf-covariance and has the correct state dimensions. Finally we demonstrate, using synthetic examples, that given i.i.d. samples of the leaf variables our method can recover the correct state dimensions of an underlying MAR process.
In today's highly complex multi-AGV systems key research objective is finding a scheduling and routing policy that avoids deadlock while assuring that vehicle utilization is as high as possible. It is well known t...
详细信息
In today's highly complex multi-AGV systems key research objective is finding a scheduling and routing policy that avoids deadlock while assuring that vehicle utilization is as high as possible. It is well known that finding such an optimal policy is a NP-hard task in general case. Therefore, big part of the research is oriented towards finding various suboptimal policies that can be applied to real world plants. In this paper we propose modified Banker's algorithm for scheduling in multi-AGV systems. A predetermined mission's path is executed in a way that some non-safe states are allowed in order to achieve better utilization of vehicles. A graph-based method of polynomial complexity for verification of these states is given. Algorithm is tested on a layout of a real plant for packing and warehousing palettes. Results shown at the end of the paper demonstrate advantages of the proposed method compared with other methods based on Banker's algorithm.
暂无评论