Optimal source rate control for adapting VBR video over CBR channels

In this paper we discuss the source rate control problem of adapting variable bit-rate （VBR） compressed video over constant bit-rate （CBR） channels. Firstly we formulate it as an optimal control problem of a discrete linear system with state and control constraints. Then we apply the discrete maximum principle to get the optimal solution. Experimental results are given in the end. Compared with traditional algorithms, the proposed algorithm is suitable for the coder with continuous output rates, and can achieve the better solution. Our algorithm can be used in both off-line and on-line coding.     

VBR视频流在有服务质量(QoS)保证的信道上传输时的最优控制问题

本文讨论了可变比特率（VBR）视频流在有服务质量(QoS)保证的信道上传输时的信源和信道速率控制问题.首先将其表述为离散线性时延系统的最优控制问题，然后利用离散极大值原理得到该问题的最优解.和传统的解决方案相比较，本文的方法适合于具有连续输出码率的编码器，并对于编码器和解码器的缓冲区大小没有特殊要求，理论分析和实验结果表明，本文的方法具有更低的复杂度.该方法既能用于离线编码，也能用于在线编码.     

Discrete dynamic optimization of N-stages control for isolated signalized intersections

The N-stages control problem for isolated signalized intersections is defined as the control problem to disperse initial queue lengths to their optimal steady-state values in N cycles. Based on a discrete-event model of a simplified isolated signalized intersection, the N-stages control problem is formulated as a linear programming problem as well as a quadratic programming problem. A new algorithm is proposed for solving the discrete optimization problem by simple calculations, based on the optimal solution of the corresponding continuous-time problem. Numerical comparisons between the continuous-time optimal solution and the discrete-event optimal solutions, obtained from linear programming and sequential quadratic programming, are given for a few examples.     

SENSITIVITY APPROACH TO OPTIMAL CONTROL FOR AFFINE NONLINEAR DISCRETE‐TIME SYSTEMS

This paper deals with the optimal control problem for a class of affine nonlinear discrete‐time systems. By introducing a sensitivity parameter and expanding the system variables into a Maclaurin series around it, we transform the original optimal control problem for affine nonlinear discrete‐time systems into the optimal control problem for a sequence of linear discrete‐time systems. The optimal control law consists of an accurate linear term and a nonlinear compensating term, which is an infinite sequence of adjoint vectors. In the present approach, iteration is required only for the nonlinear compensation series. By intercepting a finite sum of the series, we obtain a suboptimal control law that reduces the complexity of the calculations. A numerical simulation shows that the algorithm can be easily implemented and has a fast convergence rate.     

基于统计模型预测截断的码率控制算法

针对JPEG2000存在大量计算冗余影响星载遥感图像压缩速度的问题,提出基于统计模型预测截断的遥感图像码率控制算法。建立统计模型预测最优率失真斜率阈值,并将其作为层一编码门限值,根据生成码流长度自适应调整该值,获得近似的最优斜率阈值,层二在该值基础上搜索最优率失真斜率阈值和最优截断点以实现码率控制。实验结果表明,目标码率为0.5 bpp时,在保证重构图像质量的前提下,减少了编码时间,相比JasPer减少了40%。     

离散时间线性系统最优控制的遗传算法实现

本文提出了求解控制变量受区间约束情形的离散时间线性系统最优控制的遗传算法,在遗传算法框架下给出了离散时间线性系统最优控制问题可行解的编码及初始化方法,设计了选择、交叉、变异等遗传算子,并对初始化方法及各种遗传算子的可行性给出理论分析。     

CG伪谱法在欠驱动航天器姿态机动最优控制中的应用

使用Chebyshev-Gauss(CG)伪谱法研究带动量轮和推力器的欠驱动航天器姿态最优控制问题.基于欧拉姿态角和动量矩定理导出两类航天器姿态运动模型,采用Clenshaw-Curtis积分近似得到性能指标函数中的积分项,应用重心拉格朗日插值逼近状态变量和控制变量,将连续最优控制问题离散为具有代数约束的非线性规划(NLP)问题,通过序列二次规划(SQP)算法求解.数值仿真结果表明,对两类欠驱动航天器的姿态机动最优控制均能达到设计控制要求,得到的姿态最优曲线与验证得到的曲线几乎完全重叠.     

