DOA and steering vector estimation using a partially calibratedarray

We consider the problem of estimating directions of arrival (DOAs) using an array of sensors, where some of the sensors are perfectly calibrated, while others are uncalibrated. We identify a cost function whose minimizer is a statistically consistent and efficient estimator of the unknown parameters-the DOAs and the gains and phases of the uncalibrated sensors. Next we present an iterative algorithm for finding the minimum of that cost function The proposed algorithm is guaranteed to converge. The performance of the estimation algorithm is compared with the Cramer Rao bound (CRB). The derivation of the bound is also included. It is shown that DOA accuracy can be improved by adding uncalibrated sensors to a precisely calibrated array. Moreover, the number of sources that can be resolved may be larger than the number that can be resolved by the calibrated portion of the array     

航路网络生成及优化

空中交通流运行的安全性和成本取决于航路网络结构。基于节点度实现航路网络枢纽节点和干线节点分层,利用全局耦合生成主干网络,运用距离连接概率实现干线节点社区化,采用连接概率生成社区网络;采用DBSCAN聚类算法,基于角度和距离实现航路网络优化;以中国大陆空域为例,实现了主干航路网络和局部干线航路网络的生成及优化,验证了方法的可行性。在与相关研究对比,基于节点度的枢纽节点选取更加客观合理,所构建的分层航路网络结构符合机场点的分布特性,采用DBSCAN聚类算法优化效率明显提高。     

商用飞机的经济性设计

介绍商用飞机经济性设计的定义,阐述商用飞机经济性设计的主要研究内容,提出商用飞机设计使用的指标框架体系。在此基础上,给出商用飞机经济性设计的主要方法和分析模型。最后提出民机经济性设计的研究方向。     

Core-based Shared Tree Multicast Routing Algorithms for LEO Satellite IP Networks

A new core-based shared tree algorithm, viz core-cluster combination-based shared tree （CCST） algorithm and the weighted version （i.e. w-CCST algorithm） are proposed in order to resolve the channel resources waste problem in typical source-based multicast routing algorithms in low earth orbit （LEO） satellite IP networks. The CCST algorithm includes the dynamic approximate center （DAC） core selection method and the core-cluster combination multicast route construction scheme. Without complicated onboard computation, the DAC method is uniquely developed for highly dynamic networks of periodical and regular movement. The core-cluster combination method takes core node as the initial core-cluster, and expands it stepwise to construct an entire multicast tree at the lowest tree cost by a shortest path scheme between the newly-generated core-cluster and surplus group members, which results in great bandwidth utilization. Moreover, the w-CCST algorithm is able to strike a balance between performance of tree cost and that of end-to-end propagation delay by adjusting the weighted factor to meet strict end-to-end delay requirements of some real-time multicast services at the expense of a slight increase in tree cost. Finally, performance comparison is conducted between the proposed algorithms and typical algorithms in LEO satellite IP networks. Simulation results show that the CCST algorithm significantly decreases the average tree cost against to the others, and also the average end-to-end propagation delay ofw-CCST algorithm is lower than that of the CCST algorithm.     

航线网络中基于最小费用流的航线选择问题

针对航线网络中航线选择优化问题,分析了空中交通航线网络结构和空中交通流的特点,给出了空中交通航线网络的数学描述,考虑从求解最小费用流问题的角度寻求最优航线,建立了航线网络中求解最小费用流问题的数学模型。借鉴了连续时间网络最小费用流问题中结点到达费用的概念,并结合简单算例的求解验证了航线网络中用最小费用流方法选择航线的可行性,具有良好的计算性能。     

适于低轨卫星IP网络的单核共享树组播算法(英文)

为了解决低轨卫星IP网络中现有典型源组播算法的信道资源浪费问题,本文提出了一套单核共享树组播算法,即核心群合并共享树(CCST)和加权核心群合并共享树(w-CCST)算法。CCST 算法包括动态近似中心(DAC)选核方法和核心群合并组播路径构建方法。DAC方法专为周期、规律运动的低轨卫星网络提出,不需要复杂的星上计算。在核心群合并方法中,以核节点作为初始核心群,通过核心群和剩余组成员的最短路径方法逐步扩展直至整棵组播树构建完成,从而使得组播树的树代价最小,大大提高了网络的带宽利用率和组播传输效率。w-CCST 算法中所提出的加权因子可以调整树代价和端到端传播时延之间的折衷程度,因此,可以通过调整加权因子来适度增大树代价、降低端到端传播时延以支持某些端到端时延要求苛刻的实时组播业务。最后,与低轨卫星 IP 网络中典型算法进行了性能比较,仿真结果说明,CCST 算法的平均树代价比其它算法显著降低,w-CCST 算法的平均端到端传播时延小于 CCST 算法。     

飞机座舱显示系统画面显示质量的研究

由于飞行状态姿态复杂多变,座舱显示系统的画面也要求动态、实时、清晰。为了有效解决这些问题,提出了刻度线的快速反走样算法。该算法适用于任何直线的反走样绘制,且响应速度快、效果好。文章主要从图形走样产生的根本原因出发,提出了利用算法来消除走样现象,给出了较详细的数学推导,并将此算法应用于罗盘刻度线的生成,效果明显。     

