Informative Path Planning and Sensor Scheduling for Persistent Monitoring Tasks
In this thesis we consider two combinatorial optimization problems that relate to the field of persistent monitoring. In the first part, we extend the classic problem of finding the maximum weight Hamiltonian cycle in a graph to the case where the objective is a submodular function of the edges. We...
| Main Author: | |
|---|---|
| Language: | en |
| Published: |
2013
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10012/7896 |