m2ACO: Multi-agent Path Planning Algorithm for Web3D Mountain Scenario

Abstract

Mountain scenario data is large and complex for there are large amount of semantic information in it. That is the reason why it is difficult for computer to calculate an accurate path in real-time for multi-agent marching in mountain scenario. The paper proposed an m2ACO (multi-agent in mountain environment using ACO) algorithm for multi-agent path planning in Web3D technology. And the pgACO (planar grid ACO) and A* path planning algorithm have been implemented in this paper to compare with the m2ACO algorithm. The experimental results show that the m2ACO is more accurate than the other kinds of path planning algorithms.