Patrolling by robots equipped with visibility

DOI10.1007/978-3-319-09620-9_18MaRDI QIDQ5496161zbMATH OpenOpenAlexFDO

Authors Jurek Czyzowicz, Dominik Pajak, 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

cyclegraphmobile robotspatrollingsegmentspeedvisibility

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)

Recommendations

• Patrolling a path connecting a set of points with unbalanced frequencies of visits
• Patrolling trees with mobile robots
• Simple Strategies Versus Optimal Schedules in Multi-agent Patrolling
• On fence patrolling by mobile agents
• Boundary Patrolling by Mobile Agents with Distinct Maximal Speeds

Cited in

(10)

• Patrolling trees with mobile robots
• When patrolmen become corrupted: monitoring a graph using faulty mobile robots
• Optimal patrolling of high priority segments while visiting the unit interval with a set of mobile robots
• Simple strategies versus optimal schedules in multi-agent patrolling
• Distributed patrolling with two-speed robots (and an application to transportation)
• When patrolmen become corrupted: monitoring a graph using faulty mobile robots
• Optimal strategies for patrolling fences
• Patrolling a path connecting a set of points with unbalanced frequencies of visits
• Distance-based solution of patrolling problems with individual waiting times
• Generalised formulations for minimum distance trajectory in patrolling problems

This page was built for publication: Patrolling by robots equipped with visibility

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5496161)