{"id":"https://openalex.org/W3098336417","doi":"https://doi.org/10.1109/mra.2015.2448276","title":"Benchmarking Motion Planning Algorithms: An Extensible Infrastructure for Analysis and Visualization","display_name":"Benchmarking Motion Planning Algorithms: An Extensible Infrastructure for Analysis and Visualization","publication_year":2015,"publication_date":"2015-08-20","ids":{"openalex":"https://openalex.org/W3098336417","doi":"https://doi.org/10.1109/mra.2015.2448276","mag":"3098336417"},"language":"en","primary_location":{"id":"doi:10.1109/mra.2015.2448276","is_oa":false,"landing_page_url":"https://doi.org/10.1109/mra.2015.2448276","pdf_url":null,"source":{"id":"https://openalex.org/S132261465","display_name":"IEEE Robotics & Automation Magazine","issn_l":"1070-9932","issn":["1070-9932","1558-223X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Robotics &amp; Automation Magazine","raw_type":"journal-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/A5061397940","display_name":"Mark Moll","orcid":"https://orcid.org/0000-0002-0451-2797"},"institutions":[{"id":"https://openalex.org/I74775410","display_name":"Rice University","ror":"https://ror.org/008zs3103","country_code":"US","type":"education","lineage":["https://openalex.org/I74775410"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mark Moll","raw_affiliation_strings":["Rice University, Houston, Texas 77251 USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Rice University, Houston, Texas 77251 USA","institution_ids":["https://openalex.org/I74775410"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5078911730","display_name":"Ioan A. \u015eucan","orcid":null},"institutions":[{"id":"https://openalex.org/I1291425158","display_name":"Google (United States)","ror":"https://ror.org/00njsd438","country_code":"US","type":"company","lineage":["https://openalex.org/I1291425158","https://openalex.org/I4210128969"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ioan A. Sucan","raw_affiliation_strings":["Google, Mountain View, 94043 USA","Google Inc, Mountain View, CA, US"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Google, Mountain View, 94043 USA","institution_ids":["https://openalex.org/I1291425158"]},{"raw_affiliation_string":"Google Inc, Mountain View, CA, US","institution_ids":["https://openalex.org/I1291425158"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5067205988","display_name":"Lydia E. Kavraki","orcid":"https://orcid.org/0000-0003-0699-8038"},"institutions":[{"id":"https://openalex.org/I74775410","display_name":"Rice University","ror":"https://ror.org/008zs3103","country_code":"US","type":"education","lineage":["https://openalex.org/I74775410"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Lydia E. Kavraki","raw_affiliation_strings":["Rice University, Houston, Texas 77005 USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Rice University, Houston, Texas 77005 USA","institution_ids":["https://openalex.org/I74775410"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":2045,"currency":"USD","value_usd":2045},"apc_paid":null,"fwci":5.5514,"has_fulltext":false,"cited_by_count":128,"citation_normalized_percentile":{"value":0.96608815,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":100},"biblio":{"volume":"22","issue":"3","first_page":"96","last_page":"102"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":1.0,"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":1.0,"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/T10191","display_name":"Robotics and Sensor-Based Localization","score":0.9959999918937683,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace 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/T12288","display_name":"Optimization and Search Problems","score":0.9945999979972839,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/motion-planning","display_name":"Motion planning","score":0.8583166599273682},{"id":"https://openalex.org/keywords/completeness","display_name":"Completeness (order theory)","score":0.7533656358718872},{"id":"https://openalex.org/keywords/benchmarking","display_name":"Benchmarking","score":0.7210118770599365},{"id":"https://openalex.org/keywords/robotics","display_name":"Robotics","score":0.5799195170402527},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5550165176391602},{"id":"https://openalex.org/keywords/motion","display_name":"Motion (physics)","score":0.506259560585022},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5023307800292969},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.4582045078277588},{"id":"https://openalex.org/keywords/visualization","display_name":"Visualization","score":0.4561223089694977},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.44855791330337524},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.4387964606285095},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3764451742172241},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3686200976371765},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.34921687841415405},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.28302526473999023},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.1671084463596344}],"concepts":[{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.8583166599273682},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.7533656358718872},{"id":"https://openalex.org/C86251818","wikidata":"https://www.wikidata.org/wiki/Q816754","display_name":"Benchmarking","level":2,"score":0.7210118770599365},{"id":"https://openalex.org/C34413123","wikidata":"https://www.wikidata.org/wiki/Q170978","display_name":"Robotics","level":3,"score":0.5799195170402527},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5550165176391602},{"id":"https://openalex.org/C104114177","wikidata":"https://www.wikidata.org/wiki/Q79782","display_name":"Motion (physics)","level":2,"score":0.506259560585022},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5023307800292969},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.4582045078277588},{"id":"https://openalex.org/C36464697","wikidata":"https://www.wikidata.org/wiki/Q451553","display_name":"Visualization","level":2,"score":0.4561223089694977},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.44855791330337524},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.4387964606285095},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3764451742172241},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3686200976371765},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.34921687841415405},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.28302526473999023},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.1671084463596344},{"id":"https://openalex.org/C144133560","wikidata":"https://www.wikidata.org/wiki/Q4830453","display_name":"Business","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C162853370","wikidata":"https://www.wikidata.org/wiki/Q39809","display_name":"Marketing","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/mra.2015.2448276","is_oa":false,"landing_page_url":"https://doi.org/10.1109/mra.2015.2448276","pdf_url":null,"source":{"id":"https://openalex.org/S132261465","display_name":"IEEE Robotics & Automation Magazine","issn_l":"1070-9932","issn":["1070-9932","1558-223X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Robotics &amp; Automation Magazine","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.697.2188","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.697.2188","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.rice.edu/%7Emmoll/publications/moll2015benchmarking-motion-planning-algorithms.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/9","score":0.6200000047683716,"display_name":"Industry, innovation and infrastructure"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1500643070","https://openalex.org/W1516027685","https://openalex.org/W1521785144","https://openalex.org/W1974733785","https://openalex.org/W2002548850","https://openalex.org/W2012233224","https://openalex.org/W2100539185","https://openalex.org/W2110762409","https://openalex.org/W2141664020","https://openalex.org/W2167348159","https://openalex.org/W2259289808","https://openalex.org/W6629888152","https://openalex.org/W6630827198","https://openalex.org/W6631300751"],"related_works":["https://openalex.org/W4238897586","https://openalex.org/W435179959","https://openalex.org/W2619091065","https://openalex.org/W2059640416","https://openalex.org/W1490753184","https://openalex.org/W2284465472","https://openalex.org/W2291782699","https://openalex.org/W1993948687","https://openalex.org/W2000169967","https://openalex.org/W2112883198"],"abstract_inverted_index":{"Motion":[0],"planning":[1,55,82,89],"is":[2,9,44,58],"a":[3,13,17,35],"key":[4],"problem":[5,31],"in":[6],"robotics":[7],"that":[8,15],"concerned":[10],"with":[11],"finding":[12,34],"path":[14,36],"satisfies":[16],"goal":[18,78],"specification":[19],"subject":[20],"to":[21,29,45],"constraints.":[22],"In":[23],"its":[24,86],"simplest":[25],"form,":[26],"the":[27,41,53,63],"solution":[28,61],"this":[30,50],"consists":[32],"of":[33,52,69],"connecting":[37],"two":[38],"states,":[39],"and":[40,93,106],"only":[42],"constraint":[43],"avoid":[46],"collisions.":[47],"Even":[48],"for":[49,62,95],"version":[51],"motion":[54,74,81],"problem,":[56],"there":[57],"no":[59],"efficient":[60],"general":[64,77],"case":[65],"[1].":[66],"The":[67],"addition":[68],"differential":[70],"constraints":[71],"on":[72],"robot":[73],"or":[75],"more":[76],"specifications":[79],"makes":[80],"even":[83],"harder.":[84],"Given":[85],"complexity,":[87],"most":[88],"algorithms":[90],"forego":[91],"completeness":[92,104],"optimality":[94],"slightly":[96],"weaker":[97],"notions":[98],"such":[99],"as":[100],"resolution":[101],"completeness,":[102],"probabilistic":[103],"[2],":[105],"asymptotic":[107],"optimality.":[108]},"counts_by_year":[{"year":2026,"cited_by_count":8},{"year":2025,"cited_by_count":19},{"year":2024,"cited_by_count":11},{"year":2023,"cited_by_count":19},{"year":2022,"cited_by_count":14},{"year":2021,"cited_by_count":17},{"year":2020,"cited_by_count":11},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":11},{"year":2017,"cited_by_count":10},{"year":2016,"cited_by_count":2}],"updated_date":"2026-08-29T07:29:34.045763","created_date":"2025-10-10T00:00:00"}
