多无人机协同攻击路径规划研究

如何实现多架无人机规避复杂威胁区域对敌重要目标实施协同打击成为近来研究的难点,研究实现协同打击的关键是规划出多无人机从各自起始点到目标的最优协同攻击路径,以解决路径规划的关键技术为目的。对复杂威胁区域中,多无人机最优协同攻击路径规划进行了研究。首先,构建了多无人机最优协同攻击路径规划系统框架;其次,以人工智能A*算法为基础,结合无人机运动学方程对A*算法进行了改进,得到一种基于步长搜索的无人机路径快速生成算法;再次,基于改进的路径快速生成算法,以多无人机同时攻击目标为约束条件,进行变步长的协同攻击仿真计算。仿真验证了路径规划算法和协同攻击算法的有效性。     

Multiple task assignments for cooperating uninhabited aerial vehicles using genetic algorithms

A problem of assigning cooperating uninhabited aerial vehicles to perform multiple tasks on multiple targets is posed as a new combinatorial optimization problem. A genetic algorithm for solving such a problem is proposed. The algorithm allows us to efficiently solve this NP-hard problem that has prohibitive computational complexity for classical combinatorial optimization methods. It also allows us to take into account the unique requirements of the scenario such as task precedence and coordination, timing constraints, and trajectory limitations. A matrix representation of the genetic algorithm chromosomes simplifies the encoding process and the application of the genetic operators. The performance of the algorithm is compared to that of deterministic branch and bound search and stochastic random search methods. Monte Carlo simulations demonstrate the viability of the genetic algorithm by showing that it consistently and quickly provides good feasible solutions. This makes the real time implementation for high-dimensional problems feasible.     

Rolling Horizon Path Planning of an Autonomous System of UAVs for Persistent Cooperative Service: MILP Formulation and Efficient Heuristics

A networked system consisting of unmanned aerial vehicles (UAVs), automated logistic service stations (LSSs), customer interface software, system orchestration algorithms and UAV control software can be exploited to provide persistent service to its customers. With efficient algorithms for UAV task planning, the UAVs can autonomously serve the customers in real time. Nearly uninterrupted customer service may be accomplished via the cooperative hand-off of customer tasks from weary UAVs to ones that have recently been replenished at an LSS. With the goal of enabling the autonomy of the task planning tasks, we develop a mixed integer linear programming (MILP) formulation for the problem of providing simultaneous. UAV escort service to multiple customers across a field of operations with multiple sharable LSSs. This MILP model provides a formal representation of our problem and enables use in a rolling horizon planner via allowance of arbitrary UAV initial locations and consumable reservoir status (e.g., battery level). As such, it enables automation of the orchestration of system activities. To address computational complexity, we develop efficient heuristics to rapidly derive near optimal solutions. A receding horizon task assignment (RHTA) heuristic and sequential task assignment heuristic (STAH) are developed. STAH exploits properties observed in optimal solutions obtained for small problems via CPLEX. Numerical studies suggest that RHTA and STAH are 45 and 2100 times faster than solving the MILP via CPLEX, respectively. Both heuristics perform well relative to the optimal solution obtained via CPLEX. An example demonstrating the use of the approach for rolling horizon planning is provided.     

一种双无人机协同跟踪地面移动目标方法

针对通信延时情况下双无人机协同跟踪地面移动目标问题进行研究, 构建了基于分布式遗传算法和滚动时域优化结合的目标跟踪航迹规划算法模型。考虑到通信延时会增加目标状态信息数据融合时的误差, 导致无人机跟踪任务效果变差, 结合递推最小二乘滤波和加权最小二乘估计设计了融合方法, 来融合处理目标状态信息; 考虑到无人机对目标的观测效果与未来时刻的目标状态信息密切相关, 采用递推最小二乘滤波预测目标的状态信息, 结合分布式遗传算法和滚动时域优化设计了双无人机目标跟踪航迹规划算法。适应度函数考虑了无人机和目标之间的距离、无人机之间的通信距离、无人机之间的通信角度。仿真结果表明：该协同跟踪方法能够较好地完成跟踪任务; 与一架无人机跟踪相比误差明显减小, 并且可以减小通信延时带来的跟踪误差。     

A Cooperative receding horizon controller for multivehicle uncertain environments

