You can’t get there from here: sensor scheduling with refocusing delays
- 115 Downloads
We study a problem in which a single sensor is scheduled to observe sites periodically, motivated by applications in which the goal is to maintain up-to-date readings for all the observed sites. In the existing literature, it is typically assumed that the time for a sensor switching from one site to another is negligible. This may not be the case in applications such as camera surveillance of a border, however, in which the camera takes time to pan and tilt to refocus itself to a new geographical location. We formulate a problem with constraints modeling refocusing delays. We prove the problem to be NP-hard and then study a special case in which refocusing is proportional to some Euclidian metric. We give a lower bound on the optimal cost for the scheduling problem, and we derive exact solutions for some special cases of the problem. Finally, we provide and experimentally evaluate several heuristic algorithms, some of which are based on the computed lower bound, for the setting of one sensor and many sites.
KeywordsSensor scheduling Delay constraints Sensor networks Sensors Surveillance Resource allocation Algorithms
This research was sponsored by US Army Research laboratory and the UK Ministry of Defence and was accomplished under Agreement Number W911NF-06-3-0001. The views and conclusions contained in this document are those of the authors and should not be interpreted as representing the official policies, either expressed or implied, of the US Army Research Laboratory, the US Government, the UK Ministry of Defence, or the UK Government. The US and UK Governments are authorized to reproduce and distribute reprints for Government purposes notwithstanding any copyright notation hereon.
- 2.Yavuz, M., & Jeffcoat, D.E. (2007). Single sensor scheduling for multi-site surveillance. Air Force Research Laboratory : Technical report.Google Scholar
- 3.Boyko, N., Turko, T., Boginski, V., Jeffcoat, D.E., Uryasev, S., Zrazhevsky, G., & Pardalos, P.M. (2009). Robust multi-sensor scheduling for multi-site surveillance. Journal of Combinatorial Optimization, ISSN 1382–6905. doi: 10.1007/s10878-009-9271-4.
- 7.Uryasev, S., & Pardalos, P. (2011). Detecting and jamming dynamic communication networks in anti-access environments. DTIC Document: Technical report.Google Scholar
- 8.Acharya, S., Alonso, R., Franklin, M.J., & Zdonik, S.B. (1995). Broadcast disks: Data management for asymmetric communications environments. In SIGMOD conference, pp. 199–210.Google Scholar
- 12.Silberschatz, A., Galvin, P., & Gagne, G. (2002). Operating system concepts (6th ed.). New York: Wiley.Google Scholar
- 14.Chin, W., & Ntafos, S.C. (1986). Optimum watchman routes. In Symposium on computational geometry, pp. 24–33.Google Scholar
- 15.Costello, C.J., Diehl, C.P., Banerjee, A., & Fisher, H. (2004). Scheduling an active camera to observe people. In VSSN ’04: Proceedings of the ACM 2nd international workshop on video surveillance and sensor networks, (pp. 39–45). New York, NY: ACM.Google Scholar
- 18.Piciarelli, C., Micheloni, C., & Foresti, G.L. (2010). Occlusion-aware multiple camera reconfiguration. In Proceedings of the fourth ACM/IEEE international conference on distributed smart cameras, ICDSC ’10 (pp. 88–94). New York, NY: ACM.Google Scholar
- 19.Starzyk, W., & Qureshi, F.Z. (2011). Learning proactive control strategies for ptz cameras. In Distributed smart cameras (ICDSC), 2011 fifth ACM/IEEE international conference on, pp. 1–6.Google Scholar
- 21.Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: A guide to the theory of NP-colmpleteness. San Francisco: Freeman.Google Scholar