Abstract: There is amount of data in a mountain scene, and the path planning algorithm in it is very complex, so it is not impossible to be shown detailed in Web. Usually the common potential path planning using contours can not find an optimal path because the path is easily cut under the cliff. To solve the above problems, a mACO (mountain ACO) path planning algorithm was addressed for the Web3D application, a planar grid ACO path planning algorithm and a A* path planning were completed in Web3D environment. Then a typical battle scene case was used for the three kinds of algorithms to be compared in effectiveness, efficiency, and FPS. The result can be seen that all the three kinds of algorithms are real-time, but the mACO algorithm is more accurate than the others. Based on the optimal path and using leader-follower idea, a real-time effective multi-agent path planning is implemented.

Key words: Web3D mountain scene, mACO (mountain ACO) algorithm, planar grid ACO algorithm, A* algorithm, multi-agent path planning