基于可达集的鲁棒模型预测控制

设计了一种基于可达集的鲁棒模型预测控制算法.首先确定了一个鲁棒不变集,并将此不变集用作模型预测控制的终端约束集;接着采用终端约束集对可达集的包含度作为优化指标;最后,采用预测时域逐渐减小的控制策略以保证在线优化存在可行解.从理论上证明了吸引域内的任意点在有限时域内都会被引导至终端约束集并始终停留在此集之内,并由仿真算例验证了本文所设计鲁棒模型预测控制算法的可行性.     

输入状态稳定的鲁棒预测控制

以有界干扰非线性系统为研究对象,设计一种基于近似可达集的鲁棒预测控制方法。该方法以鲁棒控制不变集作为终端约束集,采用一种简单的三次多项式逼近预测控制的待优化控制律,通过在线优化求解三次多项式的各项系数,并从理论上证明了所设计的鲁棒预测控制律可以使系统输入状态稳定。最后通过仿真实例验证了所提出的鲁棒预测控制方法的可行性和有效性。     

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

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

From Dubins’ car to Reeds and Shepp’s mobile robot

In the paper, a control system with intermediate dynamics between Dubins’ car and Reeds and Shepp’s mobile robot is investigated. Time-limited reachable sets and reachable sets at given time are computed. Families of semipermeable curves that are useful for the detection of jumps of the value function of time-optimal control problem are constructed. Research is partly supported by the Russian Foundation for Fundamental Research under Grants 06-01-00414 and 07-01-96085.     

Optimal control for integrated emission management in diesel engines

Integrated Emission Management (IEM) is a supervisory control strategy that minimises operational costs (consisting of fuel and AdBlue) for diesel engines with an aftertreatment system, while satisfying emission constraints imposed by legislation. In most work on IEM, a suboptimal heuristic real-time implementable solution is used, which is based on Pontryagin's Minimum Principle (PMP). In this paper, we compute the optimal solution using both PMP and Dynamic Programming (DP). As the emission legislation imposes a terminal state constraint, standard DP algorithms are sensitive to numerical errors that appear close to the boundary of the feasible sets. Therefore, we propose two extensions to existing DP methods, which use an approximation of the forward reachable sets to reduce the grid size over time and an approximation of the backward reachable sets to avoid the aforementioned numerical errors. Using a simulation study of a cold-start World Harmonised Transient Cycle for a Euro-VI engine, we show that the novel extension to the DP algorithm yields the best approximation of the optimal cost, when compared to existing DP methods. Furthermore, we show that PMP yields almost the same results as DP, and that the real-time implementable solution only deviates approximately 0.08–0.16% from the optimal solution.     

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

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

Gain-scheduled control of time-varying delay systems with input constraint

This paper investigates gain-scheduled control design for linear systems with time-varying state delays subject to actuator saturation and external disturbance. Assuming the disturbance is peak bounded, a sufficient delay-dependent condition is established to guarantee that a family of level sets, corresponding to a novel parameter-dependent Lyapunov–Krasovskii functional, are nested and invariant to the closed-loop system. The invariant sets are then used to obtain nested reachable sets (ellipsoids) to bound the closed-loop states. A family of continuous controllers are designed based on these nested ellipsoids. The controller with the best performance is selected, each time, based on the closed-loop state vector, while complying with the saturation bound, and the resulting closed-loop system is locally input-to-state stable. All conditions are represented in the form of linear matrix inequalities (LMIs) by the linear spline method. Finally, the benefit of the control method is illustrated by two examples.     

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

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

Asymptotics of reachable sets of linear dynamical systems with impulsive control

Explicit asymptotic formulas for the reachable sets of linear dynamical systems with constraints on the total impulse of control action under different assumptions concerning the spectrum of the system’s matrix are obtained. It is shown that for large time, the reachable sets can be approximately represented in the form of the product of the scaling matrix and the normalized reachable set, where the matrix is an elementary function of time, and the normalized reachable set depends on time quasi-periodically. Analysis of asymptotic formulas has shown that, generally speaking, there exists a continuum of limit shapes, the aggregate of which produces a multidimensional attractor.     

Reachability analysis of continuous-time piecewise affine systems

This paper proposes an algorithm for the characterization of reachable sets of states for continuous-time piecewise affine systems. Given a model of the system and a bounded set of possible initial states, the algorithm employs an LMI approach to compute both upper and lower bounds on reachable regions. Rather than performing computations in the state-space, this method uses impact maps to find the reachable sets on the switching surfaces of the system. This tool can then be used to deduce safety and performance results about the system.     

基于可拓控制的离散变结构系统的组合控制

提出了一种新的离散变结构系统组合控制策略和一种改进的变速趋近律.众所周知,由于变结构控制系统中存在高频抖振,这一现象限制了变结构控制方法在各种工程设计领域中的应用.新的离散变结构系统组合控制策略的目的是使系统在最短的时间内完成正常运动从而系统的鲁棒性得以提高.对于滑动模态的到达问题,提出了基于改进的变速趋近率、指数趋近率和可拓控制的组合控制策略.这种新的控制策略能有效地削弱抖振提高系统的动态性能.最后通过将传统组合控制策略与所提出的组合控制策略仿真比较,其结果表明新的组合控制策略能够获得令人满意的结果.     

