多UCAV协同任务分配模型及粒子群算法求解

任务分配是多无人作战飞机(UCAV)协同控制的基础.对此,分析了影响任务分配的关键战技指标,建立了针对攻击任务的多UCAV协同任务分配模型.应用连续粒子群算法对问题进行求解,建立了粒子与实际问题间的映射,通过位置饱和策略构造粒子的搜索空间,采用自适应惯性权重提高粒子群算法的收敛速度和全局寻优能力.考虑到单机的任务载荷限制,引入了买卖合同机制以实现多机任务协调.仿真结果表明,所提出模型和算法可以较好地解决多UCAV协同任务分配问题.     

多无人机分布式协同异构任务分配

研究异构无人机对不同类型目标执行侦察、打击和评估任务的协同任务分配问题.采用信息论中熵的变化量对侦察与评估任务中所获取的信息量进行度量,将无人机对不同类型目标的打击能力抽象为对目标的毁伤概率,并考虑各个任务之间的相互关联,建立异构多无人机协同任务分配模型.设计了基于相邻局部通信的分布式拍卖算法,实现了多无人机协同任务分配问题的优化求解.仿真结果表明了所建模型的合理性和求解方法的有效性.     

面向协同任务的多UCAV分布式任务分配与协调技术

对多架无人作战飞机 (Unmanned combat aerial vehicle, UCAV) 分布式控制中的任务分配与任务协调问题开展研究. 采用合同网实现任务执行过程中的任务分配. 通过对合同网进行扩展, 使 UCAV 能够在招标和竞标的同时处理任务间的时间约束. 设计了一种新的部分全局规划协商机制, 能够更有效地对执行相关任务的 UCAV 的任务计划进行协调. 通过 Petri 网建模方法, 将两种协商机制模型化为 Petri 网并分析了协商过程的正确性与协商结果的可行性. 仿真实验验证了方法的有效性.     

基于纳什议价的无人机编队自主重构控制方法

针对任务环境下携带不同载荷的无人机(Unmanned aerial vehicles, UAVs)组成的编队, 为实现无人机间的相互支援和补充而进行编队重构控制, 运用多目标多人博弈理论, 将其转化为纳什谈判过程. 结合分布式模型预测控制(Distributed model predictive control, DMPC)方法, 设计一种基于纳什谈判的分布式预测控制(Nash bargaining solution-DMPC, NBS-DMPC)算法求解该问题, 并对算法收敛性进行了证明. 仿真实验表明, 该算法能够有效控制编队自主重构, 实现编队无人机间的威胁规避和协同保护, 同时能够有效降低无人机编队自主重构控制问题的求解规模.     

基于改进鱼群算法的多无人机任务分配研究

多无人机协同任务分配问题是多无人机协同控制的关键,为解决单目标函数构建的任务分配模型不能满足决策者对战场环境大量信息的需求,以最大航程和最长任务执行时间作为多无人机任务分配的两个目标函数,依据多目标优化理论,建立了协同任务分配多目标优化模型.并采用了一种借鉴遗传算法中的变异思想的改进鱼群算法进行求解,得到多无人机任务分配的多目标最优解集,然后根据决策者的偏好选择最佳任务分配方案.最后将上述算法应用于多无人机协同任务分配中并进行了仿真,仿真结果验证了改进鱼群算法的收敛性及有效性,为多无人机协同任务分配优化提供了参考依据.     

基于顺序扩展一致性包算法的多无人机分布式任务分配

以异构多无人机协同执行复杂的耦合多任务为背景,提出一种求解分布式任务分配问题非死锁的顺序扩展一致性包算法.首先,建立考虑任务载荷资源、任务时序、威胁区等约束条件的时序多任务分配模型;其次,对一致性包算法的任务包构建过程和冲突消解规则进行扩展,并设计一种基于有向图深度优先搜索的方法进行任务方案的死锁检测和修正,以实现无冲突和无死锁的任务分配;然后,将关联任务之间的时序约束转化为软时间窗约束,利用顺序分层的策略进行求解;最后,为了提高任务分配结果的可靠性,采用Dubins曲线路径将航路规划耦合到任务分配中.仿真实验表明,所提出的算法能够快速有效地求解异构多无人机分布式耦合多任务分配问题,具备良好的最优性和时效性.     

基于集散式模型预测控制的多无人机协同分区搜索

针对多无人机在对大范围目标区域执行协同搜索任务时搜索资源分配不均、容易因频繁转场造成资源浪费等问题,借鉴集中式控制和分布式控制结构的优点,建立了集散式多无人机(unmanned aerial vehicle,UAV)协同搜索结构体系,通过聚类分析和V图划分等方法对目标区域进行分区,结合各子区域任务特点对无人机群进行搜索任务分配,并采用一种经改进后可有效增大UAV预测范围的预测控制模型,研究了动态环境下多UAV集散式协同分区搜索问题,最后,将所提方法与常见几种协同搜索方法进行对比仿真,获取仿真结果验证了所提方法在目标发现概率和搜索效率方面的有效性和优越性.     

