Time Preference for Information in Multi-agent Exploration with Limited Communication

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8069)

Abstract

Multi-agent exploration of unknown environments with limited communication is a rapidly emerging area of research with applications including surveying and robotic rescue. Quantifying different approaches is tricky, with different schemes favouring one parameter of the exploration, such as the total time of exploring 90 % of the environment, at the expense of another parameter, like the rate of information update at a base station. In this paper we present a novel approach to this problem, in which agents choose their actions based on the time preference of the base station for information, which it encodes as the desired minimum ratio of base station utility to total agent utility. We then show that our approach performs competitively with existing exploration algorithms while offering additional flexibility, and holds the promise for much improvement regarding incorporation of various information preferences for the base station.

References

  1. 1.
    Arkin, R.C., Diaz, J.: Line-of-sight constrained exploration for reactive multiagent robotic teams. In: 7th International Workshop on Advanced Motion Control. Proceedings (Cat. No.02TH8623), pp. 455–461. IEEE (2002)Google Scholar
  2. 2.
    Bahl, P., Padmanabhan, V.N.: RADAR: an in-building RF-based user location and tracking system. In: Proceedings of the IEEE Infocom 2000, vol. 2, pp. 775–784. Tel-Aviv, Israel (2000)Google Scholar
  3. 3.
    Balch, T., Powers, M.: Value-based communication preservation for mobile robots. In: 7th International Symposium on Distributed Autonomous Robotic Systems (2004)Google Scholar
  4. 4.
    De Hoogm, J.: Role-based multi-robot exploration. D.Phil Thesis, Department of Computer Science, University of Oxford (2011)Google Scholar
  5. 5.
    De Hoog, J.: Using mobile relays in multi-robot exploration. In: Proceedings of ACRA (Australian Conference on Robotics and Automation). Melbourne, Australia (2011)Google Scholar
  6. 6.
    De Hoog, J., Cameron, S., Visser, A.: Role-based autonomous multi-robot exploration. In: Proceedings of the International Conference on Advanced Cognitive Technologies and Applications (COGNITIVE) (2009)Google Scholar
  7. 7.
    De Hoog, J., Cameron, S., Visser, A.:. Selection of rendezvous points for multi-robot exploration in dynamic environments. In: Proceedings of AAMAS (Workshop on Agents in Realtime and Dynamic Environments, International Conference on Autonomous Agents and Multi-Agent Systems). Toronto, Canada (2010)Google Scholar
  8. 8.
    Howard, A., Mataric, M.J., Sukhatme, G.S.: An incremental deployment algorithm for mobile robot teams. In: IEEE/RSJ International Conference on Intelligent Robots and System, vol. 3, pp. 2849–2854. IEEE (2002)Google Scholar
  9. 9.
    Mosteo, A.R., Montano, L., Lagoudakis, M.G.: Multi-robot routing under limited communication range. In: 2008 IEEE International Conference on Robotics and Automation, pp. 1531–1536. IEEE (2008)Google Scholar
  10. 10.
    Vazquez, J., Malcolm, C.: Distributed multirobot exploration maintaining a mobile network. In: 2nd International IEEE Conference on ‘Intelligent Systems’. Proceedings (IEEE Cat. No.04EX791), pp. 113–118. IEEE (2004)Google Scholar
  11. 11.
    Visser, A., Slamet, B.: Balancing the information gain against the movement cost for multi-robot frontier exploration. In: European Robotics Symposium (2008)Google Scholar
  12. 12.
    Visser, A., Van Ittersum, M., Jaime, L.A.G., Stancu, L.A.: Beyond frontier exploration. In: Proceedings of the 11th Robocup International Symposium (2007)Google Scholar
  13. 13.
    Yamauchi, B.: Frontier-based exploration using multiple robots. In: AGENTS ’98: Proceedings of the Second International Conference on Autonomous Agents, pp. 47–53. ACM, New York (1998)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2014

Authors and Affiliations

  • Victor Spirin
    • 1
  • Stephen Cameron
    • 1
  • Julian de Hoog
    • 1
  1. 1.University of OxfordOxfordUK

Personalised recommendations