{"id":"https://openalex.org/W4415180125","doi":"https://doi.org/10.23919/ecc65951.2025.11187259","title":"Robust Shortest Path with Incremental Information Revelation","display_name":"Robust Shortest Path with Incremental Information Revelation","publication_year":2025,"publication_date":"2025-06-24","ids":{"openalex":"https://openalex.org/W4415180125","doi":"https://doi.org/10.23919/ecc65951.2025.11187259"},"language":"en","primary_location":{"id":"doi:10.23919/ecc65951.2025.11187259","is_oa":false,"landing_page_url":"https://doi.org/10.23919/ecc65951.2025.11187259","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 European Control Conference (ECC)","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/A5037092133","display_name":"Edwin Meriaux","orcid":"https://orcid.org/0000-0002-9186-5362"},"institutions":[{"id":"https://openalex.org/I5023651","display_name":"McGill University","ror":"https://ror.org/01pxwe438","country_code":"CA","type":"education","lineage":["https://openalex.org/I5023651"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Edwin Meriaux","raw_affiliation_strings":["McGill University,Department of Electrical and Computer Enigneering,Montreal,Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"McGill University,Department of Electrical and Computer Enigneering,Montreal,Canada","institution_ids":["https://openalex.org/I5023651"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5005770424","display_name":"Aditya Mahajan","orcid":"https://orcid.org/0000-0001-8125-1191"},"institutions":[{"id":"https://openalex.org/I5023651","display_name":"McGill University","ror":"https://ror.org/01pxwe438","country_code":"CA","type":"education","lineage":["https://openalex.org/I5023651"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Aditya Mahajan","raw_affiliation_strings":["McGill University,Department of Electrical and Computer Enigneering,Montreal,Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"McGill University,Department of Electrical and Computer Enigneering,Montreal,Canada","institution_ids":["https://openalex.org/I5023651"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I5023651"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.34080201,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"2383","last_page":"2389"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9799000024795532,"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"}},"topics":[{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9799000024795532,"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"}},{"id":"https://openalex.org/T11063","display_name":"Rough Sets and Fuzzy Logic","score":0.9760000109672546,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9740999937057495,"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/shortest-path-problem","display_name":"Shortest path problem","score":0.597000002861023},{"id":"https://openalex.org/keywords/pruning","display_name":"Pruning","score":0.5741999745368958},{"id":"https://openalex.org/keywords/partially-observable-markov-decision-process","display_name":"Partially observable Markov decision process","score":0.5526000261306763},{"id":"https://openalex.org/keywords/markov-decision-process","display_name":"Markov decision process","score":0.4846000075340271},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4564000070095062},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.42089998722076416},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.40880000591278076},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.4077000021934509},{"id":"https://openalex.org/keywords/state-space","display_name":"State space","score":0.40459999442100525}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.597000002861023},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.583299994468689},{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.5741999745368958},{"id":"https://openalex.org/C17098449","wikidata":"https://www.wikidata.org/wiki/Q176814","display_name":"Partially observable Markov decision process","level":4,"score":0.5526000261306763},{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.4846000075340271},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4812000095844269},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4564000070095062},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4542999863624573},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.42089998722076416},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.40880000591278076},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.4077000021934509},{"id":"https://openalex.org/C72434380","wikidata":"https://www.wikidata.org/wiki/Q230930","display_name":"State space","level":2,"score":0.40459999442100525},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.38749998807907104},{"id":"https://openalex.org/C46149586","wikidata":"https://www.wikidata.org/wiki/Q11785332","display_name":"Monte Carlo tree search","level":3,"score":0.3716999888420105},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.3637999892234802},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36239999532699585},{"id":"https://openalex.org/C32848918","wikidata":"https://www.wikidata.org/wiki/Q845789","display_name":"Observable","level":2,"score":0.3424000144004822},{"id":"https://openalex.org/C143724316","wikidata":"https://www.wikidata.org/wiki/Q312468","display_name":"Series (stratigraphy)","level":2,"score":0.3253999948501587},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.3246999979019165},{"id":"https://openalex.org/C19499675","wikidata":"https://www.wikidata.org/wiki/Q232207","display_name":"Monte Carlo method","level":2,"score":0.32179999351501465},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.302700012922287},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.28380000591278076},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.2777999937534332},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.275299996137619},{"id":"https://openalex.org/C36299963","wikidata":"https://www.wikidata.org/wiki/Q1369844","display_name":"Observability","level":2,"score":0.27079999446868896},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.26820001006126404},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.2549000084400177},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.25200000405311584}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.23919/ecc65951.2025.11187259","is_oa":false,"landing_page_url":"https://doi.org/10.23919/ecc65951.2025.11187259","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 European Control Conference (ECC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W1969483458","https://openalex.org/W1977543916","https://openalex.org/W1986315748","https://openalex.org/W2013979699","https://openalex.org/W2023727736","https://openalex.org/W2028186501","https://openalex.org/W2081287319","https://openalex.org/W2093308381","https://openalex.org/W2113256452","https://openalex.org/W2126316555","https://openalex.org/W2155153696","https://openalex.org/W2168405694","https://openalex.org/W2169528473","https://openalex.org/W2682890765","https://openalex.org/W3119464194","https://openalex.org/W3193604950","https://openalex.org/W4236251699","https://openalex.org/W4391609370","https://openalex.org/W4401279408","https://openalex.org/W6922480057"],"related_works":[],"abstract_inverted_index":{"In":[0],"this":[1,55],"paper,":[2],"we":[3,119],"consider":[4],"the":[5,9,21,38,44,50,85,90,93,96,104,126,129],"problem":[6,56],"of":[7,25,80,128],"finding":[8],"shortest":[10],"path":[11,31],"in":[12,33],"a":[13,58,78,121],"graph":[14,45],"when":[15],"there":[16],"is":[17],"aleatoric":[18],"uncertainty":[19],"about":[20],"presence":[22],"and/or":[23],"cost":[24,94],"certain":[26],"edges.":[27],"We":[28,53,76,98],"investigate":[29],"hybrid":[30],"planning,":[32],"which":[34,83],"an":[35,69,115],"agent":[36],"observes":[37],"uncertain":[39],"information":[40,70],"as":[41,57],"it":[42],"traverses":[43],"and":[46,67,95],"may":[47],"adapt":[48,103],"to":[49,102,113,124],"new":[51],"information.":[52],"model":[54],"robust":[59],"partially":[60],"observable":[61],"Markov":[62],"decision":[63],"process":[64],"(robust":[65],"POMDP)":[66],"identify":[68],"state":[71,86],"for":[72],"dynamic":[73],"programming":[74],"decomposition.":[75],"propose":[77],"series":[79],"pruning":[81],"steps,":[82],"truncate":[84],"space":[87],"based":[88],"on":[89],"relationship":[91],"between":[92],"uncertainty.":[97],"then":[99],"show":[100],"how":[101],"Neural":[105],"Monte":[106],"Carlo":[107],"Tree":[108],"Search":[109],"(Neural":[110],"MCTS)":[111],"algorithm":[112],"obtain":[114],"approximate":[116],"solution.":[117],"Finally,":[118],"present":[120],"numerical":[122],"study":[123],"illustrate":[125],"effectiveness":[127],"proposed":[130],"approach.":[131]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-15T00:00:00"}