Near-optimal cumulative longitude low-thrust orbit transfer

The indirect method for the continuous low-thrust near minimum cumulative longitude orbit transfer problem is addressed. The movement of the satellite is described by the Gauss equation using the modified equinoctial elements and replacing time as the system independent variable by the cumulative longitude. The maximum principle is adapted to design the optimal control in order to minimize the final cumulative longitude, and the twopoint- boundary-value problem is derived from the orbit transfer problem. The single shooting method is applied in a numerical experiment, and the simulations demonstrate that the orbit transfer mission is fulfilled and the product of the maximal thrust and the minimum cumulative longitude is near constant.     

Robust fault detection and diagnosis for uncertain nonlinear systems

This paper considers robust fault detection and diagnosis for input uncertain nonlinear systems. It proposes a multi-objective fault detection criterion so that the fault residual is sensitive to the fault but insensitive to the uncertainty as much as possible. Then the paper solves the proposed criterion by maximizing the smallest singular value of the transformation from faults to fault detection residuals while minimizing the largest singular value of the transformation from input uncertainty to the fault detection residuals. This method is applied to an aircraft which has a fault in the left elevator or rudder. The simulation results show the proposed method can detect the control surface failures rapidly and efficiently.     

Online blind source separation based on joint diagonalization

A now algorithm is proposed for joint diagonalization. With a modified objective function, the now algorithm not only excludes trivial and unbalanced solutions successfully, but is also easily optimized. In addition, with the new objective function, the proposed algorithm can work well in online blind source separation (BSS) for the first time, although this family of algorithms is always thought to be valid only in batch-mode BSS by far. Simulations show that it is a very competitive joint diagonalization algorithm.     

Closed circle DNA algorithm of change positive-weighted Hamilton circuit problem

Chain length of closed circle DNA is equal. The same closed circle DNA's position corresponds to different recognition sequence, and the same recognition sequence corresponds to different foreign DNA segment, so closed circle DNA computing model is generalized. For change positive-weighted Hamilton circuit problem, closed circle DNA algorithm is put forward. First, three groups of DNA encoding are encoded for all arcs, and deck groups are designed for all vertices. All possible solutions axe composed. Then, the feasible solutions axe filtered out by using group detect experiment, and the optimization solutions are obtained by using group insert experiment and electrophoresis experiment. Finally, all optimization solutions are found by using detect experiment. Complexity of algorithm is concluded and validity of DNA algorithm is explained by an example. Three dominances of the closed circle DNA algorithm are analyzed, and characteristics and dominances of group delete experiment axe discussed.     

High efficient moving object extraction and classification in traffic video surveillance

Moving object extraction and classification are important problems in automated video surveillance systems. A background model based on region segmentation is proposed. An adaptive single Gaussian background model is used in the stable region with gradual changes, and a nonparametric model is used in the variable region with jumping changes. A generalized agglomerative scheme is used to merge the pixels in the variable region and fill in the small interspaces. A two-threshold sequential algorithmic scheme is used to group the background samples of the variable region into distinct Gaussian distributions to accelerate the kernel density computation speed of the nonparametric model. In the feature-based object classification phase, the surveillance scene is first partitioned according to the road boundaries of different traffic directions and then re-segmented according to their scene localities. The method improves the discriminability of the features in each partition. AdaBoost method is applied to evaluate the relative importance of the features in each partition respectively and distinguish whether an object is a vehicle, a single human, a human group, or a bike. Experimental results show that the proposed method achieves higher performance in comparison with the existing method.     

基于双向投影法的概率语言多属性群决策

针对概率语言信息下的多属性群决策问题,首先基于概率语言术语集(probabilistic linguistic term sets, PLTS)的调整规则和语言尺度函数,定义了PLTS的新运算,并证明其满足代数运算的基本性质。然后,为解决现有向量模公式在下标对称语言下计算结果与实际不符的问题,提出一种改进的概率语言信息下的向量模公式。在此基础上定义方案与正、负理想解形成的向量表示式,并建立针对概率语言信息的双向投影法,由此提出新的贴近度公式。最后,通过应用算例的对比分析验证了本文所提方法的有效性和可行性。该方法充分考虑了PLTS的数据特征,在简化计算的同时避免了信息损失,为解决概率语言信息中数值差异较小的问题提供了新的方法和思路。     

控制污染物排放的支线机场跑滑结构优化仿真

民航运输在LTO(Landing and take-off)循环阶段的大气污染物排放对地面人员和近地环境危害较大,应主要通过减少地面滑行时间进行控制。考虑支线机场常见的单跑滑结构给出飞机地面滑行时间计算方法,基于该方法提出了污染物评价指标并建立了支线机场航空器污染物排放评估模型。以某支线机场为例,使用Matlab建模计算得出污染物评价指数最小滑行道口位置。利用AirTOp仿真验证了模型计算结果有效性,优化后的跑道出口位置将使该机场污染物总指数较原位置降低21.7%。     

基于仿真的无人机空袭沙特油田事件探索性分析

以2019 年9 月也门空袭沙特油田事件为例,提出一种基于仿真的危机事件快速分析方法,将仿真与探索性分析相结合,对危机事件进行全面的分析与处理。根据沙特、也门关于事件细节的公开资料,基于仿真推演复盘此次空袭的作战情况,校验各方在事件声明中细节的合理性和真实性,同时可为我国防御“低、小、慢”无人机的发展和作战研究提供借鉴意义。     

用Melnikov函数的数值积分法估计混沌阈值

用Melnikov方法对含高阶非线性项的微分方程进行研究。由于很难得到Melnikov函数的解析表达式,故采用数值积分法求解,从而得到可能出现混沌的阈值曲线。并由给定参数计算出相应的混沌阈值,数值仿真结果与Melnikov函数的数值解是一致的。     

An Evolutionary Real-Time 3D Route Planner for Aircraft

Abstract: A novel evolutionary route planner for aircraft is proposed in this paper. In the new planner, individual candi-dates are evaluated with respect to the workspace, thus the computation of the configuration space is not required. By usingproblem-specific chromosome structure and genetic operators, the routes are generated in real time, with different missionconstraints such as minimum route leg length and flying altitude, maximum turning angle, maximum climbing/diving an-gle and route distance constraint taken into account.