Computing the \(k\)-resilience of a synchronized multi-robot system

DOI10.1007/s10878-018-0297-3zbMath1421.90152arXiv1707.07083OpenAlexW2963505198WikidataQ129895233 ScholiaQ129895233MaRDI QIDQ721922

Mario A. Lopez, Luis-Evaristo Caraballo, Sergey Bereg, José-Miguel Díaz-Báñez

Publication date: 20 July 2018

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1707.07083

zbMATH Keywords

synchronizationresiliencemulti-robot system

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items

Failure and communication in a synchronized multi-drone system, Stochastic strategies for patrolling a terrain with a synchronized multi-robot system, On the robustness of a synchronized multi-robot system, On optimal coverage of a tree with multiple robots, Connectivity and stochastic robustness of synchronized multi-drone systems

Cites Work

• Unnamed Item
• Unnamed Item
• On fence patrolling by mobile agents
• Hardness results and spectral techniques for combinatorial problems on circulant graphs
• New results in the packing of equal circles in a square
• Fence patrolling by mobile agents with distinct speeds
• View-obstruction problems
• Simple Strategies Versus Optimal Schedules in Multi-agent Patrolling
• Boundary Patrolling by Mobile Agents with Distinct Maximal Speeds
• Algorithmic Number Theory