Skip to main content

Multi Robot Exploration Using a Modified A* Algorithm

  • Conference paper
Intelligent Information and Database Systems (ACIIDS 2011)

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

Included in the following conference series:

Abstract

Exploration of an unknown environment is one of the major applications of multi robot systems. A popular concept for the exploration problem is based on the notion of frontiers: the boundaries of the current map from where target points are allocated to multiple robots. Exploring an environment is then about entering into the unexplored area by moving towards the targets. To do so they must have an optimal path planning algorithm that chooses the shortest route with minimum energy consumption. Aiming at the problem, we discuss a modification to the well known A* algorithm that satisfies these requirements. Furthermore, we discuss improvements to the target allocation strategy, by pruning the frontier cells, because the computation burden for optimal allocation is increases with the number of frontier cells. The proposed approach has been tested with a set of environments with different levels of complexity depending on the density of the obstacles. All exploration paths generated were optimal in terms of smoothness and crossovers.

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. Yamauchi, B.: A Frontier-Based Approach for Autonomous Exploration. In: IEEE International Symposium on Computational Intelligence in Robotics and Automation, pp. 146–151 (1997)

    Google Scholar 

  2. Guzzoni, D., Cheyer, A., Julia, L., Konolige, K.: Many robots make short work. AI Magazine 18(1), 55–64 (1997)

    Google Scholar 

  3. Fox, D., Ko, J., Konolige, K., Limketkai, B., Stewart, B.: Distributed multi-robot exploration and mapping. In: Proc. of the IEEE. Special Issue on Multi-Robot Systems (2006)

    Google Scholar 

  4. Cyrill, S., et al.: Efficient exploration of unknown indoor environments using a team of mobile robots. Annals of Mathematics and Artificial Intelligence 52, 205–227 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  5. Noa, A., et al.: The giving tree: constructing trees for efficient offline and online multi robot coverage. Annals of Mathematics and Artificial Intelligence 52, 143–168 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  6. Visser, A., Slamet, B.A.: Balancing the information gain against the movement cost for multi robot frontier exploration. In: European Robotics Symposium (2008)

    Google Scholar 

  7. Rich, E., Knight, K.: Artificial Intelligence, pp. 29–98. McGraw- Hill, New York (1991)

    Google Scholar 

  8. Solanas, A., Garcia, M.A.: Coordinated multi-robot exploration through unsupervised clustering of unknown space. In: Proc. Int. Conf. on Intelligent Robots and Systems, vol. 1, pp. 717–721 (2004)

    Google Scholar 

  9. Yamauchi, B.: Frontier-based exploration using multiple robots. In: Proc. of Int. Conf. on Autonomous Agents, pp. 47–53 (1998)

    Google Scholar 

  10. Burgard, W., et al.: Collaborative multi-robot exploration. In: Proc. Int.Conf. on Robotics and Automat., vol. 1, pp. 476–481 (2000)

    Google Scholar 

  11. Burgard, W., Moors, M., Stachniss, C., Schneider, F.: Coordinated multi robot exploration. IEEE Transactions on Robotics 21(3), 376–386 (2005)

    Article  Google Scholar 

  12. Latimer, D., et al.: Towards sensor based coverage with robot teams. In: IEEE Int. Conf. on Robotics and Automation, pp. 961–967 (2002)

    Google Scholar 

  13. Yamauchi, B.: Decentralized coordination for multirobot exploration. Robotics and Autonomous Systems 29, 111–118 (1999)

    Article  Google Scholar 

  14. Ge, S.S., Fua, C.H.: Complete Multi-Robot Coverage of Unknown Environments with Minimum Repeated Coverage. In: IEEE Intl. Conf. on Robotics and Automation, pp. 727–732 (2005)

    Google Scholar 

  15. Howard, A., Mataric, M.J., Skhatme, G.S.: Mobile sensor network deployment using potential fields: a distributed, scalable solution to the area coverage problem. In: 6th Int. Symp. on Distributed Autonomous Robotics Systems, pp. 299–308 (2002)

    Google Scholar 

  16. Wu, L., et al.: Balanced Multi-Robot Exploration through a Global Optimization Strategy. Journal of Physical Agents 4(1) (2010)

    Google Scholar 

  17. Kala, R., et al.: Mobile Robot Navigation Control in Moving Obstacle Environment using Genetic Algorithm, Artificial Neural Networks and A* Algorithm. In: Proceedings of the IEEE World Congress on Computer Science and Information Engineering, pp. 705–713 (2009)

    Google Scholar 

  18. Kala, R., Shukla, A., Tiwari, R.: Robotic Path Planning using Multi Neuron Heuristic Search. In: Proceedings of the ACM 2009 International Conference on Computer Sciences and Convergence Information Technology, pp. 1318–1323 (2009)

    Google Scholar 

  19. Kala, R., Shukla, A., Tiwari, R.: Fusion of probabilistic A* algorithm and fuzzy inference system for robotic path planning. Artificial Intelligence Review 33(4), 275–306 (2010)

    Article  Google Scholar 

  20. Al-Khawaldah, M., Livatino, S., Lee, D.: Frontier based exploration with two Cooperative Mobile Robots. International Journal of Circuit, Systems and Signal Processing 4(2) (2010)

    Google Scholar 

  21. Sheng, W., Yang, Q., Tan, J., Xi, N.: Distributed multirobot coordination in area exploration. Robotics and Autonomous Systems 54, 945–955 (2006)

    Article  Google Scholar 

  22. Hartigan, J.A., Wong, M.A.: A k-means clustering algorithm. Journal of Applied Statistics 28, 100–108 (1979)

    Article  MATH  Google Scholar 

  23. Kuhn, H.W.: The hungarian method for the assignment problem. Naval Research Logistics Quarterly 2(1), 83–97 (1955)

    Article  MathSciNet  MATH  Google Scholar 

  24. Wurm, K.M., et al.: Coordinated Multi-robot Exploration using a Segmentation of the Environment. In: International Conference on Intelligent Robots and Systems (2008)

    Google Scholar 

  25. Rooker, M.N., Birk, A.: Multi-robot exploration under the constraints of wireless networking. Control Engineering Practice 15(4), 435–445 (2007)

    Article  Google Scholar 

  26. Doniec, A., et al.: Distributed constraint reasoning applied to multi robot exploration. In: 21st IEEE International conference on Tools with Artificial Intelligence (2009)

    Google Scholar 

  27. Ferranti, E., et al.: Rapid exploration of unknown areas through dynamic deployment of mobile and stationary sensor nodes. Autonomous Agents and Multi Agent systems 19(2), 210–243 (2009)

    Article  Google Scholar 

  28. Pei, Y., et al.: Coordinated Multi-Robot Real-Time Exploration with Connectivity and Bandwidth awareness. IEEE International conference on Robotics and Automation (2010)

    Google Scholar 

  29. Vallejo, D., et al.: A Multi-agent Architecture for Multi-robot Surveillance. In: Nguyen, N.T., Kowalczyk, R., Chen, S.-M. (eds.) ICCCI 2009. LNCS (LNAI), vol. 5796, pp. 266–278. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pal, A., Tiwari, R., Shukla, A. (2011). Multi Robot Exploration Using a Modified A* Algorithm . In: Nguyen, N.T., Kim, CG., Janiak, A. (eds) Intelligent Information and Database Systems. ACIIDS 2011. Lecture Notes in Computer Science(), vol 6591. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20039-7_51

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-20039-7_51

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-20038-0

  • Online ISBN: 978-3-642-20039-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics