{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,5]],"date-time":"2025-12-05T18:53:43Z","timestamp":1764960823785,"version":"3.46.0"},"reference-count":64,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"name":"European Community\u2019s H2020 Program [Future and Emerging Technologies (FET)]","award":["899265 (ADOPD)"],"award-info":[{"award-number":["899265 (ADOPD)"]}]},{"name":"German Science Foundation","award":["WO 388\/16-1"],"award-info":[{"award-number":["WO 388\/16-1"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Neural Netw. Learning Syst."],"published-print":{"date-parts":[[2025,1]]},"DOI":"10.1109\/tnnls.2023.3327103","type":"journal-article","created":{"date-parts":[[2023,11,7]],"date-time":"2023-11-07T14:12:02Z","timestamp":1699366322000},"page":"498-509","source":"Crossref","is-referenced-by-count":0,"title":["Combining Optimal Path Search With Task-Dependent Learning in a Neural Network"],"prefix":"10.1109","volume":"36","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3390-6418","authenticated-orcid":false,"given":"Tomas","family":"Kulvicius","sequence":"first","affiliation":[{"name":"Department for Computational Neuroscience, and the University Medical Center Göttingen, Systemic Ethology and Developmental Science, Child and Adolescent Psychiatry and Psychotherapy, 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 for 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 for Computational Neuroscience, University of Göttingen, Göttingen, Germany"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1090\/qam\/102435"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/0-387-22633-8_9"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-79983-9"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.4324\/9781410612403"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.conb.2017.08.020"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1162\/neco.2007.19.10.2694"},{"key":"ref7","first-page":"285","article-title":"The shortest path through a maze","volume-title":"Proc. Int. Symp. Theory Switching","author":"Moore"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/2370036.2145832"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TSSC.1968.300136"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(85)90084-0"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2003.12.001"},{"key":"ref13","first-page":"469","article-title":"Generalized adaptive A*","volume-title":"Proc. 7th Int. J. Conf. Auto. Agents Multiagent Syst.","author":"Sun"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v25i1.7994"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/367766.368168"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/321105.321107"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/321992.321993"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/72.286889"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/IJCNN.1998.686030"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/72.950136"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1162\/089976698300017322"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/0893-6080(94)E0045-M"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/BF00209422"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30501-9_43"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/3477.931512"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.2009.2029858"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1155\/2017\/9269742"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2021.3089023"},{"key":"ref29","article-title":"Motion planning networks","author":"Qureshi","year":"2018","journal-title":"arXiv:1806.05767"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2018.8460851"},{"key":"ref31","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.3389\/fnbot.2020.600984"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/IROS40897.2019.8968089"},{"volume-title":"Reinforcement Learning: An Introduction","year":"2018","author":"Sutton","key":"ref34"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2017.8202134"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2018.01.054"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1038\/s41586-018-0102-6"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-93417-4_38"},{"key":"ref39","first-page":"5165","article-title":"Link prediction based on graph neural networks","volume-title":"Proc. NIPS","volume":"31","author":"Zhang"},{"key":"ref40","first-page":"1","article-title":"Neural execution of graph algorithms","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Velickovic"},{"key":"ref41","first-page":"9448","article-title":"Inductive relation prediction by subgraph reasoning","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Teru"},{"key":"ref42","first-page":"1","article-title":"Neural bellmanford networks: A general graph neural network framework for link prediction","volume-title":"Proc. Neural Inf. Process. Syst.","author":"Zhu"},{"key":"ref43","first-page":"1","article-title":"Graph neural networks inspired by classical iterative algorithms","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Yang"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.12328"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2022.3181116"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2022.3183586"},{"key":"ref47","article-title":"Scene graph generation via conditional random fields","author":"Cong","year":"2018","journal-title":"arXiv:1811.08075"},{"key":"ref48","first-page":"1","article-title":"Translating embeddings for modeling multi-relational data","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"26","author":"Bordes"},{"key":"ref49","first-page":"1","article-title":"LinkNet: Relational embedding for scene graph","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"31","author":"Woo"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2017.330"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2018.00611"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1111\/coin.12202"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-01246-5_21"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-01246-5_41"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2021.3137605"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2020.3035351"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2022.3194044"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2019.00332"},{"key":"ref59","article-title":"AGAN: Towards automated design of generative adversarial networks","author":"Wang","year":"2019","journal-title":"arXiv:1906.11080"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2021.3127346"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1109\/9.887639"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2017.2694547"},{"volume-title":"Complexity Analysis of Real-Time Reinforcement Learning Applied to Finding Shortest Paths in Deterministic Domains","year":"1993","author":"Koenig","key":"ref63"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1162\/08997660360581921"}],"container-title":["IEEE Transactions on Neural Networks and Learning Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/5962385\/10832116\/10310255.pdf?arnumber=10310255","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,5]],"date-time":"2025-12-05T18:39:23Z","timestamp":1764959963000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10310255\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1]]},"references-count":64,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tnnls.2023.3327103","relation":{},"ISSN":["2162-237X","2162-2388"],"issn-type":[{"type":"print","value":"2162-237X"},{"type":"electronic","value":"2162-2388"}],"subject":[],"published":{"date-parts":[[2025,1]]}}}