[DonHopkins]

That't not unlike how the dynamic adaptive local traffic routing works in the procedural Distributed City Generation rule for the Moveable Feast Machine.

Robust-first Computing: Distributed City Generation.

https://www.youtube.com/watch?v=XkSXERxucPc

>A rough video demo of Trent R. Small's procedural city generation dynamics in the Movable Feast Machine simulator. See http://nm8.us/q for more information. Apologies for the poor audio!

Here's the fascinating paper that describes exactly how that works:

Local Routing in a new Indefinitely Scalable Architecture, by Trent Small.

https://www.cs.unm.edu/~ackley/papers/paper_tsmall1_11_24.pd...

>Abstract: 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.