{"id":"https://openalex.org/W2742437670","doi":"https://doi.org/10.1109/urai.2017.7992715","title":"Path planning using flexible region sampling for arbitrarily-shaped obstacles","display_name":"Path planning using flexible region sampling for arbitrarily-shaped obstacles","publication_year":2017,"publication_date":"2017-06-01","ids":{"openalex":"https://openalex.org/W2742437670","doi":"https://doi.org/10.1109/urai.2017.7992715","mag":"2742437670"},"language":"en","primary_location":{"id":"doi:10.1109/urai.2017.7992715","is_oa":false,"landing_page_url":"https://doi.org/10.1109/urai.2017.7992715","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 14th International Conference on Ubiquitous Robots and Ambient Intelligence (URAI)","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/A5008025570","display_name":"Yeong Sang Park","orcid":"https://orcid.org/0000-0003-2951-0373"},"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":true,"raw_author_name":"Yeong Sang Park","raw_affiliation_strings":["Department of Civil and Environmental Engineering, KAIST, Republic of Korea"],"affiliations":[{"raw_affiliation_string":"Department of Civil and Environmental Engineering, KAIST, Republic of Korea","institution_ids":["https://openalex.org/I157485424"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100740100","display_name":"Ayoung Kim","orcid":"https://orcid.org/0000-0001-9829-2408"},"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":"Ayoung Kim","raw_affiliation_strings":["Department of Civil and Environmental Engineering, KAIST, Republic of Korea"],"affiliations":[{"raw_affiliation_string":"Department of Civil and Environmental Engineering, KAIST, Republic of Korea","institution_ids":["https://openalex.org/I157485424"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5051193326","display_name":"Young Sam Lee","orcid":null},"institutions":[{"id":"https://openalex.org/I191879574","display_name":"Inha University","ror":"https://ror.org/01easw929","country_code":"KR","type":"education","lineage":["https://openalex.org/I191879574"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Young Sam Lee","raw_affiliation_strings":["Department of Electrical Engineering, Inha University, Republic of Korea"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, Inha University, Republic of Korea","institution_ids":["https://openalex.org/I191879574"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5008025570"],"corresponding_institution_ids":["https://openalex.org/I157485424"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.10021867,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"5","issue":null,"first_page":"210","last_page":"215"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9998000264167786,"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.9998000264167786,"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.9871000051498413,"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/T11106","display_name":"Data Management and Algorithms","score":0.9800000190734863,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/tree-traversal","display_name":"Tree traversal","score":0.8786138296127319},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.7808213233947754},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7394830584526062},{"id":"https://openalex.org/keywords/obstacle","display_name":"Obstacle","score":0.7133699655532837},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.648219108581543},{"id":"https://openalex.org/keywords/grid","display_name":"Grid","score":0.6346085071563721},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.5961068868637085},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5175265669822693},{"id":"https://openalex.org/keywords/grid-method-multiplication","display_name":"Grid method multiplication","score":0.4806765019893646},{"id":"https://openalex.org/keywords/sampling","display_name":"Sampling (signal processing)","score":0.47485804557800293},{"id":"https://openalex.org/keywords/any-angle-path-planning","display_name":"Any-angle path planning","score":0.472806841135025},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.46184295415878296},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.29312974214553833},{"id":"https://openalex.org/keywords/computer-vision","display_name":"Computer vision","score":0.1859760582447052},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.17629021406173706},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.13753506541252136},{"id":"https://openalex.org/keywords/geography","display_name":"Geography","score":0.07409533858299255}],"concepts":[{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.8786138296127319},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.7808213233947754},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7394830584526062},{"id":"https://openalex.org/C2776650193","wikidata":"https://www.wikidata.org/wiki/Q264661","display_name":"Obstacle","level":2,"score":0.7133699655532837},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.648219108581543},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.6346085071563721},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.5961068868637085},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5175265669822693},{"id":"https://openalex.org/C91370436","wikidata":"https://www.wikidata.org/wiki/Q5608616","display_name":"Grid method multiplication","level":3,"score":0.4806765019893646},{"id":"https://openalex.org/C140779682","wikidata":"https://www.wikidata.org/wiki/Q210868","display_name":"Sampling (signal processing)","level":3,"score":0.47485804557800293},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.472806841135025},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.46184295415878296},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.29312974214553833},{"id":"https://openalex.org/C31972630","wikidata":"https://www.wikidata.org/wiki/Q844240","display_name":"Computer vision","level":1,"score":0.1859760582447052},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.17629021406173706},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.13753506541252136},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.07409533858299255},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"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},{"id":"https://openalex.org/C166957645","wikidata":"https://www.wikidata.org/wiki/Q23498","display_name":"Archaeology","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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/urai.2017.7992715","is_oa":false,"landing_page_url":"https://doi.org/10.1109/urai.2017.7992715","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 14th International Conference on Ubiquitous Robots and Ambient Intelligence (URAI)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6499999761581421,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320321681","display_name":"Ministry of Trade, Industry and Energy","ror":"https://ror.org/008nkqk13"},{"id":"https://openalex.org/F4320326258","display_name":"Korea Electric Power Corporation","ror":"https://ror.org/04fperw70"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W140238390","https://openalex.org/W1496982712","https://openalex.org/W1573854618","https://openalex.org/W1969483458","https://openalex.org/W2052258220","https://openalex.org/W2134560790","https://openalex.org/W2143776582","https://openalex.org/W2159000142","https://openalex.org/W2165036656","https://openalex.org/W6605705772","https://openalex.org/W6634169345","https://openalex.org/W6681031197"],"related_works":["https://openalex.org/W2007857089","https://openalex.org/W2084091668","https://openalex.org/W2125569607","https://openalex.org/W4313270149","https://openalex.org/W2041862797","https://openalex.org/W2006137058","https://openalex.org/W2363708335","https://openalex.org/W248608892","https://openalex.org/W3208126522","https://openalex.org/W4383333717"],"abstract_inverted_index":{"In":[0],"this":[1,19],"paper,":[2],"we":[3,21,84],"propose":[4,22],"a":[5,23,28,63,67,96],"path":[6,89,98],"planning":[7,90],"algorithm":[8],"targeting":[9],"an":[10],"environment":[11],"with":[12,66],"complex":[13],"and":[14,44,104],"arbitrarily-shaped":[15],"obstacles.":[16],"To":[17],"tackle":[18],"issue,":[20],"method":[24,39],"that":[25,86],"adaptively":[26],"divides":[27],"free":[29],"region":[30],"into":[31],"smaller":[32],"regions":[33,49,61],"of":[34,50,57,70,94],"various":[35],"sizes.":[36],"The":[37],"proposed":[38,88],"uses":[40],"recursive":[41],"tree":[42],"traversal":[43],"k-means":[45],"clustering":[46],"to":[47,54,108],"create":[48],"diverse":[51],"sizes":[52],"according":[53],"the":[55,58,73,78,87,109],"distance":[56],"obstacle.":[59],"Divided":[60],"represent":[62],"large":[64],"area":[65],"small":[68],"number":[69],"points,":[71],"unlike":[72],"grid":[74],"map":[75],"used":[76],"in":[77],"conventional":[79],"methods.":[80,111],"Via":[81],"two":[82],"simulations,":[83],"validate":[85],"approach":[91],"is":[92],"capable":[93],"finding":[95],"feasible":[97],"while":[99],"substantially":[100],"improving":[101],"computational":[102],"time":[103],"memory":[105],"consumption":[106],"compare":[107],"existing":[110]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}