Abstract
An intelligent surveillance planning system must allocate available resources to optimize data collection with respect to a variety of operational requirements. In addition, these requirements often vary temporally (i.e., targets of interest move, priorities change, etc.), requiring dynamic reoptimization on-the-fly. Allocation of surveillance resources has typically been accomplished either by human planners, (for small problems of very limited complexity) or by deterministic methods (typically producing suboptimal solutions which are incapable of adapting to dynamic changes in the environment). The method presented here solves these problems by using evolutionary programming to optimize the simultaneous and coordinated scheduling of multiple surveillance assets. The problem of allocating unmanned aerial vehicles (UAVs) to acquire temporally variable, time-differential intelligence data is addressed. Imposition of realistic constraints ensures solution feasibility in real-world problems. This implementation can be modified to optimize solutions for a suite of different surveillance asset types, such as manned vehicles and satellites.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Aho, A.V., Hopcroft, J.E., and Ullman, J.D., (1974) The Design and Analysis of Computer Algorithms, Reading, MA: Addison-Wesley, pp. 364–404
Blanton, J.L. Jr. and Wainwright, R.L. (1993) “Multiple Vehicle Routing with Time and Capacity Constraints using Genetic Algorithms,” Proc. of the Fifth International Conference on Genetic Algorithms, Stephanie Forrest ed., San Mateo, CA: Morgan Kaufmann, pp. 452–459
Dorigo, M. and Gambardella, L.M., (1997) “Ant Colony System: A Cooperative Learning Approach to the Traveling Salesman Problem,” IEEE Trans. on Evolutionary Computation, Vol. 1,No. 1, pp. 53–66
Fogel, D.B. (1988) “An Evolutionary Approach to the Traveling Salesman Problem,” Biological Cybernetics, Vol 60:2, pp. 139–144
Fogel, L.J., Owens, A.J., and Walsh, M.J. (1966) Artificial Intelligence through Simulated Evolution, New York, NY: John Wiley
Hopfield, J.J, and Tank, D.W., (1985) “Neural Computation of Decisions in Optimization Problems,” Biological Cybernetics, Vol. 52, pp. 141–152
Porto, V.W., and Fogel, L.J. (1997) “Evolution of Intelligently Interactive Behaviors for Simulated Forces,” Proceedings of the Sixth International Conference on Evolutionary Programming, P.J. Angeline, R.G. Reynolds, J.R. McDonnell, and R. Eberhart (eds.), Berlin: Springer Verlag, pp. 419–429
Sedgewick, R. (1983) Algorithms, Reading, MA: Addison Wesley, pp. 513–524
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Porto, V.W. (1999). Using Evolutionary Programming to Optimize the Allocation of Surveillance Assets. In: McKay, B., Yao, X., Newton, C.S., Kim, JH., Furuhashi, T. (eds) Simulated Evolution and Learning. SEAL 1998. Lecture Notes in Computer Science(), vol 1585. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48873-1_29
Download citation
DOI: https://doi.org/10.1007/3-540-48873-1_29
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65907-5
Online ISBN: 978-3-540-48873-6
eBook Packages: Springer Book Archive