New reference trajectory optimization algorithm for a flight management system inspired in beam search

With the objective of reducing the flight cost and the amount of polluting emissions released in the atmosphere, a new optimization algorithm considering the climb, cruise and descent phases is presented for the reference vertical flight trajectory. The selection of the reference vertical navigation speeds and altitudes was solved as a discrete combinatory problem by means of a graphtree passing through nodes using the beam search optimization technique. To achieve a compromise between the execution time and the algorithm's ability to find the global optimal solution, a heuristic methodology introducing a parameter called ‘‘optimism coefficient was used in order to estimate the trajectory's flight cost at every node. The optimal trajectory cost obtained with the developed algorithm was compared with the cost of the optimal trajectory provided by a commercial flight management system(FMS). The global optimal solution was validated against an exhaustive search algorithm(ESA), other than the proposed algorithm. The developed algorithm takes into account weather effects, step climbs during cruise and air traffic management constraints such as constant altitude segments, constant cruise Mach, and a pre-defined reference lateral navigation route. The aircraft fuel burn was computed using a numerical performance model which was created and validated using flight test experimental data.     

Air route network optimization in fragmented airspace based on cellular automata

Air route network optimization,one of the essential parts of the airspace planning,is an effective way to optimize airspace resources,increase airspace capacity,and alleviate air traffic con gestion.However,little has been done on the optimization of air route network in the fragmented airspace caused by prohibited,restricted,and dangerous areas (PRDs).In this paper,an air route network optimization model is developed with the total operational cost as the objective function while airspace restriction,air route network capacity,and non-straight-line factors (NSLF) are taken as major constraints.A square grid cellular space,Moore neighbors,a fixed boundary,together with a set of rules for solving the route network optimization model are designed based on cellular automata.The empirical traffic of airports with the largest traffic volume in each of the 9 flight information regions in mainland China is collected as the origin-destination (OD) air port pair demands.Based on traffic patterns,the model generates 35 air routes which successfully avoids 144 PRDs.Compared with the current air route network structure,the number of nodes decreases by 41.67％,while the total length of flight segments and air routes drop by 32.03％ and 5.82％ respectively.The NSLF decreases by 5.82％ with changes in the total length of the air route network.More importantly,the total operational cost of the whole network decreases by 6.22％.The computational results show the potential benefits of the model and the advantage of the algorithm.Optimization of air route network can significantly reduce operational cost while ensuring operation safety.     

飞行器航迹规划算法综述

首先给出了飞行器航迹规划的概念和问题描述对航迹规划算法中的轨迹优化、路径规划和基于类比的航迹规划进行了分类介绍，其次对多飞行器编队航迹规划的两种控制方式进行了简单说明．最后指出了航迹规划中需要进一步研究的问题。     

A-SMGCS routing and guidance functions

In the present work it is presented an implementation of two specific functions which are going to be of growing importance in Advanced Surface Movement Guidance and Control Systems (A-SMGCS). Namely the two functions are Routing and Guidance. Routing provides a means to suggest to the airport ground control a best path from any given point on the airfield to any other given point according to a number of constraints and rules. Guidance provides an interface between the system and the pilot and provides guidance aids to the pilot in order to have the airplane on the route generated by the Routing function. Both Functions have been developed under the European Union “Vision” project, in the frame of the Telematics Application Program. A complete A-SMGCS is working now at Navia with simulation scenarios for various airports and will be installed and tested at, at least, two of them. The system is completely modular and can be installed in a number of configurations. In fact, every function is a self-contained program, communicating with each other by the means of computer networks     

Multiple air route crossing waypoints optimization via artificial potential field method

Air route crossing waypoint optimization is one of the effective ways to improve airspace utilization, capacity and resilience in dealing with air traffic congestion and delay. However, research is lacking on the optimization of multiple Crossing Waypoints (CWPs) in the fragmented airspace separated by Prohibited, Restricted and Dangerous areas (PRDs). To tackle this issue, this paper proposes an Artificial Potential Field (APF) model considering attractive forces produced by the optimal routes and repulsive forces generated by obstacles. An optimization framework based on the APF model is proposed to optimize the different airspace topologies varying the number of CWPs, air route segments and PRDs. Based on the framework, an adaptive method is developed to dynamically control the optimization process in minimizing the total air route cost. The proposed model is applied to a busy controlled airspace. And the obtained results show that after optimization the safety-related indicators: conflict number and controller workload reduced by 7.75% and 6.51% respectively. As for the cost-effectiveness indicators: total route length, total air route cost and non-linear coefficient, declined by 1.74%, 3.13% and 1.70% respectively. While the predictability indicator, total flight delay, saw a notable reduction by 7.96%. The proposed framework and methodology can also provide an insight in the understanding of the optimization to other network systems.     

终端区多机协同进场下的飞机性能参数优化方法

