{"id":"https://openalex.org/W7133205683","doi":"https://doi.org/10.48550/arxiv.2602.23789","title":"UPath: Universal Planner Across Topological Heterogeneity For Grid-Based Pathfinding","display_name":"UPath: Universal Planner Across Topological Heterogeneity For Grid-Based Pathfinding","publication_year":2026,"publication_date":"2026-02-27","ids":{"openalex":"https://openalex.org/W7133205683","doi":"https://doi.org/10.48550/arxiv.2602.23789"},"language":null,"primary_location":{"id":"pmh:doi:10.48550/arxiv.2602.23789","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","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":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":null,"any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5127812758","display_name":"Aleksandr Ananikian","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ananikian, Aleksandr","raw_affiliation_strings":["Saint-Petersburg University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Saint-Petersburg University","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5127825043","display_name":"Daniil Drozdov","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Drozdov, Daniil","raw_affiliation_strings":["Saint-Petersburg University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Saint-Petersburg University","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5127853316","display_name":"Konstantin Yakovlev","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yakovlev, Konstantin","raw_affiliation_strings":["Saint-Petersburg University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Saint-Petersburg University","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.24190564,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"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.3555999994277954,"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.3555999994277954,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.30300000309944153,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T11106","display_name":"Data Management and Algorithms","score":0.06539999693632126,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/heuristics","display_name":"Heuristics","score":0.673799991607666},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6366999745368958},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.5303000211715698},{"id":"https://openalex.org/keywords/focus","display_name":"Focus (optics)","score":0.508899986743927},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.41339999437332153},{"id":"https://openalex.org/keywords/grid","display_name":"Grid","score":0.39259999990463257},{"id":"https://openalex.org/keywords/sketch","display_name":"Sketch","score":0.34040001034736633},{"id":"https://openalex.org/keywords/planner","display_name":"Planner","score":0.3330000042915344}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.673799991607666},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6596999764442444},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6366999745368958},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.5303000211715698},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.508899986743927},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.48339998722076416},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.41339999437332153},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.39259999990463257},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.3910999894142151},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3628000020980835},{"id":"https://openalex.org/C2779231336","wikidata":"https://www.wikidata.org/wiki/Q7534724","display_name":"Sketch","level":2,"score":0.34040001034736633},{"id":"https://openalex.org/C2776999362","wikidata":"https://www.wikidata.org/wiki/Q2349274","display_name":"Planner","level":2,"score":0.3330000042915344},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3203999996185303},{"id":"https://openalex.org/C171268870","wikidata":"https://www.wikidata.org/wiki/Q1486676","display_name":"GRASP","level":2,"score":0.3061000108718872},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.30079999566078186},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.28690001368522644},{"id":"https://openalex.org/C34413123","wikidata":"https://www.wikidata.org/wiki/Q170978","display_name":"Robotics","level":3,"score":0.27459999918937683},{"id":"https://openalex.org/C164155591","wikidata":"https://www.wikidata.org/wiki/Q2067766","display_name":"Satisfiability modulo theories","level":2,"score":0.26919999718666077},{"id":"https://openalex.org/C2781039887","wikidata":"https://www.wikidata.org/wiki/Q1391724","display_name":"Factor (programming language)","level":2,"score":0.26499998569488525},{"id":"https://openalex.org/C2780310539","wikidata":"https://www.wikidata.org/wiki/Q12547192","display_name":"Imperfect","level":2,"score":0.2597000002861023},{"id":"https://openalex.org/C148220186","wikidata":"https://www.wikidata.org/wiki/Q7111912","display_name":"Outcome (game theory)","level":2,"score":0.2515000104904175},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.2506999969482422}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:doi:10.48550/arxiv.2602.23789","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","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":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},{"id":"doi:10.48550/arxiv.2602.23789","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.23789","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":"pmh:doi:10.48550/arxiv.2602.23789","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","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":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities","score":0.5640398859977722}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0],"performance":[1],"of":[2,34,98,123,129,145,152,160],"search":[3],"algorithms":[4],"for":[5,178,184],"grid-based":[6],"pathfinding,":[7],"e.g.":[8],"A*,":[9],"critically":[10],"depends":[11],"on":[12,54,78,164,167],"the":[13,21,32,35,43,48,55,66,138,142,161,168,175,185],"heuristic":[14,115],"function":[15],"that":[16,27,30,57,95,137,170],"is":[17,93,96],"used":[18,177],"to":[19,149],"focus":[20],"search.":[22],"Recent":[23],"studies":[24],"have":[25],"shown":[26],"informed":[28],"heuristics":[29],"take":[31],"positions/shapes":[33],"obstacles":[36],"into":[37],"account":[38],"can":[39],"be":[40],"approximated":[41],"with":[42],"deep":[44],"neural":[45],"networks.":[46],"Unfortunately,":[47],"existing":[49],"learning-based":[50],"approaches":[51],"mostly":[52],"rely":[53],"assumption":[56],"training":[58,179],"and":[59,75],"test":[60],"grid":[61],"maps":[62],"are":[63,171],"drawn":[64],"from":[65,174],"same":[67],"distribution":[68],"(e.g.,":[69],"city":[70],"maps,":[71,73],"indoor":[72],"etc.)":[74],"perform":[76],"poorly":[77],"out-of-distribution":[79],"tasks.":[80,131],"This":[81],"naturally":[82],"limits":[83],"their":[84],"application":[85],"in":[86],"practice":[87],"when":[88],"often":[89],"a":[90,117,126,150,181,189],"universal":[91,114],"solver":[92],"needed":[94],"capable":[97,122],"efficiently":[99],"handling":[100],"any":[101],"problem":[102],"instance.":[103],"In":[104],"this":[105,109],"work,":[106],"we":[107],"close":[108],"gap":[110],"by":[111,147,188],"designing":[112],"an":[113],"predictor:":[116],"model":[118],"trained":[119],"once,":[120],"but":[121],"generalizing":[124],"across":[125],"full":[127],"spectrum":[128],"unseen":[130],"Our":[132],"extensive":[133],"empirical":[134],"evaluation":[135],"shows":[136],"suggested":[139],"approach":[140],"halves":[141],"computational":[143],"effort":[144],"A*":[146],"up":[148],"factor":[151],"2.2,":[153],"while":[154],"still":[155],"providing":[156],"solutions":[157],"within":[158],"3%":[159],"optimal":[162],"cost":[163],"average":[165],"altogether":[166],"tasks":[169],"completely":[172],"different":[173],"ones":[176],"$\\unicode{x2013}$":[180],"milestone":[182],"reached":[183],"first":[186],"time":[187],"learnable":[190],"solver.":[191]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-03-03T00:00:00"}