On the reachable set of inflated singularly perturbed differential equations

Singularly perturbed differential equations with slow and fast subsystems are under consideration. It is well-known that the invariant probability measures of the unperturbed fast subsystems produce a limiting system for the slow subsystem. Unfortunately, the limiting system is non-smooth in general and might be too big since it also generates trajectories that are not related to the singularly perturbed system. However, if the flows produced by the unperturbed fast subsystems are chain transitive an inflation of the singularly perturbed system can be used in order to approximate all trajectories of the limiting system. Moreover, it turns out that the reachable sets of the limiting system are contained in the reachable sets of the slightly inflated singularly perturbed system.     

Reachable sets bounding for switched systems with time-varying delay and bounded disturbances

In this paper, we address the problem of finding outer bound of forward reachable sets and inter-bound of backward reachable sets of switched systems with an interval time-varying delay and bounded disturbances. By constructing a flexible Lyapunov–Krasovskii functional combining with some recent refined integral-based inequalities, some sufficient conditions are derived for the existence of (1) the smallest possible outer bound of forwards reachable sets; and (2) the largest possible inter-bound of backward reachable sets. These conditions are delay dependent and in the form of linear matrix inequalities, which therefore can be efficiently solved by using existing convex algorithms. A constructive geometric design of switching laws is also presented. Two numerical examples with simulation results are provided to demonstrate the effectiveness of our results.     

Comparative analysis of the asymptotic dynamics of reachable sets to linear systems

Explicit asymptotic formulas for reachable sets of linear dynamic systems with two types of control bounds, geometric constraints and constraints on the total impulse of the control action, are compared. A detailed proof of asymptotic formulas for the case of geometric constraints was first given. It was shown that, despite the similarity of the problem statement and methods to study the asymptotics of reachable sets for the considered types of constraints, the results obtained are essentially different. For example, for the impulsive case in the space of shapes of reachable sets, a multidimensional attractor may arise, while, in the case of geometric constraints, the corresponding attractor is reduced to a single point.     

Subspace controllability of Boolean networks

Many Boolean control networks contain independent uncontrollable subnetworks, which may affect other nodes; and the rest of the system is called subspace of sub‐controllable states. This paper investigates the problem of subspace controllability under free input sequences, while the presumption that the initial states of those independent subnetworks are designable is canceled. An algorithm based on the common asymptotic periodic properties of the states is developed to find the reachable sets. Accordingly, the existing controllability criteria for subspaces when initial states of subnetworks are designable is improved, and a necessary and sufficient condition of subspace controllability via subnetworks and free inputs is derived. A design technique involving a kind of newly defined addition is presented to construct desired controls.     

关于Sontag-Type控制的注记

基于控制李雅普诺夫函数的Sontag-Type控制是仿射系统鲁棒镇定中的重要控制律.首先揭示该控制律本质上是一种变结构控制且闭环的切换面总可达,受此启发并为了相对容易地构造控制李雅普诺夫函数,运用零状态可检测概念定义弱控制李雅普诺夫函数,并证明了基于弱控制李雅普诺夫函数的Sontag-Type控制的优化镇定性.文中还证明,在温和条件下,基于弱控制李雅普诺夫函数的Sontag＿Type控制为仿射系统的输入到状态镇定控制.     

Controllability and reachability criteria for switched linear systems

This paper investigates the controllability and reachability of switched linear control systems. It is proven that both the controllable and reachable sets are subspaces of the total space. Complete geometric characterization for both sets is presented. The switching control design problem is also addressed.     

Convexity of reachable sets of nonlinear ordinary differential equations

A necessary and sufficient condition for the reachable set, i.e., the set of states reachable from a ball of initial states at some time, of an ordinary differential equation to be convex is presented. In particular, convexity is guaranteed if the ball of initial states is sufficiently small, an upper bound on the radius of that ball being obtained directly from the right hand side of the differential equation. In finite dimensions, the results cover the case of ellipsoids of initial states. A potential application of the results is inner and outer polyhedral approximation of reachable sets, which becomes extremely simple and almost universally applicable if these sets are known to be convex. An example demonstrates that the balls of initial states for which the latter property follows from the results are large enough to be used in actual computations.     

Robust time-optimal control of constrained linear Systems

A version of dynamic programming, which computes level sets of the value function rather than the value function set itself, is used to design robust non-linear controllers for linear, discrete-time, dynamical systems subject to hard constraints on controls and states. The controller stabilizes the system and steers all trajectories emanating in a prescribed set to a control invariant set in minimum time. For the robust regulator problem, the control invariant terminal set is a neighborhood, preferably small, of the origin; for the robust tracking problem, the control invariant terminal set is a neighborhood of the invariant set in which the tracking error is zero. Two non-linear controllers which utilize the level sets of the value function, are described. The first requires the controller to solve, on-line, a modest linear program whose dimension is approximately the same as that of the control variable. The second decomposes each level set into a set of simplices; a piecewise linear control law, affine in each simplex, is then constructed.