基于遗传算法的多台光电经纬仪优化布站研究

利用部署于不同地点的多台光电经纬仪对飞行目标进行交会测量,可以确定被测目标的空间位置.为提高对被测目标的定位精度,提出了一种基于遗传算法的多台光电经纬仪优化布站方法.首先建立了光电经纬仪交会测量定位优化布站数学模型,然后针对该优化问题对遗传算法进行了设计,最后运用该算法对三台光电经纬仪布站几何进行了优化布站仿真计算,得到了三台光电经纬仪经布站优化后的站点坐标,且仿真结果表明该方法能够明显提高对被测目标的定位精度.     

椭圆参考轨道指定区域最优交会研究

研究了椭圆参考轨道指定区域最优交会问题。为了实现在指定区域完成最优交会,采用以参考轨道真近点角为自变量的线性化时变Tschauner-Hempel交会动力学模型,按照设定的真近点角交会域和最优二次性能指标设计最优交会控制,加权矩阵随真近点角变化。为方便指定区域最优控制问题求解,采用区段混合能法递推求解时变黎卡提矩阵微分方程和状态轨线。对远距、近距异面交会和共面交会三种情况设定不同的交会域进行了仿真研究,结果表明方法能保证在设定的真近点角域内完成交会,交会控制能耗小,精度高。     

基于最优模糊PID温度控制方法研究

针对某智能大厦空调的温度控制系统,引入了一种新的模糊推理方法,设计了模糊PID控制器.该模糊推理方法将优化和反馈的思想引入推理过程中,依据不同的优化指标进行推理,使推理过程更为有效,论文给出了应用该推理方法的具体过程.以建立起的温度系统模型为基础,设计了基于最优模糊推理的温度系统模糊PID控制器,进行了仿真研究,仿真结果和实际运行表明了该控制方法具有强鲁棒性和良好控制品质.     

Disturbance attenuation by dynamic output feedback for input-delay systems

This paper addresses the optimal disturbance attenuation problem by output feedback for multivariable linear systems with delayed inputs. The attenuation is optimal in the sense that the controller minimizes the maximal amplitude of the plant output in response to such a disturbance. The controller is a general feedback, involving an observer, a state predictor, and a predicted state feedback. The optimal disturbance attenuation problem is formulated in terms of an equivalent system without delay. The optimal bound of the disturbance attenuation is then characterized, and it is shown that the optimal controller tends to have high gains. A necessary and sufficient condition to guarantee the existence of an optimal solution is provided using the geometric approach.     

Trading a mean-reverting asset: Buy low and sell high

This paper is concerned with an optimal trading (buy and sell) rule. The underlying asset price is governed by a mean-reverting model. The objective is to buy and sell the asset so as to maximize the overall return. Slippage cost is imposed on each transaction. The associated HJB equations (quasi-variational inequalities) are used to characterize the value functions. It is shown that the solution to the original optimal stopping problem can be obtained by solving two quasi-algebraic equations. Sufficient conditions are given in the form of a verification theorem. A numerical example is reported to demonstrate the results.     

Solving the Beck and Wieland model with optimal experimentation in DualPC

Currently, there is a renewed interest in the use of optimal experimentation (adaptive control) in economics. Example are found in [Amman and Kendrick, 1999], [Amman and Kendrick, 2003], [Cosimano, in?press], [Cosimano and Gapen, 2005b], [Cosimano and Gapen, 2005a], [Cosimano and Gapen, 2006], [Tesfaselassie et?al., 2007], [Tucci, 1997], [Wieland, 2000a] and [Wieland, 2000b]. In this paper we present the Beck & Wieland model [Beck, G., & Wieland, V. (2002). Learning and control in a changing economic environment. Journal of Economic Dynamics and Control, 26, 1359-1378] and the methodology to solve this model with time-varying parameters using the various control methods described in [Kendrick, 1981] and [Kendrick, 2002]. Furthermore, we also provide numerical results using the DualPC software [Amman, H. M., & Kendrick, D. A. (1999). The DualI/DualPC software for optimal control models: User’s guide. Working paper, Austin, TX 78712, USA: Center for Applied Research in Economics, University of Texas] and show first evidence that optimal experimentation or Dual Control may produce better results than Expected Optimal Feedback.     

二级倒立摆的建模与MATLAB仿真

通过对二级倒立摆结构构成及平衡控制问题的分析,给出基于牛顿力学定律的数学建模方法,并应用二次型最优控制理论实现二级倒立摆控制。根据MATLAB仿真结果表明,建模方法可行,采用二次型最优控制对系统进行控制,能满足控制系统稳定性、鲁棒性要求。     

混合遗传算法求解高超音速飞行器弹道优化

高超音速巡航导弹最优上升轨道设计问题是终端时刻未定、终端约束苛刻的最优控制问题,经典算法求解这类问题时对初值选取敏感、局部收敛等问题表现得比较突出.针对上述问题,将具有良好全局收敛性的遗传算法应用到导弹最优上升段设计问题求解中,为了提高遗传算法的收敛速度和克服早熟问题,结合单纯形和Powell算法的优点,设计了两种混合遗传算法.通过所设计的两种混合遗传算法的求解结果和分别用单纯形以及Powell算法的求解结果进行比较,得出所设计的混合遗传算法是更有效的求解高超声速巡航导弹轨迹优化的方法.     

智能天线中的干扰抑制算法研究

智能天线技术是是第三代移动通信系统采用的抗干扰关键技术.智能天线技术研究的核心是波束赋型的算法,但各种算法均存在计算量大和收敛速度较慢等缺点,如何提高系统性能成为一个重要课题.提出了一种新的用于智能天线中抑制干扰的波束形成算法,阐述了阵列天线波束形成的最佳权向量技术和估计信号波达方向的改进MUSIC算法,并对其进行了仿真实验.理论分析及仿真结果表明,与目前其它方法相比,具有空间分辨力高、计算量小、稳健性好等优点,有较强的实用性.     

关键词最优路径查询的分段拓展算法

关键词最优路径查询（KOR）查找在满足关键词全覆盖和路径长度约束条件下,时间开销最小的路线常用于旅行规划。现有优化算法虽然采用各种剪枝策略缩小搜索规模,但是本质上是广度优先搜索,在查找长路径时,搜索规模依然过大,执行时间长。针对该问题,提出一种关键词最优路径查询的分段拓展算法（SE-KOR）。SE-KOR算法根据关键词倒排索引表构建关键词顶点路径,将路径划分为多段分别拓展,降低搜索规模,从而缩短执行时间。该算法在路径拓展时给出路径走向,而现有剪枝策略不控制路径拓展方向,因此提出局部代价阈值剪枝,控制路径的走向沿关键词顶点路径拓展,并综合运用近似支配、可行解目标值剪枝和全局优先拓展策略加速拓展。实验结果表明,在不损失精度的情况下,该算法执行时间分别在不同关键词个数、代价阈值与查询图规模下至少缩短8.0%、61.0%和57.7%。