Skip to main content

A Markov Model for Multiagent Patrolling in Continuous Time

  • Conference paper
Neural Information Processing (ICONIP 2009)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5864))

Included in the following conference series:

Abstract

We present a model for the multiagent patrolling problem with con-tinuous-time. An anytime and online algorithm is then described and extended to asynchronous multiagent decision processes. An online algorithm is also proposed for coordinating the agents. We finally compared our approach empirically to existing methods.

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 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. Santana, H., Ramalho, G., Corruble, V., Ratitch, B.: Multi-agent patrolling with reinforcement learning. In: Proc. of AAMAS 2004 (2004)

    Google Scholar 

  2. Glad, A., Simonin, O., Buffet, O., Charpillet, F.: Theoretical study of antbased algorithms for multi-agent patrolling. In: Proc. of ECAI 2008, pp. 626–630 (2008)

    Google Scholar 

  3. Chevaleyre, Y., Sempé, F., Ramalho, G.: A theoretical analysis of multi-agent patrolling strategies. In: Proc. of AAMAS 2004 (2004)

    Google Scholar 

  4. Machado, A., Ramalho, G., Zucker, J.D., Drogoul, A.: Multi-Agent Patrolling: an Empirical Analysis of Alternative Architectures. In: Proc. of the Multi-Agent Based Simulation Conference (2002)

    Google Scholar 

  5. Younes, H.L.S., Simmons, R.G.: A formalism for stochastic decision processes with asynchronous events. In: Proc. of AAAI Workshop on Learning and Planning in Markov Processes, pp. 107–110. AAAI Press, Menlo Park (2004)

    Google Scholar 

  6. Ross, S., Chaib-draa, B.: AEMS: An Anytime Online Search Algorithm for Approximate Policy Refinement in Large POMDPs. In: Proc. of IJCAI 2007, pp. 2592–2598 (2007)

    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

Marier, JS., Besse, C., Chaib-draa, B. (2009). A Markov Model for Multiagent Patrolling in Continuous Time. In: Leung, C.S., Lee, M., Chan, J.H. (eds) Neural Information Processing. ICONIP 2009. Lecture Notes in Computer Science, vol 5864. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10684-2_72

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-10684-2_72

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-10682-8

  • Online ISBN: 978-3-642-10684-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics