I've just started learning AI and I have a certain problem:
We have directed connected graph, where nodes are places one can go to and edges are the "roads" between places. We have K agents whose goal is to meet in one node. Agents start in different nodes. Note that more than one agent can be at one node at the same time and that all agents move by one node at every turn(they move synchronously).
We have to variants of this task:
1) in each turn every agent must move
2) an agent may pass on moving.
For a chosen variant I have to find an algorithm to complete this task, but it cannot be the searching state-space algorithm.
I've been sitting on this for a while but I cannot think of anything.
I've been thinking if agents could know each other positions in order to choose where to go, but it's searching state space. I also thought that if agents meet, they could continue together. But I'm looking for an alternative to searching state-space algorithms.