首页|期刊导航|南京航空航天大学学报(自然科学版)|基于改进DECBBA-SR算法的异构多无人飞行器任务分配

基于改进DECBBA-SR算法的异构多无人飞行器任务分配OA

Task Allocation for Heterogeneous Multi-UAV Systems Based on Improved DECBBA-SR Algorithm

中文摘要英文摘要

针对异构多无人飞行器在障碍环境下的实时多类复杂任务规划问题,对任务分配模型的分布式求解方法进行研究.本文提出了一种改进的基于共识的捆绑算法(Consensus-based bundling algorithm,CBBA),重新设计任务包构建阶段的边际成本函数,并基于快速扩展随机树星(Rapidly-exploring random tree star,RRT*)算法耦合路径规划成本计算,优化包构建时的任务选择操作,设计了一种局部按需选择通信优化的冲突消解机制,针对动态任务分配问题求解提出了一种局部任务路径集重构机制.仿真结果表明,在障碍环境下,改进算法的动态分配收敛时间减少38.1%,总得分增加15.1%,飞行总航程减少58.0%,且满足任务时序、时间窗口、飞行器资源限制以及动态任务添加等多重约束,实现了高效任务分配,具有较高的可行性和实时性.

Aiming at the problem of real-time multi-class complex task planning of heterogeneous multi-unmanned aerial vehicles under obstacle environment,the distributed solution of task assignment model is studied.An improved consensus-based bundling algorithm(CBBA)is proposed.The marginal cost function of task package construction is redesigned and the path planning cost calculation is coupled based on the rapidly-exploring random tree star(RRT*)algorithm.The task selection operation is optimized during package construction,and a local on-demand selection communication optimization conflict resolution mechanism is designed.A local task path set reconstruction mechanism is proposed for solving dynamic task assignment problems.The simulation results show that under the obstacle and dynamic environment,the convergence time of dynamic assignment of the improved algorithm is reduced by 38.1%,the total score is increased by 15.1%,and the total flight distance is reduced by 58.0%.Moreover,it satisfies multiple constraints such as task timing,time window,aircraft resource limitation,dynamic task addition,etc.,and achieves efficient task assignment with high feasibility and real-time performance.

王爽宇;刘伟鹏;胡春朝;马梓元;龚华军;王皓淳

南京航空航天大学自动化学院,南京 211106上海机电工程研究所,上海 201109上海机电工程研究所,上海 201109南京航空航天大学自动化学院,南京 211106南京航空航天大学自动化学院,南京 211106南京航空航天大学自动化学院,南京 211106

航空航天

异构多无人飞行器基于共识的捆绑算法动态任务分配时间窗口约束路径集重构机制快速扩展随机树星算法

heterogeneous multiple unmanned aerial vehiclesconsensus-based bundle algorithmdynamic task assignmenttime window constraintpath set reconstruction mechanismrapidly-exploring random tree star(RRT*)algorithm

《南京航空航天大学学报(自然科学版)》 2026 (4)

878-891,14

上海航天科技创新基金(SAST2023-012).

10.16356/j.2097-6771.2026.04.015

评论