In recent years,the path planning for multi-agent technology has gradually matured,and has made breakthrough progress.The main difficulties in path planning for multi-agent are large state space,long algorithm running...In recent years,the path planning for multi-agent technology has gradually matured,and has made breakthrough progress.The main difficulties in path planning for multi-agent are large state space,long algorithm running time,multiple optimization objectives,and asynchronous action of multiple agents.To solve the above problems,this paper first introduces the main problem of the research:multi-objective multi-agent path finding with asynchronous action,and proposes the algorithm framework of multi-objective loose synchronous(MO-LS)search.By combining A*and M*,MO-LS-A*and MO-LS-M*algorithms are respectively proposed.The completeness and optimality of the algorithm are proved,and a series of comparative experiments are designed to analyze the factors affecting the performance of the algorithm,verifying that the proposed MO-LS-M*algorithm has certain advantages.展开更多
基金Aeronautical Science Foundation of China(No.20220001057001)。
文摘In recent years,the path planning for multi-agent technology has gradually matured,and has made breakthrough progress.The main difficulties in path planning for multi-agent are large state space,long algorithm running time,multiple optimization objectives,and asynchronous action of multiple agents.To solve the above problems,this paper first introduces the main problem of the research:multi-objective multi-agent path finding with asynchronous action,and proposes the algorithm framework of multi-objective loose synchronous(MO-LS)search.By combining A*and M*,MO-LS-A*and MO-LS-M*algorithms are respectively proposed.The completeness and optimality of the algorithm are proved,and a series of comparative experiments are designed to analyze the factors affecting the performance of the algorithm,verifying that the proposed MO-LS-M*algorithm has certain advantages.
