驾驶员最优预见跟踪仿真研究

预见信息的加入能使驾驶员提前感知跟踪目标未来变化,从而对飞机做出超前控制。研究了驾驶员最优预见跟踪控制算法,理论分析得出预见信息对预见控制的作用特点。最后通过人机系统模拟实验,验证了预见信息对驾驶员超前补偿的特性。     

装甲战车训练模拟器综合显示终端仿真系统设计与实现

采用模拟器进行数字化武器装备的操作训练是当今信息化装备发展的需要,综合显示终端仿真系统是装甲战车训练模拟器中重要的组成部分.基于实装通过在PC机上VAPS平台和VC 开发环境相结合来构建仿真系统,可以降低设计成本,缩短设计周期.介绍了仿真系统的结构、设计思想和实现方法,给出了系统组成框图和开发流程,重点研究了仿真界面显示和外部驱动程序等关键问题,实现了某型装甲战车训练模拟器综合显示终端仿真系统,满足了装甲车辆综合显示终端信息化训练的需要,具有较高的军事和经济价值.     

一种考虑所有权重信息的区间交叉效率排序方法

针对交叉效率评价方法中交叉效率不唯一的问题,在分析现有解决方法缺陷的基础上,提出了考虑所有权重信息的区间平均交叉效率,即将所有决策单元的交叉效率值定义在各自的一个区间数上,该区间数考虑了所有决策单元自评时的权重信息,通过比较各决策单元的区间平均交叉效率值,从而可以对所有决策单元进行充分排序,利用该方法能够很好地解决现有方法所存在的部分缺陷.最后通过算例对该方法进行了演示.     

Adaptive SPC monitoring scheme for DOE-based APC

Automatic process control （APC） based on design of experiment （DOE） is a cost-efficient approach for variation reduction. The process changes both in mean and variance owing to online parameter adjustment make it hard to apply traditional SPC charts in such DOE-based APC applied process. An adaptive SPC scheme is developed, which can better track the process transitions and achieve the possible SPC run cost reduction when the process is stable. The control law of SPC parameters is designed by fully utilizing the estimation properties of the process model instead of traditionally using the data collected from the production line. An example is provided to illustrate the proposed adaptive SPC design approach.     

SAR图像目标方位角估计与分析

SAR成像对目标方位角特别敏感,方位角估计的准确性会直接影响目标的分类和识别.目标方位角估计方法主要有包络盒准则法、轮廓线变换法和主轴原则法.每种方法都有其局限性,且估计范围是[0, 180],可是目标方位角实际范围是[0, 360].为了能获得任意角度且相对精确目标方位角,提出了一种综合SAR图像目标方位角估计方法.该方法融合了的单一估计法的优点,并利用目标的相关信息,突破了以往仅从图像的角度估计方位角的缺点.实验表明这种方法是有效的、可行的.     

Non-fragile decentralized H∞ controller design for uncertain linear systems

Considering the design problem of non-fragile decentralized H∞ controller with gain variations, the dynamic feedback controller by measurement feedback for uncertain linear systems is constructed and studied. The parameter uncertainties are considered to be unknown but norm bounded. The design procedures are investigated in terms of positive definite solutions to modify algebraic Riccati inequalities. Using information exchange among local controllers, the designed non-fragile decentralized H∞ controllers guarantee that the uncertain closed-loop linear systems are stable and with H∞ -norm bound on disturbance attenuation. A sufficient condition that there are such non-fragile H∞ controllers is obtained by algebraic Riccati inequalities. The approaches to solve modified algebraic Riccati inequalities are carried out preliminarily. Finally, a numerical example to show the validity of the proposed approach is given.     

基于OpenGL的小型组机器人足球仿真平台设计

机器人足球是人工智能与机器人领域的基础研究课题。实现了基于OpenGL的小型组机器人足球仿真平台,并对其中的关键技术进行了讨论。仿真平台建模简单、直观,使用射线追踪算法很好地实现了世界模型的碰撞检测,对机器人的运动以及控球性能也作了精确的模拟,并实现了多种人机交互功能。三维仿真平台的应用能更好地协助实物机器人足球系统的先期调试,也为实际比赛后的数据分析提供了有利的工具。     

网络化制造环境下生产动态调度仿真与分析

针对网络化制造环境下生产系统特点,构建异地生产协同调度框架.基于调度框架进行动态仿真计算:应用模糊理论对生产时间分布概率进行判断,确定企业内部生产调度评测参数;使用Hopfield神经网络综合决策,求出企业外协生产与内部调度之间的可行解.将调度框架应用在实际生产调度问题中,对仿真计算结果继续综合优化,能够得到好的可行调度方案.     

一种新的大规模网络最短路径的近似算法

平均最短路径长度是复杂网络的一个重要特性,但是对于大规模网络的平均最短路径长度的计算是困难的.在最近的一次对中国教育网的研究中.建立了一个有2 354 934个网页和26 816 209个链接的网络.要想计算该网络的平均最短路径长度,无论是传统的Floyd、Dijkstra算法,还是基于MPI的并行算法,在现有的计算机资源下都难以实现.提出了二级网络的概念,并基于此给出了一种针对中国教育网的新算法,使得在可以接受的时间内完成平均最短路径的近似计算,经试算效果令人满意,说明这种方法对于计算大规模网络的平均最短路径是有效的.     

Cluster Synchronization in a Complex Dynamical Network with Two Nonidentical Clusters

This paper further investigates cluster synchronization in a complex dynamical network with two-cluster. Each cluster contains a number of identical dynamical systems, however, the subsystems composing the two clusters can be different, i.e., the individual dynamical system in one cluster can differ from that in the other cluster. Complete synchronization within each cluster is possible only if each node from one cluster receives the same input from nodes in other cluster. In this case, the stability condition of one-cluster synchronization is known to contain two terms： the first accounts for the contribution of the inner-cluster coupling structure while the second is simply an extra linear term, which can be deduced by the ＂same-input＂ condition. Applying the connection graph stability method, the authors obtain an upper bound of input strength for one cluster if the first account is known, by which the synchronizability of cluster can be scaled. For different clusters, there are different upper bound of input strength by virtue of different dynamics and the corresponding cluster structure. Moreover, two illustrative examples are presented and the numerical simulations coincide with the theoretical analysis.