{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,21]],"date-time":"2026-07-21T14:44:07Z","timestamp":1784645047925,"version":"3.55.0"},"reference-count":33,"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":"Major Science and Technology Project of Henan Province","award":["161100210300"],"award-info":[{"award-number":["161100210300"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2019]]},"DOI":"10.1109\/access.2019.2941537","type":"journal-article","created":{"date-parts":[[2019,9,17]],"date-time":"2019-09-17T01:07:18Z","timestamp":1568682438000},"page":"135870-135881","source":"Crossref","is-referenced-by-count":14,"title":["A Multi-Heuristic A* Algorithm Based on Stagnation Detection for Path Planning of Manipulators in Cluttered Environments"],"prefix":"10.1109","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5075-2209","authenticated-orcid":false,"given":"Kai","family":"Mi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jun","family":"Zheng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yunkuan","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jianhua","family":"Hu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1613\/jair.2994"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/MRA.2012.2205651"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(86)90074-3"},{"key":"ref30","first-page":"39","article-title":"Deadline-aware search using on-line measures of behavior","author":"dionne","year":"2011","journal-title":"Proc 4th Annu Symp Combinat Search"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2014.6907818"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2011.5980280"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.15607\/RSS.2013.IX.031"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2016.7487091"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.15607\/RSS.2016.XII.001"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1177\/0278364918790369"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TSSC.1968.300136"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2011.5980550"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1177\/0278364913507983"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1177\/0278364915594029"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2018\/683"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2003.1248805"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/COASE.2018.8560414"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2000.844730"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.1985.1087247"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(70)90007-X"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1177\/0278364911406761"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.1989.100007"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/70.163777"},{"key":"ref2","article-title":"Rapidly-exploring random trees: A new tool for path planning","author":"lavalle","year":"1998"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2009.5152817"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/70.508439"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2017.7989659"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2014.6907542"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1080\/01691864.2013.756386"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.robot.2015.02.007"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/s11370-017-0236-7"},{"key":"ref26","article-title":"Optimal bidirectional rapidly-exploring random trees","author":"jordan","year":"2013"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.robot.2018.06.013"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8600701\/08839099.pdf?arnumber=8839099","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,10]],"date-time":"2021-08-10T19:41:17Z","timestamp":1628624477000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8839099\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"references-count":33,"URL":"https:\/\/doi.org\/10.1109\/access.2019.2941537","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]}}}