基于拉格朗日松弛算法的终端区飞机排序研究

终端区飞机排序问题是减少航班延误、降低成本的关键技术.考虑机型运行成本和飞机总延误时间,建立一个0~1整数规划模型.因其是一个组合优化问题,多约束相互制约,采用拉格朗日松弛算法将复杂约束转换为线性约束进行求解.仿真结果表明,求得的进近队列延误小、延误成本低、无冲突,且拉格朗日松弛算法计算得到的结果更为可靠,符合实际运行需求,结果优于传统的启发式算法.     

终端区飞机排序的规划模型和算法研究

对终端区到达飞机进行排序是终端区交通管理自动化系统的一项主要任务。提出了一种新的终端区规划排序模型，把飞机的排序问题看作等价于带有准备好时间的渐增周游店员问题，并给出了兼顾解的最优性和计算复杂性的快速启发式算法。分析了静态和动态两种情况，并且考虑了实际的运行限制。计算结果表明，所给模型和算法具有良好的规划性能，能较好地解决终端区排序问题，可应用于我国空中战术流量管制系统。     

基于遗传算法的起降航班动态排序模型的研究

讨论了空中交通流量管理中终端区航班的排序规划问题。目的是在终端区空中交通繁忙的情况下有效地为到达航班安排合理的着陆次序，并在不违反飞机间隔要求的情况下给出各飞机经过优化的着陆时间，提高机场跑道的利用率。引入离场起飞的航班问题，建立了航班排序的动态模型和基于遗传算法的终端区动态排序算法。并对一个算例采用冬文方法进行验证计算，结果表明，所提出的方法计算效率高，实用可行。     

终端区飞机排序的模糊综合评判方法研究

研究了模糊综合评判方法在机场终端区飞机排序中的应用。介绍了终端区管制的要求及方式,提出了一种终端区飞机排序的模糊综合评判算法;并给出了仿真算例。仿真结果表明,模糊综合评判排序方法通过设置各因素权重,可在综合考虑各因素的基础上使得系统总延迟尽量减少。     

基于动态规划的航班着陆调度算法

为了解决机场终端区空中交通流量高速增长造成的进近冲突,合理安排飞机着陆次序,充分利用跑道容量,减少航班延误,提出了一种基于动态规划方法的航班着陆调度算法,算法结合了MPS约束、优化深度限制和时间窗限制约束和其他多项约束,并采用了动态规划的方法来减少计算量。仿真结果表明,算法能满足现实复杂空管条件下的各种限制约束,可应用于实时的ATC自动化系统,并能输出合理可行的排序结果,明显减少航班队列的延误。     

基于管制习惯的多跑道机场离场航班排序

针对我国航空迅速发展致使终端区空域拥挤以及航班延误问题,研究了繁忙多跑道机场的离场航班排序问题,以缓解终端区空域拥挤和减少航班延误及提高跑道利用率。将管制习惯因素引入到离场航班的排序中,根据飞机尾流间隔的要求,建立基于管制员管制习惯的多跑道机场离场航班排序模型。针对机场小规模的离场航班流量,采用穷举法求解,并用算例进行仿真验证。结果表明,与先到先服务排序方法相比,经算法排序后的总延误时间减少了近30％。     

多机场终端区进离场交通流协同排序方法

针对大都市及都市圈飞行冲突、空域拥堵和航班延误日益严峻的现状,研究了多机场终端区进离场交通流协同排序问题。综合考虑尾流间隔、跑道间隔、时间窗、进离场容量等约束限制,从时空多维角度引入航班满意度概念,建立了多机场终端区进离场交通流协同排序模型,设计了带精英策略的非支配排序多目标遗传算法(NSGA-II),寻求多机场终端区进离场排序问题的Pareto最优解。实例验证表明,所提方法可对多机场终端区进离场交通流进行优化排序,有效降低航班延误总时间,显著提高航班总满意度,并实现多机场系统对终端区空域资源的公平均衡使用。与经典的先到先服务策略相比,协同排序策略的整体优化效果较为显著,其中航班延误时间得到了一定的降低。     

