Near-optimal continuous patrolling with teams of mobile information gathering agents

DOI10.1016/J.ARTINT.2012.10.006zbMATH Open1270.68338OpenAlexW2160432815MaRDI QIDQ360100FDOQ360100

Authors: R. Stranders, E. Munoz de Cote, Alex Rogers, Nicholas R. Jennings 

Publication date: 26 August 2013

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0004370212001282

Recommendations

• A sub-modular receding horizon solution for mobile multi-agent persistent monitoring
• Patrolling on dynamic ring networks
• Simple Strategies Versus Optimal Schedules in Multi-agent Patrolling
• Optimal control for multi-agent persistent monitoring
• A distributed ant algorithm for efficiently patrolling a network

Mathematics Subject Classification ID

Artificial intelligence for robotics (68T40) Agent technology and artificial intelligence (68T42)

Cited In (8)

• The Robot Routing Problem for Collecting Aggregate Stochastic Rewards
• Boundary Patrolling by Mobile Agents with Distinct Maximal Speeds
• Verification of agent navigation in partially-known environments
• Title not available (Why is that?)
• Decentralized redistribution for cooperative patrol
• Simple Strategies Versus Optimal Schedules in Multi-agent Patrolling
• Efficient informative sensing using multiple robots
• Spatial coverage in routing and path planning problems

This page was built for publication: Near-optimal continuous patrolling with teams of mobile information gathering agents

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