Skip to main content
SpringerLink
Log in

A Based-DC Programming Approach for Planning a Multisensor Multizone Search for a Moving Target

  • Conference paper
Book cover Modelling, Computation and Optimization in Information Systems and Management Sciences

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 359))

  • 1552 Accesses

Abstract

In this paper, we consider a well-known problem in the general area of search theory: planning a multisensor in multizone search so as to minimize the probability of non-detection of a moving target under a given resource effort to be shared. The solution method is based on a combination of the forward-backward split technique and DC programming. Numerical experiments demonstrate the efficiency of the proposed algorithm in comparison with the existing method.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. de Boer, P.T., Kroese, D.P., Mannor, S., Rubinstein, R.Y.: A Tutorial on The Cross-Entropy Method. Annals of Operations Research 134, 19–67 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  2. Brown, S.S.: Optimal search for a moving target in discrete time and space. Operations Research 32(5), 1107–1115 (1979)

    Google Scholar 

  3. Cadre, J.P., Souris, G.: Searching Tracks. IEEE Transactions on Aerospace and Electronic systems 36(4), 1149–1166 (2000)

    Article  Google Scholar 

  4. Dobbie, J.M.: Transfer of detection contacts to tracking contacts in surveillance. Operations Research 14, 791–800 (1966)

    Article  Google Scholar 

  5. Frost, J.R.: Principles of search theory, part III: Probability density distributions. Response 17(3), 1–10 (1999c)

    Google Scholar 

  6. de Guenin, J.: Optimum distribution of effort: an extension of the Koopman theory. Operations Research 9(1), 1–7 (1961)

    Article  MathSciNet  Google Scholar 

  7. Hohzaki, R., Iida, K.: A concave minimization problem with double layers of constraints on the total amount of resources. Journal of the Operations Research Society of Japan 43(1), 109–127 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  8. Haley, K.B., Stone, L.D. (eds.): Search Theory and Applications. Plenum Press, New York (1980)

    Google Scholar 

  9. Koopman, B.O.: Search and Screening: General Principles with Historical Applications. Pergamon Press, New York (1980)

    MATH  Google Scholar 

  10. Koopman, B.O.: Search and Screening: General Principle with Historical Applications. MORS Heritage Series, Alexandria (1999)

    Google Scholar 

  11. Le Thi, H.A., Pham Dinh, T.: The DC (difference of convex functions) Programming and DCA revisited with DC models of real world nonconvex optimization problems. Annals of Operations Research 133, 23–46 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  12. Le Thi, H.A., Nguyen, D.M., Pham Dinh, T.: A DC programming approach for planning a multisensor multizone search for a target. Submitted in Computers & Operations Research 41, 231–239 (2014)

    Article  Google Scholar 

  13. Pham Dinh, T., Le Thi, H.A.: Convex analysis approach to DC programming: Theory, Algorithms and Applications (dedicated to Professor Hoang Tuy on the occasion of his 70th birthday). Acta Mathematica Vietnamica 22, 289–355 (1997)

    MATH  MathSciNet  Google Scholar 

  14. Pham Dinh, T., Le Thi, H.A.: DC optimization algorihms for solving the trust region subproblem. SIAM J. Optimization 8, 476–505 (1998)

    Article  MATH  Google Scholar 

  15. Rubinstein, R.Y., Kroese, D.: The cross-entropy method: a unified approach to combinatorial optimization. Monté Carlo simulation, and machine learning. Springer, Berlin (2004)

    Book  Google Scholar 

  16. Simonin, S., Cadre, J.P., Dambreville, F.: A Hierarchical Approach for Planning a Multisensor Multizone Search for a Moving Target. Computers & Operations Research 36(7), 2179–2192 (2009)

    Article  MATH  Google Scholar 

  17. Stone, L.D.: Necessary and suffcient conditions for optimal search plans for moving targets. Mathematics of Operations Research (4), 431–440 (1979); Math. Sci. Net.

    Google Scholar 

  18. Stone, L.D.: What’s happened in search theory since the 1975 Lanchester prize? Operations Research 37(3), 501–506 (1989)

    Article  MathSciNet  Google Scholar 

  19. Stone, L.D.: Theory of Optimal Search, 2nd edn. Operations Research Society of America, ORSA Books, Arlington (1989)

    Google Scholar 

  20. Stromquist, W.R., Stone, L.D.: Constrained optimization of functionals with search theory applications. Mathematics of Operations Research 6(4), 518–527 (1981)

    Article  MATH  MathSciNet  Google Scholar 

  21. Washburn, A.R.: Search for a moving target, The FAB algorithm. Operations Research 31(4), 739–751 (1983)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratory of Theoretical and Applied Computer Science, UFR MIM, University of Lorraine, Ile du Saulcy, 57045, Metz, France

    Hoai An Le Thi

  2. Department of Mathematics and Informatics, Hanoi National University of Education, Cau Giay, Hanoi, Vietnam

    Duc Manh Nguyen

  3. Laboratory of Mathematics, National Institute for Applied Sciences - Rouen, 76801, Saint-Etienne-du-Rouvray, France

    Tao Pham Dinh

Authors
  1. Hoai An Le Thi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Duc Manh Nguyen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Tao Pham Dinh
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Laboratory of Theoretical and Applied Computer Science, University of Lorraine-Metz, Metz, France

    Hoai An Le Thi

  2. Laboratory of Mathematics, National Institute for Applied Sciences-Rouen, Rouen, France

    Tao Pham Dinh

  3. Division of Knowledge Management Systems Institute of Informatics (I-32), Wroclaw University of Technology, Wroclaw, Poland

    Ngoc Thanh Nguyen

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Le Thi, H.A., Nguyen, D.M., Dinh, T.P. (2015). A Based-DC Programming Approach for Planning a Multisensor Multizone Search for a Moving Target. In: Le Thi, H., Pham Dinh, T., Nguyen, N. (eds) Modelling, Computation and Optimization in Information Systems and Management Sciences. Advances in Intelligent Systems and Computing, vol 359. Springer, Cham. https://doi.org/10.1007/978-3-319-18161-5_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-18161-5_10

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-18160-8

  • Online ISBN: 978-3-319-18161-5

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation