Optimal Distributed Searching in the Plane with and Without Uncertainty

DOI10.1007/978-3-319-30139-6_6zbMath1475.68393arXiv1410.1077OpenAlexW1655324574MaRDI QIDQ2803811

Daniela Maftuleac, Alejandro López-Ortiz

Publication date: 3 May 2016

Published in: WALCOM: Algorithms and Computation (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Artificial intelligence for robotics (68T40)

Cites Work

• Searching in the plane
• A polynomial time primal network simplex algorithm for minimum cost flows
• The theory of search games and rendezvous.
• Parallel searching in the plane
• Collaborative search on the plane without communication

This page was built for publication: Optimal Distributed Searching in the Plane with and Without Uncertainty