{"id":"https://openalex.org/W1995929346","doi":"https://doi.org/10.1109/icra.2012.6224664","title":"3D time-space path planning algorithm in dynamic environment utilizing Arrival Time Field and Heuristically Randomized Tree","display_name":"3D time-space path planning algorithm in dynamic environment utilizing Arrival Time Field and Heuristically Randomized Tree","publication_year":2012,"publication_date":"2012-05-01","ids":{"openalex":"https://openalex.org/W1995929346","doi":"https://doi.org/10.1109/icra.2012.6224664","mag":"1995929346"},"language":"en","primary_location":{"id":"doi:10.1109/icra.2012.6224664","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra.2012.6224664","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE International Conference on Robotics and Automation","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/A5018898701","display_name":"Igi Ardiyanto","orcid":"https://orcid.org/0000-0002-0006-1458"},"institutions":[{"id":"https://openalex.org/I136259955","display_name":"Toyohashi University of Technology","ror":"https://ror.org/04ezg6d83","country_code":"JP","type":"education","lineage":["https://openalex.org/I136259955"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Igi Ardiyanto","raw_affiliation_strings":["Department of Computer Science and Engineering, Toyohashi University of Technology, Toyohashi, Aichi, Japan","Department of Computer Science and Engineering, Toyohashi University of Technology, 1-1 Hibarigaoka, Tenpaku-cho, Aichi, 441-8580, Japan"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Toyohashi University of Technology, Toyohashi, Aichi, Japan","institution_ids":["https://openalex.org/I136259955"]},{"raw_affiliation_string":"Department of Computer Science and Engineering, Toyohashi University of Technology, 1-1 Hibarigaoka, Tenpaku-cho, Aichi, 441-8580, Japan","institution_ids":["https://openalex.org/I136259955"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5071725508","display_name":"Jun Miura","orcid":"https://orcid.org/0000-0003-0153-2570"},"institutions":[{"id":"https://openalex.org/I136259955","display_name":"Toyohashi University of Technology","ror":"https://ror.org/04ezg6d83","country_code":"JP","type":"education","lineage":["https://openalex.org/I136259955"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Jun Miura","raw_affiliation_strings":["Department of Computer Science and Engineering, Toyohashi University of Technology, Toyohashi, Aichi, Japan","Department of Computer Science and Engineering, Toyohashi University of Technology, 1-1 Hibarigaoka, Tenpaku-cho, Aichi, 441-8580, Japan"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Toyohashi University of Technology, Toyohashi, Aichi, Japan","institution_ids":["https://openalex.org/I136259955"]},{"raw_affiliation_string":"Department of Computer Science and Engineering, Toyohashi University of Technology, 1-1 Hibarigaoka, Tenpaku-cho, Aichi, 441-8580, Japan","institution_ids":["https://openalex.org/I136259955"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5018898701"],"corresponding_institution_ids":["https://openalex.org/I136259955"],"apc_list":null,"apc_paid":null,"fwci":0.8236,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.73726667,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"30","issue":null,"first_page":"187","last_page":"192"},"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.9983000159263611,"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/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.9914000034332275,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.7761979103088379},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.69243323802948},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6913490295410156},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5975844860076904},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5824852585792542},{"id":"https://openalex.org/keywords/any-angle-path-planning","display_name":"Any-angle path planning","score":0.5358172059059143},{"id":"https://openalex.org/keywords/field","display_name":"Field (mathematics)","score":0.5304144024848938},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5123335123062134},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4805212914943695},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.46158578991889954},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.30143433809280396},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2913735508918762}],"concepts":[{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.7761979103088379},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.69243323802948},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6913490295410156},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5975844860076904},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5824852585792542},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.5358172059059143},{"id":"https://openalex.org/C9652623","wikidata":"https://www.wikidata.org/wiki/Q190109","display_name":"Field (mathematics)","level":2,"score":0.5304144024848938},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5123335123062134},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4805212914943695},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.46158578991889954},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.30143433809280396},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2913735508918762},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icra.2012.6224664","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra.2012.6224664","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE International Conference on Robotics and Automation","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.7400000095367432,"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1777783943","https://openalex.org/W1950933659","https://openalex.org/W1972952473","https://openalex.org/W1975949753","https://openalex.org/W1985556642","https://openalex.org/W1999244633","https://openalex.org/W2000359213","https://openalex.org/W2034801091","https://openalex.org/W2038131922","https://openalex.org/W2049391017","https://openalex.org/W2099593662","https://openalex.org/W2101817641","https://openalex.org/W2133710727","https://openalex.org/W2139822104","https://openalex.org/W2143826757","https://openalex.org/W2401275229","https://openalex.org/W3104753760","https://openalex.org/W6640802323","https://openalex.org/W6674861906"],"related_works":["https://openalex.org/W2368795992","https://openalex.org/W4308080200","https://openalex.org/W2908094156","https://openalex.org/W2389896347","https://openalex.org/W4395071568","https://openalex.org/W2904203243","https://openalex.org/W3139139461","https://openalex.org/W2125569607","https://openalex.org/W2359600231","https://openalex.org/W1660309994"],"abstract_inverted_index":{"This":[0],"paper":[1],"deals":[2],"with":[3],"a":[4,79,84],"path":[5,29,100],"planning":[6,30],"problem":[7],"in":[8,41,59,83],"the":[9,23,26,34,46,49,55,66,76,91,96,99,110,120],"dynamic":[10,39],"and":[11,19,36,95,123],"cluttered":[12],"environments.":[13],"The":[14,68,93],"presence":[15],"of":[16,22,28,38,48,78,90,98,125],"moving":[17],"obstacles":[18,40],"kinodynamic":[20,88],"constraints":[21,89],"robot":[24],"increases":[25],"complexity":[27],"problem.":[31],"We":[32,44],"model":[33],"environment":[35],"motion":[37],"3D":[42,62],"time-space.":[43],"propose":[45],"utilization":[47],"arrival":[50,69],"time":[51,70],"field":[52,71],"for":[53,64,74],"examining":[54],"most":[56],"promising":[57],"area":[58],"those":[60],"obstacles-occupied":[61],"time-space":[63],"approaching":[65],"goal.":[67],"is":[72],"used":[73],"guiding":[75],"expansion":[77],"randomized":[80,111],"tree":[81],"search":[82],"favorable":[85],"way,":[86],"considering":[87],"robot.":[92],"quality":[94],"optimality":[97],"are":[101,115],"taken":[102],"into":[103],"account":[104],"by":[105],"performing":[106],"heuristic":[107],"methods":[108],"on":[109],"tree.":[112],"Simulation":[113],"results":[114],"also":[116],"provided":[117],"to":[118],"prove":[119],"feasibility,":[121],"possibility,":[122],"effectiveness":[124],"our":[126],"algorithm.":[127]},"counts_by_year":[{"year":2018,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}