{"id":"https://openalex.org/W2891559848","doi":"https://doi.org/10.1109/icra.2018.8460221","title":"Optimal Path Planning in Time-Varying Flows with Forecasting Uncertainties","display_name":"Optimal Path Planning in Time-Varying Flows with Forecasting Uncertainties","publication_year":2018,"publication_date":"2018-05-01","ids":{"openalex":"https://openalex.org/W2891559848","doi":"https://doi.org/10.1109/icra.2018.8460221","mag":"2891559848"},"language":"en","primary_location":{"id":"doi:10.1109/icra.2018.8460221","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra.2018.8460221","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE International Conference on Robotics and Automation (ICRA)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5035394904","display_name":"Dhanushka Kularatne","orcid":"https://orcid.org/0000-0001-7424-601X"},"institutions":[{"id":"https://openalex.org/I72816309","display_name":"Drexel University","ror":"https://ror.org/04bdffz58","country_code":"US","type":"education","lineage":["https://openalex.org/I72816309"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Dhanushka Kularatne","raw_affiliation_strings":["Scalable Autonomous Systems Lab, Drexel University, Philadelphia, PA, USA","Drexel University, Scalable Autonomous Systems Lab, Philadelphia, PA, 19104, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Scalable Autonomous Systems Lab, Drexel University, Philadelphia, PA, USA","institution_ids":["https://openalex.org/I72816309"]},{"raw_affiliation_string":"Drexel University, Scalable Autonomous Systems Lab, Philadelphia, PA, 19104, USA","institution_ids":["https://openalex.org/I72816309"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5015115695","display_name":"Hadi Hajieghrary","orcid":"https://orcid.org/0000-0002-4278-1293"},"institutions":[{"id":"https://openalex.org/I72816309","display_name":"Drexel University","ror":"https://ror.org/04bdffz58","country_code":"US","type":"education","lineage":["https://openalex.org/I72816309"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Hadi Hajieghrary","raw_affiliation_strings":["Scalable Autonomous Systems Lab, Drexel University, Philadelphia, PA, USA","Drexel University, Scalable Autonomous Systems Lab, Philadelphia, PA, 19104, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Scalable Autonomous Systems Lab, Drexel University, Philadelphia, PA, USA","institution_ids":["https://openalex.org/I72816309"]},{"raw_affiliation_string":"Drexel University, Scalable Autonomous Systems Lab, Philadelphia, PA, 19104, USA","institution_ids":["https://openalex.org/I72816309"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5042002060","display_name":"M. Ani Hsieh","orcid":"https://orcid.org/0000-0003-2186-9074"},"institutions":[{"id":"https://openalex.org/I79576946","display_name":"University of Pennsylvania","ror":"https://ror.org/00b30xv10","country_code":"US","type":"education","lineage":["https://openalex.org/I79576946"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"M. Ani Hsieh","raw_affiliation_strings":["GRASP Laboratory, University of Pennsylvania, Philadelphia, PA, USA","University of Pennsylvania, GRASP Laboratory, Philadelphia, PA, 19104, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"GRASP Laboratory, University of Pennsylvania, Philadelphia, PA, USA","institution_ids":["https://openalex.org/I79576946"]},{"raw_affiliation_string":"University of Pennsylvania, GRASP Laboratory, Philadelphia, PA, 19104, USA","institution_ids":["https://openalex.org/I79576946"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":30,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"4857","last_page":"4864"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9904999732971191,"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"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9904999732971191,"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"}},{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9879999756813049,"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/T11622","display_name":"Maritime Navigation and Safety","score":0.9804999828338623,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/markov-decision-process","display_name":"Markov decision process","score":0.6876431107521057},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.6539949178695679},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6468936204910278},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6027728319168091},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5778480768203735},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4836812913417816},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.47301653027534485},{"id":"https://openalex.org/keywords/minimum-cost-flow-problem","display_name":"Minimum-cost flow problem","score":0.41985654830932617},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.2836821675300598},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.20846593379974365},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.09395551681518555},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.08334332704544067},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.08172032237052917}],"concepts":[{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.6876431107521057},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.6539949178695679},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6468936204910278},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6027728319168091},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5778480768203735},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4836812913417816},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.47301653027534485},{"id":"https://openalex.org/C99545648","wikidata":"https://www.wikidata.org/wiki/Q2897180","display_name":"Minimum-cost flow problem","level":3,"score":0.41985654830932617},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.2836821675300598},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.20846593379974365},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.09395551681518555},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.08334332704544067},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.08172032237052917},{"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.2018.8460221","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra.2018.8460221","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE International Conference on Robotics and Automation (ICRA)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5699999928474426,"id":"https://metadata.un.org/sdg/14","display_name":"Life below water"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W81238816","https://openalex.org/W1504761831","https://openalex.org/W1823979212","https://openalex.org/W2038754967","https://openalex.org/W2044552296","https://openalex.org/W2045823581","https://openalex.org/W2071099748","https://openalex.org/W2078639717","https://openalex.org/W2113023534","https://openalex.org/W2140019566","https://openalex.org/W2158246215","https://openalex.org/W2267184893","https://openalex.org/W2416852083","https://openalex.org/W2764229566","https://openalex.org/W3214467020","https://openalex.org/W6603223803","https://openalex.org/W6803978026"],"related_works":["https://openalex.org/W2359600231","https://openalex.org/W2380019117","https://openalex.org/W3138952546","https://openalex.org/W1987886368","https://openalex.org/W1660309994","https://openalex.org/W2369187583","https://openalex.org/W3197207153","https://openalex.org/W3154539612","https://openalex.org/W187740018","https://openalex.org/W2162286586"],"abstract_inverted_index":{"Uncertainties":[0],"in":[1,13,101,119,128],"flow":[2,34,104],"models":[3],"have":[4],"to":[5,23,70,79,89,114],"be":[6],"explicitly":[7],"considered":[8],"for":[9],"effective":[10],"path":[11,96],"planning":[12],"marine":[14],"environments.":[15],"In":[16,85],"this":[17],"paper,":[18],"we":[19],"present":[20],"two":[21,110],"methods":[22,111],"compute":[24,71,90,115],"minimum":[25,47,60,116],"expected":[26,48,61,92],"cost":[27,49,62,93],"policies":[28],"and":[29,123],"paths":[30,118],"over":[31],"an":[32,102,120],"uncertain":[33,103],"model.":[35],"The":[36,109],"first":[37],"method":[38,88],"based":[39,56],"on":[40],"a":[41,46,59,82,87,95],"Markov":[42],"Decision":[43],"Process":[44],"computes":[45,58],"policy":[50],"while":[51],"the":[52,72,91,124],"second":[53],"graph":[54],"search":[55],"method,":[57],"path.":[63],"A":[64],"transition":[65,75],"probability":[66,73],"model":[67],"is":[68,99,106],"developed":[69],"of":[74,94],"from":[76],"one":[77],"state":[78],"another":[80],"under":[81],"given":[83],"action.":[84],"addition,":[86],"when":[97],"it":[98],"executed":[100],"field":[105],"also":[107],"presented.":[108],"are":[112,126],"used":[113],"energy":[117],"ocean":[121],"environment":[122],"results":[125],"analyzed":[127],"simulations.":[129]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":7},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":2}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}