Pages that link to "Item:Q2947025"
From MaRDI portal
The following pages link to Simple Strategies Versus Optimal Schedules in Multi-agent Patrolling (Q2947025):
Displaying 12 items.
- Near-optimal continuous patrolling with teams of mobile information gathering agents (Q360100) (← links)
- On fence patrolling by mobile agents (Q405281) (← links)
- Computing the \(k\)-resilience of a synchronized multi-robot system (Q721922) (← links)
- When patrolmen become corrupted: monitoring a graph using faulty mobile robots (Q1679239) (← links)
- A distributed ant algorithm for efficiently patrolling a network (Q1879364) (← links)
- Simple strategies versus optimal schedules in multi-agent patrolling (Q2196578) (← links)
- Utility distribution strategy of the task agents in coalition skill games (Q2283848) (← links)
- Problems on track runners (Q2306363) (← links)
- Fence patrolling by mobile agents with distinct speeds (Q2353252) (← links)
- Boundary Patrolling by Mobile Agents with Distinct Maximal Speeds (Q3092272) (← links)
- Approximation Algorithms for Multi-Robot Patrol-Scheduling with Min-Max Latency (Q3381954) (← links)
- (Q5092349) (← links)