Approximating reachable sets for a class of linear control systems†

We present a technique for overestimating the reachable set from the origin for a class of n-dimensional linear control systems. The proposed ‘box’ method is based upon decomposing the system into one and two-dimensional subsystems for which bounds on the new variables can readily be found. Using these bounds enables the construction of a n-dimensional parallelepiped containing the reachable set of the original system. Examples of this procedure are given as well as a comparison to an overapproximation afforded by a Lyapunov approach.     

Measure-controlled dynamic systems: Polyhedral approximation of their reachable set boundary

An algorithm for polyhedral approximation of the reachable set of impulsive dynamic control systems is designed. The boundary points of the reachable set are determined by recursively generating and solving a family of auxiliary optimal impulsive control problems with state-linear objective functional. The impulsive control problem is solved with an algorithm that implicitly reduces the problem an ordinary optimal control problem. The reduced problem thus obtained is solved with an algorithm based on local approximations of the reachable set.     

On the reachability of quantized control systems

In this paper, we study control systems whose input sets are quantized, i.e., finite or regularly distributed on a mesh. We specifically focus on problems relating to the structure of the reachable set of such systems, which may turn out to be either dense or discrete. We report results on the reachable set of linear quantized systems, and on a particular but interesting class of nonlinear systems, i.e., nonholonomic chained-form systems. For such systems, we provide a complete characterization of the reachable set, and, in case the set is discrete, a computable method to completely and succinctly describe its structure. Implications and open problems in the analysis and synthesis of quantized control systems are addressed     

Reachable sets of second-order switched systems

This paper studies the reachability of second-order switched nonlinear systems in which the switching law is the only control action. For some initial conditions we find states that are reachable from the initial condition. We also give the switching law that drives the system from the initial state to the final state. Moreover, for switched systems with limit cycles, it is proved that the reachable set is totally determined for each switched convergent state. Finally, several examples and a real application are presented in order to illustrate the results.     

Construction of switching sequences for reachability realization of switched impulsive control systems

This paper studies the construction of switching sequences for reachability realization of switched impulsive control systems. An approach is proposed to design switching sequences so that the reachable subspace of switched impulsive control systems is expressed in terms of the reachable state sets of the designed switching sequences. For a class of switched impulsive control systems, it is proved that a single switching sequence can be designed with its reachable state set coinciding with the reachable subspace. Periodic switching sequences are also constructed in this paper for the reachability realization problem. The results present a new way to exploit the switching mechanism to achieve the reachability and controllability of switched impulsive control systems. Copyright © 2007 John Wiley & Sons, Ltd.     

基于稳定性分析的一类欠驱动系统的滑模控制器设计

从稳定分析的角度提出了一种欠驱动系统的新型滑模控制方法．该方法将各个子系统的一个变量进行组合定义成一个中间变量，然后从这个中间变量出发构造滑模函数，通过求取总的控制量保证中间变量在有限时间内收敛到平衡点；进一步利用LaSalle不变性原理证明该收敛域内只有一个平衡点且是渐近稳定的．仿真实验进一步验证了该结论．     

A complete characterization of reachable sets for constrained linear time-varying systems

We consider linear time-varying systems with linear constraints on both control and state variables. The reachable set is a convex polyhedron that we completely characterize in terms of its boundary hyperplanes.     

Optimal technique for estimating the reachable set of a controlled n-dimensional linear system

The reachable set from a given point of a controlled dynamical system is the set of all states to which the system can be driven from that point in a finite time by the allowed controls. A technique is presented Tor estimating the reachable set from the asymptotically-stable origin of a class of n-dimensional linear systems under bounded control. The technique is an optimal version of a Lyapunov method, and provides an (over-)estimate of the full reachable set; it involves the minimization of a quadratic constraint, followed by the maximization of a quadratic form subject to this constraint. The non-linear optimization problems can be routinely solved by means of computer algebra and commonly available computer software. In general, the technique produces a much-improved estimate of the reachable set compared to that given by the standard Lyapunov method. Another advantage of the technique is that it is truly applicable to higher-dimensional systems (n ≥ 3). Since the estimate produced is in the convenient form of an n-dimensional ellipsoid, projections of the estimate onto any space of dimension ≤ n — 1 can be readily found. Problems of two, three, and four dimensions are solved to illustrate the technique.     

Under-estimates of reachable sets for linear control systems

A new algorithm is presented for providing under-estimates of the reachable set from the origin for a class ofn-dimensional linear systems with bounded controls. This algorithm is based on the novel approach of choosing a feedback control which makes all the eigenvalues of the closed loop system unstable. Results from feedback control and Liapunov stability theory are then used to formulate the problem as the minimization of a nonlinear function subject to constraints on certain matrices. The solution of this optimization problem provides an under-estimate of the reachable set in the form of ann-dimensional ellipsoid. Examples of both continuous and discrete-time systems are presented to illustrate the method. Comparison with existing exact results for some 2-dimensional systems shows that the method provides good approximations in these cases.     

带有运行成本函数的Hamilton-Jacobi可达性分析

