Abstract
Mission planning for surveillance coverage is of both practical and theoretical interest. In brief, regional surveillance involves planning the search of certain given regions in the minimum possible time. The surveillance problem can therefore be described as a variant of the classical travelling salesman problem. The uniqueness of the problem lies in the different allowed entry and exit points. Additionally, the mission schedule has to ensure the probability of target detection must not be compromised. From the practical perspective, any reduction in travelling time provides immediate cost savings to the defence department. A dynamic programming formulation is derived for the regional surveillance problem. An example is included to illustrate the methodology.
Similar content being viewed by others
References
Bertsekas DP and Tsitsiklis J (1996). Neuro-Dynamic Programming. Athena Scientific: Belmont, MA.
Bland RG and Shallcross DF (1989). Large traveling salesman problems arising from experiments in X-ray crystallography: A preliminary report on computation. Opns Res Lett 8: 125–128.
Brugioni DA (1993). Reconnaissance and surveillance. In: Dupuy TN (ed). International Military and Defense Encyclopedia. Macmillan: New York.
Canadian Forces Cost Factors Manual (2005). Department of National Defence, Canada.
Grötschel M, Jünger M and Reinelt G (1991). Optimal control of plotting and drilling machines: A case study. Z Opns Res 32: 1195–1220.
John M, Panton D and White K (2001). Mission planning for regional surveillance. Ann Opns Res 108: 157–173.
Jünger M, Reinelt G and Rinaldi G (1995). The traveling salesman problem. In: Ball MO., Magnanti TL, Monma GL and Nemhauser G.L. (eds). Handbook in Operations Research and Management Sciences, vol. 7. North-Holland: Amsterdam.
Ng KYK and Ghanmi A (2002). An automated surface surveillance system. J Opl Res Soc 53: 1–12.
Ng KYK and Sancho NGF (2001). A hybrid dynamic programming/depth-first-search algorithm, with an application to redundancy allocation. Inst Ind Eng Trans 33: 1047–1058.
Panton D and Elbers A (1999). Mission planning for synthetic aperture radar surveillance. Interfaces 29(2): 73–88.
Plante R, Lowe TJ and Chandrasekaran R (1995). The product matrix traveling salesman problem: An application and solution heuristics. Opns Res 35: 772–783.
Wagner DH, Mylander WC and Sanders TJ (1999). Naval Operations Analysis, 3rd ed. Naval Institute Press: Annapolis, MD.
Acknowledgements
The first author wishes to thank LCol. Bigelow, MARPAC for introducing him to this problem. The analysis presented in this paper is solely the opinions of the authors and does not represent the official views of the Department of National Defence.© Crown Copyright–Canadian Government
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Ng, K., Sancho, N. Regional surveillance of disjoint rectangles: a travelling salesman formulation. J Oper Res Soc 60, 215–220 (2009). https://doi.org/10.1057/palgrave.jors.2602507
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1057/palgrave.jors.2602507