Skip to main content

MinPos : A Novel Frontier Allocation Algorithm for Multi-robot Exploration

  • Conference paper
Intelligent Robotics and Applications (ICIRA 2012)

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

Included in the following conference series:

Abstract

Exploring an unknown environment with multiple robots requires an efficient coordination method to minimize the total duration. A standard method to discover new areas is to assign frontiers (boundaries between unexplored and explored accessible areas) to robots. In this context, the frontier allocation method is paramount. This paper introduces a decentralized and computationally efficient frontier allocation method favoring a well balanced spatial distribution of robots in the environment. For this purpose, each robot evaluates its relative rank among the other robots in term of travel distance to each frontier. Accordingly, robots are allocated to the frontier for which it has the lowest rank. To evaluate this criteria, a wavefront propagation is computed from each frontier giving an interesting alternative to path planning from robot to frontiers. Comparisons with existing approaches in computerized simulation and on real robots demonstrated the validity and efficiency of our algorithm.

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.

References

  1. Barraquand, J., Langlois, B., Latombe, J.-C.: Numerical potential field techniques for robot path planning. In: Fifth International Conference on Advanced Robotics, ICAR 1991, Robots in Unstructured Environments, vol. 2, pp. 1012–1017 (June 1991)

    Google Scholar 

  2. Bennet, D.J., McInnes, C.R.: Distributed control of multi-robot systems using bifurcating potential fields. Robot. Auton. Syst. 58, 256–264 (2010) ISSN 0921-8890

    Article  Google Scholar 

  3. Burgard, W., Moors, M., Schneider, F.: Collaborative Exploration of Unknown Environments with Teams of Mobile Robots. In: Beetz, M., Hertzberg, J., Ghallab, M., Pollack, M.E. (eds.) Plan-Based Control of Robotic Agents 2001. LNCS (LNAI), vol. 2466, pp. 52–70. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  4. Burgard, W., Moors, M., Stachniss, C., Schneider, F.E.: Coordinated multi-robot exploration. IEEE Transactions on Robotics 21(3), 376–386 (2005) ISSN 1552-3098

    Article  Google Scholar 

  5. Chaimowicz, L., Campos, M.F.M., Kumar, V.: Dynamic role assignment for cooperative robots. In: Proceedings of the IEEE International Conference on Robotics and Automation, ICRA 2002, vol. 1, pp. 293–298 (2002)

    Google Scholar 

  6. Elfes, A.: Using occupancy grids for mobile robot perception and navigation. Computer 22(6), 46–57 (1989), doi:10.1109/2.30720, ISSN 0018-9162

    Article  Google Scholar 

  7. Franchi, A., Freda, L., Oriolo, G., Vendittelli, M.: The sensor-based random graph method for cooperative robot exploration. IEEE/ASME Trans. on Mechatronics 14(2), 163–175 (2009); Winner of the IEEE RAS ICYA Best Paper Award 2010

    Article  Google Scholar 

  8. Howard, A.: Multi-robot Simultaneous Localization and Mapping using Particle Filters. The International Journal of Robotics Research 25(12), 1243–1256 (2006)

    Article  Google Scholar 

  9. Simmons, R., Apfelbaum, D., Burgard, W., Fox, D., Moors, M., Thrun, S., Younes, H.: Coordination for multi-robot exploration and mapping. In: Proceedings of the AAAI National Conference on Artificial Intelligence, Austin, TX. AAAI (2000)

    Google Scholar 

  10. Stachniss, C.: Exploration and Mapping with Mobile Robots. PhD thesis, University of Freiburg, Department of Computer Science (April 2006)

    Google Scholar 

  11. Thrun, S., Liu, Y.: Multi-robot slam with sparse extended information filers. International Journal of Robotics Research, 254–266 (2005)

    Google Scholar 

  12. Yamauchi, B.: A frontier-based approach for autonomous exploration. In: Proceedings of the IEEE International Symposium on Computational Intelligence in Robotics and Automation, CIRA 1997, pp. 146–151 (July 1997)

    Google Scholar 

  13. Yamauchi, B.: Frontier-based exploration using multiple robots. In: AGENTS 1998: Proceedings of the Second International Conference on Autonomous Agents, pp. 47–53. ACM, New York (1998)

    Chapter  Google Scholar 

  14. Zlot, R., Stentz, A., Dias, M.B., Thayer, S.: Multi-robot exploration controlled by a market economy. In: Proceedings of the IEEE International Conference on Robotics and Automation, ICRA 2002, vol. 3, pp. 3016–3023 (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bautin, A., Simonin, O., Charpillet, F. (2012). MinPos : A Novel Frontier Allocation Algorithm for Multi-robot Exploration. In: Su, CY., Rakheja, S., Liu, H. (eds) Intelligent Robotics and Applications. ICIRA 2012. Lecture Notes in Computer Science(), vol 7507. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33515-0_49

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-33515-0_49

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-33514-3

  • Online ISBN: 978-3-642-33515-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics