MPC-Based Surveillance over Graphs by Multiple Agents
The multi-agent surveillance problem over graphs is to find trajectories of multiple agents that travel each node as evenly as possible. This problem has several applications such as city safety management and disaster rescue. In this paper, the finite-time optimal surveillance problem is formulated...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Taylor & Francis Group
2017-05-01
|
| Series: | SICE Journal of Control, Measurement, and System Integration |
| Subjects: | |
| Online Access: | http://dx.doi.org/10.9746/jcmsi.10.253 |