Adaptive Multiagent Path Planning with Dynamic Heuristic

  • SeyedMehdi MohaimenianPour
  • Mohammed Behbooei
  • Saeed Shiry Ghidary
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 302)

Abstract

Multiagent path planning is a challenging problem in robotics. Basically, there are two types of approaches on this problem. Centralized approaches in which by some state space searching algorithms obtaining an optimal solution is guaranteed however this completeness concludes on drawbacks like exponential time and space complexity. On the contrary, incompleteness and nonoptimality in decentralized approaches result in polynomial time complexity; therefore, we face a trade-off between completeness and time complexity. We propose a complete centralized semi-coupled algorithm including three different phases which uses discrete time stamps to search in state space to find the optimal solution. The first phase is called Advanced-Solver based on A* search, the second phase is called Easy-Solver which tries to complete Advanced-Solvers solution faster and optimally, and finally in the third phase in order to reduce time complexity, we introduce a deadlock-handler heuristic which prevents opening some useless states by pruning state space tree. Our algorithm has been implemented on our simulator and the result was also tested on real robots.

Keywords

Robotics Multiagent Path planning A* Heuristic Grid-Based Environment 

References

  1. 1.
    M.  Bennewitz and W.  Burgard and S.  Thrun, Optimizing Schedules for Prioritized Path Planning of Multi-Robot Systems. in Proceedings 2001 ICRA. IEEE International Conference on (Volume:1 ). 2001.Google Scholar
  2. 2.
    Y. Guo and L. E. Parker, A distributed and optimal motion planning approach for multiple mobile robots. in Proceedings. ICRA ’02. IEEE International Conference on (Volume:3). 2002.Google Scholar
  3. 3.
    R. Luna and K. E. Bekris, Efficient and Complete Centralized Multi-Robot Path Planning. in Intelligent Robots and Systems (IROS), 2011 IEEE/RSJ International Conference on. 2011.Google Scholar
  4. 4.
    K. C. Wang and A. Botea, Tractable Multi-Agent Path Planning on Grid Maps. in IJCAI’09 Proceedings of the 21st international joint conference on Artificial intelligence. 2009.Google Scholar
  5. 5.
    T. Standley, Finding Optimal Solutions to Cooperative Pathfinding Problems. in Proceedings of the 24th AAAI Conference on Artificial Intelligence. 2010.Google Scholar
  6. 6.
    A. Geramifard and P. Chubak and V. Bulitko, Biased Cost Pathfinding. in Proceedings of The second Artificial Intelligence and Interactive Digital Entertainment Conference. 2006, Marina del Rey, California.Google Scholar
  7. 7.
    P. E. Hart and N. J. Nilsson and B. Raphael, A Formal Basis for the Heuristic Determination of Minimum Cost Paths. in IEEE Transactions on Systems Science and Cybernetics SSC-4. 1968.Google Scholar
  8. 8.
    S. Russell and P. Norvig, Artificial Intelligence: A Modern Approach, 3rd ed, 2009.Google Scholar

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  • SeyedMehdi MohaimenianPour
    • 1
  • Mohammed Behbooei
    • 2
  • Saeed Shiry Ghidary
    • 1
  1. 1.Computer Science DepartmentAmirkabir University of TechnologyTehranIran
  2. 2.Computer Engineering DepartmentAmirkabir University of TechnologyTehranIran

Personalised recommendations