Skip to main content
SpringerLink
Log in

Search and Detection of Failed Components in Repairable Complex Systems under Imperfect Inspections

  • Conference paper
Book cover Advances in Computational Intelligence (MICAI 2012)

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

Included in the following conference series:

Abstract

We study a problem of scheduling search-and-detection activities in complex technological and organizational systems. Prior probabilities of failures are known for each element, and the decision maker has to sequentially inspect the components so that to find a failed component within a given level of confidence. The inspections are imperfect; namely, a probability of overlooking the failed element and a probability of a “false alarm” exist. An index-based algorithm for finding the optimal search strategy is developed. An example for robotic search systems is discussed.

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Assaf, D., Zamir, S.: Optimal sequential search: A Bayesian approach. Ann. Statist. 13(3), 1213–1221 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  2. Bourgault, F., Furukawa, T., Durrant-Whyte, H.F.: Optimal Search for a Lost Target in a Bayesian World. In: Yuta, S., et al. (eds.) Field and Service Robotics. STAR, vol. 24, pp. 209–222. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  3. Chew Jr., M.C.: A sequential search procedure. Annals of Mathematical Statistics 38(2), 94–502 (1967)

    Article  MathSciNet  Google Scholar 

  4. Chew Jr., M.C.: Optimal stopping in a discrete search problem. Operations Research 21(3), 741–747 (1973)

    Article  MathSciNet  MATH  Google Scholar 

  5. Chung, T.H., Burdick, J.W.: Analysis of search decision making using probabilistic search strategies. IEEE Transactions on Robotics 28(1), 1–13 (2012)

    Article  Google Scholar 

  6. Eagle, J.N., Yee, J.R.: An optimal branch-and-bound procedure for the constrained path, moving target search problem. Operations Research 38(1), 110–114 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  7. Ferrari, S., Fierro, R., Perteet, B., Cai, C., Baumgartner, K.: A geometric optimization approach to detecting and intercepting dynamic targets using a mobile sensor network. SIAM Journal of Control and Optimization 48(1), 292–320 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  8. Kadane, J.B.: Optimal whereabouts search. Oper. Res. 19(4), 894–904 (1971)

    Article  MathSciNet  MATH  Google Scholar 

  9. Kadane, J.B., Simon, H.A.: Optimal strategies for a class of constrained sequential problems. The Annals of Statistics 5, 237–255 (1977)

    Article  MathSciNet  MATH  Google Scholar 

  10. Koopman, B.: The theory of search, II.Target detection. Oper. Res. 4, 324–346 (1956)

    Article  MathSciNet  Google Scholar 

  11. Kress, M., Lin, K.Y., Szechtman, R.: Optimal discrete search with imperfect specificity. Mathematical Methods of Operations Research 68(3), 539–549 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  12. Kress, M., Royset, J.O., Rozen, N.: The eye and the fist: Optimizing search and interdiction. European Journal of Operational Research 220(2), 550–558 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  13. Kress, M., Szechtman, R., Jones, J.S.: Efficient employment of non-reactive sensors. Military Operations Research 13(4), 45–57 (2008)

    Article  Google Scholar 

  14. Lau, H., Huang, S., Dissanayake, G.: Discounted mean bound for the optimal searcher path problem with non-uniform travel times. European Journal of Operational Research 190(2), 383–397 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  15. Lee, K.K.: Efficient employment of adaptive sensor. Monterey, Calif. Naval Postgraduate School (2008)

    Google Scholar 

  16. Levner, E.: Infinite-horizon scheduling algorithms for optimal search for hidden objects. Interanational Transactions in Operational Research 1(2), 241–250 (1994)

    Article  MATH  Google Scholar 

  17. Rabinowitz, G., Emmons, H.: Optimal and heuristic inspection schedules for multistage production systems. IIE Transactions 29(12), 1063–1071 (1997)

    Google Scholar 

  18. Ross, S.M.: A problem in optimal search and stop. Oper. Res. 17(6), 984–992 (1969)

    Article  MATH  Google Scholar 

  19. Sato, H., Royset, J.O.: Path optimization for the resource-constrained searcher. Naval Research Logistics 57, 422–440 (2010)

    MathSciNet  MATH  Google Scholar 

  20. Stone, L.D.: Theory of Optimal Search. ORSA, New York (1992)

    Google Scholar 

  21. Trummel, K.E., Weisinger, J.R.: The complexity of the optimal searcher path problem. Operations Research 34(2), 324–327 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  22. Washburn, A.R.: Search and Detection, 4th edn. Topics in Operations Research Series. INFORMS (2002)

    Google Scholar 

  23. Wegener, I.: The discrete sequential search problem with nonrandom cost and overlook probabilities. Mathematics of Operations Research 5(3), 373–380 (1980)

    Article  MathSciNet  MATH  Google Scholar 

  24. Wegener, I.: Optimal search with positive switch cost is NP-hard. Information Processing Letters 21(1), 49–52 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  25. Wilson, K.E., Szechtman, R., Atkinson, M.P.: A sequential perspective on searching for static targets. European Journal of Operational Research 215(1), 218–226 (2011)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Askelon Academic College, Ashkelon, Israel

    Boris Kriheli & Eugene Levner

Authors
  1. Boris Kriheli
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Eugene Levner
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Mexican Petroleum Institute, Eje Central Lazaro Cardenas Norte, 152, Col. San Bartolo Atepehuacan, CP 07730, México D.F., Mexico

    Ildar Batyrshin

  2. Tecnológico de Monterrey, Campus Estado de México, Carretera Lago de Guadalupe Km 3.5, CP 52926, Atizapán de Zaragoza, Estado de México, Mexico

    Miguel González Mendoza

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kriheli, B., Levner, E. (2013). Search and Detection of Failed Components in Repairable Complex Systems under Imperfect Inspections. In: Batyrshin, I., Mendoza, M.G. (eds) Advances in Computational Intelligence. MICAI 2012. Lecture Notes in Computer Science(), vol 7630. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-37798-3_35

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-37798-3_35

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-37797-6

  • Online ISBN: 978-3-642-37798-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation