Identification by parameter bounds in adaptive control

Approximate solutions are suggested for receding horizon dual control to guarantee acceptable control performance of a plant with large a priori parameter uncertainties under poor excitation by the output reference and to satisfy the requirement of very fast adaptation using knowledge available on sensor and performance in industrial applications of adaptive control. the aim of the paper is to present several levels of interaction between on-line identification and control performance using parameter bounds. an interesting theorem shows that parameter bounding is a necessary part of the solution of the dual control problem. Starting from the complete separation of identification and control, various approximations are presented at different levels of optimality. Finally, the exact solution of the dual control problem is found for static gain adaptation, which implicitly involves a parameter-bounding identification procedure.     

Positive state‐bounding observer for positive interval continuous‐time systems with time delay

This paper is concerned with the problem of positive observer synthesis for positive systems with both interval parameter uncertainties and time delay. Conventional observers may no longer be applicable for such kind of systems due to the positivity constraint on the observers, and they only provide an estimate of the system state in an asymptotic way. A pair of positive observers with state‐bounding feature is proposed to estimate the state of positive systems at all times in this paper. A necessary and sufficient condition for the existence of desired observers is first established, and the observer matrices can be obtained easily through the solutions of a set of linear matrix inequalities (LMIs). Then, to reduce the error signal between the system state and its estimates, an iterative LMI algorithm is developed to compute the optimized state‐bounding observer matrices. Finally, a numerical example is presented to show the effectiveness and applicability of the theoretical results. Copyright © 2011 John Wiley & Sons, Ltd.     

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

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

结合图像特征的多视拼接数据的消冗处理

在不丢失非重叠区域数据的情况下, 对多视拼接重合区域的三维点云数据进行消冗处理是三维拼接中的一个难题。针对这一难题, 提出了一种结合二维图像信息查找和消除冗余数据的新方法。算法首先查找位于拼接重叠区域的三维点云数据, 结合三维点的K近邻约束和对应像素特征描述的相似度, 对重叠区域的点云数据进行冗余查找和消除。实验表明, 该方法能够准确判断并消除冗余点, 没有造成更改或丢失非重叠区域三维数据点的不良效果, 消冗速度也有所提高。     

一种多基元类的布局迁移自适应算法及在闸机设计中的应用

布局问题研究物体的布局先后或布局定位以满足设计要求,布局迁移设计是在已有布局基础上高效设计新布局的方法。在轨道交通自动控制系统中,闸机表面传感器的布局对人与物的识别有重要的影响。为了实现闸机在不同地域环境中的快速设计,首先以闸机布局中的传感器作为研究对象,进行基元划分,提出了多种基元类型;并分析了基于拓扑结构的基元迁移变换方法,研究了人群特征因素、机械结构约束的数学表达;然后提出基于包围圆搜索的基元运动与干涉分析算法,其参数能够根据求解精度进行自适应调整;并利用多目标归一化函数对各基元的解进行择优,以获取最终布局。最后以18对传感器的闸机布局设计为例进行实例分析,应用此方法并借助于Visual Basic可视化编译平台,实现了闸机在不同地域环境中的传感器布局快速设计。     

Variable partial-update NLMS algorithms with data-selective updating

We note that some existing algorithms are based on the normalized least-mean square （NLMS） algorithm and aim to reduce the computational complexity of NLMS all inherited from the solution of the same optimization problem, but with different constraints. A new constraint is analyzed to substitute an extra searching technique in the set-membership partial-update NLMS algorithm （SM-PU-NLMS） which aims to get a variable number of updating coefficients for a further reduction of computational complexity. We get a closed form expression of the new constraint without extra searching technique to generate a novel set-membership variable-partial-update NLMS （SM-VPU-NLMS） algorithm. Note that tile SM-VPU-NLMS algorithm obtains a faster convergence and a smaller mean-squared error （MSE） than the existing SM-PU-NLMS. It is pointed out that the closed form expression can also be applied to the conventional variable-step-size partial-update NLMS （VSS-PU-NLMS） algorithm. The novel variable-step-size variable-partial-update NLMS （VSS-VPU-NLMS） algorithm is also verified to get a further computational complexity reduction. Simulation results verify that our analysis is reasonable and effective.     

针对多目标的分布式多边融合定位

针对基于接收信号强度指数(Received Signal Strength Indicator,RSSI)的多目标定位问题,结合点估计与椭圆估计算法,提出一种新的分布式多边融合定位(Distributed Multi-lateral Fusion Localization,DMFL)算法.首先,通过多边定位算法进行粗定位,估计目标的大致位置.其次,基于区间分析理论在线获取泰勒展式高阶余项的边界,并通过集员递归算法求解多目标定位问题.最后,通过实验和仿真验证该算法的定位性能.结果表明,在相同的节点布置条件下,与最新的RSSI定位算法相比,该算法的定位精度更高,最大误差小于0.3 m,并可提供保证包含目标真实位置的最优区域.     

导弹飞行视景仿真中的碰撞检测算法

针对导弹飞行视景仿真中碰撞检测实时性与精确性的不足,提出了一种优化的混合包围盒碰撞检测算法.该算法在包围盒树的上层使用Sphere,下层使用OBB;将该算法在导弹飞行视景仿真系统中实现后,分别与相交矢量碰撞检测算法、OBB包围盒算法进行对比试验和分析.结果表明,这种混合包围盒算法能够有效地提高导弹飞行视景仿真中碰撞检测的实时性与精确性.     

3D游戏开发中的碰撞检测算法研究

碰撞检测在三维游戏开发中是必不可少的环节。目前,主流游戏引擎大多采用基于层次包围体的碰撞检测算法,其基本思想是用一个相对简单的包围体逼近场景中复杂的物体。文中对当前三维游戏开发中常用的四种基于包围体的算法作了理论分析,并通过试验对四种不同的包围体算法作了性能测试。试验结果表明,紧密性越好的包围体其精度越高,但时间消耗也高。因此,在具体的游戏开发中,应根据实际游戏的特殊情况进行算法选用,才能取得较好的效果。