When patrolmen become corrupted: monitoring a graph using faulty mobile robots
type: Item
instance of: scholarly article
title: When patrolmen become corrupted: monitoring a graph using faulty mobile robots
zbMATH Open document ID: 1380.68367
author: Jurek Czyzowicz
author: Adrian Kosowski
author: Evangelos Kranakis
author: D. Krizanc
author: Najmeh Taleb
author: Leszek Gąsieniec
published in: Algorithmica
publication date: 2017-11-09T00:00:00Z
Mathematics Subject Classification ID: 68T40
Mathematics Subject Classification ID: 68M15
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 6804045
zbMATH Keywords: mobile robot
zbMATH Keywords: fault-tolerant
zbMATH Keywords: patrolling
zbMATH Keywords: idleness
zbMATH Keywords: Kotzig graphs
MaRDI profile type: Publication
full work available at URL: s00453-016-0233-9
OpenAlex ID: W2535803352
cites work: Gathering Despite Mischief
cites work: Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots
cites work: Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems
cites work: Patrolling games
cites work: Convergence of Autonomous Mobile Robots with Inaccurate Sensors and Movements
cites work: Boundary Patrolling by Mobile Agents with Distinct Maximal Speeds
cites work: Fault-Tolerant and Self-stabilizing Mobile Robots Gathering
cites work: On fence patrolling by mobile agents
cites work: Multi-robot area patrol under frequency constraints
cites work: The NP-Completeness of Edge-Coloring
cites work: The gathering problem for two oblivious robots with unreliable compasses
cites work: Q4198056
cites work: Fence patrolling by mobile agents with distinct speeds
cites work: Q5560917
cites work: Q4413473
cites work: Q4944984
cites work: A distributed ant algorithm for efficiently patrolling a network
DOI: 10.1007/S00453-016-0233-9
description: scientific article; zbMATH DE number 6804045