{"id":"https://openalex.org/W1977972789","doi":"https://doi.org/10.1109/icra.2013.6631301","title":"Anytime solution optimization for sampling-based motion planning","display_name":"Anytime solution optimization for sampling-based motion planning","publication_year":2013,"publication_date":"2013-05-01","ids":{"openalex":"https://openalex.org/W1977972789","doi":"https://doi.org/10.1109/icra.2013.6631301","mag":"1977972789"},"language":"en","primary_location":{"id":"doi:10.1109/icra.2013.6631301","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra.2013.6631301","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":"conference-paper","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/A5001357017","display_name":"Ryan Luna","orcid":"https://orcid.org/0000-0002-2930-3254"},"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":"Ryan Luna","raw_affiliation_strings":["Dept. of Computer Science, Rice University, Houston, TX, USA","Dept. of Comput. Sci., Rice Univ., Houston, TX, USA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Computer Science, Rice University, Houston, TX, USA","institution_ids":["https://openalex.org/I74775410"]},{"raw_affiliation_string":"Dept. of Comput. Sci., Rice Univ., Houston, TX, USA#TAB#","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/I4210117999","display_name":"Willow Wood (United States)","ror":"https://ror.org/02hrkdj18","country_code":"US","type":"company","lineage":["https://openalex.org/I4210117999"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ioan A. \u015eucan","raw_affiliation_strings":["Willow Garage, Inc., Menlo Park, CA, USA","[Willow Garage Inc. Menlo Park, CA, USA]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Willow Garage, Inc., Menlo Park, CA, USA","institution_ids":["https://openalex.org/I4210117999"]},{"raw_affiliation_string":"[Willow Garage Inc. Menlo Park, CA, USA]","institution_ids":["https://openalex.org/I4210117999"]}]},{"author_position":"middle","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":["Dept. of Computer Science, Rice University, Houston, TX, USA","Dept. of Comput. Sci., Rice Univ., Houston, TX, USA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Computer Science, Rice University, Houston, TX, USA","institution_ids":["https://openalex.org/I74775410"]},{"raw_affiliation_string":"Dept. of Comput. Sci., Rice Univ., Houston, TX, USA#TAB#","institution_ids":["https://openalex.org/I74775410"]}]},{"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":["Dept. of Computer Science, Rice University, Houston, TX, USA","Dept. of Comput. Sci., Rice Univ., Houston, TX, USA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Computer Science, Rice University, Houston, TX, USA","institution_ids":["https://openalex.org/I74775410"]},{"raw_affiliation_string":"Dept. of Comput. Sci., Rice Univ., Houston, TX, USA#TAB#","institution_ids":["https://openalex.org/I74775410"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.1528,"has_fulltext":false,"cited_by_count":71,"citation_normalized_percentile":{"value":0.95741529,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":91,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"5068","last_page":"5074"},"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/T10571","display_name":"Robotic Mechanisms and Dynamics","score":0.9944999814033508,"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"}},{"id":"https://openalex.org/T10653","display_name":"Robot Manipulation and Learning","score":0.9900000095367432,"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.8280091285705566},{"id":"https://openalex.org/keywords/sampling","display_name":"Sampling (signal processing)","score":0.6115500926971436},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6092537641525269},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6090051531791687},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6007232666015625},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5744761228561401},{"id":"https://openalex.org/keywords/series","display_name":"Series (stratigraphy)","score":0.5020129680633545},{"id":"https://openalex.org/keywords/any-angle-path-planning","display_name":"Any-angle path planning","score":0.48749494552612305},{"id":"https://openalex.org/keywords/asymptotically-optimal-algorithm","display_name":"Asymptotically optimal algorithm","score":0.4760044515132904},{"id":"https://openalex.org/keywords/motion","display_name":"Motion (physics)","score":0.4683859646320343},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4593394994735718},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3052150011062622},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2123178243637085},{"id":"https://openalex.org/keywords/computer-vision","display_name":"Computer vision","score":0.18299460411071777},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.18298161029815674}],"concepts":[{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.8280091285705566},{"id":"https://openalex.org/C140779682","wikidata":"https://www.wikidata.org/wiki/Q210868","display_name":"Sampling (signal processing)","level":3,"score":0.6115500926971436},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6092537641525269},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6090051531791687},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6007232666015625},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5744761228561401},{"id":"https://openalex.org/C143724316","wikidata":"https://www.wikidata.org/wiki/Q312468","display_name":"Series (stratigraphy)","level":2,"score":0.5020129680633545},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.48749494552612305},{"id":"https://openalex.org/C181789720","wikidata":"https://www.wikidata.org/wiki/Q4812191","display_name":"Asymptotically optimal algorithm","level":2,"score":0.4760044515132904},{"id":"https://openalex.org/C104114177","wikidata":"https://www.wikidata.org/wiki/Q79782","display_name":"Motion (physics)","level":2,"score":0.4683859646320343},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4593394994735718},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3052150011062622},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2123178243637085},{"id":"https://openalex.org/C31972630","wikidata":"https://www.wikidata.org/wiki/Q844240","display_name":"Computer vision","level":1,"score":0.18299460411071777},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.18298161029815674},{"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/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C106131492","wikidata":"https://www.wikidata.org/wiki/Q3072260","display_name":"Filter (signal processing)","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/icra.2013.6631301","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra.2013.6631301","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"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.299.3713","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.299.3713","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/~mmoll/publications/luna2013anytime-solution-optimization.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.7799999713897705,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":39,"referenced_works":["https://openalex.org/W101508493","https://openalex.org/W326738931","https://openalex.org/W1424654272","https://openalex.org/W1510265196","https://openalex.org/W1515762908","https://openalex.org/W1519170695","https://openalex.org/W1521785144","https://openalex.org/W1536373029","https://openalex.org/W1847125952","https://openalex.org/W1971086298","https://openalex.org/W2000359213","https://openalex.org/W2002548850","https://openalex.org/W2056718993","https://openalex.org/W2068127265","https://openalex.org/W2096158814","https://openalex.org/W2099893201","https://openalex.org/W2100656238","https://openalex.org/W2110762409","https://openalex.org/W2115257338","https://openalex.org/W2127772657","https://openalex.org/W2128990851","https://openalex.org/W2141664020","https://openalex.org/W2142963440","https://openalex.org/W2143826757","https://openalex.org/W2144481803","https://openalex.org/W2147497140","https://openalex.org/W2161473822","https://openalex.org/W2165143557","https://openalex.org/W2165307897","https://openalex.org/W2167348159","https://openalex.org/W2171205311","https://openalex.org/W2171266831","https://openalex.org/W2296385533","https://openalex.org/W2611243847","https://openalex.org/W6611291617","https://openalex.org/W6630396903","https://openalex.org/W6631073399","https://openalex.org/W6632103127","https://openalex.org/W6664355621"],"related_works":["https://openalex.org/W2368795992","https://openalex.org/W4308080200","https://openalex.org/W2908094156","https://openalex.org/W2359600231","https://openalex.org/W2126380264","https://openalex.org/W2093343611","https://openalex.org/W1987886368","https://openalex.org/W1660309994","https://openalex.org/W2126635878","https://openalex.org/W2369187583"],"abstract_inverted_index":{"Recent":[0],"work":[1],"in":[2,16,131],"sampling-based":[3,76],"motion":[4,107],"planning":[5,77],"has":[6],"yielded":[7],"several":[8],"different":[9],"approaches":[10],"for":[11],"computing":[12],"good":[13],"quality":[14],"paths":[15],"high":[17],"degree":[18],"of":[19,44,103,126],"freedom":[20],"systems:":[21],"path":[22,32,38,63,81],"shortcutting":[23],"methods":[24,98,121],"that":[25,41,58,72],"attempt":[26],"to":[27,49,60,84,94],"shorten":[28],"a":[29,37,51,74,116],"single":[30],"solution":[31,92],"by":[33],"connecting":[34],"non-consecutive":[35],"configurations,":[36],"hybridization":[39],"technique":[40],"combines":[42],"portions":[43],"two":[45],"or":[46],"more":[47],"solutions":[48],"form":[50,85],"shorter":[52],"path,":[53],"and":[54,99,108],"asymptotically":[55,119],"optimal":[56,120],"algorithms":[57],"converge":[59],"the":[61,95,124,127],"shortest":[62],"over":[64],"time.":[65],"This":[66],"paper":[67],"presents":[68],"an":[69,86],"extensible":[70],"meta-algorithm":[71],"incorporates":[73],"traditional":[75],"algorithm":[78,88],"with":[79,118],"offline":[80],"shortening":[82],"techniques":[83],"anytime":[87],"which":[89,122],"exhibits":[90],"competitive":[91],"lengths":[93],"best":[96],"known":[97],"optimizers.":[100],"A":[101],"series":[102],"experiments":[104],"involving":[105],"rigid":[106],"complex":[109],"manipulation":[110],"are":[111],"performed":[112],"as":[113,115],"well":[114],"comparison":[117],"show":[123],"efficacy":[125],"proposed":[128],"scheme,":[129],"particularly":[130],"high-dimensional":[132],"spaces.":[133]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":7},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":10},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":8},{"year":2018,"cited_by_count":10},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":9},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":7},{"year":2013,"cited_by_count":2}],"updated_date":"2026-08-26T07:47:46.906454","created_date":"2025-10-10T00:00:00"}