带有复形法局部搜索的粒子群算法求解最优控制问题*

对最优控制问题的求解是实现计算机控制的前提条件,但有效地求出控制系统的全局最优解是困难的。现今各种求解此问题的算法需要增强算法的优化性能与简洁性。遗传算法求此类问题需要进行离散化;复形法、粒子群算法求解此类问题容易陷入局部极值。为此提出用带有复形法局部搜索的粒子群算法求解此类问题。此算法充分考虑粒子群算法与复形法的特性,将复形法的局部搜索与粒子群算法的全局搜索结合起来,以提高算法搜索能力,克服粒子群算法与复形法易陷局部极值的不足。通过性能测试效果良好,同时算法简便、可行、高效。最后将所提算法用于求解Park-Ramirez生物反应器补料流率的动态优化,取得了满意的效果。     

时滞系统控制问题块脉冲算子解的收敛性

本文给出了一种基于块脉冲算子的离散逼近格式.应用这种逼近格式,可以获得时滞非 线性最优控制问题的块脉冲级数解.本文证明了这种块脉冲级数解将收敛于这类问题的精 确解,并具有一阶收敛速度.     

带ε误差限的近似最优控制

近似动态规划方法求解非线性系统最优控制, 需要迭代无限步才能得到最优控制律. 本文提出了一种ε–近似最优控制算法, 选择ε误差限, 通过自适应迭代不断逼近哈密顿– 雅可比– 贝尔曼(HJB)方程的解, 应用神经网络实现在有限步迭代后得到带ε误差限的近似最优控制律. 计算机仿真结果表明了该算法的有效性.     

Markov控制过程基于性能势的平均代价最优策略

研究了一类离散时间Markov控制过程平均代价性能最优控制决策问题.应用 Markov性能势的基本性质,在很一般性的假设条件下,直接导出了无限时间平均代价模型在紧 致行动集上的最优性方程及其解的存在性定理.提出了求解最优平稳控制策略的迭代算法,并 讨论了这种算法的收敛性问题.最后通过分析一个实例来说明这种算法的应用.     

Tuning an adaptive controller using a robust control approach

This article proposes a new technique for the tuning of a discrete adaptive controller that is designed based on Lyapunov stability concepts. The tuning is based on the minimisation of a performance index that can be calculated from a generalised eigenvalue problem (GEVP) using LMI's (Linear Matrix Inequalities). The proposed technique results in an adaptive controller with time-varying tuning gains. The solution is based on an approximation of the optimal dual adaptive control problem. The tuning technique was used to perform on-line control of a first-order system and an isothermal and a non-isothermal CSTR. The results show that the proposed approach provides better performance than an adaptive algorithm with the same structure, but with constant adaptation gains. Also, the proposed algorithm is shown to be superior to an adaptive controller based on a Recursive Least Squares (RLS) estimator during sudden changes in model parameters.     

乘性随机离散系统的最优控制

基于对系统随机不确定因素的分析,文中定义了一种新型随机离散系统--乘性随机 离散系统,并研究该类系统的线性二次型(LQ)最优控制问题.首先给出了该类系统的有限时间 和无限时间LQ最优控制律,并着重分析、证明了无限时间LQ最优控制问题的Riccati方程的 正定矩阵解的存在性及相应数值求解算法与收敛性,以及闭环系统的稳定性等问题.仿真结果 表明了该方法的有效性.     

线性离散奇异系统的不定二次最优控制问题: Krein空间方法

The finite time horizon indefinite linear quadratic(LQ) optimal control problem for singular linear discrete time-varying systems is discussed. Indefinite LQ optimal control problem for singular systems can be transformed to that for standard state-space systems under a reasonable assumption. It is shown that the indefinite LQ optimal control problem is dual to that of projection for backward stochastic systems. Thus, the optimal LQ controller can be obtained by computing the gain matrices of Kalman filter. Necessary and sufficient conditions guaranteeing a unique solution for the indefinite LQ problem are given. An explicit solution for the problem is obtained in terms of the solution of Riccati difference equations.     

一类双线性随机系统M量测不定LQ控制

