{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,14]],"date-time":"2026-04-14T06:01:10Z","timestamp":1776146470660,"version":"3.50.1"},"reference-count":27,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"name":"General Program of National Natural Science Foundation of China","award":["U1613223"],"award-info":[{"award-number":["U1613223"]}]},{"name":"National Key Research and Development Project","award":["2017YFC0806505"],"award-info":[{"award-number":["2017YFC0806505"]}]},{"name":"National Key Research and Development Project","award":["2015AA042201"],"award-info":[{"award-number":["2015AA042201"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2019]]},"DOI":"10.1109\/access.2019.2920420","type":"journal-article","created":{"date-parts":[[2019,6,3]],"date-time":"2019-06-03T19:10:54Z","timestamp":1559589054000},"page":"111095-111101","source":"Crossref","is-referenced-by-count":10,"title":["Path Planning Based on ADFA* Algorithm for Quadruped Robot"],"prefix":"10.1109","volume":"7","author":[{"given":"Li","family":"Zhe","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5021-8695","authenticated-orcid":false,"given":"Li","family":"Yibin","sequence":"additional","affiliation":[]},{"given":"Rong","family":"Xuewen","sequence":"additional","affiliation":[]},{"given":"Zhang","family":"Hui","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","first-page":"102","article-title":"Graph-based path planning for mobile robots","author":"wooden","year":"2006"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2010.5509226"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2007.11.009"},{"key":"ref13","first-page":"52","article-title":"ARA*: Anytime A* with provable bounds on sub-optimality","author":"likhachev","year":"2003","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.1994.351061"},{"key":"ref15","first-page":"1652","article-title":"The focussed D* algorithm for real-time replanning","author":"stentz","year":"1995","journal-title":"Proc Int Joint Conf Artif Intell"},{"key":"ref16","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1109\/TRO.2004.838026","article-title":"Fast replanning for navigation in unknown terrain","volume":"21","author":"koenig","year":"2005","journal-title":"IEEE Trans Robot"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2003.12.001"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-6333-3"},{"key":"ref19","first-page":"63","author":"dierckx","year":"1995","journal-title":"Curve and Surface Fitting with Splines"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2015.7139916"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2018.8460731"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2015.7353790"},{"key":"ref6","first-page":"767","article-title":"ARA*: Anytime A* with provable bounds on sub-optimality","author":"likhachev","year":"2004","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/RoMoCo.2013.6614593"},{"key":"ref8","first-page":"385","article-title":"Design and implementation of SCalf, an advanced hydraulic quadruped robot","volume":"36","author":"chai","year":"2014","journal-title":"Robot"},{"key":"ref7","first-page":"476","article-title":"D* Lite","author":"koenig","year":"2002","journal-title":"Proc AAAI Conf Artif Intell"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TSSC.1968.300136"},{"key":"ref9","first-page":"334","author":"hui","year":"2016","journal-title":"Path planning based on sliding window and variant A* algorithm for quadruped robot"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.3182\/20080706-5-KR-1001.01833"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/41.824136"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2019.2899664"},{"key":"ref21","first-page":"37","article-title":"Randomized motion planning for car-like robots with C-PRM","author":"song","year":"2001","journal-title":"Proc IEEE\/RSJ Int Conf Intell Robots Syst"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TMECH.2016.2616284"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2017.7989126"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2017.7989655"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2017.2728200"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8600701\/08728025.pdf?arnumber=8728025","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:32:42Z","timestamp":1641987162000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8728025\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"references-count":27,"URL":"https:\/\/doi.org\/10.1109\/access.2019.2920420","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]}}}