Boundary Patrolling by Mobile Agents with Distinct Maximal Speeds
From MaRDI portal
Publication:3092272
DOI10.1007/978-3-642-23719-5_59zbMath1260.68397OpenAlexW1728603878MaRDI QIDQ3092272
Jurek Czyzowicz, Adrian Kosowski, Leszek Gąsieniec, Evangelos Kranakis
Publication date: 16 September 2011
Published in: Algorithms – ESA 2011 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-23719-5_59
Related Items
Two Robots Patrolling on a Line: Integer Version and Approximability, On the robustness of a synchronized multi-robot system, When patrolmen become corrupted: monitoring a graph using faulty mobile robots, Simple Strategies Versus Optimal Schedules in Multi-agent Patrolling, Perpetual maintenance of machines with different urgency requirements, The beachcombers' problem: walking and searching with mobile robots, Rendezvous of heterogeneous mobile agents in edge-weighted networks, Simple strategies versus optimal schedules in multi-agent patrolling, Rendezvous Problem, Unnamed Item, Bamboo Garden Trimming Problem (Perpetual Maintenance of Machines with Different Attendance Urgency Factors), Distributed Patrolling with Two-Speed Robots (and an Application to Transportation), Approximation Algorithms for Barrier Sweep Coverage, Position discovery for a system of bouncing robots, Localization for a system of colliding robots, Linear search by a pair of distinct-speed robots, Bamboo garden trimming problem: priority schedulings, Fast two-robot disk evacuation with wireless communication, Unnamed Item, Computing the \(k\)-resilience of a synchronized multi-robot system, Beachcombing on strips and islands, Searching by heterogeneous agents, Approximation Algorithms for Multi-Robot Patrol-Scheduling with Min-Max Latency, Problems on track runners, A dynamic extremum seeking scheme for three-player attack-defense with unknown gradient, Linear Search by a Pair of Distinct-Speed Robots, Group search of the plane with faulty robots, Approximation algorithm for sweep coverage on graph, Fence patrolling by mobile agents with distinct speeds, Optimal patrolling of high priority segments while visiting the unit interval with a set of mobile robots
