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

DOI10.1016/J.ARTINT.2012.10.006MaRDI QIDQ360100zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

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

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

Cited in

(10)

• Verification of agent navigation in partially-known environments
• Simple Strategies Versus Optimal Schedules in Multi-agent Patrolling
• The robot routing problem for collecting aggregate stochastic rewards
• Frequency-based multi-agent patrolling model and its area partitioning solution method for balanced workload
• Spatial coverage in routing and path planning problems
• Policies for risk-aware sensor data collection by mobile agents
• Boundary Patrolling by Mobile Agents with Distinct Maximal Speeds
• Efficient informative sensing using multiple robots
• Decentralized redistribution for cooperative patrol
• scientific article; zbMATH DE number 1950764 (Why is no real title available?)

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)