机动性约束下低空突防航迹规划算法研究

研究飞行器多目标优化问题,为了寻求安全突防的飞行轨迹,结合低空突防中对飞行器实际飞行轨迹的要求,对航迹规划算法进行了研究.针对改善目前航迹规划过程中所存在的几何建模困难和所得轨迹不能符合实际可飞的问题,提出了一种新的垂直面轨迹规划方法.方法在水平面规划的基础上重点分析了飞行器垂直面内的运动状态,结合过载、航迹倾角等机动性约束条件对垂直面内的运动轨迹进行研究,将实际复杂的飞行轨迹简化为由直线段和圆弧段衔接而成的轨迹模型,针对简化模型进行轨迹规划.仿真结果表明,能够得到满足约束条件,并符合实际飞行的航迹.     

基于改进分段Gauss伪谱法的带推力高超声速 飞行器再入轨迹规划

再入轨迹规划是高超声速飞行器领域的热点问题,已吸引了众多国内外专家的关注. Gauss伪谱法以及分段Gauss伪谱法是解决含有多约束轨迹规划问题的一类有效工具.然而,发动机多次点火熄火导致推力不连续以及点火时刻控制输入的连续性要求是带推力高超声速飞行器再入轨迹优化面临的新挑战.本文将问题简化为多脉冲再入轨迹规划问题,基于改进分段Gauss伪谱法生成满足多条件约束的最优再入轨迹.通过设置分段Gauss伪谱法连续性条件,确保飞行器状态与控制输入在分段点处连续衔接.通过无动力自由再入与带推力再入算例对改进分段Gauss伪谱法进行说明,仿真结果也表明,改进分段Gauss伪谱法可有效求解带推力高超声速飞行器再入轨迹规划.     

基于能量管理的飞翼飞行器迫降轨迹设计

针对飞翼类飞行器迫降轨迹设计问题,建立力学运动模型对无动力滑翔过程进行分析,采用满足始末端约束和飞行器性能约束的Dubins轨迹进行轨迹搜索,并提出根据迫降初始能量状态采用广义Dubins类型航线规划低能迫降轨迹和高能迫降轨迹。通过批量仿真验证了迫降飞行阶段分段管理和能量实时评估实现迫降轨迹设计的方法使飞行器精确回收到迫降点的同时兼具适应环境干扰的鲁棒性,对实际工程应用具有重要意义。     

三维自主再入制导方法

基于阻力加速度-能量剖面设计,提出一种新的三维自主再入制导方法.该方法的阻力加速度-能量剖面由再入走廊上边界和下边界内插得到,倾侧角采用两次反转模式,轨迹规划同时考虑了飞行器的纵向和横向运动,并具有在线生成三维轨迹的能力.最后对制导方法的适应性进行了仿真分析,仿真结果表明给出的再入制导方法能适应不同情况的再入,使飞行器在具有较好轨迹特性的同时以较高的精度到达末端能量管理界面.     

高超声速飞行器水平航迹规划算法研究

伴随高超声速飞行器的出现,防空系统也变得越来越复杂,为了提高高超声速飞行器在空战中的生存概率,有必要对多约束远程轨迹优化技术进行深入研究.给出了航迹生存概率函数及局部重新规划区域的确定方法,且对变种群遗传算法、稀疏A*变步长搜索算法和动态规划方法进行了研究.并应用这三种改进后的算法对高超声速飞行器的航迹进行了规划,仿真结果表明,变种群遗传算法比较慢,只适合于离线规划,后两种算法应用在离线和在线实时规划时,都能快速的得到令人满意的航迹.     

基于遗传算法的飞行器参考航迹规划

针对飞行器航迹规划问题展开研究,为了规划出最优满意的飞行轨迹,分析了飞行器航迹规划中存在的威胁与自身约束条件,提出了一种关于遗传算法的航迹规划方案,采用改进编码机制对飞行器在已知威胁情况下飞行航迹进行整体规划。取航迹个体只包含一个染色体,每个染色体为一个航迹点序列,随机生成种群,通过选择交叉变异,并将各种威胁和约束条件的影响适当的加入到适应值函数中,得到优化路径进行仿真。仿真结果给出了不同加权比例下所得到的最优航迹,通过仿真验证了算法的有效性。     

基于伪谱法的滑翔轨迹多级迭代优化策略

