Summary

International Technical Conference on Circuits/Systems, Computers and Communications

2016

Session Number:M2-1

Session:

Number:M2-1-5

An MILP Approach to Optimal Surveillance over Graphs

Mifuyu Kido,  Koichi Kobayashi,  Yuh Yamashita ,  

pp.133-136

Publication Date:2016/7/10

Online ISSN:2188-5079

DOI:10.34385/proc.61.M2-1-5

PDF download (942.1KB)

Summary:
The surveillance problem over graphs is to find an trajectory of an agent that travels each node as evenly as possible. This problem has several application such as city safety management and disaster rescue. In this paper, the finite-time optimal surveillance problem is formulated, and is reduced to a mixed integer linear programming (MILP) problem. Based on the policy of model predictive control, an optimal trajectory is generated by solving the MILP problem at each discrete time, and persistent surveillance can be realized.