{"id":"https://openalex.org/W2941397484","doi":"https://doi.org/10.1109/iros40897.2019.8968089","title":"Neural Path Planning: Fixed Time, Near-Optimal Path Generation via Oracle Imitation","display_name":"Neural Path Planning: Fixed Time, Near-Optimal Path Generation via Oracle Imitation","publication_year":2019,"publication_date":"2019-11-01","ids":{"openalex":"https://openalex.org/W2941397484","doi":"https://doi.org/10.1109/iros40897.2019.8968089","mag":"2941397484"},"language":"en","primary_location":{"id":"doi:10.1109/iros40897.2019.8968089","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iros40897.2019.8968089","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1904.11102","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5035385275","display_name":"Mayur J. Bency","orcid":null},"institutions":[{"id":"https://openalex.org/I36258959","display_name":"University of California San Diego","ror":"https://ror.org/0168r3w48","country_code":"US","type":"education","lineage":["https://openalex.org/I36258959"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mayur J. Bency","raw_affiliation_strings":["University of California,Department of Electrical and Computer Engineering,San Diego, La Jolla,CA,USA,92093"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California,Department of Electrical and Computer Engineering,San Diego, La Jolla,CA,USA,92093","institution_ids":["https://openalex.org/I36258959"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5056336556","display_name":"Ahmed H. Qureshi","orcid":"https://orcid.org/0000-0003-2104-2333"},"institutions":[{"id":"https://openalex.org/I36258959","display_name":"University of California San Diego","ror":"https://ror.org/0168r3w48","country_code":"US","type":"education","lineage":["https://openalex.org/I36258959"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ahmed H. Qureshi","raw_affiliation_strings":["University of California,Department of Electrical and Computer Engineering,San Diego, La Jolla,CA,USA,92093"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California,Department of Electrical and Computer Engineering,San Diego, La Jolla,CA,USA,92093","institution_ids":["https://openalex.org/I36258959"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5054598974","display_name":"Michael C. Yip","orcid":"https://orcid.org/0000-0001-9689-0172"},"institutions":[{"id":"https://openalex.org/I36258959","display_name":"University of California San Diego","ror":"https://ror.org/0168r3w48","country_code":"US","type":"education","lineage":["https://openalex.org/I36258959"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Michael C. Yip","raw_affiliation_strings":["University of California,Department of Electrical and Computer Engineering,San Diego, La Jolla,CA,USA,92093","University of California\u2014San Diego"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California,Department of Electrical and Computer Engineering,San Diego, La Jolla,CA,USA,92093","institution_ids":["https://openalex.org/I36258959"]},{"raw_affiliation_string":"University of California\u2014San Diego","institution_ids":["https://openalex.org/I36258959"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I36258959"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"3965","last_page":"3972"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9998999834060669,"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.9998999834060669,"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/T10653","display_name":"Robot Manipulation and Learning","score":0.9968000054359436,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10812","display_name":"Human Pose and Action Recognition","score":0.9886999726295471,"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/pathfinding","display_name":"Pathfinding","score":0.7830556035041809},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.690525233745575},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.6320781111717224},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6294407844543457},{"id":"https://openalex.org/keywords/configuration-space","display_name":"Configuration space","score":0.6255201101303101},{"id":"https://openalex.org/keywords/oracle","display_name":"Oracle","score":0.5742614269256592},{"id":"https://openalex.org/keywords/curse-of-dimensionality","display_name":"Curse of dimensionality","score":0.52159184217453},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.48483407497406006},{"id":"https://openalex.org/keywords/any-angle-path-planning","display_name":"Any-angle path planning","score":0.47965386509895325},{"id":"https://openalex.org/keywords/fast-path","display_name":"Fast path","score":0.4494922161102295},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4299776554107666},{"id":"https://openalex.org/keywords/a-priori-and-a-posteriori","display_name":"A priori and a posteriori","score":0.42286279797554016},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3790236711502075},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3544773459434509},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2947455644607544},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.20306307077407837},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.18240192532539368},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.14382970333099365}],"concepts":[{"id":"https://openalex.org/C25321074","wikidata":"https://www.wikidata.org/wiki/Q1969601","display_name":"Pathfinding","level":4,"score":0.7830556035041809},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.690525233745575},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.6320781111717224},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6294407844543457},{"id":"https://openalex.org/C90738871","wikidata":"https://www.wikidata.org/wiki/Q41642869","display_name":"Configuration space","level":2,"score":0.6255201101303101},{"id":"https://openalex.org/C55166926","wikidata":"https://www.wikidata.org/wiki/Q2892946","display_name":"Oracle","level":2,"score":0.5742614269256592},{"id":"https://openalex.org/C111030470","wikidata":"https://www.wikidata.org/wiki/Q1430460","display_name":"Curse of dimensionality","level":2,"score":0.52159184217453},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.48483407497406006},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.47965386509895325},{"id":"https://openalex.org/C32638748","wikidata":"https://www.wikidata.org/wiki/Q5437051","display_name":"Fast path","level":4,"score":0.4494922161102295},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4299776554107666},{"id":"https://openalex.org/C75553542","wikidata":"https://www.wikidata.org/wiki/Q178161","display_name":"A priori and a posteriori","level":2,"score":0.42286279797554016},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3790236711502075},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3544773459434509},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2947455644607544},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.20306307077407837},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18240192532539368},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.14382970333099365},{"id":"https://openalex.org/C115903868","wikidata":"https://www.wikidata.org/wiki/Q80993","display_name":"Software engineering","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","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}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1109/iros40897.2019.8968089","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iros40897.2019.8968089","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:1904.11102","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1904.11102","pdf_url":"https://arxiv.org/pdf/1904.11102","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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":"text"},{"id":"doi:10.48550/arxiv.1904.11102","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1904.11102","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"},{"id":"mag:2941397484","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":null}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1904.11102","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1904.11102","pdf_url":"https://arxiv.org/pdf/1904.11102","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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":"text"},"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11","score":0.5799999833106995}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W2941397484.pdf"},"referenced_works_count":32,"referenced_works":["https://openalex.org/W131069610","https://openalex.org/W1969483458","https://openalex.org/W2058580716","https://openalex.org/W2064675550","https://openalex.org/W2086860466","https://openalex.org/W2095705004","https://openalex.org/W2099893201","https://openalex.org/W2103120971","https://openalex.org/W2104332709","https://openalex.org/W2104733512","https://openalex.org/W2112765698","https://openalex.org/W2134491302","https://openalex.org/W2141664020","https://openalex.org/W2154543878","https://openalex.org/W2158207287","https://openalex.org/W2163650400","https://openalex.org/W2211552581","https://openalex.org/W2293698677","https://openalex.org/W2306644740","https://openalex.org/W2569181534","https://openalex.org/W2772709170","https://openalex.org/W2964077562","https://openalex.org/W2964079853","https://openalex.org/W2967969632","https://openalex.org/W3106475722","https://openalex.org/W4246226690","https://openalex.org/W6674330103","https://openalex.org/W6675999342","https://openalex.org/W6692405165","https://openalex.org/W6743350977","https://openalex.org/W6746177919","https://openalex.org/W6752808292"],"related_works":["https://openalex.org/W3003648623","https://openalex.org/W2808829022","https://openalex.org/W1971086298","https://openalex.org/W2967969632","https://openalex.org/W2141664020","https://openalex.org/W131069610","https://openalex.org/W2894417726","https://openalex.org/W3089692097","https://openalex.org/W3120771597","https://openalex.org/W3015106960","https://openalex.org/W3093196803","https://openalex.org/W2115970849","https://openalex.org/W3047385205","https://openalex.org/W2964077562","https://openalex.org/W2795756076","https://openalex.org/W2593841437","https://openalex.org/W2557465155","https://openalex.org/W2306644740","https://openalex.org/W2128990851","https://openalex.org/W2110762409"],"abstract_inverted_index":{"Fast":[0],"and":[1,60,106,188],"efficient":[2],"path":[3],"generation":[4],"is":[5,17,152],"critical":[6],"for":[7,110],"robots":[8],"operating":[9],"in":[10,20,81,131,144,146,154,161,185],"complex":[11,186],"environments.":[12],"This":[13],"motion":[14,108,139],"planning":[15],"problem":[16],"often":[18],"performed":[19],"a":[21,85,100,115,147,162],"robot's":[22],"actuation":[23],"or":[24,54],"configuration":[25,83,177],"space,":[26],"where":[27],"popular":[28,182],"pathfinding":[29,183],"methods":[30],"such":[31],"as":[32,50],"A":[33],"<sup":[34,39,191],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[35,40,192],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">*</sup>":[36,41],",":[37,42],"RRT":[38],"get":[43],"exponentially":[44],"more":[45,58],"computationally":[46],"expensive":[47],"to":[48,69,127],"execute":[49],"the":[51,55,63,71,82,176],"dimensionality":[52],"increases":[53],"spaces":[56],"become":[57],"cluttered":[59],"complex.":[61],"On":[62],"other":[64],"hand,":[65],"if":[66],"one":[67,87],"were":[68],"save":[70],"entire":[72],"set":[73],"of":[74,79,91,103,175],"paths":[75,160],"connecting":[76],"all":[77],"pair":[78],"locations":[80],"space":[84,178],"priori,":[86],"would":[88],"run":[89],"out":[90],"memory":[92],"very":[93],"quickly.":[94],"In":[95,167],"this":[96],"work,":[97],"we":[98],"introduce":[99],"novel":[101],"way":[102],"producing":[104],"fast":[105],"optimal":[107,138],"plans":[109,140],"static":[111],"environments":[112,187],"by":[113],"using":[114],"stepping":[116],"neural":[117],"network":[118],"approach,":[119],"called":[120],"OracleNet.":[121],"OracleNet":[122,169],"uses":[123],"Recurrent":[124],"Neural":[125],"Networks":[126],"determine":[128],"end-to-end":[129,165],"trajectories":[130],"an":[132],"iterative":[133],"manner":[134],"that":[135],"implicitly":[136],"generates":[137],"with":[141],"minimal":[142],"loss":[143],"performance":[145],"compact":[148],"form.":[149],"The":[150],"algorithm":[151],"straightforward":[153],"implementation":[155],"while":[156,180],"consistently":[157],"generating":[158],"near-optimal":[159],"single,":[163],"iterative,":[164],"roll-out.":[166],"practice,":[168],"generally":[170],"has":[171],"fixed-time":[172],"execution":[173],"regardless":[174],"complexity":[179],"outperforming":[181],"algorithms":[184],"higher":[189],"dimensions":[190],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">1</sup>":[193],".":[194]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":6}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}