{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,21]],"date-time":"2026-06-21T02:28:41Z","timestamp":1782008921456,"version":"3.54.5"},"reference-count":31,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2020]]},"DOI":"10.1109\/access.2020.3015976","type":"journal-article","created":{"date-parts":[[2020,8,12]],"date-time":"2020-08-12T20:42:42Z","timestamp":1597264962000},"page":"147827-147838","source":"Crossref","is-referenced-by-count":225,"title":["Surface Optimal Path Planning Using an Extended Dijkstra Algorithm"],"prefix":"10.1109","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3154-1657","authenticated-orcid":false,"given":"Min","family":"Luo","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8217-8491","authenticated-orcid":false,"given":"Xiaorong","family":"Hou","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jing","family":"Yang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2943009"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.1990.125972"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/JSYST.2018.2813929"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2868339"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2819199"},{"key":"ref13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1155\/2017\/5656323","article-title":"A gradual approach for multimodel journey planning: A case study in izmir, turkey","volume":"2017","author":"dalk\u00e4\u00e7","year":"2017","journal-title":"J Adv Transp"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1155\/2017\/5098183"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.trpro.2017.05.094"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1155\/2015\/438290"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.proeng.2013.12.013"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.5772\/56911"},{"key":"ref19","doi-asserted-by":"crossref","first-page":"1756","DOI":"10.1109\/TCSI.2009.2034235","article-title":"High-throughput and area-efficient MIMO symbol detection based on modified Dijkstra’s search","volume":"57","author":"kim","year":"2010","journal-title":"IEEE Trans Circuits Syst I Reg Papers"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/HUMANOIDS.2014.7041374"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ROBIONETICS.2013.6743587"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2015.2430526"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ICRIS.2017.62"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.scitotenv.2019.01.222"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/JSEN.2015.2464271"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.pss.2019.104707"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.epsr.2019.105953"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1590\/0370-44672018720124"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/SICN47020.2019.9019345"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.isprsjprs.2019.01.004"},{"key":"ref1","first-page":"10","article-title":"A modified Dijkstra’s algorithm for solving the problem of finding the maximum load path","author":"wei","year":"2019","journal-title":"Proc IEEE 2nd Int Conf Inf Comput Technol (ICICT)"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/MUE.2009.86"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-002-1008-z"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2004.833832"},{"key":"ref24","article-title":"On routing with QOS constraints in ATM networks","author":"cavendish","year":"1994","journal-title":"The International Federation for Information Processing"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ICSMC.2000.886462"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/BF00625277"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/BF01299142"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8948470\/09165710.pdf?arnumber=9165710","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,17]],"date-time":"2021-12-17T19:55:08Z","timestamp":1639770908000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9165710\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":31,"URL":"https:\/\/doi.org\/10.1109\/access.2020.3015976","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]}}}