Skip to main content
Log in

Cooperative exploration and protection of a workspace assisted by information networks

  • Published:
Annals of Mathematics and Artificial Intelligence Aims and scope Submit manuscript

Abstract

We develop strategies that enable multiple robots to cooperatively explore an unknown workspace while building information networks. Every robot deploys information nodes with sensing and communication capabilities while constructing the Voronoi diagram as the topological map of the workspace. The resulting information networks constructed by individual robots will eventually meet, allowing for inter-robot information sharing. The constructed information network is then employed by the mobile robots to protect the workspace against intruders. We introduce the intruder capturing strategy on the Voronoi diagram assisted by information networks.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Barriére, L., Ere, L.B., Flocchini, P., Fraigniaud, P., Santoro, N.: Capture of an intruder by mobile agents. In: Proc. of the Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 200–209. Canada (2002)

  2. Brass, P., Gasparri, A., Cabrera-Mora, F., Xiao, J.: Multi-robot tree and graph exploration. In: Proc. of IEEE International Conference on Robotics and Automation, pp. 2332–2337. Japan (2009)

  3. Burgard, W., Moors, M., Fox, D., Simmons, R., Thrun, S.: Collaborative multi-robot exploration. In: Proc. of IEEE International Conference on Robotics and Automation, pp. 476–481. CA (2000)

  4. Burgard, W., Moors, M., Stachniss, C., Schneider, F.: Coordinated multi-robot exploration. IEEE Trans. Robot. 21, 376–386 (2005)

    Article  Google Scholar 

  5. Choset, H., Nagatani, K.: Topological simultaneous localization and mapping (SLAM): toward exact localization without explicit localization. IEEE Trans. Robot. Autom. 17, 125–137 (2001)

    Article  Google Scholar 

  6. Choset, H., Walker, S., Eiamsa-Ard, K., Burdick, J.: Sensor-based exploration: incremental construction of the hierarchical generalized Voronoi graph. Int. J. Robot. Res. 19(2), 126–148 (2000)

    Article  Google Scholar 

  7. Cortés, J., Martínez, S., Karatas, T., Bullo, F.: Coverage control for mobile sensing networks. IEEE Trans. Robot. Autom. 20(2), 243–255 (2004)

    Article  Google Scholar 

  8. Culler, D., Estrin, D., Srivastava, M.: Overview of sensor networks. IEEE Comput. Mag. 37(8), 41–49 (2004)

    Article  Google Scholar 

  9. Douglas, B.W.: Introduction to Graph Theory, 2nd edn. Prentice Hall, Illinois (2001)

    Google Scholar 

  10. Fomin, F.V., Fraigniaud, P., Nisse, N.: Nondeterministic graph searching: from pathwidth to treewidth. Algorithmica 53(3), 358–373 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  11. Fomin, F.V., Thilikos, D.M.: An annotated bibliography on guaranteed graph searching. Theor. Comput. Sci. 399, 236–245 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  12. Fox, D., Ko, J., Stewart, B., Konolige, K., Limketkai, B.: Distributed multirobot exploration and mapping. Proc. IEEE 94(7), 1325–1339 (2006)

    Article  Google Scholar 

  13. Franchi, A., Freda, L., Oriolo, G., Vendittelli, M.: The sensor-based random graph method for cooperative robot exploration. IEEE/ASME Trans. Mechatron. 14(2), 163–175 (2009)

    Article  Google Scholar 

  14. Fu, J., Bandyopadhyay, T., Ang, M.: Local Voronoi decomposition for multi-agent task allocation. In: Proc. of IEEE International Conference on Robotics and Automation, pp. 1935–1940. Japan (2009)

  15. Howard, A.: Multi-robot simultaneous localization and mapping using particle filters. Int. J. Robot. Res. 25(12), 1243–1256 (2006)

    Article  Google Scholar 

  16. Jadbabaie, A., Lin, J., Morse, A.S.: Coordination of groups of mobile autonomous agents using nearest neighbor rules. IEEE Trans. Autom. Control 48(6), 349–368 (2003)

    Article  MathSciNet  Google Scholar 

  17. Kim, J., Maxon, S., Egerstedt, M., Zhang, F.: Intruder capturing game on a topological map assisted by information networks. In: Proc. of IEEE Conference on Decision and Control, pp. 6266–6271. Orlando (2011)

  18. Kim, J., Zhang, F., Egerstedt, M.: Simultaneous cooperative exploration and networking based on Voronoi diagrams. In: Proc. of IFAC Workshop on Networked Robotics, pp. 1–6. Colorado (2009)

  19. Kim, J., Zhang, F., Egerstedt, M.: A provably complete exploration strategy by constructing Voronoi diagrams. Auton. Robot. 29(3–4), 367–380 (2010)

    Article  Google Scholar 

  20. Kolling, A., Carpin, S.: The graph-clear problem: definition, theoretical properties and its connections to multirobot aided surveillance. In: Proc. of the 2007 IEEE/RSJ International Conference on Intelligent Robots and Systems, pp. 1003–1008. San Diego (2009)

  21. Lapaugh, A.: Recontamination does not help to search a graph. J. ACM 40(2), 224–245 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  22. Lavalle, S.M.: Planning Algorithms. Cambridge University Press (2006)

  23. Liu, H., Li, J., Xie, Z., Lin, S., Whitehouse, K., Stankovic, J.A., Siu, D.: Automatic and robust breadcrumb system deployment for indoor firefighter applications. In: Proceedings of the 8th International Conference on Mobile Systems, Applications, and Services (MobiSys 10), pp. 21–34. ACM, San Francisco (2010)

    Google Scholar 

  24. Makedon, F., Sudborough, I.H.: On minimizing width in linear layouts. Discret. Appl. Math. 23(3), 243–265 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  25. Martínez, S., Cortés, J., Bullo, F.: Motion coordination with distributed information. IEEE Control. Syst. Mag. 27(4), 75–88 (2007)

    Article  Google Scholar 

  26. McNew, J.M., Klavins, E.: Locally interacting hybrid systems with embedded graph grammars. In: Proc. of IEEE International Conference on Decision and Control, pp. 6080–6087. San Diego (2006)

  27. Megiddo, N., Hakimi, S.L., Garey, M.R., Johnson, D.S., Papadimitriou, C.H.: The complexity of searching a graph. J. ACM 35, 18–44 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  28. Nagatani, K., Choset, H.: Toward robust sensor based exploration by constructing reduced generalized Voronoi graph. In: Proc. of IEEE/RSJ International Conference on Intelligent Robots and Systems, pp. 1687–1692. Kyongju (1999)

  29. Parsons, T.D.: Pursuit-evasion in a graph. In: Theory and Applications of Graphs. Lecture Notes in Mathematics, vol. 642, pp. 426–441. Springer (1978)

  30. Rao, N., Stoltzfus, N., Iyengar, S.: A retraction method for learned navigation in unknown terrains for a circular robot. IEEE Trans. Robot. Autom. 7, 699–707 (1991)

    Article  Google Scholar 

  31. Richerby, D., Thilikos, D.M.: Graph searching in a crime wave. SIAM J. Discret. Math. 23(1), 349–368 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  32. Seymour, P.D., Thomas, R.: Graph searching and a min-max theorem for tree-width. J. Combin. Theory Ser. B 58, 22–33 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  33. Smith, B., Howard, A., McNew, J., Egerstedt, M.: Multi-robot deployment and coordination with embedded graph grammars. Auton. Robot. 26(1), 79–98 (2009)

    Article  Google Scholar 

  34. Souryal, M.R., Geissbuehler, J., Miller, L.E., Moayeri, N.: Real-time deployment of multihop relays for range extension. In: Proceedings of the 5th International Conference on Mobile Systems, Applications and Services (MobiSys 07), pp. 85–98. ACM, New York (2007)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jonghoek Kim.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kim, J. Cooperative exploration and protection of a workspace assisted by information networks. Ann Math Artif Intell 70, 203–220 (2014). https://doi.org/10.1007/s10472-013-9383-5

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10472-013-9383-5

Keywords

Mathematics Subject Classification (2010)

Navigation