We consider a setting where multiple vehicles form a team cooperating to visit multiple target points and collect rewards associated with them. The team objective is to maximize the total reward accumulated over a given time interval. Complicating factors include uncertainties regarding the locations of target points and the effectiveness of collecting rewards, differences among vehicle capabilities, and the fact that rewards are time-varying. We propose a receding horizon (RH) controller suitable for dynamic and uncertain environments, where combinatorially complex assignment algorithms are infeasible. The control scheme dynamically determines vehicle trajectories by solving a sequence of optimization problems over a planning horizon and executing them over a shorter action horizon. This centralized scheme can generate stationary trajectories in the sense that they guide vehicles to target points, even though the controller is not explicitly designed to perform any discrete point assignments. This paper establishes conditions under which this stationarity property holds in settings that are analytically tractable, quantifies the cooperative properties of the controller, and includes a number of illustrative simulation examples.     

Precedence-constrained path planning of messenger UAV for air-ground coordination

This paper addresses an unmanned aerial vehicle (UAV) path planning problem for a team of cooperating heterogeneous vehicles composed of one UAV and multiple unmanned ground vehicles (UGVs). The UGVs are used as mobile actuators and scattered in a large area. To achieve multi-UGV communication and collaboration, the UAV serves as a messenger to fly over all task points to collect the task information and then flies all UGVs to transmit the information about tasks and UGVs. The path planning of messenger UAV is formulated as a precedence-constrained dynamic Dubins traveling salesman problem with neighborhood (PDDTSPN). The goal of this problem is to find the shortest route enabling the UAV to fly over all task points and deliver information to all requested UGVs. When solving this path planning problem, a decoupling strategy is proposed to sequentially and rapidly determine the access sequence in which the UAV visits task points and UGVs as well as the access location of UAV in the communication neighborhood of each task point and each UGV. The effectiveness of the proposed approach is corroborated through computational experiments on randomly generated instances. The computational results on both small and large instances demonstrate that the proposed approach can generate high-quality solutions in a reasonable time as compared with two other heuristic algorithms.     

基于遗传算法的动态资源调度问题研究

建立了无人作战飞机任务规划问题的数学模型，提出了分层递阶的任务规划系统结构．针对任务规划的核心资源调度问题，设计了基于遗传算法的动态资源调度算法，有效地解决了多无人作战飞机的资源调度问题，计算结果表明了算法的有效性．     

多约束下多无人机的任务规划研究综述

高度信息化的发展使得无人机作战优势凸显。准确的无人机任务规划技术是完成给定任务的重要保障。任务分配、路径规划是构成无人机任务规划技术的两个核心部分。基于该技术,首先讨论了无人机任务规划的发展状况、分类标准、体系结构。其次,分别详细介绍了影响任务分配、路径规划的重要指标,如分类标准、约束指标、相应模型、代表算法、评价指标等,然后,分别分析对比求解任务分配的启发式算法、数学规划方法、随机智能优化算法的优缺点和求解路径规划的数学规划方法、人工势场法、基于图形学法、智能优化算法的优缺点;最后,总结了无人机任务规划存在的开放性问题、未来发展方向和研究重点。     

复杂多约束UAVs协同目标分配的一种统一建模方法

多无人机协同目标分配(Multi-UAVs cooperative target assignment problem, MUCTAP)是一个条件复杂的多模型、多约束组合优化问题, 很难用一致的方法获得可行的解. 为解决该问题, 本文对各种目标分配模型统一建模, 设计了一致的模型处理方法; 针对三维环境特点, 提出利用空间垂直切面计算无人机估计航程代价的方法, 并利用航程代价矩阵优化目标分配算法; 同时加入协同约束关系计算, 提高分配算法的准确性. 仿真实验验证了该方法能够处理多种情况的目标分配问题, 具有较高的通用性和准确性, 能够有效完成多机协同目标分配任务.     

An improved constrained differential evolution algorithm for unmanned aerial vehicle global route planning

This paper formulates the global route planning problem for the unmanned aerial vehicles (UAVs) as a constrained optimization problem in the three-dimensional environment and proposes an improved constrained differential evolution (DE) algorithm to generate an optimal feasible route. The flight route is designed to have a short length and a low flight altitude. The multiple constraints based on the realistic scenarios are taken into account, including maximum turning angle, maximum climbing/gliding slope, terrain, forbidden flying areas, map and threat area constraints. The proposed DE-based route planning algorithm combines the standard DE with the level comparison method and an improved strategy is proposed to control the satisfactory level. To show the high performance of the proposed method, we compare the proposed algorithm with six existing constrained optimization algorithms and five penalty function based methods. Numerical experiments in two test cases are carried out. Our proposed algorithm demonstrates a good performance in terms of the solution quality, robustness, and the constraint-handling ability.     

An Integral Framework of Task Assignment and Path Planning for Multiple Unmanned Aerial Vehicles in Dynamic Environments