伪谱法可实时求解具有高度非线性动态特性的飞行器最优轨迹;以X-51A相似飞行器模型为研究对象,采用增量法与查表插值建立纵向气动力模型,伪谱法与序列二次规划算法求解滑翔轨迹最优控制问题;提出使用多级迭代优化策略,为序列二次规划算法求解伪谱法参数化得到的大规模非线性规划问题提供初值,弥补序列二次规划算法在求解大规模非线性规划问题过程中,出现的初值敏感、收敛速度减慢等问题。通过与传统方法求解出的状态量与控制量仿真飞行状态进行对比,证明了多级迭代优化策略的有效性和高效性,该策略在实际工程应用中取得了良好效果。     

基于卡尔曼滤波的轨迹规划高度修正仿真实现

综合地形跟随/地形回避（TF/TA）是新一代低空突防技术,其中的轨迹规划技术是飞行器低空突防飞行控制律设计的重要依据.针对飞行器实时飞行过程中存在各种误差因素影响规划轨迹性能的情况,设计卡尔曼滤波器在实时轨迹规划中对所获取的飞行器高度值进行修正,可以获得比较精确的离地高度信息提供给飞行器,从而增加飞行器的安全系数.建立系统的状态与观测数学模型,在给定初始值和噪声方差阵的情况下进行了仿真.仿真结果显示所设计的卡尔曼滤波器可行,大大减小了组合导航系统误差模型的作用效果.     

飞行器上升段轨迹的优化设计

针对飞行器上升段轨迹优化求解困难的问题,提出一种基于正交配点的优化求解方法。该方法以第二类切比雪夫正交多项式的零点作为系统控制变量和状态变量的离散点,利用拉格朗日插值多项式对状态和控制变量进行拟合。通过对多项式的求导将动力学微分方程约束转化为代数约束,从而把无限维的最优控制问题转化为一个有限维的非线性规划(Nonlinear Programming,NLP)问题。随后,利用序列二次规划(Sequential Quadratic Program-ming,SQP)方法求解转化后的NLP问题,获得最优的飞行轨迹。最后,飞行器上的仿真结果验证了所提方法的有效性。研究成果可为飞行器的制导控制提供可行的飞行轨迹,有一定的工程应用价值。     

平面四旋翼无人飞行器运送系统的轨迹规划与跟踪控制器设计

对于四旋翼无人飞行器运送系统而言,需要保证飞行过程中负载的摆幅维持在适当的范围内,并且在飞行器到达目的地后负载无残余摆动.本文针对四旋翼无人飞行器运送系统,提出了一种新颖的轨迹规划与跟踪控制方法.论文首先得到了平面四旋翼无人飞行器的运动特性与负载摆角之间的非线性耦合关系.通过相平面内的几何分析,分别设计了两个轴方向上的分段式加速度轨迹.这种轨迹具有简洁的解析表达式并可获得较高的运送效率,同时满足飞行器的速度,加速度等物理约束.为了使四旋翼无人飞行器准确跟踪规划好的轨迹,本文基于反步法设计了一种非线性跟踪控制器,并通过李雅普诺夫方法对其闭环稳定性进行分析,证明其能使跟踪误差指数收敛于零.论文最后通过仿真结果验证了本文所提出方法的可行性与有效性,及其对外界干扰的鲁棒性.     

On‐line estimation and path planning for multiple vehicles in an uncertain environment

A unified approach to cooperative target tracking and path planning for multiple vehicles is presented. All vehicles, friendly and adversarial, are assumed to be aircraft. Unlike the typical target tracking problem that uses the linear state and nonlinear output dynamics, a set of aircraft nonlinear dynamics is used in this work. Target state information is estimated in order to integrate into a path planning framework. The objective is to fly from a start point to a goal in a highly dynamic, uncertain environment with multiple friendly and adversarial vehicles, without collision. The estimation architecture proposed is consistent with most path planning methods. Here, the path planning approach is based on evolutionary computation technique which is then combined with a nonlinear extended set membership filter in order to demonstrate a unified approach. A cooperative estimation approach among friendly vehicles is shown to improve speed and routing of the path. Copyright © 2004 John Wiley & Sons, Ltd.     

Multi-vehicle consensus with a time-varying reference state

