Skip to main content

Detecting Intruders in Complex Environments with Limited Range Mobile Sensors

  • Conference paper
Robot Motion and Control 2007

Part of the book series: Lecture Notes in Control and Information Sciences ((LNCIS,volume 360))

Abstract

This paper examines the problem of detecting intruders in large multiply-connected environments with multiple robots and limited range sensors. We divide the problem into two sub-problems: 1) partitioning of the environment and 2) a new problem called weighted graph clearing. We reduce the latter to weighted tree clearing and present a solution for finding paths for the robot team that ensure the detection of all intruders with a proven upper bound on the number of robots needed. This is followed by a practical performance analysis.

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. A. Kolling, S. Carpin, “Multirobot Cooperation for Surveillance of Multiple Moving Targets - A New Behavioral Approach,” Proceedings of the 2006 IEEE International Conference on Robotics and Automation, pp. 1311–1316

    Google Scholar 

  2. L. E. Parker, “Distributed algorithms for multi-robot observation of multiple moving targets,” Autonomous robots, 12(3):231–255, 2002.

    Google Scholar 

  3. S. Sachs, S. Rajko, S. M. LaValle. “Visibility-Based Pursuit-Evasion in an Unknown Planar Environment,” The International Journal of Robotics Research, 23(1):3-26, 2004

    Google Scholar 

  4. L. J. Guibas, J. Latombe, S. M. LaValle, D. Lin, R. Motwani, “Visibility-Based Pursuit-Evasion in a Polygonal Environment,” International Journal of Computational Geometry and Applications, 9(5):471–494, 1999

    Google Scholar 

  5. S. M. LaValle, D. Lin, L. J. Guibas, J. Latombe, R. Motwani, “Finding an Unpredictable Target in a Workspace with Obstacles,” Proceedings of the 1997 IEEE International Conference on Robotics and Automation, pp. 737–724

    Google Scholar 

  6. B. P. Gerkey, S. Thrun, G. Gordon. “Visibility-based pursuit-evasion with limited field of view,” The International Journal on Robotics Research, 25(4):299-316, 2006.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer London

About this paper

Cite this paper

Kolling, A., Carpin, S. (2007). Detecting Intruders in Complex Environments with Limited Range Mobile Sensors. In: Kozłowski, K. (eds) Robot Motion and Control 2007. Lecture Notes in Control and Information Sciences, vol 360. Springer, London. https://doi.org/10.1007/978-1-84628-974-3_38

Download citation

  • DOI: https://doi.org/10.1007/978-1-84628-974-3_38

  • Publisher Name: Springer, London

  • Print ISBN: 978-1-84628-973-6

  • Online ISBN: 978-1-84628-974-3

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics