Patrolling by Robots Equipped with Visibility

DOI10.1007/978-3-319-09620-9_18zbMath1416.68189OpenAlexW27048282MaRDI QIDQ5496161

Dominik Pająk, Jurek Czyzowicz, Najmeh Taleb, Evangelos Kranakis

Publication date: 7 August 2014

Published in: Structural Information and Communication Complexity (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/hal-00996773/file/pp-vis.pdf

zbMATH Keywords

graphcyclevisibilityspeedmobile robotssegmentpatrolling

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Artificial intelligence for robotics (68T40)

Related Items (5)

Simple strategies versus optimal schedules in multi-agent patrolling ⋮ Unnamed Item ⋮ Searching by heterogeneous agents ⋮ 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

This page was built for publication: Patrolling by Robots Equipped with Visibility