Skip to main content

Advertisement

Log in

Relaxed Dijkstra and A* with linear complexity for robot path planning problems in large-scale grid environments

  • Methodologies and Application
  • Published:
Soft Computing Aims and scope Submit manuscript

Abstract

Although there exist efficient methods to determine an optimal path in a graph, such as Dijkstra and A* algorithms, large instances of the path planning problem need more adequate and efficient techniques to obtain solutions in reasonable time. We propose two new time-linear relaxed versions of Dijkstra (RD) and A* (RA*) algorithms to solve the global path planning problem in large grid environments. The core idea consists in exploiting the grid-map structure to establish an accurate approximation of the optimal path, without visiting any cell more than once. We conducted extensive simulations (1290 runs on 43 maps of various types) for the proposed algorithms, both in four-neighbor and eight-neighbor grid environments, and compared them against original Dijkstra and A* algorithms with different heuristics. We demonstrate that our relaxed versions exhibit a substantial gain in terms of computational time (more than 3 times faster in average), and in most of tested problems an optimal solution (in at least 97 % of cases for RD and 82 % for RA*) or a very close one is reached (at most 9 % of extra length, and less than 2 % in average). Besides, the simulations also show that RA* provides a better trade-off between solution quality and execution time than previous bounded relaxations of A* that exist in the literature.

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

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Instant access to the full article PDF.