基于SEAD任务特性约束的协同任务分配方法

以多异构无人机执行SEAD任务为背景,开展协同任务分配问题建模、算法设计和仿真分析.采用图论的方法完成问题的建模,将无人机本体等效为Dubins Car模型,并对其在相应目标处执行侦查、打击、评估任务时的进入角度进行约束,通过Dubins路径完成对无人机飞行路径的等效,采用分布式遗传算法完成对问题的快速求解.研究结果表明,带有路径末端角度约束的任务分配问题具有较好的实用意义,分布式遗传算法可有效处理实时任务分配问题,完成任务空间的快速决策.     

基于KnCMPSO算法的异构无人机协同多任务分配

随着无人机(Unmanned aerial vehicle, UAV)技术的广泛应用和执行任务的日益复杂,无人机多机协同控制面临着新的挑战.以无人机总飞行距离和任务完成时间为优化目标,同时考虑异构无人机类型、任务执行时序等多种实际约束,构建基于多种约束条件的异构无人机协同多任务分配模型.该模型不仅包含混合变量,同时还存在多个复杂的约束条件,因此,传统的多目标优化算法并不能有效地处理混合变量及对问题空间进行搜索并生成满足多种约束条件的可行解.为高效求解上述模型,提出一种基于拐点的协同多目标粒子群优化算法(Knee point based coevolution multi-objective particle swarm optimization,Kn CMPSO),该算法引入基于拐点的学习策略来更新外部档案集,在保证收敛性的同时增加种群的多样性,使算法能搜索到更多可行的任务分配结果;并基于二进制交叉方法,引入基于学习的粒子更新策略来提升算法的收敛性及基于区间扰动的局部搜索策略以提升算法的多样性.最后通过在四组实例上的仿真实验验证了所提算法在求解异构无人机协同多任务分配问题上的有效性.     

基于免疫粒子群算法的多UCAV协同任务分配

任务分配问题是多UCAV协同控制的关键和有效保证。综合考虑问题的多规划指标和多类复杂约束条件,建立了基于多目标整数规划的协同多任务分配模型。通过模拟生物免疫系统的免疫特征和运行机制,并将粒子群优化作为算法的局部搜索算子,设计了一种适用于问题求解的免疫粒子群算法,使算法同时具有人工免疫算法种群多样性好、粒子群优化局部搜索能力和进化方向性强等特点。仿真实验表明该方法具有良好的优化效果和时间特性,可较好地解决多UCAV协同任务分配问题。     

复杂约束条件下异构多智能体联盟任务分配

分布式任务决策是提高多智能体系统自主性的关键. 以异构多智能体协同执行复杂任务为背景, 首先建立 了一种考虑任务载荷资源约束、任务耦合关系约束及执行窗口约束等条件的异构多智能体分布式联盟任务分配模 型; 其次, 对一致性包算法(CBBA)进行了扩展, 提出了基于改进冲突消解原则的一致性联盟算法(CBCA), 以实现异 构多智能体协同无冲突任务分配, 并进一步证明了在一定条件下CBCA算法收敛于改进顺序贪婪算法(ISGA). 最后 通过数值仿真, 验证了CBCA算法求解复杂约束条件下异构多智能体联盟任务分配问题的可行性和快速性.     

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...     

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

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

Formation control of unmanned aerial vehicle swarms: A comprehensive review

The unmanned aerial vehicle formation plays a crucial role in numerous applications, such as reconnaissance, agricultural plant protection, and electric power inspection. This paper provides a comprehensive review and analysis of the unmanned aerial vehicle swarm communication networks and formation control strategies. First, the most commonly used unmanned aerial vehicles are introduced and compared. Next, the entire process of the formation task, from the formation assignment to the formation transformation, is detailed described. At last, the widely adopted communication networks are analyzed, and the existing formation control strategies of the UAV swarm are compared, which shows that the distributed formation control is superior to the centralized method and is the future development trend.     

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.     

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

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

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

Intelligent Cooperative Control Architecture: A Framework for Performance Improvement Using Safe Learning

Planning for multi-agent systems such as task assignment for teams of limited-fuel unmanned aerial vehicles (UAVs) is challenging due to uncertainties in the assumed models and the very large size of the planning space. Researchers have developed fast cooperative planners based on simple models (e.g., linear and deterministic dynamics), yet inaccuracies in assumed models will impact the resulting performance. Learning techniques are capable of adapting the model and providing better policies asymptotically compared to cooperative planners, yet they often violate the safety conditions of the system due to their exploratory nature. Moreover they frequently require an impractically large number of interactions to perform well. This paper introduces the intelligent Cooperative Control Architecture (iCCA) as a framework for combining cooperative planners and reinforcement learning techniques. iCCA improves the policy of the cooperative planner, while reduces the risk and sample complexity of the learner. Empirical results in gridworld and task assignment for fuel-limited UAV domains with problem sizes up to 9 billion state-action pairs verify the advantage of iCCA over pure learning and planning strategies.