{"id":"https://openalex.org/W2039107569","doi":"https://doi.org/10.1109/icra.2013.6631119","title":"ODrM* optimal multirobot path planning in low dimensional search spaces","display_name":"ODrM* optimal multirobot path planning in low dimensional search spaces","publication_year":2013,"publication_date":"2013-05-01","ids":{"openalex":"https://openalex.org/W2039107569","doi":"https://doi.org/10.1109/icra.2013.6631119","mag":"2039107569"},"language":"en","primary_location":{"id":"doi:10.1109/icra.2013.6631119","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra.2013.6631119","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE International Conference on Robotics and Automation","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5000884319","display_name":"Cornelia Ferner","orcid":"https://orcid.org/0000-0003-1721-0453"},"institutions":[{"id":"https://openalex.org/I182212641","display_name":"University of Salzburg","ror":"https://ror.org/05gs8cd61","country_code":"AT","type":"education","lineage":["https://openalex.org/I182212641"]},{"id":"https://openalex.org/I4210087982","display_name":"Fachhochschule Salzburg","ror":"https://ror.org/0072dxg89","country_code":"AT","type":"education","lineage":["https://openalex.org/I4210087982"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Cornelia Ferner","raw_affiliation_strings":["ITS, Salzburg University of Applied Sciences, Salzburg, Austria","ITS, Salzburg Univ. of Appl. Sci., Puch, Austria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ITS, Salzburg University of Applied Sciences, Salzburg, Austria","institution_ids":["https://openalex.org/I4210087982"]},{"raw_affiliation_string":"ITS, Salzburg Univ. of Appl. Sci., Puch, Austria","institution_ids":["https://openalex.org/I182212641"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5031211737","display_name":"Glenn Wagner","orcid":"https://orcid.org/0000-0002-3450-398X"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Glenn Wagner","raw_affiliation_strings":["Robotics Institute, Carnegie Mellon University, Pittsburgh, PA, USA","[Robot. Inst., Carnegie Mellon Univ., Pittsburgh, PA, USA]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Robotics Institute, Carnegie Mellon University, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]},{"raw_affiliation_string":"[Robot. Inst., Carnegie Mellon Univ., Pittsburgh, PA, USA]","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5048906141","display_name":"Howie Choset","orcid":null},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Howie Choset","raw_affiliation_strings":["Robotics Institute, Carnegie Mellon University, Pittsburgh, PA, USA","[Robot. Inst., Carnegie Mellon Univ., Pittsburgh, PA, USA]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Robotics Institute, Carnegie Mellon University, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]},{"raw_affiliation_string":"[Robot. Inst., Carnegie Mellon Univ., Pittsburgh, PA, USA]","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.3813,"has_fulltext":false,"cited_by_count":75,"citation_normalized_percentile":{"value":0.83852628,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"3854","last_page":"3859"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9998000264167786,"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.9998000264167786,"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.9980000257492065,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9961000084877014,"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/robot","display_name":"Robot","score":0.689631462097168},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5953919291496277},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.5547446608543396},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5274220705032349},{"id":"https://openalex.org/keywords/curse-of-dimensionality","display_name":"Curse of dimensionality","score":0.5064171552658081},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.4661264419555664},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.46156516671180725},{"id":"https://openalex.org/keywords/any-angle-path-planning","display_name":"Any-angle path planning","score":0.45829567313194275},{"id":"https://openalex.org/keywords/space","display_name":"Space (punctuation)","score":0.45232611894607544},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.43910178542137146},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4258801341056824},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.4249994158744812},{"id":"https://openalex.org/keywords/bidirectional-search","display_name":"Bidirectional search","score":0.4186224043369293},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.38696253299713135},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.336331307888031},{"id":"https://openalex.org/keywords/incremental-heuristic-search","display_name":"Incremental heuristic search","score":0.2520345449447632},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23577827215194702},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2219492495059967},{"id":"https://openalex.org/keywords/beam-search","display_name":"Beam search","score":0.21135655045509338}],"concepts":[{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.689631462097168},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5953919291496277},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.5547446608543396},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5274220705032349},{"id":"https://openalex.org/C111030470","wikidata":"https://www.wikidata.org/wiki/Q1430460","display_name":"Curse of dimensionality","level":2,"score":0.5064171552658081},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.4661264419555664},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.46156516671180725},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.45829567313194275},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.45232611894607544},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.43910178542137146},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4258801341056824},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.4249994158744812},{"id":"https://openalex.org/C831591","wikidata":"https://www.wikidata.org/wiki/Q59750","display_name":"Bidirectional search","level":5,"score":0.4186224043369293},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.38696253299713135},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.336331307888031},{"id":"https://openalex.org/C139979381","wikidata":"https://www.wikidata.org/wiki/Q17056021","display_name":"Incremental heuristic search","level":4,"score":0.2520345449447632},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23577827215194702},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2219492495059967},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.21135655045509338},{"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/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icra.2013.6631119","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra.2013.6631119","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE International Conference on Robotics and Automation","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","score":0.4699999988079071,"display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W3359552","https://openalex.org/W93645818","https://openalex.org/W1551562380","https://openalex.org/W1763528081","https://openalex.org/W1777366632","https://openalex.org/W1985818490","https://openalex.org/W1986164452","https://openalex.org/W1989407213","https://openalex.org/W2000359213","https://openalex.org/W2005600449","https://openalex.org/W2124015815","https://openalex.org/W2128990851","https://openalex.org/W2293119400","https://openalex.org/W2398043204","https://openalex.org/W2404271123","https://openalex.org/W2408675864","https://openalex.org/W6600116910","https://openalex.org/W6603775515","https://openalex.org/W6632973643","https://openalex.org/W6637859625","https://openalex.org/W6643460623","https://openalex.org/W6696707632","https://openalex.org/W6712558145","https://openalex.org/W6713083276"],"related_works":["https://openalex.org/W2368795992","https://openalex.org/W4308080200","https://openalex.org/W2908094156","https://openalex.org/W2389896347","https://openalex.org/W2106119116","https://openalex.org/W2904203243","https://openalex.org/W3139139461","https://openalex.org/W2125569607","https://openalex.org/W2084091668","https://openalex.org/W3204808601"],"abstract_inverted_index":{"We":[0,141],"believe":[1],"the":[2,6,77,80,135,144,150],"core":[3],"of":[4,8,17,38,79,134,137,149],"handling":[5],"complexity":[7],"coordinated":[9],"multiagent":[10],"search":[11,59,70,81,119,133],"lies":[12],"in":[13,27,83,117],"identifying":[14],"which":[15],"subsets":[16],"robots":[18,109,113],"can":[19],"be":[20,115],"safely":[21],"decoupled,":[22],"and":[23,65],"hence":[24],"planned":[25,116],"for":[26,54,61,68,111],"a":[28,100,138],"lower":[29],"dimensional":[30],"space.":[31,120],"Our":[32],"work,":[33,46],"as":[34,36],"well":[35],"those":[37],"others":[39],"take":[40],"that":[41,103,143],"perspective.":[42],"In":[43,89],"our":[44],"prior":[45],"we":[47,92],"introduced":[48],"an":[49,66,129],"approach":[50],"called":[51,71],"subdimensional":[52],"expansion":[53,74],"constructing":[55],"low-dimensional":[56,118],"but":[57],"sufficient":[58],"spaces":[60],"multirobot":[62],"path":[63],"planning,":[64],"implementation":[67],"graph":[69],"M*.":[72],"Subdimensional":[73],"dynamically":[75],"increases":[76],"dimensionality":[78],"space":[82],"regions":[84],"featuring":[85],"significant":[86],"robot-robot":[87],"interactions.":[88],"this":[90],"paper,":[91],"integrate":[93],"M*":[94,121],"with":[95,125],"Meta-Agent":[96],"Constraint-Based":[97],"Search":[98],"(MA-CBS),":[99],"planning":[101],"framework":[102],"seeks":[104],"to":[105,114],"couple":[106],"repeatedly":[107],"colliding":[108],"allowing":[110],"other":[112],"is":[122],"also":[123],"integrated":[124],"operator":[126],"decomposition":[127],"(OD),":[128],"A*-variant":[130],"performing":[131],"lazy":[132],"outneighbors":[136],"given":[139],"vertex.":[140],"show":[142],"combined":[145],"algorithm":[146],"demonstrates":[147],"state":[148],"art":[151],"performance.":[152]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":12},{"year":2024,"cited_by_count":16},{"year":2023,"cited_by_count":9},{"year":2022,"cited_by_count":7},{"year":2021,"cited_by_count":8},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":3}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}