{"id":"https://openalex.org/W7128815734","doi":"https://doi.org/10.48550/arxiv.2602.12096","title":"Multi Graph Search for High-Dimensional Robot Motion Planning","display_name":"Multi Graph Search for High-Dimensional Robot Motion Planning","publication_year":2026,"publication_date":"2026-02-12","ids":{"openalex":"https://openalex.org/W7128815734","doi":"https://doi.org/10.48550/arxiv.2602.12096"},"language":null,"primary_location":{"id":"pmh:doi:10.48550/arxiv.2602.12096","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":"preprint","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/A5013633462","display_name":"Itamar Mishani","orcid":"https://orcid.org/0000-0002-2731-7441"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mishani, Itamar","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5103257510","display_name":"Maxim Likhachev","orcid":"https://orcid.org/0000-0002-9539-2398"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Likhachev, Maxim","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"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.6564000248908997,"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.6564000248908997,"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/T10906","display_name":"AI-based Problem Solving and Planning","score":0.10170000046491623,"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"}},{"id":"https://openalex.org/T10653","display_name":"Robot Manipulation and Learning","score":0.05139999836683273,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.7218999862670898},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.5570999979972839},{"id":"https://openalex.org/keywords/mobile-robot","display_name":"Mobile robot","score":0.46939998865127563},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.44920000433921814},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.44600000977516174},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.4374000132083893},{"id":"https://openalex.org/keywords/motion","display_name":"Motion (physics)","score":0.4235999882221222},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.39309999346733093}],"concepts":[{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.7218999862670898},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6100000143051147},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.5570999979972839},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.46939998865127563},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.44920000433921814},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.44600000977516174},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.4374000132083893},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.435699999332428},{"id":"https://openalex.org/C104114177","wikidata":"https://www.wikidata.org/wiki/Q79782","display_name":"Motion (physics)","level":2,"score":0.4235999882221222},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.39309999346733093},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.3443000018596649},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3125999867916107},{"id":"https://openalex.org/C34413123","wikidata":"https://www.wikidata.org/wiki/Q170978","display_name":"Robotics","level":3,"score":0.31119999289512634},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.3109999895095825},{"id":"https://openalex.org/C96333769","wikidata":"https://www.wikidata.org/wiki/Q907955","display_name":"Graph traversal","level":3,"score":0.30799999833106995},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.3075999915599823},{"id":"https://openalex.org/C114073186","wikidata":"https://www.wikidata.org/wiki/Q2631895","display_name":"Automated planning and scheduling","level":2,"score":0.28049999475479126},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.27090001106262207},{"id":"https://openalex.org/C2775935494","wikidata":"https://www.wikidata.org/wiki/Q741964","display_name":"Search and rescue","level":3,"score":0.26820001006126404},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.25529998540878296}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:doi:10.48550/arxiv.2602.12096","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.12096","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.12096","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":"article"}],"best_oa_location":{"id":"pmh:doi:10.48550/arxiv.2602.12096","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":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Efficient":[0],"motion":[1,62],"planning":[2,24,63],"for":[3,15],"high-dimensional":[4,30],"robotic":[5],"systems,":[6],"such":[7],"as":[8,104],"manipulators":[9],"and":[10,18,50,69,78,114,116,126,132],"mobile":[11,127],"manipulators,":[12],"is":[13,112],"critical":[14],"real-time":[16],"operation":[17],"reliable":[19],"deployment.":[20],"Although":[21],"advances":[22],"in":[23],"algorithms":[25],"have":[26],"enhanced":[27],"scalability":[28],"to":[29,72,98],"state":[31,86],"spaces,":[32],"these":[33],"improvements":[34],"often":[35],"come":[36],"at":[37,136],"the":[38,85,105],"cost":[39],"of":[40,124],"generating":[41],"unpredictable,":[42],"inconsistent":[43],"motions":[44],"or":[45],"requiring":[46],"excessive":[47],"computational":[48],"resources":[49],"memory.":[51],"In":[52],"this":[53],"work,":[54],"we":[55],"introduce":[56],"Multi-Graph":[57],"Search":[58],"(MGS),":[59],"a":[60,73,122],"search-based":[61],"algorithm":[64],"that":[65,110],"generalizes":[66],"classical":[67],"unidirectional":[68],"bidirectional":[70],"search":[71,106],"multi-graph":[74],"setting.":[75],"MGS":[76,111],"maintains":[77],"incrementally":[79],"expands":[80],"multiple":[81],"implicit":[82],"graphs":[83],"over":[84],"space,":[87],"focusing":[88],"exploration":[89],"on":[90,121],"high-potential":[91],"regions":[92],"while":[93],"allowing":[94],"initially":[95],"disconnected":[96],"subgraphs":[97],"be":[99],"merged":[100],"through":[101],"feasible":[102],"transitions":[103],"progresses.":[107],"We":[108],"prove":[109],"complete":[113],"bounded-suboptimal,":[115],"empirically":[117],"demonstrate":[118],"its":[119],"effectiveness":[120],"range":[123],"manipulation":[125,128],"tasks.":[129],"Demonstrations,":[130],"benchmarks":[131],"code":[133],"are":[134],"available":[135],"https://multi-graph-search.github.io/.":[137]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-02-14T00:00:00"}