五边平行进近冲突风险定量分析模型

针对飞机五边平行进近时飞行冲突,提出了一种五边平行进近飞行冲突定量分析模型。模型通过飞机在任意时刻的标称位置坐标与因不确定性因素导致的航迹偏移量之和,形成飞机任意时刻真实位置坐标,基于此推导出飞机在五边平行进近时冲突风险计算公式。在分析不确定性因素导致航迹偏离时,提出了一种基于布朗运动的随机过程来描述因干扰因素导致飞机随机运动的方法。在建立模型后,使用蒙特卡罗仿真方法计算了飞行冲突概率,结果理想。     

基于遗传算法的终端区航迹优化方法

为了对终端区的航迹进行优化设计,以数学中的最优化理论为基础并借助遗传算法,根据设计所追求的性能目标建立了目标函数;在满足给定的约束条件下,寻求最优的设计方案,构建了科学的终端区航迹。仿真结果表明,所设计的方法有效地解决了终端区飞行航迹存在的飞行冲突和限制区避让等问题,保证了飞机在终端区飞行的安全性和经济性。     

基于改进遗传算法的终端区排序研究

终端区航班排序是减少航班延误,降低成本的关键技术。基于安全性考虑,将进近无冲突作为约束条件,这是一个组合优化问题,多约束条件互相制约,导致可行解较难获得。采用改进遗传算法,针对航班速度编码的特性引入局部适应度函数,并以此为标准指导交叉变异操作。仿真结果表明,求得的进近队列延误低、无冲突,且遗传更具方向性,收敛快,大大提升求解速度,更符合实际运用中实时性要求,优于传统方法。     

Test sequencing problem arising at the design stage for reducing life cycle cost

Previous test sequencing algorithms only consider the execution cost of a test at the application stage. Due to the fact that the placement cost of some tests at the design stage is considerably high compared with the execution cost, the sequential diagnosis strategy obtained by previous methods is actually not optimal from the view of life cycle. In this paper, the test sequencing problem based on life cycle cost is presented. It is formulated as an optimization problem, which is non-deterministic polynomial-time hard (NP-hard). An algorithm and a strategy to improve its computational efficiency are proposed. The formulation and algorithms are tested on various simulated systems and comparisons are made with the extant test sequencing methods. Application on a pump rotational speed control (PRSC) system of a spacecraft is studied in detail. Both the simulation results and the real-world case application results suggest that the solution proposed in this paper can significantly reduce the life cycle cost of a sequential fault diagnosis strategy.     

吸气式空天飞行器闭环上升制导研究

闭环上升制导是吸气式空天飞行器达到快速优化、实时规划以及自主制导的必然要求。采用GHAME吸气式空天飞行器作为研究对象,提出了闭环上升制导最优控制方案,重点论证了该方案不存在关于节流阀值的奇异问题,并阐述了最优推力控制的Bang-Bang控制。引入有限差分法求解两点边值问题,并通过终端时刻调节算法求解终端时刻自由问题。仿真结果表明,所提出的闭环制导算法是有效、可行的,具有显著的优越性。     

A strategic flight conflict avoidance approach based on a memetic algorithm

Conflict avoidance （CA） plays a crucial role in guaranteeing the airspace safety. The cur- rent approaches, mostly focusing on a short-term situation which eliminates conflicts via local adjust- ment, cannot provide a global solution. Recently, long-term conflict avoidance approaches, which are proposed to provide solutions via strategically planning traffic flow from a global view, have attracted more attentions. With consideration of the situation in China, there are thousands of flights per day and the air route network is large and complex, which makes the long-term problem to be a large-scale combinatorial optimization problem with complex constraints. To minimize the risk of premature convergence being faced by current approaches and obtain higher quality solutions, in this work, we present an effective strategic framework based on a memetic algorithm （MA）, which can markedly improve search capability via a combination of population-based global search and local improve- ments made by individuals. In addition, a specially designed local search operator and an adaptive local search frequency strategy are proposed to improve the solution quality. Furthermore, a fast genetic algorithm （GA） is presented as the global optimization method. Empirical studies using real traffic data of the Chinese air route network and daily flight plans show that our approach outper- formed the existing approaches including the GA .based approach and the cooperative coevolution based approach as well as some well-known memetic algorithm based approaches.     

