Routing on spatiotemporal networks without global knowledge

@inproceedings{Hoffmann2012RoutingOS,
  title={Routing on spatiotemporal networks without global knowledge},
  author={Till Hoffmann},
  year={2012}
}
The formulation of most shortest-path problems makes two simplifying assumptions: (1) the edge weights are deterministic, and (2) global knowledge of the network is available. I develop a decentralised routing algorithm providing en-route guidance for travellers without global knowledge on spatial networks with stochastic edge weights. The algorithm guides… CONTINUE READING