水平集方法将可达集表示为Hamilton-Jacobi方程解的零水平集,保存多个不同时间范围的可达集则需要保存Hamilton-Jacobi方程在多个时刻的解,这不仅需要消耗大量的存储空间还为控制律的设计造成了困难.针对这些局限性,提出了一种改进的基于Hamilton-Jacobi方程的可达集表示方法.该方法在Hamilton-Jacobi方程中加入了一项运行成本函数,可以用同一个时刻的解的多个非零水平集表示多个不同时间范围的可达集,极大地节省了存储空间并为控制律的设计提供了便利.为了求解所构造的带有运行成本函数的Hamilton-Jacobi方程,采用了一种基于递归和插值的方法.最后,通过一些数值算例验证了所提出的方法的精确性、在存储空间方面的优越性以及设计的控制律的有效性.     

具有自适应噪声边界的Tube可达集鲁棒预测控制

针对过程噪声设定边界与真实噪声边界失配的有界干扰离散线性不确定系统,提出一种具有自适应噪声边界的Tube可达集鲁棒模型预测控制方法.首先,该算法引入基于MIT规则的自适应集员滤波在线估计系统状态和噪声边界.其次,基于估计值,通过迭代自适应集员滤波的时间更新部分计算出预测时域内闭环不确定系统状态的可达集.最后,用可达集代替不变集并根据Tube鲁棒模型预测控制策略,给出了实际不确定系统的控制律,确保系统状态鲁棒渐近稳定,并收敛于终端干扰不变集.仿真结果验证了该控制方法的有效性.     

Reachable set of bilinear control systems with time varying drift

In this article, we give a complete characterization of the reachable set at all times for a class of bilinear control systems with time varying drift and unbounded control amplitude. These results are of fundamental interest in geometric control theory and have important applications to control of coupled spins in solid state NMR spectroscopy.     

Reachable zones for equicontinuous bilinear control processes†

Geometrical properties of the set of reachable states are analysed for a class of nonlinear systems termed bilinear. Admissible controls are assumed to be bounded equicontinuous functions of time. While the results are valid for the larger class of non-linear systems with linear control, it is shown that bilinear processes are of particular significance in practice.     

Time-optimal control strategy for saturating linear discrete systems

An easily implemented strategy for obtaining the required minimal-time and time-optimal control sequence for a given initial state of an nth-order linear discrete system with constraints on the input is described. This strategy uses the boundary faces of the reachable set for the determination of the minimal time. The time-optimal control sequence is achieved by dividing the reachable set into linear and saturated parts.     

On reachable set synthesis of delay Markovian jump systems under partially delay-dependent asynchronous control

This paper pays close attention to the reachable set synthesis problem for discrete-time delayed Markovian jump systems (DDMJSs) under partially asynchronous control. Different from the traditional controller, a class of partially asynchronous controller is proposed, where delay-free and delay states are comprised and cannot take place at the same time. In addition, Bernoulli variable is used to describe the probability distribution of the above two kinds of states, and the design of feedback controller is considered. On this basis, the sufficient conditions which the state feedback controller is existent are solved effectively by using linear matrix inequalities (LMIs). Furthermore, the results of reachable set synthesis are extended to the DDMJs with uncertain transition probabilities. Finally, several numerical simulations are given to show the effectiveness of the presented methods.     

一类非匹配不确定性系统的变结构控制

研究一类非匹配不确定性系统的变结构控制问题. 引入适当的状态变换, 将非匹配不确定系统描述成具有分级形式的两个子系统. 在保证第一个子系统二次渐近稳定的条件下, 利用线性矩阵不等式方法得到第二个状态变量的期望值, 并由第二个状态变量与其期望值之差构造滑动模, 并利用滑模运动的到达条件, 得到变结构控制律.     

不确定线性系统的可达集估计

本文针对线性不确定系统,研究了系统状态可达集估计问题.在已知参考输入,未知扰动有界的条件下,提出了一种新的可达集估计方法,并把所提方法推广到系统不稳定的情况,分别估计出不稳定系统的闭环可达集和开环可达集.通过分析动态系统的李雅普诺夫函数,将求取系统可达集的问题转化为线性矩阵不等式优化问题,并将可达集范围用椭球集形式表述.最后分别通过数值仿真分析,验证了所提出方法对线性系统可达集估计的有效性.     

鲁棒镇定受到干扰的非线性微分包含系统

研究带有干扰的非线性微分包含系统的镇定问题. 基于凸锥Lyapunov函数方法, 首先, 对于无干扰的这类系统, 设计可使闭环系统全局镇定的连续反馈控制律. 其次, 通过状态反馈, 对于受到两类有界干扰的这类微分包含系统的可达集进行了估计. 最后, 通过一个仿真例子说明所提出的设计方法的有效性.     

On the reachability in any fixed time for positive continuous-time linear systems

This paper deals with the reachability of continuous-time linear positive systems. The reachability of such systems, which we will call here the strong reachability, amounts to the possibility of steering the state in any fixed time to any point of the positive orthant by using nonnegative control functions. The main result of this paper essentially says that the only strongly reachable positive systems are those made of decoupled scalar subsystems. Moreover, the strongly reachable set is also characterized.