{"id":"https://openalex.org/W2892184971","doi":"https://doi.org/10.1109/icra.2018.8463181","title":"Dancing PRM*: Simultaneous Planning of Sampling and Optimization with Configuration Free Space Approximation","display_name":"Dancing PRM*: Simultaneous Planning of Sampling and Optimization with Configuration Free Space Approximation","publication_year":2018,"publication_date":"2018-05-01","ids":{"openalex":"https://openalex.org/W2892184971","doi":"https://doi.org/10.1109/icra.2018.8463181","mag":"2892184971"},"language":"en","primary_location":{"id":"doi:10.1109/icra.2018.8463181","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra.2018.8463181","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 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/A5100682312","display_name":"Donghyuk Kim","orcid":"https://orcid.org/0000-0002-4979-7255"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Donghyuk Kim","raw_affiliation_strings":["School of Computing"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computing","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5012606974","display_name":"Youngsun Kwon","orcid":"https://orcid.org/0000-0003-2438-1349"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Youngsun Kwon","raw_affiliation_strings":["School of Computing"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computing","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5078173428","display_name":"Sung\u2010Eui Yoon","orcid":"https://orcid.org/0000-0002-7123-1119"},"institutions":[{"id":"https://openalex.org/I157485424","display_name":"Korea Advanced Institute of Science and Technology","ror":"https://ror.org/05apxxy63","country_code":"KR","type":"education","lineage":["https://openalex.org/I157485424"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Sung-Eui Yoon","raw_affiliation_strings":["Korea Advanced Institute of Science and Technology (KAIST), Faculty of School of Computing, Daejeon, 34141, South Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Korea Advanced Institute of Science and Technology (KAIST), Faculty of School of Computing, Daejeon, 34141, South Korea","institution_ids":["https://openalex.org/I157485424"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.954,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.81251448,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"7071","last_page":"7078"},"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.9980999827384949,"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/T11714","display_name":"Multimodal Machine Learning Applications","score":0.9886999726295471,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7371259927749634},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.6499955058097839},{"id":"https://openalex.org/keywords/grid","display_name":"Grid","score":0.5744220614433289},{"id":"https://openalex.org/keywords/configuration-space","display_name":"Configuration space","score":0.5617417097091675},{"id":"https://openalex.org/keywords/a-priori-and-a-posteriori","display_name":"A priori and a posteriori","score":0.555392861366272},{"id":"https://openalex.org/keywords/any-angle-path-planning","display_name":"Any-angle path planning","score":0.47246432304382324},{"id":"https://openalex.org/keywords/novelty","display_name":"Novelty","score":0.47074422240257263},{"id":"https://openalex.org/keywords/sampling","display_name":"Sampling (signal processing)","score":0.4478316903114319},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4393244683742523},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.4361228942871094},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.42721420526504517},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3485305905342102},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3326653838157654},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2929088771343231},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.20762625336647034},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.16372781991958618},{"id":"https://openalex.org/keywords/detector","display_name":"Detector","score":0.1321013867855072}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7371259927749634},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.6499955058097839},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.5744220614433289},{"id":"https://openalex.org/C90738871","wikidata":"https://www.wikidata.org/wiki/Q41642869","display_name":"Configuration space","level":2,"score":0.5617417097091675},{"id":"https://openalex.org/C75553542","wikidata":"https://www.wikidata.org/wiki/Q178161","display_name":"A priori and a posteriori","level":2,"score":0.555392861366272},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.47246432304382324},{"id":"https://openalex.org/C2778738651","wikidata":"https://www.wikidata.org/wiki/Q16546687","display_name":"Novelty","level":2,"score":0.47074422240257263},{"id":"https://openalex.org/C140779682","wikidata":"https://www.wikidata.org/wiki/Q210868","display_name":"Sampling (signal processing)","level":3,"score":0.4478316903114319},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4393244683742523},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.4361228942871094},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.42721420526504517},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3485305905342102},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3326653838157654},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2929088771343231},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.20762625336647034},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.16372781991958618},{"id":"https://openalex.org/C94915269","wikidata":"https://www.wikidata.org/wiki/Q1834857","display_name":"Detector","level":2,"score":0.1321013867855072},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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},{"id":"https://openalex.org/C27206212","wikidata":"https://www.wikidata.org/wiki/Q34178","display_name":"Theology","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icra.2018.8463181","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra.2018.8463181","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE International Conference on Robotics and Automation (ICRA)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":35,"referenced_works":["https://openalex.org/W61873113","https://openalex.org/W121974122","https://openalex.org/W131069610","https://openalex.org/W181534116","https://openalex.org/W1485487406","https://openalex.org/W1643513940","https://openalex.org/W1814533834","https://openalex.org/W1971086298","https://openalex.org/W2019965290","https://openalex.org/W2028655446","https://openalex.org/W2049561732","https://openalex.org/W2082511574","https://openalex.org/W2083417417","https://openalex.org/W2099893201","https://openalex.org/W2110762409","https://openalex.org/W2112271657","https://openalex.org/W2114628632","https://openalex.org/W2124543852","https://openalex.org/W2128990851","https://openalex.org/W2161819990","https://openalex.org/W2346637437","https://openalex.org/W2416313483","https://openalex.org/W2518144990","https://openalex.org/W2570852788","https://openalex.org/W3103346840","https://openalex.org/W6605001227","https://openalex.org/W6607425462","https://openalex.org/W6628950298","https://openalex.org/W6657538410","https://openalex.org/W6662929172","https://openalex.org/W6671358485","https://openalex.org/W6677229498","https://openalex.org/W6678452799","https://openalex.org/W6705242270","https://openalex.org/W6726401292"],"related_works":["https://openalex.org/W2368795992","https://openalex.org/W2005695917","https://openalex.org/W4308080200","https://openalex.org/W2908094156","https://openalex.org/W2389896347","https://openalex.org/W2106119116","https://openalex.org/W2333571655","https://openalex.org/W2104320275","https://openalex.org/W4367628293","https://openalex.org/W2268712943"],"abstract_inverted_index":{"A":[0],"recent":[1],"trend":[2],"in":[3,159],"optimal":[4,157],"motion":[5,51],"planning":[6,52],"has":[7],"broadened":[8],"the":[9,13,71,94,101,105,108,115,118,126,131,140,146,173],"research":[10],"area":[11,128],"toward":[12],"hybridization":[14],"of":[15,117,133,148,168],"sampling,":[16],"optimization":[17],"and":[18,37,57,103,162,177],"grid-based":[19],"approaches.":[20],"We":[21,170],"can":[22],"expect":[23],"that":[24],"synergy":[25],"from":[26],"such":[27],"integrations":[28],"leads":[29],"to":[30,129],"overall":[31],"performance":[32,174],"improvement,":[33,175],"but":[34],"seamless":[35],"integration":[36],"generalization":[38],"is":[39],"still":[40],"an":[41],"open":[42],"problem.":[43],"In":[44],"this":[45],"paper,":[46],"we":[47,151,179],"suggest":[48],"a":[49,55,63,78,85],"hybrid":[50],"algorithm":[53,73],"utilizing":[54],"sampling-based":[56],"optimization-based":[58,69,122],"planner":[59,124],"while":[60],"simultaneously":[61],"approximating":[62],"configuration":[64,134],"free":[65,135],"space.":[66],"Unlike":[67],"conventional":[68],"approaches,":[70],"proposed":[72,149],"does":[74],"not":[75],"depend":[76],"on":[77,93,139],"priori":[79],"information":[80,92,99,106],"or":[81],"resolution-complete":[82],"factors,":[83],"e.g.,":[84],"distance":[86],"field.":[87],"Ours":[88],"instead":[89],"learns":[90],"spatial":[91],"fly":[95],"by":[96],"exploiting":[97],"empirical":[98],"during":[100],"execution,":[102],"decentralizes":[104],"over":[107],"constructed":[109],"graph":[110],"for":[111],"efficient":[112],"access.":[113],"With":[114],"help":[116],"learned":[119],"information,":[120],"our":[121],"local":[123,127],"exploits":[125],"identify":[130],"connectivity":[132],"space":[136],"without":[137],"depending":[138],"precomputed":[141],"domain":[142],"knowledge.":[143],"To":[144],"show":[145],"novelty":[147],"algorithm,":[150],"evaluate":[152],"it":[153],"against":[154],"other":[155],"asymptotic":[156],"planners":[158],"both":[160],"synthetic":[161],"complex":[163],"benchmarks":[164],"with":[165],"varying":[166],"degrees":[167],"freedom.":[169],"also":[171],"discuss":[172],"properties":[176],"limitations":[178],"have":[180],"observed.":[181]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":4}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}