首页|期刊导航|电子科技|基于改进贪婪算法的无人车编队领航者选择

基于改进贪婪算法的无人车编队领航者选择OA

Leader Selection in Unmanned Vehicle Formation Based on Improved Greedy Algorithm

中文摘要英文摘要

领航者是无人车编队的控制核心,在车辆编队的网络中选择合适的智能体作为领航者有利于提升编队整体的控制效果.在无人车实现期望的时变编队过程中,针对极小化所需领航者规模问题,在无向连通图和强连通有向图的条件下,文中基于回溯算法的核心思想与周期迭代更新策略,分别提出了牵制控制条件下领航者选择的两种改进贪婪算法,两种改进算法均对传统贪婪算法的搜索策略进行优化.在非强连通有向图的条件下,引入根节点选择指标使贪婪算法能够快速选择领航者.仿真结果表明,针对4种类型的无向连通图,在给定条件下对比传统贪婪算法,改进贪婪算法选择的领航者数量平均减少了20%,在链状拓扑中减少了33.3%.针对非强连通有向图,引入根节点选择指标的贪婪算法能够进一步减少领航者数量.

The leader is the control core of the unmanned vehicle formation.Selecting an appropriate intelli-gent agent as the leader in the vehicle formation network is conducive to improving the overall control effect of the formation.In the process of achieving the expected time-varying formation of unmanned vehicles,aiming at the problem of minimizing the required leader scale,under the conditions of undirected connected graphs and strongly connected directed graphs,based on the core idea of the backtracking algorithm and the periodic iterative update strategy,this paper respectively proposes two improved greedy algorithms for leader selection under the restraint control condition Both improved algorithms optimize the search strategy of the traditional greedy algorithm.Under the condition of non-strongly connected directed graphs,the introduction of the root node selection index enables the greedy algorithm to quickly select the leader.The simulation results show that for the four types of undirected connected graphs,compared with the traditional greedy algorithm under the given conditions,the number of leaders selected by the improved greedy algorithm is reduced by an average of 20%,and by 33.3%in the chain topology.For non-strongly connected directed graphs,the greedy algorithm that introduces the root node selection index can further reduce the number of leaders.

韦俊灿;陈凯乐;高金凤;李乐宝

浙江理工大学 信息科学与工程学院,浙江 杭州 310018浙江理工大学 信息科学与工程学院,浙江 杭州 310018浙江理工大学 信息科学与工程学院,浙江 杭州 310018浙江理工大学 信息科学与工程学院,浙江 杭州 310018

信息技术与安全科学

领航者-跟随者改进贪婪算法节点选择牵制控制二阶动力学模型无人车编队一致性复杂网络

leader-followerimproved greedy algorithmselecting nodespinning controlsecond-order dy-namics modelunmanned vehicle formationconsensuscomplex network

《电子科技》 2026 (9)

26-36,11

国家自然科学基金(62073296)浙江理工大学科研业务费专项资金(24222091-Y,23222216-Y)National Natural Science Foundation of China(62073296)Research Funds of Zhejiang Sci-Tech University(24222091-Y,23222216-Y)

10.16180/j.cnki.issn1007-7820.2026.09.004

评论