In this paper, we study the consensus problem in multi-vehicle systems, where the information states of all vehicles approach a time-varying reference state under the condition that only a portion of the vehicles (e.g., the unique team leader) have access to the reference state and the portion of the vehicles might not have a directed path to all of the other vehicles in the team. We first analyze a consensus algorithm with a constant reference state using graph theoretical tools. We then propose consensus algorithms with a time-varying reference state and show necessary and sufficient conditions under which consensus is reached on the time-varying reference state. The time-varying reference state can be an exogenous signal or evolve according to a nonlinear model. These consensus algorithms are also extended to achieve relative state deviations among the vehicles. An application example to multi-vehicle formation control is given as a proof of concept.     

Solution for state constrained optimal control problems applied to power split control for hybrid vehicles

This paper presents a numerical solution for scalar state constrained optimal control problems. The algorithm rewrites the constrained optimal control problem as a sequence of unconstrained optimal control problems which can be solved recursively as a two point boundary value problem. The solution is obtained without quantization of the state and control space. The approach is applied to the power split control for hybrid vehicles for a predefined power and velocity trajectory and is compared with a Dynamic Programming solution. The computational time is at least one order of magnitude less than that for the Dynamic Programming algorithm for a superior accuracy.     

有向切换通信拓扑下多无人机分布式编队控制

本文对多无人机分布式时变编队控制问题进行了研究. 无人机之间的通信拓扑假定是有向和切换的. 基于 自身状态与邻居状态的相对局部信息构建了分布式编队控制器. 通过引入一个恰当的编队误差向量, 将有向切换 通信拓扑下的多无人机编队问题转化为一个切换系统的镇定问题. 基于Lyapunov稳定性分析方法得到了达成编队 的充分性条件. 仿真实验结果验证了结论的有效性.     

Stabilization of sets with application to multi-vehicle coordinated motion

In this paper, we develop stability and control design framework for time-varying and time-invariant sets of nonlinear dynamical systems using vector Lyapunov functions. Several Lyapunov functions arise naturally in multi-agent systems, where each agent can be associated with a generalized energy function which further becomes a component of a vector Lyapunov function. We apply the developed control framework to the problem of multi-vehicle coordinated motion to design distributed controllers for individual vehicles moving in a specified formation. The main idea of our approach is that a moving formation of vehicles can be characterized by a time-varying set in the state space, and hence, the problem of distributed control design for multi-vehicle coordinated motion is equivalent to the design of stabilizing controllers for time-varying sets of nonlinear dynamical systems. The control framework is shown to ensure global exponential stabilization of multi-vehicle formations. Finally, we implement the feedback stabilizing controllers for time-invariant sets to achieve global exponential stabilization of static formations of multiple vehicles.     

Robust RHC for wheeled vehicles with bounded disturbances

The robust receding horizon control (RHC) synthesis approach is developed in this paper, for the simultaneous tracking and regulation problem (STRP) of wheeled vehicles with bounded disturbances. Considering the bounded disturbances, we firstly provide a robust positively invariant (RPI) set and associated feedback controller for the perturbed vehicles, which contribute to the foundation of the robust RHC synthesis approach. Then, by extending the tube‐based approach introduced in the article of Mayne et al (robust model predictive control of constrained linear systems with bounded disturbances in Automatica, 2005, vol. 41) to the STRP of wheeled vehicles, we employ the designed RPI set to determine the robust tube and terminal state region, and further construct a nominal optimal control problem. The actual control input is implemented by correcting the solved nominal input with the designed feedback controller. Following the contributed properties of the developed RPI set and extended tube‐based approach, a robust RHC algorithm is finally proposed with the guarantees of recursive feasibility and robust convergence, which can also be adapted for real‐time implementation. Additionally, due to the elaborate control design, the effect of disturbances can be completely nullified to achieve better tracking performance. The effectiveness and advantage of the proposed approach are illustrated by two simulation examples.     

Agent-based modeling and evolutionary computation for disseminating public advisories about hazardous material emergencies

