Skip to main content

Real-Time Moving Target Search

  • Conference paper
Agent Computing and Multi-Agent Systems (PRIMA 2007)

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

Included in the following conference series:

Abstract

In this paper, we propose a real-time moving target search algorithm for dynamic and partially observable environments, modeled as grid world. The proposed algorithm, Real-time Moving Target Evaluation Search (MTES), is able to detect the closed directions around the agent, and determine the best direction that avoids the nearby obstacles, leading to a moving target which is assumed to be escaping almost optimally. We compared our proposal with Moving Target Search (MTS) and observed a significant improvement in the solution paths. Furthermore, we also tested our algorithm against A* in order to report quality of our solutions.

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

Similar content being viewed by others

References

  1. Goldenberg, M., Kovarsky, A., Wu, X., Schaeffer, J.: Multiple agents moving target search. In: Int’l. Joint Conf. on Artificial Intelligence, IJCAI, pp. 1536–1538 (2003)

    Google Scholar 

  2. Ishida, T., Korf, R.: Moving target search: A real-time search for changing goals. IEEE Trans. Pattern Analysis and Machine Intelligence 17(6), 97–109 (1995)

    Article  Google Scholar 

  3. Koenig, S., Likhachev, M.: Real-time adaptive a*. In: 5th Int’l. Joint Conf. on Autonomous Agents and Multiagent Systems, pp. 281–288 (2006)

    Google Scholar 

  4. Koenig, S., Likhachev, M., Sun, X.: Speeding up moving-target search*. In: 6th Int’l. Joint Conf. on Autonomous Agents and Multiagent Systems (2007)

    Google Scholar 

  5. Korf, R.: Real-time heuristic search. Artificial Intelligence 42(2-3), 189–211 (1990)

    Article  MATH  Google Scholar 

  6. Russell, S., Norving, P.: Artificial Intelligence: a modern approach. Prentice Hall, Inc., Englewood Cliffs (1995)

    Google Scholar 

  7. Stentz, A.: The focussed D* algorithm for real-time replanning. In: Proceedings of the Int’l. Joint Conference on Artificial Intelligence (1995)

    Google Scholar 

  8. Undeger, C., Polat, F.: Real-time edge follow: A real-time path search approach. IEEE Transaction on Systems, Man and Cybernetics, Part C 37(5), 860–872 (2007)

    Article  Google Scholar 

  9. Undeger, C., Polat, F.: Rttes: Real-time search in dynamic environments. Applied Intelligence 27, 113–129 (2007)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Undeger, C., Polat, F. (2009). Real-Time Moving Target Search. In: Ghose, A., Governatori, G., Sadananda, R. (eds) Agent Computing and Multi-Agent Systems. PRIMA 2007. Lecture Notes in Computer Science(), vol 5044. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-01639-4_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-01639-4_10

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-01638-7

  • Online ISBN: 978-3-642-01639-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics