Trade-offs between selection complexity and performance when searching the plane without communication

DOI10.1145/2611462.2611463zbMath1321.68480arXiv1405.1688OpenAlexW2029568832MaRDI QIDQ2943625

Christoph Lenzen, Calvin Newport, Tsvetomira Radeva, Nancy A. Lynch

Publication date: 3 September 2015

Published in: Proceedings of the 2014 ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1405.1688

zbMATH Keywords

Markov chainssearch algorithmsdistributed algorithmsmobile agentsbiology-inspired algorithms

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed algorithms (68W15)

Related Items (10)

Evacuating from \(\ell_p\) unit disks in the wireless model (extended abstract) ⋮ The ANTS problem ⋮ Searching without communicating: tradeoffs between performance and selection complexity ⋮ Evacuating an Equilateral Triangle in the Face-to-Face Model ⋮ Evacuating Robots from a Disk Using Face-to-Face Communication (Extended Abstract) ⋮ ANTS on a Plane ⋮ Evacuating from \(\ell_p\) unit disks in the wireless model ⋮ How many ants does it take to find the food? ⋮ Evacuating equilateral triangles and squares in the face-to-face model ⋮ Exploration of High-Dimensional Grids by Finite Automata

This page was built for publication: Trade-offs between selection complexity and performance when searching the plane without communication