2 ms·
For some inspiration about adaptive traffic routing, check out this Distributed City Generation rule for the Moveable Feast Machine. https://www.youtube.com/wa
by DonHopkins 8y ago
For some inspiration about adaptive traffic routing, check out this Distributed City Generation rule for the Moveable Feast Machine.
https://www.youtube.com/watch?v=XkSXERxucPc https://www.youtube.com/watch?v=XkSXERxucPc
>Robust-first Computing: Distributed City Generation: A rough video demo of Trent R. Small's procedural city generation dynamics in the Movable Feast Machine simulator. See http://nm8.us/q http://nm8.us/q for more information.
The link for more information is to the paper "Local Routing in a new Indefinitely Scalable Architecture" by Trent Small:
>Local routing is a problem which most of us face on a daily basis as we move around the cities we live in. This study proposes several routing methods based on road signs in a procedurally generated city which does not assume knowledge of global city structure and shows its overall efficiency in a variety of dense city environments. We show that techniques such as Intersection-Canalization allow for this method to be feasible for routing information arbitrarily on an architecture with limited resources.
In a nutshell, the route destinations send out a "smell" along channels in the sidewalk, and the intersections look at the different roads coming into them, and steer cars towards the direction with the strongest smell that they're looking for. (There are some more nuances, but routing information flows along sidewalks to intersections, and the city adaptively learns to route traffic, and can gracefully recover from failure and change.)
- theanzelm 8y agoThis works well if you only care about the class of destination. In Citybound, people have unique, persistent homes, jobs and favourite suppliers of goods, so you always need point-to-point routing. I'm using a kind of internet-like dynamic routing table embedded in the road network to distribute the problem.