Parallel searching in the plane

From MaRDI portal
Publication:1903637

DOI10.1016/0925-7721(95)00003-RzbMath0839.68104OpenAlexW2058489548MaRDI QIDQ1903637

René Schott, Ricardo A. Baeza-Yates

Publication date: 12 December 1995

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0925-7721(95)00003-r




Related Items

On-line parallel heuristics, processor scheduling and robot searching under the competitive frameworkAgent searching in a tree and the optimality of iterative deepeningUnnamed ItemEnergy-Optimal Broadcast in a Tree with Mobile AgentsEvacuating an Equilateral Triangle in the Face-to-Face ModelGod save the queenImproved Lower Bounds for Shoreline SearchEvacuating two robots from multiple unknown exits in a circleOvercoming probabilistic faults in disoriented linear searchA nearly tight lower bound for the \(d\)-dimensional cow-path problemEvacuating equilateral triangles and squares in the face-to-face modelTreasure evacuation with one robot on a diskLinear search by a pair of distinct-speed robotsSearch on a line with faulty robotsParallel searching on \(m\) raysWireless evacuation on \(m\) rays with \(k\) searchersPriority evacuation from a disk: the case of \(n = 1,2,3\)Optimal Distributed Searching in the Plane with and Without UncertaintyLinear rendezvous with asymmetric clocksCompetitive Searching for a Line on a Line Arrangement.Energy Consumption of Group Search on a LineExploration of High-Dimensional Grids by Finite AutomataLinear Search by a Pair of Distinct-Speed RobotsCommunication Problems for Mobile Agents Exchanging EnergyGroup search of the plane with faulty robotsEnergy-optimal broadcast and exploration in a tree using mobile agentsMakespan trade-offs for visiting triangle edges (extended abstract)Graph exploration by energy-sharing mobile agents


Uses Software


Cites Work