{"id":"https://openalex.org/W1501654049","doi":"https://doi.org/10.1109/icra.2015.7139775","title":"Geometric probability results for bounding path quality in sampling-based roadmaps after finite computation","display_name":"Geometric probability results for bounding path quality in sampling-based roadmaps after finite computation","publication_year":2015,"publication_date":"2015-05-01","ids":{"openalex":"https://openalex.org/W1501654049","doi":"https://doi.org/10.1109/icra.2015.7139775","mag":"1501654049"},"language":"en","primary_location":{"id":"doi:10.1109/icra.2015.7139775","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra.2015.7139775","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE International Conference on Robotics and Automation (ICRA)","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/A5045652940","display_name":"Andrew Dobson","orcid":null},"institutions":[{"id":"https://openalex.org/I102322142","display_name":"Rutgers, The State University of New Jersey","ror":"https://ror.org/05vt9qd57","country_code":"US","type":"education","lineage":["https://openalex.org/I102322142"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Andrew Dobson","raw_affiliation_strings":["Computer Science, Rutgers University, NJ, USA"],"affiliations":[{"raw_affiliation_string":"Computer Science, Rutgers University, NJ, USA","institution_ids":["https://openalex.org/I102322142"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5056360019","display_name":"George V. Moustakides","orcid":"https://orcid.org/0000-0002-6498-5860"},"institutions":[{"id":"https://openalex.org/I174878644","display_name":"University of Patras","ror":"https://ror.org/017wvtq80","country_code":"GR","type":"education","lineage":["https://openalex.org/I174878644"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"George V. Moustakides","raw_affiliation_strings":["Electrical and Computer Engineering, University of Patras, Greece","[Electrical & Computer Engineering, University of Patras, Greece]"],"affiliations":[{"raw_affiliation_string":"Electrical and Computer Engineering, University of Patras, Greece","institution_ids":["https://openalex.org/I174878644"]},{"raw_affiliation_string":"[Electrical & Computer Engineering, University of Patras, Greece]","institution_ids":["https://openalex.org/I174878644"]}]},{"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/I102322142","display_name":"Rutgers, The State University of New Jersey","ror":"https://ror.org/05vt9qd57","country_code":"US","type":"education","lineage":["https://openalex.org/I102322142"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Kostas E. Bekris","raw_affiliation_strings":["Rutgers The State University of New Jersey, New Brunswick, NJ, US","Computer Science, Rutgers University, NJ, USA"],"affiliations":[{"raw_affiliation_string":"Rutgers The State University of New Jersey, New Brunswick, NJ, US","institution_ids":["https://openalex.org/I102322142"]},{"raw_affiliation_string":"Computer Science, Rutgers University, NJ, USA","institution_ids":["https://openalex.org/I102322142"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5045652940"],"corresponding_institution_ids":["https://openalex.org/I102322142"],"apc_list":null,"apc_paid":null,"fwci":2.2091,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":{"value":0.91559747,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"4180","last_page":"4186"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9995999932289124,"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.9995999932289124,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9965000152587891,"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"}},{"id":"https://openalex.org/T10191","display_name":"Robotics and Sensor-Based Localization","score":0.9839000105857849,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/bounding-overwatch","display_name":"Bounding overwatch","score":0.6989171504974365},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.6967004537582397},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.6098071336746216},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.601355791091919},{"id":"https://openalex.org/keywords/monte-carlo-method","display_name":"Monte Carlo method","score":0.5671133995056152},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.565379798412323},{"id":"https://openalex.org/keywords/completeness","display_name":"Completeness (order theory)","score":0.5611231923103333},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.5255228877067566},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.49752357602119446},{"id":"https://openalex.org/keywords/importance-sampling","display_name":"Importance sampling","score":0.4873086214065552},{"id":"https://openalex.org/keywords/rejection-sampling","display_name":"Rejection sampling","score":0.47751301527023315},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4720745086669922},{"id":"https://openalex.org/keywords/sampling","display_name":"Sampling (signal processing)","score":0.4573812186717987},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4289223849773407},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3935500383377075},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.35077401995658875},{"id":"https://openalex.org/keywords/hybrid-monte-carlo","display_name":"Hybrid Monte Carlo","score":0.1864687204360962},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1416766345500946},{"id":"https://openalex.org/keywords/markov-chain-monte-carlo","display_name":"Markov chain Monte Carlo","score":0.13816383481025696},{"id":"https://openalex.org/keywords/detector","display_name":"Detector","score":0.12203609943389893},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.10850661993026733},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.08094426989555359}],"concepts":[{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.6989171504974365},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.6967004537582397},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.6098071336746216},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.601355791091919},{"id":"https://openalex.org/C19499675","wikidata":"https://www.wikidata.org/wiki/Q232207","display_name":"Monte Carlo method","level":2,"score":0.5671133995056152},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.565379798412323},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.5611231923103333},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.5255228877067566},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.49752357602119446},{"id":"https://openalex.org/C52740198","wikidata":"https://www.wikidata.org/wiki/Q1539564","display_name":"Importance sampling","level":3,"score":0.4873086214065552},{"id":"https://openalex.org/C187192777","wikidata":"https://www.wikidata.org/wiki/Q381699","display_name":"Rejection sampling","level":5,"score":0.47751301527023315},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4720745086669922},{"id":"https://openalex.org/C140779682","wikidata":"https://www.wikidata.org/wiki/Q210868","display_name":"Sampling (signal processing)","level":3,"score":0.4573812186717987},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4289223849773407},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3935500383377075},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.35077401995658875},{"id":"https://openalex.org/C13153151","wikidata":"https://www.wikidata.org/wiki/Q1639846","display_name":"Hybrid Monte Carlo","level":4,"score":0.1864687204360962},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1416766345500946},{"id":"https://openalex.org/C111350023","wikidata":"https://www.wikidata.org/wiki/Q1191869","display_name":"Markov chain Monte Carlo","level":3,"score":0.13816383481025696},{"id":"https://openalex.org/C94915269","wikidata":"https://www.wikidata.org/wiki/Q1834857","display_name":"Detector","level":2,"score":0.12203609943389893},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.10850661993026733},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.08094426989555359},{"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/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"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/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/icra.2015.7139775","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra.2015.7139775","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE International Conference on Robotics and Automation (ICRA)","raw_type":"proceedings-article"},{"id":"pmh:oai:alma.01RUT_INST:11664800190004646","is_oa":false,"landing_page_url":"https://scholarship.libraries.rutgers.edu/esploro/outputs/conferenceProceeding/Geometric-probability-results-for-bounding-path/991031664390104646","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":"Conference Proceedings"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11","score":0.7400000095367432}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":39,"referenced_works":["https://openalex.org/W101508493","https://openalex.org/W196216913","https://openalex.org/W326738931","https://openalex.org/W966818798","https://openalex.org/W1424654272","https://openalex.org/W1495392417","https://openalex.org/W1516027685","https://openalex.org/W1521785144","https://openalex.org/W1585638810","https://openalex.org/W1605600765","https://openalex.org/W1971086298","https://openalex.org/W1986004895","https://openalex.org/W2000359213","https://openalex.org/W2004100691","https://openalex.org/W2036016432","https://openalex.org/W2041753526","https://openalex.org/W2058240764","https://openalex.org/W2096158814","https://openalex.org/W2096636360","https://openalex.org/W2108232656","https://openalex.org/W2114306020","https://openalex.org/W2128990851","https://openalex.org/W2404139562","https://openalex.org/W2516555774","https://openalex.org/W2570852788","https://openalex.org/W2611243847","https://openalex.org/W2951748345","https://openalex.org/W2988885761","https://openalex.org/W3115270213","https://openalex.org/W4236470048","https://openalex.org/W4242811155","https://openalex.org/W6608021196","https://openalex.org/W6611291617","https://openalex.org/W6629573421","https://openalex.org/W6630827198","https://openalex.org/W6676914488","https://openalex.org/W6713925415","https://openalex.org/W6726385526","https://openalex.org/W6770249431"],"related_works":["https://openalex.org/W2116791275","https://openalex.org/W1964820882","https://openalex.org/W2122865681","https://openalex.org/W2127967590","https://openalex.org/W2004707959","https://openalex.org/W4247477946","https://openalex.org/W1639032785","https://openalex.org/W2059147320","https://openalex.org/W2362249705","https://openalex.org/W2001848173"],"abstract_inverted_index":{"Sampling-based":[0],"algorithms":[1],"provide":[2,35],"efficient":[3],"solutions":[4],"to":[5,89],"high-dimensional,":[6],"geometrically":[7],"complex":[8],"motion":[9],"planning":[10],"problems.":[11],"For":[12],"these":[13,51],"methods":[14,33],"asymptotic":[15],"results":[16,86],"are":[17,87],"known":[18],"in":[19],"terms":[20],"of":[21,60,71],"completeness":[22],"and":[23,53,81,96,105],"optimality.":[24],"Previous":[25],"work":[26,49],"by":[27],"the":[28,58],"authors":[29],"argued":[30],"that":[31],"such":[32],"also":[34],"probabilistic":[36],"near-optimality":[37],"after":[38,67],"finite":[39,69],"computation":[40],"time":[41,104],"using":[42],"indications":[43],"from":[44],"Monte":[45],"Carlo":[46],"experiments.":[47],"This":[48,73],"formalizes":[50],"guarantees":[52],"provides":[54],"a":[55,62,68],"bound":[56,74],"on":[57],"probability":[59],"finding":[61],"near-optimal":[63,98],"solution":[64],"with":[65],"PRM*":[66,95],"number":[70],"iterations.":[72],"is":[75],"proven":[76],"for":[77,94],"general-dimension":[78],"Euclidean":[79],"spaces":[80],"evaluated":[82],"through":[83],"simulation.":[84],"These":[85],"leveraged":[88],"create":[90],"automated":[91],"stopping":[92],"criteria":[93],"sparser":[97],"roadmaps,":[99],"which":[100],"have":[101],"reduced":[102],"running":[103],"storage":[106],"requirements.":[107]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":8},{"year":2016,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}