{"id":"https://openalex.org/W2103465449","doi":"https://doi.org/10.1109/icra.2011.5979769","title":"Any-angle path planning on non-uniform costmaps","display_name":"Any-angle path planning on non-uniform costmaps","publication_year":2011,"publication_date":"2011-05-01","ids":{"openalex":"https://openalex.org/W2103465449","doi":"https://doi.org/10.1109/icra.2011.5979769","mag":"2103465449"},"language":"en","primary_location":{"id":"doi:10.1109/icra.2011.5979769","doi":"https://doi.org/10.1109/icra.2011.5979769","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra.2011.5979769","pdf_url":null,"source":{"id":"https://openalex.org/S4210217939","display_name":"Proceedings - IEEE International Conference on Robotics and Automation/Proceedings","issn_l":"1050-4729","issn":["1050-4729","2577-087X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","norway-1"],"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE International Conference on Robotics and Automation","raw_type":"proceedings-article"},"volume":null,"type":"conference-paper","is_traditional":true,"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/A5017906397","display_name":"Sunglok Choi","orcid":"https://orcid.org/0000-0002-1127-1346","observed_orcids":["https://orcid.org/0000-0002-1127-1346"]},"institutions":[{"id":"https://openalex.org/I142401562","display_name":"Electronics and Telecommunications Research Institute","ror":"https://ror.org/03ysstz10","country_code":"KR","type":"facility","lineage":["https://openalex.org/I142401562","https://openalex.org/I2801339556","https://openalex.org/I4210144908","https://openalex.org/I4387152098"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Sunglok Choi","raw_affiliation_strings":["Robot and Cognitive System Research Department, Electronics and Telecommunications ResearchInstitute (ETRI), Daejeon, South Korea","Robot and Cognitive System Research Department, Electronics and Telecommunications Research Institute (ETRI), Daejeon, Republic of Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Robot and Cognitive System Research Department, Electronics and Telecommunications ResearchInstitute (ETRI), Daejeon, South Korea","institution_ids":["https://openalex.org/I142401562"]},{"raw_affiliation_string":"Robot and Cognitive System Research Department, Electronics and Telecommunications Research Institute (ETRI), Daejeon, Republic of Korea","institution_ids":["https://openalex.org/I142401562"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5079005009","display_name":"Wonpil Yu","orcid":"https://orcid.org/0000-0001-5729-7931","observed_orcids":["https://orcid.org/0000-0001-5729-7931"]},"institutions":[{"id":"https://openalex.org/I142401562","display_name":"Electronics and Telecommunications Research Institute","ror":"https://ror.org/03ysstz10","country_code":"KR","type":"facility","lineage":["https://openalex.org/I142401562","https://openalex.org/I2801339556","https://openalex.org/I4210144908","https://openalex.org/I4387152098"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Wonpil Yu","raw_affiliation_strings":["Robot and Cognitive System Research Department, Electronics and Telecommunications ResearchInstitute (ETRI), Daejeon, South Korea","Robot and Cognitive System Research Department, Electronics and Telecommunications Research Institute (ETRI), Daejeon, Republic of Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Robot and Cognitive System Research Department, Electronics and Telecommunications ResearchInstitute (ETRI), Daejeon, South Korea","institution_ids":["https://openalex.org/I142401562"]},{"raw_affiliation_string":"Robot and Cognitive System Research Department, Electronics and Telecommunications Research Institute (ETRI), Daejeon, Republic of Korea","institution_ids":["https://openalex.org/I142401562"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I142401562"],"apc_list":null,"apc_paid":null,"fwci":2.6964,"has_fulltext":false,"cited_by_count":35,"citation_normalized_percentile":{"value":0.8876742,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"5615","last_page":"5621"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9994999766349792,"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"}},"topics":[{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9994999766349792,"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/T11574","display_name":"Artificial Intelligence in Games","score":0.0,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10462","display_name":"Reinforcement Learning in Robotics","score":0.0,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/theta-algorithm","display_name":"Theta* algorithm","score":0.7329999804496765},{"id":"https://openalex.org/keywords/grid-map","display_name":"grid map","score":0.8600000143051147},{"id":"https://openalex.org/keywords/least-cost-path","display_name":"least-cost path","score":0.7519999742507935},{"id":"https://openalex.org/keywords/a-algorithm","display_name":"A* algorithm","score":0.6700000166893005}],"concepts":[{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.7960290908813477},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.6831115484237671},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5750856399536133},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.560621976852417},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4918644428253174},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.47118687629699707},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.4591481387615204},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.43732523918151855},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.435011088848114},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.20939293503761292},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.15444111824035645},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icra.2011.5979769","doi":"https://doi.org/10.1109/icra.2011.5979769","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra.2011.5979769","pdf_url":null,"source":{"id":"https://openalex.org/S4210217939","display_name":"Proceedings - IEEE International Conference on Robotics and Automation/Proceedings","issn_l":"1050-4729","issn":["1050-4729","2577-087X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","norway-1"],"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE International Conference on Robotics and Automation","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W213027254","https://openalex.org/W432920974","https://openalex.org/W1424654272","https://openalex.org/W1562669166","https://openalex.org/W1935926926","https://openalex.org/W1996183429","https://openalex.org/W2003708116","https://openalex.org/W2048523841","https://openalex.org/W2101730182","https://openalex.org/W2107556309","https://openalex.org/W2130957631","https://openalex.org/W2135835974","https://openalex.org/W2161754147","https://openalex.org/W2166357673","https://openalex.org/W2295752869","https://openalex.org/W2611243847","https://openalex.org/W3147363384"],"related_works":["https://openalex.org/W1935926926","https://openalex.org/W4288047784","https://openalex.org/W7147293239","https://openalex.org/W7164924070","https://openalex.org/W2101730182","https://openalex.org/W2293312031","https://openalex.org/W2501990424","https://openalex.org/W7098092268","https://openalex.org/W2062766082","https://openalex.org/W2368707075"],"abstract_inverted_index":{"A*":[0,166],"on":[1,39,46,103,122,141,167],"grid":[2,40],"maps":[3,124,143],"generates":[4],"a":[5],"path":[6,159],"with":[7,149,161],"zig-zag":[8],"pattern,":[9],"but":[10,30],"Theta*":[11,20,42,54,148,155,164],"is":[12,28],"known":[13],"to":[14,36,86,111],"be":[15],"free":[16],"from":[17],"this":[18,50],"disadvantage.":[19],"assumes":[21],"that":[22,81],"cost":[23,66],"of":[24,65,114,127,133,147],"each":[25,104],"cell,":[26],"cell-cost,":[27],"uniform,":[29],"non-uniform":[31,47,56,69,168],"costs":[32],"are":[33],"effective":[34],"ways":[35],"represent":[37],"traversability":[38],"maps.":[41,119],"does":[43],"not":[44],"work":[45],"costmaps.":[48,57,169],"In":[49],"paper,":[51],"we":[52,61],"generalize":[53],"toward":[55],"To":[58],"extend":[59],"Theta*,":[60],"propose":[62],"two":[63,112,129],"kinds":[64],"functions":[67],"considering":[68,98],"cell-costs.":[70],"The":[71,90,138,153],"first":[72],"function":[73,92],"adopts":[74],"the":[75,79,87,94,99,108,128,145,150,157,162],"arithmetic":[76],"mean":[77,96],"under":[78],"assumption":[80],"all":[82],"cells":[83],"contribute":[84],"equally":[85],"overall":[88],"cost.":[89],"second":[91],"uses":[93],"weighted":[95],"by":[97],"true":[100],"traversal":[101],"length":[102],"cell.":[105],"We":[106],"applied":[107],"proposed":[109,151],"methods":[110,130],"types":[113],"maps:":[115],"synthetic":[116,123],"and":[117,135,165],"real":[118,142],"An":[120],"experiment":[121,140],"quantifies":[125],"performance":[126],"in":[131],"terms":[132],"accuracy":[134],"computing":[136],"time.":[137],"other":[139],"presents":[144],"effectiveness":[146],"methods.":[152],"generalized":[154],"generated":[156],"least-cost":[158],"compared":[160],"original":[163]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":3},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":3}],"updated_date":"2026-11-07T11:25:07.637180","created_date":"2016-06-24T00:00:00"}