Probabilistic Pursuits on the Grid

DOI10.2307/2974581MaRDI QIDQ4339329zbMATH OpenOpenAlexFDO

Authors Colin L. Mallows, Israel A. Wagner, Alfred M. Bruckstein

Publication date 2 March 1998

Published in The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/2974581

zbMATH Keywords

ants and robotsdiscrete geometrypursuit problems

Mathematics Subject Classification ID

Limit theorems in probability theory (60F99) Positional games (pursuit and evasion, etc.) (91A24)

Review text

The first author [Math. Intell. 15, No. 2, 59-62 (1993; Zbl 0769.90088)] showed that the paths of a sequence of a(ge)nts engaged in chain pursuit converge to the straight line between the origin and destination. This paper considers the same problem in a discrete setting, where the agents are only allowed to visit grid points and the pursuit is done according to a probabilistic rule of motion. A similar result is proved: The ``average a(ge)nt path converges to the straight line between the origin and the destination. It is shown that the paths become equiprobably distributed over all monotone grid-trajectories from the origin to the destination, and this implies that the agents are most likely found in the close vicinity of the straigth line.

Recommendations

• Probabilistic pursuits on graphs
• Vision-Based Pursuit-Evasion in a Grid
• Vision-based pursuit-evasion in a grid
• Rendezvous search on a graph
• Optimal Algorithms for a Pursuit-Evasion Problem in Grids

Cited in

(5)

• Row straightening via local interactions
• Lost in self-stabilization: a local process that aligns connected cells
• Probabilistic pursuits on graphs
• Why the ant trails look so straight and nice
• Lost in self-stabilization

This page was built for publication: Probabilistic Pursuits on the Grid

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4339329)