{"id":"https://openalex.org/W7137352844","doi":"https://doi.org/10.48550/arxiv.2603.12361","title":"GNN-DIP: Neural Corridor Selection for Decomposition-Based Motion Planning","display_name":"GNN-DIP: Neural Corridor Selection for Decomposition-Based Motion Planning","publication_year":2026,"publication_date":"2026-03-12","ids":{"openalex":"https://openalex.org/W7137352844","doi":"https://doi.org/10.48550/arxiv.2603.12361"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2603.12361","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.12361","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":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2603.12361","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5129569456","display_name":"Peng Xie","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Xie, Peng","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5129612686","display_name":"Yanlinag Huang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Huang, Yanliang","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5129467189","display_name":"Wenyuan Wu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Wu, Wenyuan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5122620783","display_name":"Amr Alanwar","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Alanwar, Amr","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9638000130653381,"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.9638000130653381,"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/T11099","display_name":"Autonomous Vehicle Technology and Safety","score":0.006599999964237213,"subfield":{"id":"https://openalex.org/subfields/2203","display_name":"Automotive 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/T10462","display_name":"Reinforcement Learning in Robotics","score":0.004399999976158142,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/bottleneck","display_name":"Bottleneck","score":0.7091000080108643},{"id":"https://openalex.org/keywords/delaunay-triangulation","display_name":"Delaunay triangulation","score":0.6646999716758728},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.6444000005722046},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.4810999929904938},{"id":"https://openalex.org/keywords/adjacency-list","display_name":"Adjacency list","score":0.436599999666214},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.39660000801086426},{"id":"https://openalex.org/keywords/any-angle-path-planning","display_name":"Any-angle path planning","score":0.38940000534057617},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.3637000024318695},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.3634999990463257}],"concepts":[{"id":"https://openalex.org/C2780513914","wikidata":"https://www.wikidata.org/wiki/Q18210350","display_name":"Bottleneck","level":2,"score":0.7091000080108643},{"id":"https://openalex.org/C68010082","wikidata":"https://www.wikidata.org/wiki/Q192445","display_name":"Delaunay triangulation","level":2,"score":0.6646999716758728},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.6444000005722046},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.59579998254776},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.4810999929904938},{"id":"https://openalex.org/C110484373","wikidata":"https://www.wikidata.org/wiki/Q264398","display_name":"Adjacency list","level":2,"score":0.436599999666214},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.41760000586509705},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.41609999537467957},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.39660000801086426},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.38940000534057617},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.376800000667572},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.3637000024318695},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.3634999990463257},{"id":"https://openalex.org/C128321387","wikidata":"https://www.wikidata.org/wiki/Q5164356","display_name":"Constrained Delaunay triangulation","level":3,"score":0.3424000144004822},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.32510000467300415},{"id":"https://openalex.org/C31972630","wikidata":"https://www.wikidata.org/wiki/Q844240","display_name":"Computer vision","level":1,"score":0.3077999949455261},{"id":"https://openalex.org/C58581272","wikidata":"https://www.wikidata.org/wiki/Q12741163","display_name":"Workspace","level":3,"score":0.3005000054836273},{"id":"https://openalex.org/C96333769","wikidata":"https://www.wikidata.org/wiki/Q907955","display_name":"Graph traversal","level":3,"score":0.2935999929904938},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.2897999882698059},{"id":"https://openalex.org/C2776650193","wikidata":"https://www.wikidata.org/wiki/Q264661","display_name":"Obstacle","level":2,"score":0.2856000065803528},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.2809999883174896},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.2791000008583069},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.2759999930858612},{"id":"https://openalex.org/C34736171","wikidata":"https://www.wikidata.org/wiki/Q918333","display_name":"Preprocessor","level":2,"score":0.2567000091075897},{"id":"https://openalex.org/C140779682","wikidata":"https://www.wikidata.org/wiki/Q210868","display_name":"Sampling (signal processing)","level":3,"score":0.2563000023365021},{"id":"https://openalex.org/C24881265","wikidata":"https://www.wikidata.org/wiki/Q757267","display_name":"Voronoi diagram","level":2,"score":0.25429999828338623},{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.25360000133514404},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.2526000142097473}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2603.12361","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.12361","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"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2603.12361","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.12361","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":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[{"score":0.7178695201873779,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Motion":[0],"planning":[1],"through":[2,83],"narrow":[3,16],"passages":[4],"remains":[5],"a":[6,26,64,71,93,101,108,114],"core":[7],"challenge:":[8],"sampling-based":[9,196],"planners":[10,46],"rarely":[11],"place":[12],"samples":[13,23],"inside":[14,25],"these":[15],"but":[17],"critical":[18],"regions,":[19],"and":[20,38,67,180],"even":[21],"when":[22],"land":[24],"passage,":[27],"the":[28,78,84,125,146],"straight-line":[29],"connections":[30],"between":[31],"them":[32],"run":[33],"close":[34],"to":[35,129,177],"obstacle":[36],"boundaries":[37],"are":[39],"frequently":[40],"rejected":[41],"by":[42,50,75,106],"collision":[43],"checking.":[44],"Decomposition-based":[45],"resolve":[47],"both":[48],"issues":[49],"partitioning":[51],"free":[52],"space":[53],"into":[54],"convex":[55,158],"cells":[56],"--":[57],"every":[58],"passage":[59],"is":[60,73],"captured":[61],"exactly":[62],"as":[63],"cell":[65,72,85,126],"boundary,":[66],"any":[68],"path":[69,165],"within":[70,153],"collision-free":[74],"construction.":[76],"However,":[77],"number":[79],"of":[80],"candidate":[81],"corridors":[82],"graph":[86,128],"grows":[87],"combinatorially":[88],"with":[89,113,145,160,175,191],"environment":[90],"complexity,":[91],"creating":[92],"bottleneck":[94,173],"in":[95,155],"corridor":[96,131],"selection.":[97],"We":[98],"present":[99],"GNN-DIP,":[100],"framework":[102],"that":[103,185],"addresses":[104],"this":[105],"integrating":[107],"Graph":[109],"Neural":[110],"Network":[111],"(GNN)":[112],"two-phase":[115],"Decomposition-Informed":[116],"Planner":[117],"(DIP).":[118],"The":[119],"GNN":[120],"predicts":[121],"portal":[122],"scores":[123],"on":[124,168],"adjacency":[127],"bias":[130],"search":[132],"toward":[133],"near-optimal":[134,164],"regions":[135],"while":[136],"preserving":[137],"completeness.":[138],"In":[139],"2D,":[140],"Constrained":[141],"Delaunay":[142],"Triangulation":[143],"(CDT)":[144],"Funnel":[147],"algorithm":[148],"yields":[149],"exact":[150],"shortest":[151],"paths":[152],"corridors;":[154],"3D,":[156],"Slab":[157],"decomposition":[159],"portal-face":[161],"sampling":[162],"provides":[163],"evaluation.":[166],"Benchmarks":[167],"2D":[169,182],"narrow-passage":[170],"scenarios,":[171],"3D":[172],"environments":[174],"up":[176],"246":[178],"obstacles,":[179],"dynamic":[181],"settings":[183],"show":[184],"GNN-DIP":[186],"achieves":[187],"99--100%":[188],"success":[189],"rates":[190],"2--280":[192],"times":[193],"speedup":[194],"over":[195],"baselines.":[197]},"counts_by_year":[],"updated_date":"2026-07-17T05:52:16.776730","created_date":"2026-03-17T00:00:00"}