Rendezvous Navigation and Guidance Using a Hand-Held Self-Powered Digital Computer

This paper describes a simplified solution of the space rendezvous problem based on optical sightings taken with a hand-held sextant entered into and processed by a small digital computer. Compared to the manual method described in [1], this approach greatly reduces the astronaut's work load. Also, the computer can provide a more accurate solution, can present more flight plan options (allowing more tradeoffs between fuel usage and time), and can allow greater freedom in the sequencing of measurements and maneuvers. Physical characteristics, input-output parameters, and logic design of the computer are briefly described.     

Application of the Conjugate Gradient Method to a Problem on Minimum Time Orbit Transfer

This correspondence considers the problem of optimally controlling the thrust steering angle of an ion-propelled spaceship so as to effect a minimum time coplanar orbit transfer from the mean orbital distance of Earth to mean Martian and Venusian orbital distances. This problem has been modelled as a free terminal time-optimal control problem with unbounded control variable and with state variable equality constraints at the final time. The problem has been solved by the penalty function approach, using the conjugate gradient algorithm. In general, the optimal solution shows a significant departure from earlier work. In particular, the optimal control in the case of Earth-Mars orbit transfer, during the initial phase of the spaceship's flight, is found to be negative, resulting in the motion of the spaceship within the Earth's orbit for a significant fraction of the total optimized orbit transfer time. Such a feature exhibited by the optimal solution has not been reported at all by earlier investigators of this problem.     

Target Track Pulse Scheduling

The problem of scheduling radar tracking pulses in a dense target environment where the position estimation error must be constrained to avoid false return with track correlations is considered. The problem is to schedule n fixed energy pulses such that the rangerate error is minimized at some final time subject to the constraint that the position error will be smaller than some value for the whole time interval. For a fixed time interval, the problem of finding the minimum number of radar measurements required to satisfy the position estimation error constraint is solved. A closed-form solution for the optimum schedule is given in the case where the number of pulses is equal to the minimum number of pulses. For cases where one extra pulse is available, a solution method is described and an algorithm is derived.     

基于控制理论和NS方程的气动设计方法研究

研究了基于控制理论和NS方程的气动设计方法,针对给定的目标函数表达形式,应用该设计理论在计算坐标下详细推导了相应的共轭方程及边界条件具体表达形式,以及梯度方程求解表达式,通过合理的数学变换,导出了共轭方程在笛卡尔坐标系下的直观表达形式,发展了有效的共轭方程数值求解方法,通过流动控制方程数值求解、共轭方程数值求解、目标函数对设计变量的梯度求解和优化算法等方面的有效结合,研究与发展了一种新的气动设计方法,以二维机翼气动设计为例,成功进行了亚、跨音速情形下的相关设计算例研究,研究结果表明应用控制理论和NS方程的气动设计方法在设计理论、适用性以及时间花费等方面都有着很好的特色和优点,且设计结果也更为可靠.     

Orbital rendezvous using two-step sliding mode control

The problem of spacecraft rendezvous is studied, using sliding mode control in the presence of the earth's gravitational perturbation. The impulsive solution of Lambert's problem is obtained using the combined equations method to minimize total ΔV via an iterative method, and it is used as the desired trajectory for the rendezvous. In this paper, a two-step sliding mode control method is introduced for solving the rendezvous problem with finite-thrust including unmodeled dynamics.The thrust-coast-thrust type control laws for the system to follow the desired trajectories are represented and resultant trajectories are close enough to the Lambert's orbit with comparable amount of ΔV to the Lambert's impulsive solution. All state variables matched the final boundary conditions reasonably well at the end of maneuver.