欢迎访问《兵工学报》官方网站,今天是

兵工学报 ›› 2025, Vol. 46 ›› Issue (5): 240743-.doi: 10.12382/bgxb.2024.0743

• • 上一篇    

基于改进快速搜索树和合同网的多智能体目标分配算法

王义涛1, 王俊森1,2, 石章松2,*(), 徐慧慧2, 朱伟明2   

  1. 1 海军大连舰艇学院 作战仿真软件与研究所, 辽宁 大连 116018
    2 海军工程大学, 湖北 武汉 430033
  • 收稿日期:2024-08-29 上线日期:2025-05-07
  • 通讯作者:
  • 基金资助:
    湖北省自然科学基金项目(2024AFB404)

Task Allocation for Multi-agent System Based on Extended Rapidly-exploring Random Tree and Contract Net

WANG Yitao1, WANG Junsen1,2, SHI Zhangsong2,*(), XU Huihui2, ZHU Weiming2   

  1. 1 Institute of Operation Software and Simulation, Dalian Naval Academy, Dalian 116018, Liaoning, China
    2 Naval University of Engineering, Wuhan 430033, Hubei, China
  • Received:2024-08-29 Online:2025-05-07

摘要:

针对多智能体任务目标分配中航迹代价估算不准确的问题,提出一种基于改进快速搜索树算法的航迹代价计算方法,在合理地规划智能体运动轨迹的同时提高智能体航迹代价估算的准确性;针对改进合同网算法投标过程中优势智能体过早签约的问题,提出一种智能体投标状态转化机制,使得优势智能体可以多次参与任务竞标,实现智能体系统任务负载的均衡。仿真结果表明,新提出的航迹代价计算方法能够较好地计算智能体与目标、目标与目标之间的航迹;智能体投标转化机制解决了优势智能体过早签约导致的资源浪费,智能体系统完成任务的执行时间较之前降低6.54%,但处理优势智能体问题时新的机制会增加整个任务分配的投标轮次。

关键词: 多智能体系统, 目标分配, 航路规划, 改进合同网算法

Abstract:

For the inaccurate track cost estimation in task allocation for multi-agent systems, a track cost calculation method based on extended rapidly-exploring random tree is proposed to rationally plan the motion trajectories of agents and improve the accuracy of track cost estimation. In order to solve the problem of premature contracting of dominant agents in improved contract net algorithm, an agent bidding transformation mechanism is proposed to make the dominant agents participate in the task bidding for multiple times and achieve the balance of task load between agents in a system. The simulated results show that the proposed track cost calculation method can be used to accurately calculate the trajectory between agent and target, and the trajectory between target and target. The agent bidding transformation mechanism solves the resource waste caused by the premature contracting of dominant agent, and the time of the agents to complete all tasks is reduced by 6.54%. However, when dealing with the dominant agent problem, the new mechanism will increase the bidding rounds of the entire task allocation.

Key words: multi-agent system, task allocation, path planning, improved contract net algorithm

中图分类号: