{"id":"https://openalex.org/W3003509823","doi":"https://doi.org/10.1109/iros40897.2019.8967728","title":"Volumetric Tree<sup>*</sup>: Adaptive Sparse Graph for Effective Exploration of Homotopy Classes","display_name":"Volumetric Tree<sup>*</sup>: Adaptive Sparse Graph for Effective Exploration of Homotopy Classes","publication_year":2019,"publication_date":"2019-11-01","ids":{"openalex":"https://openalex.org/W3003509823","doi":"https://doi.org/10.1109/iros40897.2019.8967728","mag":"3003509823"},"language":"en","primary_location":{"id":"doi:10.1109/iros40897.2019.8967728","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iros40897.2019.8967728","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)","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/A5100682314","display_name":"Donghyuk Kim","orcid":"https://orcid.org/0000-0003-1381-3943"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Donghyuk Kim","raw_affiliation_strings":["School of Computing"],"affiliations":[{"raw_affiliation_string":"School of Computing","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5011569987","display_name":"Mincheul Kang","orcid":"https://orcid.org/0000-0002-3003-0089"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mincheul Kang","raw_affiliation_strings":["School of Computing"],"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":["Institute of Science and Technology (KAIST) at Daejeon,Faculty of School of Computing,South Korea,34141"],"affiliations":[{"raw_affiliation_string":"Institute of Science and Technology (KAIST) at Daejeon,Faculty of School of Computing,South Korea,34141","institution_ids":["https://openalex.org/I157485424"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5100682314"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.4049,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.66885503,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"19","issue":null,"first_page":"1496","last_page":"1503"},"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.980400025844574,"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.9717000126838684,"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/motion-planning","display_name":"Motion planning","score":0.6246540546417236},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5767726898193359},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5669066309928894},{"id":"https://openalex.org/keywords/sampling","display_name":"Sampling (signal processing)","score":0.5599561333656311},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5598747730255127},{"id":"https://openalex.org/keywords/homotopy","display_name":"Homotopy","score":0.4917466938495636},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.4798662066459656},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.45276322960853577},{"id":"https://openalex.org/keywords/adaptive-sampling","display_name":"Adaptive sampling","score":0.4292723536491394},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37435615062713623},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.35695964097976685},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3372887969017029},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3095978796482086},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2776009142398834},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.25886061787605286},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2119920253753662},{"id":"https://openalex.org/keywords/detector","display_name":"Detector","score":0.17808985710144043},{"id":"https://openalex.org/keywords/monte-carlo-method","display_name":"Monte Carlo method","score":0.12482994794845581},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.08409616351127625}],"concepts":[{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.6246540546417236},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5767726898193359},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5669066309928894},{"id":"https://openalex.org/C140779682","wikidata":"https://www.wikidata.org/wiki/Q210868","display_name":"Sampling (signal processing)","level":3,"score":0.5599561333656311},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5598747730255127},{"id":"https://openalex.org/C5961521","wikidata":"https://www.wikidata.org/wiki/Q746083","display_name":"Homotopy","level":2,"score":0.4917466938495636},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.4798662066459656},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.45276322960853577},{"id":"https://openalex.org/C2781395549","wikidata":"https://www.wikidata.org/wiki/Q4680762","display_name":"Adaptive sampling","level":3,"score":0.4292723536491394},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37435615062713623},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.35695964097976685},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3372887969017029},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3095978796482086},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2776009142398834},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.25886061787605286},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2119920253753662},{"id":"https://openalex.org/C94915269","wikidata":"https://www.wikidata.org/wiki/Q1834857","display_name":"Detector","level":2,"score":0.17808985710144043},{"id":"https://openalex.org/C19499675","wikidata":"https://www.wikidata.org/wiki/Q232207","display_name":"Monte Carlo method","level":2,"score":0.12482994794845581},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.08409616351127625},{"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/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iros40897.2019.8967728","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iros40897.2019.8967728","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5199999809265137,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W61873113","https://openalex.org/W145388748","https://openalex.org/W1485487406","https://openalex.org/W1554174647","https://openalex.org/W1643513940","https://openalex.org/W1814533834","https://openalex.org/W1971086298","https://openalex.org/W1976930960","https://openalex.org/W2011282943","https://openalex.org/W2019965290","https://openalex.org/W2082511574","https://openalex.org/W2087989168","https://openalex.org/W2110762409","https://openalex.org/W2128990851","https://openalex.org/W2141664020","https://openalex.org/W2152536965","https://openalex.org/W2161819990","https://openalex.org/W2293883387","https://openalex.org/W2338687951","https://openalex.org/W2416313483","https://openalex.org/W2518144990","https://openalex.org/W2892184971","https://openalex.org/W2911979099","https://openalex.org/W2989967279","https://openalex.org/W3003596479","https://openalex.org/W3030788629","https://openalex.org/W3102121895","https://openalex.org/W3103346840","https://openalex.org/W6632963374","https://openalex.org/W6636841669","https://openalex.org/W6726401292","https://openalex.org/W6770366356"],"related_works":["https://openalex.org/W2494523064","https://openalex.org/W2943623134","https://openalex.org/W2588219639","https://openalex.org/W2215759665","https://openalex.org/W2030292806","https://openalex.org/W2960358116","https://openalex.org/W4287727129","https://openalex.org/W3041172967","https://openalex.org/W2118356379","https://openalex.org/W4312721425"],"abstract_inverted_index":{"We":[0,73,96],"present":[1],"volumetric":[2,27],"tree":[3,17],"<sup":[4,18],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[5,19],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">*</sup>":[6,20],",":[7],"a":[8,34,39,76],"hybridization":[9],"of":[10,63,88,93,119],"sampling-based":[11,35],"and":[12,108,114],"optimization-based":[13,53],"motion":[14,36],"planning.":[15],"Volumetric":[16],"constructs":[21],"an":[22],"adaptive":[23],"sparse":[24,48],"graph":[25,49],"with":[26,111],"vertices,":[28],"hyper-spheres":[29],"encoding":[30],"free":[31],"configurations,":[32],"using":[33],"planner":[37,85],"for":[38,68],"homotopy":[40],"exploration.":[41],"The":[42],"coarse-grained":[43],"paths":[44],"computed":[45],"on":[46],"the":[47,56,60,64,69,82,98,102,117,120],"are":[50],"refined":[51],"by":[52],"planning":[54,67],"during":[55],"execution,":[57],"while":[58],"exploiting":[59],"probabilistic":[61],"completeness":[62],"sampling-":[65,83],"based":[66,84],"initial":[70],"path":[71],"generation.":[72],"also":[74],"suggest":[75],"dropout":[77],"technique":[78],"probabilistically":[79],"ensuring":[80],"that":[81],"is":[86],"capable":[87],"identifying":[89],"all":[90],"possible":[91],"homotopies":[92],"solution":[94],"paths.":[95],"compare":[97],"proposed":[99,121],"algorithm":[100],"against":[101],"state-of-the-art":[103],"planners":[104],"in":[105],"both":[106],"synthetic":[107],"practical":[109],"benchmarks":[110],"varying":[112],"dimensions,":[113],"experimentally":[115],"show":[116],"benefit":[118],"algorithm.":[122]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}