{"id":"https://openalex.org/W2516555774","doi":"https://doi.org/10.1007/978-3-319-29363-9_24","title":"Asymptotically Near-Optimal Is Good Enough for Motion Planning","display_name":"Asymptotically Near-Optimal Is Good Enough for Motion Planning","publication_year":2016,"publication_date":"2016-08-25","ids":{"openalex":"https://openalex.org/W2516555774","doi":"https://doi.org/10.1007/978-3-319-29363-9_24","mag":"2516555774"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-319-29363-9_24","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-29363-9_24","pdf_url":null,"source":{"id":"https://openalex.org/S4210185684","display_name":"Springer tracts in advanced robotics","issn_l":"1610-742X","issn":["1610-742X","1610-7438"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319965","host_organization_name":"Springer Nature","host_organization_lineage":["https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Springer Tracts in Advanced Robotics","raw_type":"book-chapter"},"type":"book-chapter","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/A5084488493","display_name":"James D. Marble","orcid":"https://orcid.org/0009-0006-3870-2771"},"institutions":[{"id":"https://openalex.org/I134113660","display_name":"University of Nevada, Reno","ror":"https://ror.org/01keh0577","country_code":"US","type":"education","lineage":["https://openalex.org/I134113660"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"James D. Marble","raw_affiliation_strings":["Computer Science and Engineering Department, University of Nevada, 1664 N. Virginia St., MS 171, Reno, NV, 89557, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science and Engineering Department, University of Nevada, 1664 N. Virginia St., MS 171, Reno, NV, 89557, USA","institution_ids":["https://openalex.org/I134113660"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5010667333","display_name":"Kostas E. Bekris","orcid":"https://orcid.org/0000-0002-0675-3324"},"institutions":[{"id":"https://openalex.org/I134113660","display_name":"University of Nevada, Reno","ror":"https://ror.org/01keh0577","country_code":"US","type":"education","lineage":["https://openalex.org/I134113660"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Kostas E. Bekris","raw_affiliation_strings":["Computer Science and Engineering Department, University of Nevada, 1664 N. Virginia St., MS 171, Reno, NV, 89557, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science and Engineering Department, University of Nevada, 1664 N. Virginia St., MS 171, Reno, NV, 89557, USA","institution_ids":["https://openalex.org/I134113660"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I134113660"],"apc_list":null,"apc_paid":null,"fwci":1.7937,"has_fulltext":false,"cited_by_count":44,"citation_normalized_percentile":{"value":0.93737052,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"419","last_page":"436"},"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.9937999844551086,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9933000206947327,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/asymptotically-optimal-algorithm","display_name":"Asymptotically optimal algorithm","score":0.9316433072090149},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6282617449760437},{"id":"https://openalex.org/keywords/smoothing","display_name":"Smoothing","score":0.5831560492515564},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.544257640838623},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.5171312689781189},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4571819305419922},{"id":"https://openalex.org/keywords/graph-theory","display_name":"Graph theory","score":0.43491125106811523},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4242130517959595},{"id":"https://openalex.org/keywords/motion","display_name":"Motion (physics)","score":0.4174618721008301},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4045582115650177},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.34368863701820374},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2009274959564209},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1448434293270111},{"id":"https://openalex.org/keywords/computer-vision","display_name":"Computer vision","score":0.11094078421592712}],"concepts":[{"id":"https://openalex.org/C181789720","wikidata":"https://www.wikidata.org/wiki/Q4812191","display_name":"Asymptotically optimal algorithm","level":2,"score":0.9316433072090149},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6282617449760437},{"id":"https://openalex.org/C3770464","wikidata":"https://www.wikidata.org/wiki/Q775963","display_name":"Smoothing","level":2,"score":0.5831560492515564},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.544257640838623},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.5171312689781189},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4571819305419922},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.43491125106811523},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4242130517959595},{"id":"https://openalex.org/C104114177","wikidata":"https://www.wikidata.org/wiki/Q79782","display_name":"Motion (physics)","level":2,"score":0.4174618721008301},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4045582115650177},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.34368863701820374},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2009274959564209},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1448434293270111},{"id":"https://openalex.org/C31972630","wikidata":"https://www.wikidata.org/wiki/Q844240","display_name":"Computer vision","level":1,"score":0.11094078421592712},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.0},{"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/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-3-319-29363-9_24","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-29363-9_24","pdf_url":null,"source":{"id":"https://openalex.org/S4210185684","display_name":"Springer tracts in advanced robotics","issn_l":"1610-742X","issn":["1610-742X","1610-7438"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319965","host_organization_name":"Springer Nature","host_organization_lineage":["https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Springer Tracts in Advanced Robotics","raw_type":"book-chapter"},{"id":"pmh:oai:alma.01RUT_INST:11664810440004646","is_oa":false,"landing_page_url":"https://scholarship.libraries.rutgers.edu/esploro/outputs/bookChapter/Asymptotically-Near-Optimal-Is-Good-Enough-for/991031664320404646","pdf_url":null,"source":{"id":"https://openalex.org/S4210197018","display_name":"View","issn_l":"2688-268X","issn":["2688-268X","2688-3988"],"is_oa":false,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Book Section"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","score":0.7599999904632568,"display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":38,"referenced_works":["https://openalex.org/W157296195","https://openalex.org/W1495392417","https://openalex.org/W1510265196","https://openalex.org/W1515762908","https://openalex.org/W1536373029","https://openalex.org/W1585638810","https://openalex.org/W1597188505","https://openalex.org/W1937845308","https://openalex.org/W1969080501","https://openalex.org/W1971086298","https://openalex.org/W2000359213","https://openalex.org/W2002041206","https://openalex.org/W2036016432","https://openalex.org/W2085512211","https://openalex.org/W2096158814","https://openalex.org/W2097737334","https://openalex.org/W2105248582","https://openalex.org/W2110762409","https://openalex.org/W2112271657","https://openalex.org/W2112388515","https://openalex.org/W2127772657","https://openalex.org/W2128990851","https://openalex.org/W2142963440","https://openalex.org/W2144481803","https://openalex.org/W2150500908","https://openalex.org/W2159722616","https://openalex.org/W2161473822","https://openalex.org/W2163788280","https://openalex.org/W2165307897","https://openalex.org/W2167366051","https://openalex.org/W2208163925","https://openalex.org/W2294643298","https://openalex.org/W2296385533","https://openalex.org/W3006111093","https://openalex.org/W4231761369","https://openalex.org/W4245082111","https://openalex.org/W6603063904","https://openalex.org/W6611116936"],"related_works":["https://openalex.org/W2359600231","https://openalex.org/W3216757130","https://openalex.org/W2380019117","https://openalex.org/W2093343611","https://openalex.org/W1987886368","https://openalex.org/W1660309994","https://openalex.org/W2369187583","https://openalex.org/W3154539612","https://openalex.org/W4211055164","https://openalex.org/W2288650507"],"abstract_inverted_index":null,"counts_by_year":[{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":7},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":9},{"year":2012,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}