{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T15:37:35Z","timestamp":1772206655827,"version":"3.50.1"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030522483","type":"print"},{"value":"9783030522490","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-52249-0_39","type":"book-chapter","created":{"date-parts":[[2020,7,3]],"date-time":"2020-07-03T11:03:49Z","timestamp":1593774229000},"page":"581-598","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["A Comprehensive Survey and Analysis on Path Planning Algorithms and Heuristic Functions"],"prefix":"10.1007","author":[{"given":"Bin","family":"Yan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tianxiang","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaohui","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yong","family":"Yue","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bing","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kai","family":"Shi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,7,4]]},"reference":[{"key":"39_CR1","first-page":"85","volume":"05","author":"GL Zhang","year":"2011","unstructured":"Zhang, G.L., Hu, X.M., Chai, J.F., Zhao, L., Yu, T.: Summary of path planning and its application. Mod. Mach. 05, 85\u201390 (2011)","journal-title":"Mod. Mach."},{"issue":"2","key":"39_CR2","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"4","author":"PE Hart","year":"1968","unstructured":"Hart, P.E., Nilsson, N.J., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. Syst. Sci. Cybern. 4(2), 100\u2013107 (1968). \nhttps:\/\/doi.org\/10.1109\/TSSC.1968.300136","journal-title":"IEEE Trans. Syst. Sci. Cybern."},{"issue":"1","key":"39_CR3","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in connexion with graphs. Numer. Math. 1(1), 271 (1959)","journal-title":"Numer. Math."},{"issue":"05","key":"39_CR4","first-page":"223","volume":"39","author":"XS Wang","year":"2012","unstructured":"Wang, X.S., Wu, Z.X.: Improved Dijkstra shortest path algorithm and its application. Comput. Sci. 39(05), 223\u2013228 (2012)","journal-title":"Comput. Sci."},{"issue":"13","key":"39_CR5","doi-asserted-by":"publisher","first-page":"109","DOI":"10.3901\/JME.2010.13.109","volume":"46","author":"QX Jia","year":"2010","unstructured":"Jia, Q.X., Chen, G., Sun, H.X., Zheng, S.Q.: Path planning for space manipulator to avoid obstacles based on A* algorithm. J. Mech. Eng. 46(13), 109\u2013115 (2010)","journal-title":"J. Mech. Eng."},{"issue":"3","key":"39_CR6","doi-asserted-by":"publisher","first-page":"869","DOI":"10.1109\/7.869506","volume":"36","author":"RJ Szczerba","year":"2000","unstructured":"Szczerba, R.J., Galkowski, P., Glicktein, I.S., et al.: Robust algorithm for real-time route planning. IEEE Trans. Aerosp. Electron. Syst. 36(3), 869\u2013878 (2000)","journal-title":"IEEE Trans. Aerosp. Electron. Syst."},{"key":"39_CR7","unstructured":"Stentz, A.: The D* algorithm for real-time planning of optimal traverses. CMU Technical report CMU-RI-TR-94-37 (1994)"},{"key":"39_CR8","unstructured":"Stentz, A.: The focussed D* algorithm for real-time replanning. In: International Joint Conference on Artificial Intelligence. Morgan Kaufmann Publishers Inc. (1995)"},{"key":"39_CR9","doi-asserted-by":"publisher","first-page":"766","DOI":"10.3182\/20140313-3-IN-3024.00050","volume":"47","author":"C Saranya","year":"2014","unstructured":"Saranya, C., Rao, K.K., Unnikrishnan, M., Brinda, V., Lalithambika, V.R., Dhekane, M.V.: Real time evaluation of grid based path planning algorithms: a comparative study. IFAC Proc. Vol. 47, 766\u2013772 (2014)","journal-title":"IFAC Proc. Vol."},{"issue":"01","key":"39_CR10","first-page":"66","volume":"26","author":"L Qiu","year":"2012","unstructured":"Qiu, L., Zhang, H.: Implementation of path finding on 2D game maps. J. Hunan Univ. Technol. 26(01), 66\u201369 (2012)","journal-title":"J. Hunan Univ. Technol."},{"key":"39_CR11","unstructured":"Liu, L., Guo, J.M.: Improved D* algorithm for robots in partially-known environment. In: First Intelligent Transport and Artificial Intelligence Conference: Research and Application of Intelligent Transport Technology, pp. 260\u2013264. Guangzhou Publisher of Southern China University of Technology (2006)"},{"key":"39_CR12","unstructured":"Xu, K.F.: Research of route planning of mobile robots based on D* Lite. Harbin Institute of Technology (2017)"},{"issue":"1\u20132","key":"39_CR13","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.artint.2003.12.001","volume":"155","author":"S Koenig","year":"2004","unstructured":"Koenig, S., Likhachev, M., Furcy, D.: Lifelong planning A*. Artif. Intell. 155(1\u20132), 93\u2013146 (2004)","journal-title":"Artif. Intell."},{"key":"39_CR14","first-page":"46","volume":"01","author":"YN Zhang","year":"2018","unstructured":"Zhang, Y.N., Sun, F.C., Shi, X.H.: Route planning of mobile robots based on fast D* Lite algorithm. Data Commun. 01, 46\u201351 (2018)","journal-title":"Data Commun."},{"key":"39_CR15","unstructured":"Koenig, S., Likhachev, M.: D* Lite. In: AAAI\/IAAI, pp. 476-483 (2002)"},{"issue":"3","key":"39_CR16","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1109\/TRO.2004.838026","volume":"21","author":"S Koenig","year":"2005","unstructured":"Koenig, S., Likhachev, M.: Fast replanning for navigation in unknown terrain. IEEE Trans. Rob. 21(3), 354\u2013363 (2005)","journal-title":"IEEE Trans. Rob."},{"key":"39_CR17","unstructured":"Zhang, Z.S.: Designing and research of autonomous robots based on visual navigation. Harbin Institute of Technology (2008)"},{"key":"39_CR18","unstructured":"Mansour, K.A., Muhammad, A., Ramdane, E.H., et al.: D* Lite based real-time multi-agent path planning in dynamic environments. In: 3rd International Conference on Computational Intelligence. IEEE Computer Society (2011)"},{"key":"39_CR19","unstructured":"Gu, Y.Z., Meng, Q.D., Gao, R.Z.: Research of route planning on military robots in street fighting. Inf. Technol. 35(02), 30\u201333+36 (2011)"},{"key":"39_CR20","first-page":"102","volume":"01","author":"CH Zhou","year":"2007","unstructured":"Zhou, C.H., Li, S.G.: Research of Dijkstra and A* algorithm. J. Softw. 01, 102\u2013103 (2007)","journal-title":"J. Softw."},{"key":"39_CR21","first-page":"1030","volume":"16","author":"SQ Chen","year":"2007","unstructured":"Chen, S.Q., Teng, Z.J., Hong, Q., Chen, Q.H.: Analysis of Instances of 4 shortest route planning algorithms. Comput. Sci. Technol. 16, 1030\u20131032 (2007)","journal-title":"Comput. Sci. Technol."}],"container-title":["Advances in Intelligent Systems and Computing","Intelligent Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-52249-0_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,3]],"date-time":"2020-07-03T23:32:06Z","timestamp":1593819126000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-52249-0_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030522483","9783030522490"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-52249-0_39","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"value":"2194-5357","type":"print"},{"value":"2194-5365","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"4 July 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SAI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Science and Information Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"London","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 July 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 July 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sai2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/saiconference.com\/Computing","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}