Probabilistic Pursuits on Graphs

23 Oct 2017Michael AmirAlfred M. Bruckstein

We consider discrete dynamical systems of "ant-like" agents engaged in a sequence of pursuits on a graph environment. The agents emerge one by one at equal time intervals from a source vertex $s$ and pursue each other by greedily attempting to close the distance to their immediate predecessor, the agent that emerged just before them from $s$, until they arrive at the destination point $t$... (read more)

PDF Abstract

No code implementations yet. Submit your code now