Skip to main content

Using Evolutionary Programming to Optimize the Allocation of Surveillance Assets

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 1585))

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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

    MATH  Google Scholar 

  2. 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

    Google Scholar 

  3. 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

    Article  Google Scholar 

  4. Fogel, D.B. (1988) “An Evolutionary Approach to the Traveling Salesman Problem,” Biological Cybernetics, Vol 60:2, pp. 139–144

    Article  MathSciNet  Google Scholar 

  5. Fogel, L.J., Owens, A.J., and Walsh, M.J. (1966) Artificial Intelligence through Simulated Evolution, New York, NY: John Wiley

    MATH  Google Scholar 

  6. Hopfield, J.J, and Tank, D.W., (1985) “Neural Computation of Decisions in Optimization Problems,” Biological Cybernetics, Vol. 52, pp. 141–152

    MATH  MathSciNet  Google Scholar 

  7. 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

    Google Scholar 

  8. Sedgewick, R. (1983) Algorithms, Reading, MA: Addison Wesley, pp. 513–524

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints 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

Publish with us

Policies and ethics