In the event of a large-scale disaster, an important aspect of humanitarian logistics is the distribution of information or warnings to the affected population. This research develops the problem formulation and solution approach for a specific routing for relief problem, in which warnings should be disseminated to an affected community, using public announcement systems mounted on emergency vehicles. The problem statement is formulated to maximize the number of individuals of a community who are protected. An evolutionary algorithm framework is developed by coupling an agent-based model with a variable-length genetic algorithm to route emergency vehicles. The dynamics of interactions among consumers, emergency vehicles, and the spatiotemporal trajectory of the hazard are simulated using an agent-based modeling approach, and a variable-length genetic algorithm approach selects routes to warn a maximum number of consumers before they are affected by the emergency. The example that is explored in this research is contamination of a water distribution network. A fleet of emergency vehicles is equipped with public address systems and is deployed to warn consumers to stop using contaminated water. The framework is demonstrated for an illustrative virtual city, Mesopolis. The results of the evolutionary algorithm framework are compared with two conventional routing optimization approaches, including a covering tour problem approach and a manual routing approach, for four contamination scenarios. The evolutionary algorithm can be applied to route emergency service vehicles to broadcast information for other emergencies, such as flash flooding, hazardous materials incidents, and severe weather.     

A multi-objective dynamic vehicle routing problem with fuzzy time windows: Model,solution and application

In this paper, a multi-objective dynamic vehicle routing problem with fuzzy time windows (DVRPFTW) is presented. In this problem, unlike most of the work where all the data are known in advance, a set of real time requests arrives randomly over time and the dispatcher does not have any deterministic or probabilistic information on the location and size of them until they arrive. Moreover, this model involves routing vehicles according to customer-specific time windows, which are highly relevant to the customers’ satisfaction level. This preference information of customers can be represented as a convex fuzzy number with respect to the satisfaction for a service time. This paper uses a direct interpretation of the DVRPFTW as a multi-objective problem where the total required fleet size, overall total traveling distance and waiting time imposed on vehicles are minimized and the overall customers’ preferences for service is maximized. A solving strategy based on the genetic algorithm (GA) and three basic modules are proposed, in which the state of the system including information of vehicles and customers is checked in a management module each time. The strategy module tries to organize the information reported by the management module and construct an efficient structure for solving in the subsequent module. The performance of the proposed approach is evaluated in different steps on various test problems generalized from a set of static instances in the literature. In the first step, the performance of the proposed approach is checked in static conditions and then the other assumptions and developments are added gradually and changes are examined. The computational experiments on data sets illustrate the efficiency and effectiveness of the proposed approach.     

An efficient and flexible approach for multiple vehicle tracking in the aerial video sequence

ABSTRACT

Multiple vehicle tracking (MVT) in the aerial video sequence can provide useful information for the applications such as traffic flow analysis. It is challenging due to the high requirement for the tracking efficiency and variable number of the vehicles. Furthermore, it is particularly challenging if the vehicles are occluded by the shadow of the trees, buildings, and large vehicles. In this article, an efficient and flexible MVT approach in the aerial video sequence is put forward. First, as the pre-step to approach the MVT problem, the superpixel segmentation-based multiple vehicle detection (MVD) is achieved by combining the two-frame difference and superpixel segmentation. The two-frame difference is utilized to reduce the search space. By scanning the search space via the centre of the superpixels, the moving vehicles are detected efficiently. Then, the deterministic data association is proposed to tackle the MVT problem. To improve the tracking accuracy, we fuse multiple types of features to establish the cost function. With respect to the variable number of the vehicles, the tracker management is designed by establishing or deleting the trackers. Furthermore, for the occlusion handling, we focus on the accurate state estimation, and it is realized by the driver behaviour-based Kalman filter (DBKF) method. In the DBKF method, we take seriously into account the driver behaviour, including the speed limit and rear-end collision avoidance with the front vehicle. Both tracker management and occlusion handling make the MVT approach flexibly cope with varieties of traffic scenes. Finally, comprehensive experiments on the DARPA VIVID data set and KIT AIS data set demonstrate that the proposed MVT algorithm can generate satisfactory and superior results.     

Coordinated search for a lost target in a Bayesian world

This paper describes a decentralized Bayesian approach to the problem of coordinating multiple autonomous sensor platforms searching for a single non-evading target. In this architecture, each decision maker builds an equivalent representation of the probability density function (PDF) of the target state through a general decentralized Bayesian sensor network, enabling them to coordinate their actions without exchanging any information about their plans. The advantage of the approach is that a high degree of scalability and real-time adaptability can be achieved. The framework is implemented on a real-time high-fidelity multi-vehicle simulator system. The effectiveness of the method is demonstrated in different scenarios for a team of airborne search vehicles looking for both a stationary and a drifting target lost at sea.