{"id":"https://openalex.org/W3174799839","doi":"https://doi.org/10.1109/tnnls.2021.3089023","title":"Finding Optimal Paths Using Networks Without Learning\u2014Unifying Classical Approaches","display_name":"Finding Optimal Paths Using Networks Without Learning\u2014Unifying Classical Approaches","publication_year":2021,"publication_date":"2021-06-28","ids":{"openalex":"https://openalex.org/W3174799839","doi":"https://doi.org/10.1109/tnnls.2021.3089023","mag":"3174799839","pmid":"https://pubmed.ncbi.nlm.nih.gov/34170833"},"language":"en","primary_location":{"id":"doi:10.1109/tnnls.2021.3089023","is_oa":true,"landing_page_url":"https://doi.org/10.1109/tnnls.2021.3089023","pdf_url":"https://ieeexplore.ieee.org/ielx7/5962385/9966944/09465214.pdf","source":{"id":"https://openalex.org/S4210175523","display_name":"IEEE Transactions on Neural Networks and Learning Systems","issn_l":"2162-237X","issn":["2162-237X","2162-2388"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Neural Networks and Learning Systems","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","pubmed"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://ieeexplore.ieee.org/ielx7/5962385/9966944/09465214.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5071193084","display_name":"Tomas Kulvi\u010dius","orcid":"https://orcid.org/0000-0003-3390-6418"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Tomas Kulvicius","raw_affiliation_strings":["Department of Computational Neuroscience, University of Göttingen, Göttingen, Germany"],"raw_orcid":"https://orcid.org/0000-0003-3390-6418","affiliations":[{"raw_affiliation_string":"Department of Computational Neuroscience, University of Göttingen, Göttingen, Germany","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5039345697","display_name":"Sebastian Herzog","orcid":"https://orcid.org/0000-0002-3827-7799"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sebastian Herzog","raw_affiliation_strings":["Department of Computational Neuroscience, University of Göttingen, Göttingen, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computational Neuroscience, University of Göttingen, Göttingen, Germany","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5026724617","display_name":"Minija Tamo\u0161i\u016bnait\u0117","orcid":"https://orcid.org/0000-0003-2996-3612"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Minija Tamosiunaite","raw_affiliation_strings":["Department of Computational Neuroscience, University of Göttingen, Göttingen, Germany"],"raw_orcid":"https://orcid.org/0000-0003-2996-3612","affiliations":[{"raw_affiliation_string":"Department of Computational Neuroscience, University of Göttingen, Göttingen, Germany","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5023811677","display_name":"Florentin W\u00f6rg\u00f6tter","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Florentin W\u00f6rg\u00f6tter","raw_affiliation_strings":["Department of Computational Neuroscience, University of Göttingen, Göttingen, Germany"],"raw_orcid":"https://orcid.org/0000-0001-8206-9738","affiliations":[{"raw_affiliation_string":"Department of Computational Neuroscience, University of Göttingen, Göttingen, Germany","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.4851,"has_fulltext":true,"cited_by_count":7,"citation_normalized_percentile":{"value":0.64557023,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"33","issue":"12","first_page":"7877","last_page":"7887"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9932000041007996,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9842000007629395,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.7780480980873108},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7254149913787842},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6753478050231934},{"id":"https://openalex.org/keywords/pooling","display_name":"Pooling","score":0.6303096413612366},{"id":"https://openalex.org/keywords/variety","display_name":"Variety (cybernetics)","score":0.5883762240409851},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.5668438673019409},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.5619180202484131},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5300694704055786},{"id":"https://openalex.org/keywords/obstacle","display_name":"Obstacle","score":0.5041888952255249},{"id":"https://openalex.org/keywords/trajectory","display_name":"Trajectory","score":0.4783974885940552},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.41263604164123535},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.406515896320343},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.39666324853897095},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3447995185852051},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.21292293071746826},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.19843554496765137},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.15294522047042847},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.09610605239868164}],"concepts":[{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.7780480980873108},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7254149913787842},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6753478050231934},{"id":"https://openalex.org/C70437156","wikidata":"https://www.wikidata.org/wiki/Q7228652","display_name":"Pooling","level":2,"score":0.6303096413612366},{"id":"https://openalex.org/C136197465","wikidata":"https://www.wikidata.org/wiki/Q1729295","display_name":"Variety (cybernetics)","level":2,"score":0.5883762240409851},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.5668438673019409},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.5619180202484131},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5300694704055786},{"id":"https://openalex.org/C2776650193","wikidata":"https://www.wikidata.org/wiki/Q264661","display_name":"Obstacle","level":2,"score":0.5041888952255249},{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.4783974885940552},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.41263604164123535},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.406515896320343},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.39666324853897095},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3447995185852051},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21292293071746826},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.19843554496765137},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.15294522047042847},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.09610605239868164},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C1276947","wikidata":"https://www.wikidata.org/wiki/Q333","display_name":"Astronomy","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1109/tnnls.2021.3089023","is_oa":true,"landing_page_url":"https://doi.org/10.1109/tnnls.2021.3089023","pdf_url":"https://ieeexplore.ieee.org/ielx7/5962385/9966944/09465214.pdf","source":{"id":"https://openalex.org/S4210175523","display_name":"IEEE Transactions on Neural Networks and Learning Systems","issn_l":"2162-237X","issn":["2162-237X","2162-2388"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Neural Networks and Learning Systems","raw_type":"journal-article"},{"id":"pmid:34170833","is_oa":false,"landing_page_url":"https://pubmed.ncbi.nlm.nih.gov/34170833","pdf_url":null,"source":{"id":"https://openalex.org/S4306525036","display_name":"PubMed","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1299303238","host_organization_name":"National Institutes of Health","host_organization_lineage":["https://openalex.org/I1299303238"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE transactions on neural networks and learning systems","raw_type":null},{"id":"pmh:oai:publications.goettingen-research-online.de:2/135711","is_oa":true,"landing_page_url":"https://resolver.sub.uni-goettingen.de/purl?gro-2/135711","pdf_url":null,"source":{"id":"https://openalex.org/S4306401634","display_name":"GoeScholar  The Publication Server of the Georg-August-Universit\u00e4t G\u00f6ttingen (Georg-August-Universit\u00e4t G\u00f6ttingen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210122495","host_organization_name":"Asklepios Klinik St. Georg","host_organization_lineage":["https://openalex.org/I4210122495"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:vdu.lt:20.500.12259/145514","is_oa":false,"landing_page_url":"https://hdl.handle.net/20.500.12259/145514","pdf_url":null,"source":{"id":"https://openalex.org/S7407055361","display_name":"Vytautas Magnus University","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"research article"}],"best_oa_location":{"id":"doi:10.1109/tnnls.2021.3089023","is_oa":true,"landing_page_url":"https://doi.org/10.1109/tnnls.2021.3089023","pdf_url":"https://ieeexplore.ieee.org/ielx7/5962385/9966944/09465214.pdf","source":{"id":"https://openalex.org/S4210175523","display_name":"IEEE Transactions on Neural Networks and Learning Systems","issn_l":"2162-237X","issn":["2162-237X","2162-2388"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Neural Networks and Learning Systems","raw_type":"journal-article"},"sustainable_development_goals":[{"score":0.4099999964237213,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[{"id":"https://openalex.org/G2957218351","display_name":null,"funder_award_id":"732266","funder_id":"https://openalex.org/F4320332999","funder_display_name":"Horizon 2020 Framework Programme"}],"funders":[{"id":"https://openalex.org/F4320332999","display_name":"Horizon 2020 Framework Programme","ror":"https://ror.org/00k4n6c32"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3174799839.pdf","grobid_xml":"https://content.openalex.org/works/W3174799839.grobid-xml"},"referenced_works_count":56,"referenced_works":["https://openalex.org/W131069610","https://openalex.org/W135651235","https://openalex.org/W1496982712","https://openalex.org/W1515851193","https://openalex.org/W1575742541","https://openalex.org/W1969483458","https://openalex.org/W1971086298","https://openalex.org/W1977935965","https://openalex.org/W1982809790","https://openalex.org/W1985291160","https://openalex.org/W2007572995","https://openalex.org/W2043528001","https://openalex.org/W2067634406","https://openalex.org/W2089314366","https://openalex.org/W2097476511","https://openalex.org/W2122410182","https://openalex.org/W2135125135","https://openalex.org/W2143114052","https://openalex.org/W2148332992","https://openalex.org/W2150470619","https://openalex.org/W2156073109","https://openalex.org/W2163650400","https://openalex.org/W2169423175","https://openalex.org/W2169528473","https://openalex.org/W2227557434","https://openalex.org/W2283674326","https://openalex.org/W2319958627","https://openalex.org/W2342112418","https://openalex.org/W2586026999","https://openalex.org/W2793998795","https://openalex.org/W2800142021","https://openalex.org/W2802440256","https://openalex.org/W2921285709","https://openalex.org/W2963268101","https://openalex.org/W2963428623","https://openalex.org/W2967850776","https://openalex.org/W2967969632","https://openalex.org/W2973204152","https://openalex.org/W3003648623","https://openalex.org/W3004407706","https://openalex.org/W3006582303","https://openalex.org/W3041202696","https://openalex.org/W3089692097","https://openalex.org/W3099866104","https://openalex.org/W3120771597","https://openalex.org/W3138807513","https://openalex.org/W4241466952","https://openalex.org/W4288089571","https://openalex.org/W6605295560","https://openalex.org/W6610028881","https://openalex.org/W6630686185","https://openalex.org/W6678087030","https://openalex.org/W6684989534","https://openalex.org/W6704257134","https://openalex.org/W6766946934","https://openalex.org/W6792319920"],"related_works":["https://openalex.org/W3209137076","https://openalex.org/W2374560440","https://openalex.org/W2394276631","https://openalex.org/W3216096898","https://openalex.org/W1490490684","https://openalex.org/W4221129498","https://openalex.org/W2887026015","https://openalex.org/W2361442013","https://openalex.org/W2373384475","https://openalex.org/W4310124294"],"abstract_inverted_index":{"Trajectory":[0],"or":[1,77],"path":[2,25,99],"planning":[3,26],"is":[4,21,56],"a":[5,9,28,39,108],"fundamental":[6],"issue":[7],"in":[8,107],"wide":[10],"variety":[11],"of":[12,42],"applications.":[13],"In":[14],"this":[15,102],"article,":[16],"we":[17],"show":[18],"that":[19,45],"it":[20],"possible":[22],"to":[23,65],"solve":[24],"on":[27,111],"maze":[29],"for":[30,51],"multiple":[31],"start":[32],"point":[33],"and":[34,95],"endpoint":[35],"highly":[36],"efficiently":[37],"with":[38,91],"novel":[40],"configuration":[41,94],"multilayer":[43],"networks":[44,59],"use":[46],"only":[47],"weighted":[48],"pooling":[49],"operations,":[50],"which":[52,62],"no":[53],"network":[54],"training":[55],"needed.":[57],"These":[58],"create":[60],"solutions,":[61],"are":[63],"identical":[64],"those":[66],"from":[67,80],"classical":[68],"algorithms":[69],"such":[70],"as":[71],"breadth-first":[72],"search":[73],"(BFS),":[74],"Dijkstra's":[75],"algorithm,":[76],"TD(0).":[78],"Different":[79],"competing":[81],"approaches,":[82],"very":[83],"large":[84],"mazes":[85],"containing":[86],"almost":[87],"one":[88],"billion":[89],"nodes":[90],"dense":[92],"obstacle":[93],"several":[96],"thousand":[97],"importance-weighted":[98],"endpoints":[100],"can":[101],"way":[103],"be":[104],"solved":[105],"quickly":[106],"single":[109],"pass":[110],"parallel":[112],"hardware.":[113]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}