{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T05:02:44Z","timestamp":1769922164451,"version":"3.49.0"},"reference-count":50,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"12","license":[{"start":{"date-parts":[[2022,12,1]],"date-time":"2022-12-01T00:00:00Z","timestamp":1669852800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"name":"European Community\u2019s H2020 Programme [Future and Emerging Technologies (FET)]","award":["732266"],"award-info":[{"award-number":["732266"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Neural Netw. Learning Syst."],"published-print":{"date-parts":[[2022,12]]},"DOI":"10.1109\/tnnls.2021.3089023","type":"journal-article","created":{"date-parts":[[2021,6,28]],"date-time":"2021-06-28T21:07:51Z","timestamp":1624914471000},"page":"7877-7887","source":"Crossref","is-referenced-by-count":6,"title":["Finding Optimal Paths Using Networks Without Learning\u2014Unifying Classical Approaches"],"prefix":"10.1109","volume":"33","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3390-6418","authenticated-orcid":false,"given":"Tomas","family":"Kulvicius","sequence":"first","affiliation":[{"name":"Department of Computational Neuroscience, University of Göttingen, Göttingen, Germany"}]},{"given":"Sebastian","family":"Herzog","sequence":"additional","affiliation":[{"name":"Department of Computational Neuroscience, University of Göttingen, Göttingen, Germany"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2996-3612","authenticated-orcid":false,"given":"Minija","family":"Tamosiunaite","sequence":"additional","affiliation":[{"name":"Department of Computational Neuroscience, University of Göttingen, Göttingen, Germany"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8206-9738","authenticated-orcid":false,"given":"Florentin","family":"W\u00f6rg\u00f6tter","sequence":"additional","affiliation":[{"name":"Department of Computational Neuroscience, University of Göttingen, Göttingen, Germany"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/BF00115009"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/3210377.3210414"},{"key":"ref33","article-title":"Fully convolutional search heuristic learning for rapid path planners","author":"ariki","year":"2019","journal-title":"arXiv 1908 03343"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2018.8460851"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2018.01.054"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2017.8202134"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1155\/2015\/736138"},{"key":"ref36","first-page":"46","article-title":"Pathfinding algorithm efficiency analysis in 2D grid","volume":"1","author":"zarembo","year":"2013","journal-title":"Proc 9th Int Sci Practical Conf"},{"key":"ref35","article-title":"Neural execution of graph algorithms","author":"veli?kovi?","year":"2019","journal-title":"arXiv 1910 10593"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.3389\/fnbot.2020.600984"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1038\/s41586-018-0102-6"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1038\/srep21142"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2019.8793889"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/2370036.2145832"},{"key":"ref1","first-page":"285","article-title":"The shortest path through a maze","author":"moore","year":"1959","journal-title":"Proc Int Symp Theory Switching"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/72.950136"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/s004220050262"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/0893-6080(94)E0045-M"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/3477.931512"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30501-9_43"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1155\/2017\/9269742"},{"key":"ref25","doi-asserted-by":"crossref","first-page":"1724","DOI":"10.1109\/TNN.2009.2029858","article-title":"Real-time robot path planning based on a modified pulse-coupled neural network model","volume":"20","author":"qu","year":"2009","journal-title":"IEEE Trans Neural Netw"},{"key":"ref50","volume":"135","author":"sutton","year":"1998","journal-title":"Introduction to Reinforcement Learning"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2003.12.001"},{"key":"ref11","first-page":"469","article-title":"Generalized adaptive A","volume":"1","author":"sun","year":"2008","journal-title":"Proc 7th Int J Conf Auto Agents Multiagent Syst (AAMAS)"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2019.2904271"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v25i1.7994"},{"key":"ref13","article-title":"Rapidly-exploring random trees: A new tool for path planning","author":"lavalle","year":"1998"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1177\/0278364911406761"},{"key":"ref15","first-page":"1651","article-title":"RRT*-smart: Rapid convergence implementation of RRT* towards optimal solution","author":"islam","year":"2012","journal-title":"Proc IEEE Int Conf Mechatronics Autom"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1177\/0278364919890396"},{"key":"ref17","article-title":"A performance comparison of rapidly-exploring random tree and Dijkstra’s algorithm for holonomic robot path planning","author":"knispel","year":"2013"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/IROS40897.2019.8968089"},{"key":"ref19","first-page":"1673","article-title":"A neural network based multi-destination routing algorithm for communication network","volume":"2","author":"park","year":"1998","journal-title":"Proc IEEE Int Joint Conf Neural Netw IEEE World Congr Comput Intell"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1090\/qam\/102435"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"ref6","author":"pearl","year":"1984","journal-title":"Heuristics Intelligent Search Strategies for Computer Problem Solving"},{"key":"ref5","article-title":"Network flow theory","author":"ford","year":"1956"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TSSC.1968.300136"},{"key":"ref7","article-title":"Artificial intelligence: A modern approach","author":"russell","year":"2002"},{"key":"ref49","first-page":"438","article-title":"An improved Dijkstra’s algorithm for shortest path planning on 2D grid maps","author":"wenzheng","year":"2019","journal-title":"Proc IEEE 9th Int Conf Electron Inf Emergency Commun (ICEIEC)"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(85)90084-0"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1145\/3354265.3354285"},{"key":"ref45","first-page":"342","article-title":"Neural implementation of Dijkstra’s algorithm","author":"m\u00e9rida-casermeiro","year":"2003","journal-title":"Proc Int Work-Conf Artif Neural Netw"},{"key":"ref48","author":"choset","year":"2005","journal-title":"Principles of Robot Motion Theory Algorithms and Implementation"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.5772\/56581"},{"key":"ref42","article-title":"Constructing shortest path maps in parallel on GPUs","author":"wynters","year":"2013","journal-title":"Proc 28th Annu Spring Conf PA Comput Inf Sci Educators"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1145\/1837274.1837289"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2014.6907070"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2013.6696830"}],"container-title":["IEEE Transactions on Neural Networks and Learning Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/5962385\/9966944\/09465214.pdf?arnumber=9465214","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,15]],"date-time":"2024-01-15T21:19:26Z","timestamp":1705353566000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9465214\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12]]},"references-count":50,"journal-issue":{"issue":"12"},"URL":"https:\/\/doi.org\/10.1109\/tnnls.2021.3089023","relation":{},"ISSN":["2162-237X","2162-2388"],"issn-type":[{"value":"2162-237X","type":"print"},{"value":"2162-2388","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,12]]}}}