为了降低多条航路上下降至同一航路点的多架飞机最后巡航阶段和下降阶段的运行总成本,同时要确保飞机的飞行安全,研究了多架飞机下降至同一航路点时降低总运行成本的参数优化方法。首先,介绍了飞机性能参数计算方法;其次,为了提高寻找飞至同一航路点各架飞机使得总运行成本最低的合适指示空速的计算速度,建立了考虑间隔约束的参数优化模型,并通过精英保留的遗传算法进行优化运算;最后,用某型民用飞机对建立的模型进行算例仿真。结果表明,该模型能准确计算出各架飞机使总运行成本最低的指示空速,对航空公司处理多架飞机下降至同一航路点降低总运行成本有较大的指导意义。     

基于航路耦合容量的协同多航路资源分配

针对中国当前航路空域拥挤日益严重的问题,分3个步骤进行解决:第1步,对空域管制单元之间存在的交通流耦合因素进行分析,建立基于空域管制单元耦合因素的航路容量模型;第2步,为反映不同类型航班对计划到达时间变动范围的不同接受程度,定义了航班的延误成本函数和改航成本函数;第3步,在上述两步的基础上,为充分利用可行的航路空域资源...     

考虑优先级的交叉口航班汇聚排序问题研究

为了有效地利用航路资源,减少飞行延误总成本,建立了改进的航路交叉口汇聚排序模型。为加快求解速度,分析了影响航班延误成本的因素,给出了权重赋值表,改进了现有算法,并用FCFS算法与改进算法进行了算例分析。仿真结果表明,改进算法通过对交叉口航班各属性赋权值可有效进行优先等级划分,完成时隙分配和航班排序的快速计算。采用改进给出的优化排序策略可减少延误飞行的总成本,具有一定的实用性。     

恶劣天气条件下航路网络修复优化

针对恶劣天气条件下可用空域资源不足导致的航班大面积延误问题,基于复杂网络修复理论和交通流分配理论,借鉴交通网络设计思想提出了一种航路网络修复优化策略。首先,建立了航路网络修复场景,基于气象信息生成了恶劣天气飞行受限区。然后,建立了上层模型以修复成本最低为目标函数、下层模型为多约束交通流分配模型的双层规划修复模型,应用改进粒子群算法对模型整体进行求解,结合K最短路径算法对下层模型进行求解。最后,提出局部和全局两类指标对航路网络修复效果进行评估。基于典型航路网络,以两类基础修复策略为对比方法,同时对比了实际运行结果,研究了不同修复策略的修复效果和适用性。仿真结果表明：航路网络修复优化策略既能弥补原有拓扑结构修复策略的结构受限不足,又能解决拓扑结构调整修复策略带来的巨额协调费用问题,能够保证在对正常运行航班干扰最小的同时,以最小的修复成本使所有受影响的航班都恢复正常运行,对于减缓航路拥堵和航班延误有极大的意义。     

基于空域灵活使用的区域航路航线运行管理

利用临时航线和固定航线等手段,建立了区域管制下以最小运行成本为目标的规划模型,在模型中引入了不同机型单位时间的运营成本和临时航线的运营成本来计算总运行成本,并以此为适应度函数,通过遗传算法实现对航班选择飞行航路航线优化,以降低运行成本。计算结果表明:利用模型管理机制进行优化后,经过指定区域的所有航班运行成本与航班在区域外等待成本之和比之前降低约10%。     

大口径碳纤维复合材料天线反射器模具在位测量技术

针对碳纤维复合材料模具修形过程中的型面精度测量,研究一种基于机器人和激光跟踪三维测量系统的在位测量技术。通过测量轨迹规划、坐标系变换,关联在位测量系统中的各个单元,实现两个系统的运动-跟随-采样的连续动作,完成模具型面点云的自动高效采样。在此基础上,研究抛物面型面精度评价算法,实现实测点云和理论模型的最佳拟合,从而获得模具型面精度。结果表明:利用在位测量技术,测量效率大幅提高,型面精度的数值和图形结果能够辅助模具的高效修形。     

空中交通相依网络的脆弱性研究

机场、航路和管制扇区构成空中交通相依网络,节点在受到扰动时,网络运输性能下降,引发网络脆弱性。提出一种空中交通相依网络脆弱性的度量方法,首先构建机场网络、航路网络和管制扇区网络3个层网络,基于空中交通管理规则与层网络间的逻辑连接关系,建立空中交通相依网络模型。在随机扰动和蓄意扰动节点两种不同失效模式下,采用最大连通度和结构熵两个指标,并给出了相应算法,分析相依网络的结构脆弱性;创建流量熵和交通流损失比指标,设计了相应算法,研究相依网络的功能脆弱性。研究结果表明,随机扰动对空中交通相依网络影响更大;网络的结构脆弱源与功能脆弱源是机场网络;网络的脆弱性与层网络间的连接方式和层网络的交通量不匹配有关。     

单枢纽机场选址与航线网络规划综合优化

枢纽机场选址与航线网络优化问题是近年来受到民航业界广泛关注的热点问题之一。考虑到枢纽机场建设对航线网络的反作用,提出了单枢纽机场选址与航线网络规划综合优化问题。为了描述该问题,建立了基于空中交通均衡分配的成本最优的数学规划模型。最后,给出了求解该模型的迭代优化算法,并进行了算例验证。