Rent this article via DeepDyve

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17
Fig. 18
Fig. 19
Fig. 20
Fig. 21
Fig. 22
Fig. 23
Fig. 24
Fig. 25

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  • Alajlan M, Koubaa A, Chaari I, Bennaceur H, Ammar A (2013) Global path planning for mobile robots in large-scale grid environments using genetic algorithms. In: 2013 international conference on individual and collective behaviors in robotics ICBR’2013, Sousse

  • Andreas K, Kaindl H (1992) A new approach to dynamic weighting. In: Proceedings of the 10th European conference on artificial intelligence (ECAI-92), Vienna, pp 16–17

  • Antsfeld L, Harabor DD, Kilby P, Walsh T (2012) Transit routing on video game maps. In: AIIDE

  • Cazenave T (2006) Optimizations of data structures, heuristics and algorithms for path-finding on maps. In: CIG, pp 27–33

  • Chaari I, Koubaa A, Bennaceur H, Trigui S, Al-Shalfan K (2012) Smartpath: a hybrid ACO-GA algorithm for robot path planning. In: 2012 IEEE congress on evolutionary computation (CEC), Brisbane, pp 1–8

  • Choubey N, Gupta MBK (2013) Analysis of working of Dijkstra and A* to obtain optimal path. Int J Comput Sci Manag Res 2:1898–1904

    Google Scholar 

  • Dijkstra EW (1959) A note on two problems in connexion with graphs. Numer Math 1(1):269–271

    Article  MathSciNet  MATH  Google Scholar 

  • Fox D, Burgard W, Thrun S (1997) The dynamic window approach to collision avoidance. IEEE Robotics Autom Mag 4(1):23–33

    Article  Google Scholar 

  • Fredman ML, Robert TE (1984) Fibonacci heaps and their uses in improved network optimization algorithms. In: 25th IEEE annual symposium on foundations of computer science, pp 338–346

  • Gerkey BP, Konolige K (2008) Planning and control in unstructured terrain. In: Workshop on path planning on costmaps. Proceedings of the IEEE international conference on robotics and automation (ICRA)

  • Hadlock FO (1977) A shortest path algorithm for grid graphs. Netw Int J 7:323–334

    MathSciNet  MATH  Google Scholar 

  • Harabor D, Grastien A (2011) Online graph pruning for pathfinding on grid maps. In: Proceedings of association for the advancement of artificial intelligence

  • Hart PE, Nilsson NJ, Raphael B (1968) A formal basis for the heuristic determination of minimum cost paths. IEEE Trans Syst Sci Cybern 4:100–107

    Article  Google Scholar 

  • Ira P (1970) First results on the effect of error in heuristic search. Mach Intell 5:219–236

    MathSciNet  MATH  Google Scholar 

  • Iroboapp (2015a) Design and analysis of intelligent algorithms for robotic problems and applications. http://www.iroboapp.org. Accessed 3 Feb 2015

  • Iroboapp (2015b) Adding a global path planner as plugin in ROS. http://www.iroboapp.org/index.php?title=Adding_A_Global_Path_Planner_As_Plugin_in_ROS. Accessed 27 Apr 2015

  • Jigang W, Han P, Jagadeesh GR, Srikanthan T (2010) Practical algorithm for shortest path on large networks with time-dependent edge-length. In 2010 2nd international conference on computer engineering and technology (ICCET), vol 2, Chengdu, pp 57–60

  • Judea P (1984) Heuristics: intelligent search strategies for computer problem solving. Addison-Wesley, New York

  • Kanoulas E, Du Y, Xia T, Zhang D (2006) Finding fastest paths on a road network with speed patterns. In: Proceedings of the 22nd international conference on data engineering, ICDE’06, pp 10–19

  • Koenig S, Likhachev M (2002) D* lite. In: Proceedings of the 18th national conference on artificial intelligence (AAAI), pp 476–483

  • Likhachev M, Ferguson D, Gordon G, Stentz A, Thrun S (2005) Anytime dynamic A*: an anytime, replanning algorithm. In: Proceedings of the international conference on automated planning and scheduling (ICAPS)

  • Maps:benchmark (2015). http://movingai.com/benchmarks. Accessed 3 Mar 2015

  • Masehian E, Amin-Naseri MR (2006) A tabu search-based approach for online motion planning. In: IEEE international conference on industrial technology, Mumbai, pp 2756–2761

  • Maxim Likhachev GG, Thrun S (2004) Ara*: Anytime A* with provable bounds on sub-optimality. In: Advances in neural information processing systems (NIPS), vol 16. MIT Press, New York

  • Peyer S, Rautenbach D, Vygen J (2009) A generalization of Dijkstra’s shortest path algorithm with applications to VLSI routing. J Discrete Algorithms 7:377–390

    Article  MathSciNet  MATH  Google Scholar 

  • Pohl I (1973) The avoidance of (relative) catastrophe, heuristic competence, genuine dynamic weighting and computational issues in heuristic problem solving. In: Proceedings of the third international joint conference on artificial intelligence (IJCAI-73), California, pp 12–17

  • Potamias M, Bonchi F, Castillo C, Gionis A (2009) Fast shortest path distance estimation in large networks. In: Proceedings of the 18th ACM conference on information and knowledge management (CIKM 09), Hong Kong, pp 867–876

  • Robot Operating System (ROS) (2015). http://www.ros.org. Accessed 15 Apr 2015

  • ROS Wiki (2015) Writing a global path planner as plugin in ROS. http://wiki.ros.org/navigation/Tutorials/Writing%20A%20Global%20Path%20Planner%20As%20Plugin%20in%20ROS. Accessed 4 June 2015

  • Russell S, Norvig P (2009) Artificial intelligence: a modern approach, 3nd edn. Prentice Hall, New York

  • Shiltagh NA, Jalal LD (2013) Optimal path planning for intelligent mobile robot navigation using modified particle swarm optimization. Int J Eng Adv Technol (IJEAT) 2(4):260–267

    Google Scholar 

  • Sturtevant N (2012) Benchmarks for grid-based pathfinding. Trans Comput Intell AI Games 4(2):144–148. http://web.cs.du.edu/sturtevant/papers/benchmarks.pdf

  • Sven Peyera JV, Rautenbachb D (2009) A generalization of Dijkstra’s shortest path algorithm with applications to VLSI routing. J Discrete Algorithms 7:377–390

    Article  MathSciNet  Google Scholar 

  • Tiwari R, Shukla A, Kala R (2012) Intelligent planning for mobile robotics: algorithmic approaches

  • van den Berg J, Shah R, Huang A, Goldberg K (2005) ANA*: anytime nonparametric A*. In: Annual conference of the association for the advancement of artificial intelligence (AAAI)

Download references

Acknowledgments

This work is supported by the iroboapp project “Design and Analysis of Intelligent Algorithms for Robotic Problems and Applications” Iroboapp (2015a) under the grant of the National Plan for Sciences, Technology and Innovation (NPSTI), managed by the Science and Technology Unit of Al-Imam Mohamed bin Saud University and by King AbdulAziz Center for Science and Technology (KACST). This work is partially supported by Prince Sultan University.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Imen Châari.

Additional information

Communicated by V. Loia.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Ammar, A., Bennaceur, H., Châari, I. et al. Relaxed Dijkstra and A* with linear complexity for robot path planning problems in large-scale grid environments. Soft Comput 20, 4149–4171 (2016). https://doi.org/10.1007/s00500-015-1750-1

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00500-015-1750-1

Keywords

Navigation