Say we had two agents and we want them both to traverse a map concurrently.
Their goal is to collectively visit a collection of certain points on the map. If there was just one agent, it would be simple enough to just implement BFS or A* and get a good solution.
But considering there are two, how can we divide the points to be visited among the two agents in such a way that no steps (or minimal steps) are wasted in visiting all the points?
-The points do not need to be visited in a particular order. -If there was only one agent, I could get a possible solution with a BFS or A* where the goal state is all the points having been visited.
Edit 2: Pictures
An example of the problem might be as seen below. Agents start at the top left of the maze and the goal is a state space where all the red dots have been visited.