Simple Strategies Versus Optimal Schedules in Multi-agent Patrolling

DOI10.1007/978-3-319-18173-8_19zbMath1453.68195arXiv1411.6853OpenAlexW1826467630MaRDI QIDQ2947025

Makoto Soejima, Akitoshi Kawamura

Publication date: 21 September 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Artificial intelligence for robotics (68T40)

Related Items (6)

Simple strategies versus optimal schedules in multi-agent patrolling ⋮ Unnamed Item ⋮ Computing the \(k\)-resilience of a synchronized multi-robot system ⋮ Utility distribution strategy of the task agents in coalition skill games ⋮ Approximation Algorithms for Multi-Robot Patrol-Scheduling with Min-Max Latency ⋮ Problems on track runners

Cites Work

• Unnamed Item
• On fence patrolling by mobile agents
• Simple strategies versus optimal schedules in multi-agent patrolling
• Fence patrolling by mobile agents with distinct speeds
• On exactly covering systems of arithmetic sequences
• Boundary Patrolling by Mobile Agents with Distinct Maximal Speeds
• On disjoint residue classes

This page was built for publication: Simple Strategies Versus Optimal Schedules in Multi-agent Patrolling