Disclaimer: This isn't my area of expertise.
Did CO consider a pathfinding implemenation based on a All Pair Shortest Path algorithm?
Background for everyone else: Multi-agent pathfinding is not a trivial problem in computer science. With an APSP implementation you calculate the costs of the shortest paths between all nodes and save them. You update as necessary, say when you change a road. You move from one node to the next by choosing the node that is the closest to your destination. You can also take traffic conditions into account when making decisions. The updating of the table doesn't exactly have to be real-time, but from my understanding, this gives you a bit more dynamic pathfinding is much cheaper allowing more agents, and makes the actual pathfinding algroirthm much simpler.
Feel free to correct any mistakes!
Did CO consider a pathfinding implemenation based on a All Pair Shortest Path algorithm?
Background for everyone else: Multi-agent pathfinding is not a trivial problem in computer science. With an APSP implementation you calculate the costs of the shortest paths between all nodes and save them. You update as necessary, say when you change a road. You move from one node to the next by choosing the node that is the closest to your destination. You can also take traffic conditions into account when making decisions. The updating of the table doesn't exactly have to be real-time, but from my understanding, this gives you a bit more dynamic pathfinding is much cheaper allowing more agents, and makes the actual pathfinding algroirthm much simpler.
Feel free to correct any mistakes!