{"id":"https://openalex.org/W3090480996","doi":"https://doi.org/10.1109/icra40945.2020.9197513","title":"Hierarchical Planning in Time-Dependent Flow Fields for Marine Robots","display_name":"Hierarchical Planning in Time-Dependent Flow Fields for Marine Robots","publication_year":2020,"publication_date":"2020-05-01","ids":{"openalex":"https://openalex.org/W3090480996","doi":"https://doi.org/10.1109/icra40945.2020.9197513","mag":"3090480996"},"language":"en","primary_location":{"id":"doi:10.1109/icra40945.2020.9197513","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra40945.2020.9197513","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 IEEE International Conference on Robotics and Automation (ICRA)","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://opus.lib.uts.edu.au/bitstream/10453/148185/3/Hierarchical%20Planning%20in%20Time-Dependent%20Flow%20Fields%20for%20Marine%20Robots.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5034514490","display_name":"James Ju Heon Lee","orcid":null},"institutions":[{"id":"https://openalex.org/I114017466","display_name":"University of Technology Sydney","ror":"https://ror.org/03f0f6041","country_code":"AU","type":"education","lineage":["https://openalex.org/I114017466"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"James Ju Heon Lee","raw_affiliation_strings":["University of Technology Sydney, Ultimo, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Technology Sydney, Ultimo, Australia","institution_ids":["https://openalex.org/I114017466"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5041795722","display_name":"Chanyeol Yoo","orcid":null},"institutions":[{"id":"https://openalex.org/I114017466","display_name":"University of Technology Sydney","ror":"https://ror.org/03f0f6041","country_code":"AU","type":"education","lineage":["https://openalex.org/I114017466"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Chanyeol Yoo","raw_affiliation_strings":["University of Technology Sydney, Ultimo, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Technology Sydney, Ultimo, Australia","institution_ids":["https://openalex.org/I114017466"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5047305911","display_name":"Stuart Anstee","orcid":"https://orcid.org/0000-0001-8642-0441"},"institutions":[{"id":"https://openalex.org/I1303474014","display_name":"Defence Science and Technology Group","ror":"https://ror.org/05ddrvt52","country_code":"AU","type":"government","lineage":["https://openalex.org/I1303474014","https://openalex.org/I2801453606","https://openalex.org/I3139952251"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Stuart Anstee","raw_affiliation_strings":["Department of Defence, Defence Science and Technology Group, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Defence, Defence Science and Technology Group, Australia","institution_ids":["https://openalex.org/I1303474014"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5053830227","display_name":"Robert Fitch","orcid":"https://orcid.org/0000-0003-2215-5188"},"institutions":[{"id":"https://openalex.org/I114017466","display_name":"University of Technology Sydney","ror":"https://ror.org/03f0f6041","country_code":"AU","type":"education","lineage":["https://openalex.org/I114017466"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Robert Fitch","raw_affiliation_strings":["University of Technology Sydney, Ultimo, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Technology Sydney, Ultimo, Australia","institution_ids":["https://openalex.org/I114017466"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":5.4774,"has_fulltext":true,"cited_by_count":12,"citation_normalized_percentile":{"value":0.97066246,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"885","last_page":"891"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11192","display_name":"Underwater Vehicles and Communication Systems","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/2212","display_name":"Ocean 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/T11192","display_name":"Underwater Vehicles and Communication Systems","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/2212","display_name":"Ocean 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/T11622","display_name":"Maritime Navigation and Safety","score":0.9980999827384949,"subfield":{"id":"https://openalex.org/subfields/2212","display_name":"Ocean 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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9954000115394592,"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/tree-traversal","display_name":"Tree traversal","score":0.6773116588592529},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.663168728351593},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.561958909034729},{"id":"https://openalex.org/keywords/graph-traversal","display_name":"Graph traversal","score":0.5419998168945312},{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.5358409285545349},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.49522843956947327},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.47902244329452515},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.47419124841690063},{"id":"https://openalex.org/keywords/robotics","display_name":"Robotics","score":0.4586603045463562},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.4527190327644348},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.43960967659950256},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.4345337152481079},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4173858165740967},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.39972150325775146},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3183874785900116},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.28630292415618896},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.27665847539901733},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.09951713681221008}],"concepts":[{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.6773116588592529},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.663168728351593},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.561958909034729},{"id":"https://openalex.org/C96333769","wikidata":"https://www.wikidata.org/wiki/Q907955","display_name":"Graph traversal","level":3,"score":0.5419998168945312},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.5358409285545349},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.49522843956947327},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.47902244329452515},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.47419124841690063},{"id":"https://openalex.org/C34413123","wikidata":"https://www.wikidata.org/wiki/Q170978","display_name":"Robotics","level":3,"score":0.4586603045463562},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.4527190327644348},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.43960967659950256},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.4345337152481079},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4173858165740967},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.39972150325775146},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3183874785900116},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.28630292415618896},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.27665847539901733},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.09951713681221008},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/icra40945.2020.9197513","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra40945.2020.9197513","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 IEEE International Conference on Robotics and Automation (ICRA)","raw_type":"proceedings-article"},{"id":"pmh:oai:opus.lib.uts.edu.au:10453/148185","is_oa":true,"landing_page_url":"http://hdl.handle.net/10453/148185","pdf_url":"https://opus.lib.uts.edu.au/bitstream/10453/148185/3/Hierarchical%20Planning%20in%20Time-Dependent%20Flow%20Fields%20for%20Marine%20Robots.pdf","source":{"id":"https://openalex.org/S4306401357","display_name":"UTS ePRESS (University of Technology Sydney)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I114017466","host_organization_name":"University of Technology Sydney","host_organization_lineage":["https://openalex.org/I114017466"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Conference Proceeding"}],"best_oa_location":{"id":"pmh:oai:opus.lib.uts.edu.au:10453/148185","is_oa":true,"landing_page_url":"http://hdl.handle.net/10453/148185","pdf_url":"https://opus.lib.uts.edu.au/bitstream/10453/148185/3/Hierarchical%20Planning%20in%20Time-Dependent%20Flow%20Fields%20for%20Marine%20Robots.pdf","source":{"id":"https://openalex.org/S4306401357","display_name":"UTS ePRESS (University of Technology Sydney)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I114017466","host_organization_name":"University of Technology Sydney","host_organization_lineage":["https://openalex.org/I114017466"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Conference Proceeding"},"sustainable_development_goals":[{"display_name":"Life below water","score":0.8100000023841858,"id":"https://metadata.un.org/sdg/14"}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3090480996.pdf","grobid_xml":"https://content.openalex.org/works/W3090480996.grobid-xml"},"referenced_works_count":38,"referenced_works":["https://openalex.org/W143506948","https://openalex.org/W1489344685","https://openalex.org/W1542112886","https://openalex.org/W1972762805","https://openalex.org/W1986652726","https://openalex.org/W2037110062","https://openalex.org/W2041213630","https://openalex.org/W2071099748","https://openalex.org/W2080936366","https://openalex.org/W2089338760","https://openalex.org/W2097868028","https://openalex.org/W2109923933","https://openalex.org/W2113014481","https://openalex.org/W2120975466","https://openalex.org/W2125974405","https://openalex.org/W2144050074","https://openalex.org/W2156557178","https://openalex.org/W2162892989","https://openalex.org/W2292324131","https://openalex.org/W2294185035","https://openalex.org/W2323637477","https://openalex.org/W2891559848","https://openalex.org/W2911474998","https://openalex.org/W2912201531","https://openalex.org/W2920467748","https://openalex.org/W2962787188","https://openalex.org/W2967042539","https://openalex.org/W2971915379","https://openalex.org/W3003677009","https://openalex.org/W3043093646","https://openalex.org/W3091295979","https://openalex.org/W3102210216","https://openalex.org/W3117917186","https://openalex.org/W4288115684","https://openalex.org/W6758888352","https://openalex.org/W6760242795","https://openalex.org/W6767053357","https://openalex.org/W6783675307"],"related_works":["https://openalex.org/W2200188075","https://openalex.org/W4252596799","https://openalex.org/W4254594467","https://openalex.org/W4230405657","https://openalex.org/W244044452","https://openalex.org/W2552915643","https://openalex.org/W3213135344","https://openalex.org/W170547082","https://openalex.org/W3183956626","https://openalex.org/W2136735429"],"abstract_inverted_index":{"We":[0,103],"present":[1],"an":[2,140],"efficient":[3,174],"approach":[4,23],"for":[5,29,173,180],"finding":[6,56],"shortest":[7,57],"paths":[8,58,156],"in":[9,45,59,71,98,151],"flow":[10,18,73,101],"fields":[11],"that":[12,33,67,90,105,146,157],"vary":[13],"as":[14],"a":[15,64,78,82,132],"sequence":[16],"of":[17,55,95,117,176],"predictions":[19,179],"over":[20],"time.":[21],"This":[22],"is":[24,43,84],"applicable":[25],"to":[26,36,62,126,159,167],"motion":[27,181],"planning":[28],"slow":[30],"marine":[31,142,168],"robots":[32],"are":[34,91,165],"subject":[35],"dynamic":[37],"ocean":[38,161,178],"currents.":[39,162],"Although":[40],"the":[41,53,99,106,110,118,135,147],"problem":[42],"NP-hard":[44],"general":[46],"form,":[47],"we":[48],"incorporate":[49],"recent":[50],"results":[51,164],"from":[52,93],"theory":[54],"time-dependent":[60,72],"graphs":[61],"construct":[63],"polynomial-time":[65],"algorithm":[66,76,108,148],"finds":[68],"continuous":[69,96,107],"trajectories":[70,97],"fields.":[74],"The":[75],"has":[77],"hierarchical":[79],"structure":[80],"where":[81],"graph":[83,120],"constructed":[85],"with":[86,139],"time-varying":[87,177],"edge":[88],"costs":[89],"derived":[92],"sets":[94],"underlying":[100],"field.":[102],"show":[104,145],"retains":[109],"time":[111],"complexity":[112],"and":[113,122,128,153],"path":[114],"quality":[115],"properties":[116],"discrete":[119],"solution,":[121],"demonstrate":[123],"its":[124],"application":[125],"surface":[127],"underwater":[129],"vehicles":[130],"including":[131],"traversal":[133],"along":[134],"East":[136],"Australian":[137],"Current":[138],"autonomous":[141],"vehicle.":[143],"Results":[144],"performs":[149],"efficiently":[150],"practice":[152],"can":[154],"find":[155],"adapt":[158],"changing":[160],"These":[163],"significant":[166],"robotics":[169],"because":[170],"they":[171],"allow":[172],"use":[175],"planning.":[182]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}