In this paper, a hierarchical framework for task assignment and path planning of multiple unmanned aerial vehicles (UAVs) in a dynamic environment is presented. For multi-agent scenarios in dynamic environments, a candidate algorithm should be able to replan for a new path to perform the updated tasks without any collision with obstacles or other agents during the mission. In this paper, we propose an intersection-based algorithm for path generation and a negotiation-based algorithm for task assignment since these algorithms are able to generate admissible paths at a smaller computing cost. The path planning algorithm is also augmented with a potential field-based trajectory replanner, which solves for a detouring trajectory around other agents or pop-up obstacles. For validation, test scenarios for multiple UAVs to perform cooperative missions in dynamic environments are considered. The proposed algorithms are implemented on a fixed-wing UAVs testbed in outdoor environment and showed satisfactory performance to accomplish the mission in the presence of static and pop-up obstacles and other agents.     

Market-Based Task Assignment for Cooperative Timing Missions in Dynamic Environments

New market-based decentralized algorithms are proposed for the task assignment of multiple unmanned aerial vehicles in dynamic environments with a limited communication range. In particular, a cooperative timing mission that cannot be performed by a single vehicle is considered. The baseline algorithms for a connected network are extended to deal with time-varying network topology including isolated subnetworks due to a limited communication range. The mathematical convergence and scalability analyses show that the proposed algorithms have a polynomial time complexity, and numerical simulation results support the scalability of the proposed algorithm in terms of the runtime and communication burden. The performance of the proposed algorithms is demonstrated via Monte Carlo simulations for the scenario of the suppression of enemy air defenses.     

基于改进遗传算法的连锁便利店配送路径优化

提出一种针对软时间窗下连锁便利店配送路径规划的带时间窗口的多染色体遗传算法。为解决单车场多车型带密集半软时间窗问题,讨论解决方案预防其陷入局部最优解。对于上述配送路径问题,提出多染色体改进遗传算法在减少车辆运输成本、惩罚成本的目标下进行最优路径求解,并为连锁便利店的路径规划案例提出车辆与路径选择的优化方案,最后将该算法与传统遗传算法进行实验对比分析。实验结果表明,本文算法在密集半软时间窗下,相比传统遗传算法明显减少了总配送成本,从而验证了本文算法的有效性。     

Embedding Remaining Useful Life Predictions into a Modified Receding Horizon Task Assignment Algorithm to Solve Task Allocation Problems

The Task Allocation problem is one of the fundamental combinatorial optimization problems with applications on various domains. Solving a Task Allocation problem consists in, given a set of tasks to be performed and a set of resources, defining which resource will perform each task in order to optimize an objective function. In this paper, we present a modified version of the Receding Horizon Task Assignment (RHTA) algorithm to solve multiple vehicle task assignment problems. In the proposed method, we generate a rejection list to reduce the number of candidate missions that are evaluated in each iteration of the RHTA algorithm. In addition, we incorporate in the mathematical formulation of the problem a set of constraints that limit the maximum mission duration that can be assigned to each vehicle. These constraints represent the predicted Remaining Useful Life (RUL) of each vehicle. Our model takes into account the execution time of each task and assumes that all vehicles must finish their missions at a base. The proposed model allows the vehicles to go to a base for maintenance during their missions. Numerical experiments are carried out using twenty benchmark problem instances. The results show that incorporating RUL predictions into task allocation problems increases the quality and the robustness of solutions.     

Receding-Horizon Trajectory Planning for Under-Actuated Autonomous Vehicles Based on Collaborative Neurodynamic Optimization

This paper addresses a major issue in planning the trajectories of under-actuated autonomous vehicles based on neurodynamic optimization. A receding-horizon vehicle trajectory planning task is formulated as a sequential global optimization problem with weighted quadratic navigation functions and obstacle avoidance constraints based on given vehicle goal configurations. The feasibility of the formulated optimization problem is guaranteed under derived conditions. The optimization problem is sequentially solved via collaborative neurodynamic optimization in a neurodynamics-driven trajectory planning method/procedure. Simulation results with under-actuated unmanned wheeled vehicles and autonomous surface vehicles are elaborated to substantiate the efficacy of the neurodynamics-driven trajectory planning method.      

城市交叉口车辆速度与交通信号协同优化控制

