Dijkstra算法和Floyd算法. Contribute to ShaoQiBNU/The-shortest-path development by creating an account on GitHub.

Finally, the path planning for each map is merged to achieve collaborative multi-agent coverage search. Each partitioned map includes one agent, giving rise to multiple partitioning approaches.