While part of the original concept, Auto Routing was removed based on a misunderstanding. It is being re-implemented into the experiment as it will add so much more capability.
As the experiment runs, each robot (Zoomie) will be dispatched at random times to random locations. That dispatch message will contain the driving directions to get to the destination. In navigation systems, shortest path algorithms perform this task. Their purpose is very specific, to find the shortest path from all available options to get from start to finish.
Initially it was believed that this would create a bad data set as all robots would pass through the city center thus clogging up those streets. However, as one of our viewers pointed out, the data set can be used to modify the behavior of the algorithm so that it AVOIDS the city center and instead uses the bypass "highway". While not shorter, it ultimately is faster because there is far less stop-and-go situations and less traffic creating additional delays.
This video is not an explanation of how this particular (Dijkstra) function works, rather it is about its implementation in this experiment and later on how it will be used to alter the flow of traffic through ZoomTown.
Cheers!
Chris
No comments:
Post a Comment