为了降低城市交通中的行车延误与燃油消耗,针对人类驾驶车辆与自动驾驶车辆混合交通环境,提出一种基于交通信息物理系统(TCPS)的车辆速度与交通信号协同优化控制方法.首先,综合考虑路口交通信号、人类驾驶车辆、自动驾驶车辆三者之间的相互影响,设计一种适用于自动驾驶车辆与人类驾驶车辆混合组队特性的过路口速度规划模型;其次,针对车辆速度规划单一应用时的局限性,即无法减少车辆路口通行延误且易出现无解情况,提出一种双目标协同优化模型,能够综合考虑车辆速度规划与路口交通信号控制,同时降低车辆燃油消耗与路口平均延误.由于双目标优化问题求解的复杂性,设计一种遗传算法-粒子群算法混合求解策略.基于SUMO的仿真实验验证了所提出方法的有效性.     

Coverage path planning with unmanned aerial vehicles for 3D terrain reconstruction

Three-dimensional terrain reconstruction from 2D aerial images is a problem of utmost importance due its wide level of applications. It is relevant in the context of intelligent systems for disaster managements (for example to analyze a flooded area), soil analysis, earthquake crisis, civil engineering, urban planning, surveillance and defense research.It is a two level problem, being the former the acquisition of the aerial images and the later, the 3D reconstruction. We focus here in the first problem, known as coverage path planning, and we consider the case where the camera is mounted on an unmanned aerial vehicle (UAV).In contrast with the case when ground vehicles are used, coverage path planning for a UAV is a lesser studied problem. As the areas to cover become complex, there is a clear need for algorithms that will provide good enough solutions in affordable times, while taking into account certain specificities of the problem at hand. Our algorithm can deal with both convex and non-convex areas and their main aim is to obtain a path that reduces the battery consumption, through minimizing the number of turns.We comment on line sweep calculation and propose improvements for the path generation and the polygon decomposition problems such as coverage alternatives and the interrupted path concept. Illustrative examples show the potential of our algorithm in two senses: ability to perform the coverage when complex regions are considered, and achievement of better solution than a published result (in terms of the number of turns used).     

Decentralized task allocation for heterogeneous multi-UAV system with task coupling constraints

The Journal of Supercomputing - Cooperative multiple task assignment problem is an essential issue in the collaboration of multiple unmanned aerial vehicles (UAVs). Consensus-based bundle algorithm...     

Multi-depot vehicle routing problem: a one-stage approach

This paper introduces multi-depot vehicle routing problem with fixed distribution of vehicles (MDVRPFD) which is one important and useful variant of the traditional multi-depot vehicle routing problem (MDVRP) in the supply chain management and transportation studies. After modeling the MDVRPFD as a binary programming problem, we propose two solution methodologies: two-stage and one-stage approaches. The two-stage approach decomposes the MDVRPFD into two independent subproblems, assignment and routing, and solves them separately. In contrast, the one-stage approach integrates the assignment with the routing where there are two kinds of routing methods-draft routing and detail routing. Experimental results show that our new one-stage algorithm outperforms the published methods. Note to Practitioners-This work is based on several consultancy work that we have done for transportation companies in Hong Kong. The multi-depot vehicle routing problem (MDVRP) is one of the core optimization problems in transportation, logistics, and supply chain management, which minimizes the total travel distance (the major factor of total transportation cost) among a number of given depots. However, in real practice, the MDVRP is not reliable because of the assumption that there have unlimited number of vehicles available in each depot. In this paper, we propose a new useful variant of the MDVRP, namely multi-depot vehicle routing problem with fixed distribution of vehicles (MDVRPFD), to model the practicable cases in applications. Two-stage and one-stage solution algorithms are also proposed. The industry participators can apply our new one-stage algorithm to solve the MDVRPFD directly and efficiently. Moreover, our one-stage solution framework allows users to smoothly add new specified constraints or variants.     

面向无人机集群路径规划的智能优化算法综述

在电–气–热互联系统(EGHS)的联合优化愈受关注的背景下, 提出一种电–气–热互联系统分布式优化调度 框架. 首先, 以系统供能成本最小建立同时考虑气网及热网动态特性的日前调度模型. 其次, 针对电–气–热互联系 统含电、气、热3个子系统在分布式运算属三区(3-Block)优化问题因而难以利用常规分布式算法得到收敛解的问题, 提出基于交替方向乘子法(ADMM)的改进算法, 即强制平等的ADMM算法. 所提算法框架为内外层协调凸分布框 架, 外层为罚凸凹算法(PCCP), 内层为ADMM–FE算法. 此算法框架中, 外层优化利用罚凸凹过程将非凸气流方程 凸化为逐次迭代的二阶锥约束, 内层ADMM–FE算法求解外层凸化后的模型以得到收敛解. 最后, 通过算例仿真分 析对比了所提算法与传统ADMM算法及集中式优化算法的计算结果, 所得结果验证了所提模型以及优化算法框架 的有效性.