研究了带有乘性噪声和受扰动观测的离散时间随机系统不定线性二次(Linear quadratic, LQ) 最优输出反馈控制问题. 对此类问题而言,二次成本函数的加权矩阵不定号,并且最优控制具有对偶效果.为在最优性和计算复杂度间 进行折衷,本文采用了一种M量测反馈控制设计方法.基于动态规划方法,将未来的测量结合到当前控制 计算当中的M量测反馈控制可以通过倒向求解一类与原系统维数相同的广义差分Riccati方程(Generalized difference Riccati equation, GDRE)得到.仿真结果 表明本文提出的算法与目前普遍采用的确定等价性方法相比具有优越性.     

基于参数化最优的仿人机器人倒地运动控制

针对仿人机器人的倒地运动控制,用经典的参数化优化方法求得最优控制函数的一个近似解．然后, 利用参数化控制及强化技术,基于几个分段的常数去逼近最优解,再将最优控制问题转化为一系列参数优化问题． 利用该方法提出了仿人机器人倒地优化控制算法,并与遗传算法进行了比较．最后,通过仿真对算法进行了验证．     

Characterisation Of Receding Horizon Control For Constrained Linear Systems

This paper characterises the geometric structure of receding horizon control (RHC) of linear, discrete‐time systems, subject to a quadratic performance index and linear constraints. The geometric insights so obtained are exploited to derive a closed‐form solution for the case where the total number of constraints is less than or equal to the number of degrees of freedom, represented by the number of control moves. The solution is shown to be a partition of the state space into regions for which an analytic expression is given for the corresponding control law. Both the regions and the control law are characterised in terms of the parameters of the open‐loop optimal control problem that underlies RHC and can be computed off line. The solution for the case where the total number of constraints is greater than the number of degrees of freedom is addressed via an algorithm that iteratively uses the off‐line solution and avoids on‐line optimisation.     

基于双线性模型的动态系统优化和参数估计集成方法

针对双线性模型与实际系统之间的差异，提出一种基于双线性模型求解非线性动态系统最优控制的迭代算法。该算法通过重复求解修正的基于双线性模型的优化控制问题和参数估计问题，获得实际系统的最优解。同时提出求解修正的基于双线性模型的优化控制问题的一种新的分解方法，克服了非线性和双线性两点边值问题求解的困难。仿真例子表明该算法的有效性和实用性。     

A graph-theoretic optimal control problem for terminating discrete event processes

Most of the results to date in discrete event supervisory control assume a zero-or-infinity structure for the cost of controlling a discrete event system, in the sense that it costs nothing to disable controllable events while uncontrollable events cannot be disabled (i.e., their disablement entails infinite cost). In several applications however, a more refined structure of the control cost becomes necessary in order to quantify the tradeoffs between candidate supervisors. In this paper, we formulate and solve a new optimal control problem for a class of discrete event systems. We assume that the system can be modeled as a finite acylic directed graph, i.e., the system process has a finite set of event trajectories and thus is terminating. The optimal control problem explicitly considers the cost of control in the objective function. In general terms, this problem involves a tradeoff between the cost of system evolution, which is quantified in terms of a path cost on the event trajectories generated by the system, and the cost of impacting on the external environment, which is quantified as a dynamic cost on control. We also seek a least restrictive solution. An algorithm based on dynamic programming is developed for the solution of this problem. This algorithm is based on a graph-theoretic formulation of the problem. The use of dynamic programming allows for the efficient construction of an optimal subgraph (i.e., optimal supervisor) of the given graph (i.e., discrete event system) with respect to the cost structure imposed. We show that this algorithm is of polynomial complexity in the number of vertices of the graph of the system.Research supported in part by the National Science Foundation under grant ECS-9057967 with additional support from GE and DEC.     

Constrained optimal control of switched systems based on modified BFGS algorithm and filled function method

In this paper, we consider an optimal control problem of switched systems with a continuous-time inequality constraint. Because of the complexity of this constraint, it is difficult to solve this problem by standard optimization techniques. To overcome this difficulty, the problem is divided into a bi-level optimization problem involving a combination of a continuous-time optimal control problem and a discrete optimization problem. Then, a modified Broyden-Fletcher-Goldfarb-Shanno algorithm and a discrete filled function method is first proposed to solve this bi-level optimization problem. Finally, a numerical example is presented to illustrate the efficiency of our method.