Multi-robot area patrol under frequency constraints
From MaRDI portal
Publication:693285
Recommendations
- Stochastic strategies for patrolling a terrain with a synchronized multi-robot system
- Distributed patrolling with two-speed robots (and an application to transportation)
- Approximation algorithms for multi-robot patrol-scheduling with min-max latency
- A survey of multi-robot coverage
- scientific article; zbMATH DE number 1954195
- Optimal patrolling of high priority segments while visiting the unit interval with a set of mobile robots
Cites work
- scientific article; zbMATH DE number 1950764 (Why is no real title available?)
- scientific article; zbMATH DE number 1869468 (Why is no real title available?)
- A distributed ant algorithm for efficiently patrolling a network
- Competitive on-line coverage of grid environments by a mobile robot
- Coverage for robotics -- a survey of recent results
- Efficiently searching a graph by a smell-oriented vertex process
- Spanning-tree based coverage of continuous areas by a mobile robot
- The giving tree: Constructing trees for efficient offline and online multi-robot coverage
Cited in
(19)- Frequency-based multi-agent patrolling model and its area partitioning solution method for balanced workload
- Monitoring the plane with rotating radars
- Multi-robot adversarial patrolling strategies via lattice paths
- Distributed patrolling with two-speed robots (and an application to transportation)
- Continuous surveillance of points by rotating floodlights
- Persistent awareness coverage control for mobile sensor networks
- Multi-robot adversarial patrolling: handling sequential attacks
- When patrolmen become corrupted: monitoring a graph using faulty mobile robots
- Patrolling security games: definition and algorithms for solving large instances with single patroller and single intruder
- Joint search with self-interested agents and the failure of cooperation enhancers
- Stochastic strategies for patrolling a terrain with a synchronized multi-robot system
- Of robot ants and elephants: a computational comparison
- Patrolling a path connecting a set of points with unbalanced frequencies of visits
- Guard games on graphs: keep the intruder out!
- Generalised formulations for minimum distance trajectory in patrolling problems
- Evasive navigation of an autonomous mobile robot in hostile unknown environments
- Optimal multirobot coverage path planning: ideal-shaped spanning tree
- Optimal control for multi-agent persistent monitoring
- Approximation algorithms for multi-robot patrol-scheduling with min-max latency
This page was built for publication: Multi-robot area patrol under frequency constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q693285)
