Skip to main content

Numerical Techniques for Efficient Sonar Bearing and Range Searching in the Near Field Using Genetic Algorithms

  • Chapter
Evolutionary Algorithms in Engineering Applications

Summary

This article describes a numerical method that may be used to efficiently locate and track underwater sonar targets in the near-field, with both bearing and range estimation, for the case of very large passive arrays. The approach used has no requirement for a priori knowledge about the source and uses only limited information about the receiver array shape. The role of sensor position uncertainty and the consequence of targets always being in the near-field are analysed and the problems associated with the manipulation of large matrices inherent in conventional eigenvalue type algorithms noted. A simpler numerical approach is then presented which reduces the problem to that of search optimization. When using this method the location of a target corresponds to finding the position of the maximum weighted sum of the output from all sensors. Since this search procedure can be dealt with using modern stochastic optimization methods, such as the genetic algorithm, the operational requirement that an acceptable accuracy be achieved in real time can usually be met.

The array studied here consists of 225 elements positioned along a flexible cable towed behind a ship with 3.4m between sensors, giving an effective aperture of 761.6m. For such a long array, the far field assumption used in most beam-forming algorithms is no longer appropriate. The waves emitted by the targets then have to be considered as curved rather than plane. It is shown that, for simulated data, if no significant noise occurs in the same frequency band as the target signal, then bearing and range can be estimated with negligible error. When background noise is present (at -14dB), the target can normally still be located to within 1% in bearing and to around 5% error in range. Array shape uncertainty worsens this performance but it is shown that it is still possible to accurately determine the target bearing and to provide approximate estimates of range in such circumstances. Finally, the ability of the approach to track the sources over a period of time and with evolving array shape is demonstrated.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 189.00
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. T. Back, F. Hoffmeister, and H.-P. Schwefel. A survey of evolution strategies. In R. K. Belew and L. B. Booker, editors, Proceedings of the 4th International Conference on Genetic Algorithms (ICGA IV), pages 2–9, San Diego, 1991. Morgan Kaufman Publishers, Inc.

    Google Scholar 

  2. S. Baluja. Population-Based Incremental Learning: A Method for Integrating Genetic Search Based Function Optimization and Competitive Learning. Carnegie Mellon University, 1994.

    Google Scholar 

  3. M.J. Box. A new method of constrained optimization and a comparison with other methods. Comp. J., 8:42–52, 1965.

    Article  MathSciNet  MATH  Google Scholar 

  4. L. Davis. Bit-climbing, representational bias, and test suite design. In R. K. Belew and L. B. Booker, editors, Proceedings of the 4th International Conference on Genetic Algorithms (ICGA IV), pages 18–23, San Diego, 1991. Morgan Kaufman Publishers, Inc.

    Google Scholar 

  5. NAg E04UCF. NAg Mark 14 Reference Manual. Numerical Algorithms Group Ltd., Oxford, 1990.

    Google Scholar 

  6. D.J. Edwards and P.M. Terrell. The smoothed step track antenna controller. Int. J. Satellite Comms., 1(1):133–139, 1981.

    Google Scholar 

  7. D.D. Feldman and L.J. Griffiths. A projection approach for robust adaptive beamforming. IEEE Trans. on Signal Processing, 42(4):867–876, 1994.

    Article  Google Scholar 

  8. D.B. Fogel. Applying evolutionary programming to selected traveling salesman problems. Cybernetics and Systems, 24(1):27–36, 1993.

    Article  MathSciNet  Google Scholar 

  9. W.R. Hahn. Optimum signal processing for passive sonar range and bearing estimation. J. Acoust. Soc. Am., 58(1):201–207, 1975.

    Article  Google Scholar 

  10. S. Haykin, J.H. Justice, N.L. Ouisley, J.L. Yen, and A.C. Kak. Array Signal Processing. Prentice Hall, 1985.

    MATH  Google Scholar 

  11. D.H. Johnson. The application of spectral estimation methods to bearing estimation problems. Proc. I.E.E., 70(9):1018–1028, 1982.

    Google Scholar 

  12. A.J. Keane. The OPTIONS concept design system user manual. Dynamics Modelling Ltd., 1993.

    Google Scholar 

  13. A.J. Keane. Experiences with optimizers in structural design. In I.C. Parmee, editor, Proceedings of the Conference on Adaptive Computing in Engineering Design and Control 94, pages 14–27, Plymouth, U.K., 1994. University of Plymouth, P.E.D.C.

    Google Scholar 

  14. A.J. Keane. Passive vibration control via unusual geometries: the application of genetic algorithm optimization to structural design. J. Sound Vib., 185(3):441— 453, 1995.

    Article  MathSciNet  MATH  Google Scholar 

  15. S. Kirkpatrick, C.D. Gelatt, Jr., and M.P. Vecchi. Optimization by simulated annealing. Science, 220(4598):671–680, 1983.

    Article  MathSciNet  MATH  Google Scholar 

  16. S.J. Marcos. Calibration of a distorted towed array using a propagation vector. J. Acoust. Soc. Am., 93(4)(1):1987–1994, 1993.

    Article  Google Scholar 

  17. J.A. Nelder and R. Meade. A simplex method for function minimization. Computer J., 7:308–313, 1965.

    Article  MATH  Google Scholar 

  18. B.P. Ng, M.H. Er, and C. Kot. Array gain/phase calibration techniques for adaptive beamforming and direction finding. IEE Proc Radar, Sonar Navigation, 141(1):25–29, 1994.

    Article  Google Scholar 

  19. L.A. Pflug, G.E. Loup, J.W. Loup, R.L. Field, and J.H. Leclere. Time delay estimation for deterministic transients using second and higher order correlations. J. Acoust. Soc. Am., 94(3)(1):1385–1399, 1993.

    Article  Google Scholar 

  20. W.H. Press, B.P. Flannery, S.A. Teukolsky, and W.T. Vetterling. Numerical Recipes: the Art of Scientific Computing. Cambridge University Press, 1986.

    Google Scholar 

  21. H.H. Rosenbrock. An automatic method for finding the greatest or least value of a function. Comp. J., 3:175–184. 1960.

    Article  MathSciNet  Google Scholar 

  22. H.-P. Schwefel. Evolution and Optimum Seekina. John Wiley and Sons. 1995.

    Google Scholar 

  23. J.N. Siddall. Optimal Engineering Design: Principles and Applications. Marcel Dekker, Inc., 1982.

    Google Scholar 

  24. C.J. Tsai and J.F. Yang. Autofocussing technique for adative coherent signal- subspace transformatio beamformers. IEE Proc Radar, Sonar Navigation, 141(1):30–36, 1994.

    Article  Google Scholar 

  25. D. Yuret and M. de la Maza. Dynamic hill climbing: Overcoming the limitations of optimization techniques. In Proceedings of the 2nd Turkish Symposium on AI and ANN, pages 254–260, 1993.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Edwards, D.J., Keane, A.J. (1997). Numerical Techniques for Efficient Sonar Bearing and Range Searching in the Near Field Using Genetic Algorithms. In: Dasgupta, D., Michalewicz, Z. (eds) Evolutionary Algorithms in Engineering Applications. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-03423-1_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-03423-1_22

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-08282-5

  • Online ISBN: 978-3-662-03423-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics