{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T02:59:13Z","timestamp":1775789953189,"version":"3.50.1"},"reference-count":11,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1995,7,1]],"date-time":"1995-07-01T00:00:00Z","timestamp":804556800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Neurocomputing"],"published-print":{"date-parts":[[1995,7]]},"DOI":"10.1016\/0925-2312(94)00018-n","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T02:26:33Z","timestamp":1027650393000},"page":"195-212","source":"Crossref","is-referenced-by-count":25,"title":["Fast computation of optimal paths using a parallel Dijkstra algorithm with embedded constraints"],"prefix":"10.1016","volume":"8","author":[{"given":"Jeffrey L.","family":"Solka","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"James C.","family":"Perry","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Brian R.","family":"Poellinger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"George W.","family":"Rogers","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"5","key":"10.1016\/0925-2312(94)00018-N_BIB1","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/0895-7177(92)90121-Z","article-title":"Collision: avoidance and low-observable navigation in a dynamic environment","volume":"16","author":"Rodin","year":"1992","journal-title":"Mathl. Compt. Modelling"},{"issue":"3","key":"10.1016\/0925-2312(94)00018-N_BIB2","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1109\/48.107148","article-title":"A technique for autonomous underwater vehicle route planning","volume":"15","author":"Warren","year":"1990","journal-title":"IEEE J. Oceanic Eng."},{"issue":"2","key":"10.1016\/0925-2312(94)00018-N_BIB3","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1287\/opre.35.2.266","article-title":"Vehicle routing with time windows","volume":"35","author":"Kolen","year":"1987","journal-title":"Operat. Res."},{"issue":"2","key":"10.1016\/0925-2312(94)00018-N_BIB4","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1109\/21.148426","article-title":"Numerical potential field techniques for robot path planning","volume":"22","author":"Barraquand","year":"1992","journal-title":"IEEE Trans. Systems Man Cybernet."},{"issue":"3","key":"10.1016\/0925-2312(94)00018-N_BIB5","doi-asserted-by":"crossref","first-page":"311","DOI":"10.2514\/3.20410","article-title":"Trajectory optimization with risk minimization for military aircraft","volume":"12","author":"Vian","year":"1989","journal-title":"J. Guidance Control Dynamics"},{"key":"10.1016\/0925-2312(94)00018-N_BIB6","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","article-title":"A note on two problems in connection with graphs","volume":"1","author":"Dijkstra","year":"1959","journal-title":"Numerische Math."},{"key":"10.1016\/0925-2312(94)00018-N_BIB7","first-page":"100","article-title":"A formal basis for the heuristic determination of minimum cost paths","volume":"4","author":"Hart","year":"1968","journal-title":"IEEE Trans. SSC"},{"key":"10.1016\/0925-2312(94)00018-N_BIB8","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF00339943","article-title":"Neural computation of decisions in optimization problems","volume":"52","author":"Hopfield","year":"1985","journal-title":"Biol. Cybernet."},{"key":"10.1016\/0925-2312(94)00018-N_BIB9","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1016\/0893-6080(90)90078-Y","article-title":"Fast computation of optimal paths in two- and higher-dimension maps","volume":"3","author":"Hassoun","year":"1989","journal-title":"Neural Networks"},{"key":"10.1016\/0925-2312(94)00018-N_BIB10","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1287\/opre.17.3.395","article-title":"An appraisal of some shortest-path algorithms","volume":"17","author":"Dreyfus","year":"1969","journal-title":"Operat. Res."},{"key":"10.1016\/0925-2312(94)00018-N_BIB11","series-title":"Proc. IEEE 1992 Custom Integrated Circuits Conf.","article-title":"Parallel processor array for high speed path planning","author":"Kemeny","year":"1992"}],"container-title":["Neurocomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:092523129400018N?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:092523129400018N?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,4,16]],"date-time":"2023-04-16T23:32:14Z","timestamp":1681687934000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/092523129400018N"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,7]]},"references-count":11,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1995,7]]}},"alternative-id":["092523129400018N"],"URL":"https:\/\/doi.org\/10.1016\/0925-2312(94)00018-n","relation":{},"ISSN":["0925-2312"],"issn-type":[{"value":"0925-2312","type":"print"}],"subject":[],"published":{"date-parts":[[1995,7]]}}}