{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T12:52:01Z","timestamp":1774961521540,"version":"3.50.1"},"reference-count":63,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"11","license":[{"start":{"date-parts":[[2022,11,1]],"date-time":"2022-11-01T00:00:00Z","timestamp":1667260800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,11,1]],"date-time":"2022-11-01T00:00:00Z","timestamp":1667260800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,11,1]],"date-time":"2022-11-01T00:00:00Z","timestamp":1667260800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"Singapore Government's Research, Innovation, and Enterprise 2020 Plan"},{"name":"Advanced Manufacturing and Engineering domain","award":["A1687b0033"],"award-info":[{"award-number":["A1687b0033"]}]},{"DOI":"10.13039\/501100001348","name":"Agency for Science, Technology and Research","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001348","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Veh. Technol."],"published-print":{"date-parts":[[2022,11]]},"DOI":"10.1109\/tvt.2022.3191490","type":"journal-article","created":{"date-parts":[[2022,7,18]],"date-time":"2022-07-18T20:34:30Z","timestamp":1658176470000},"page":"11465-11479","source":"Crossref","is-referenced-by-count":4,"title":["Dual Dynamic Programming for the Mean Standard Deviation Canadian Traveller Problem"],"prefix":"10.1109","volume":"71","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9836-3090","authenticated-orcid":false,"given":"Hongliang","family":"Guo","sequence":"first","affiliation":[{"name":"Institute for Infocomm Research, Agency for Science, Technology and Research, Singapore"}]},{"given":"Rui","family":"Shi","sequence":"additional","affiliation":[{"name":"School of Automation Engineering, University of Electronic Science and Technology of China, Chengdu, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5473-3566","authenticated-orcid":false,"given":"Daniela","family":"Rus","sequence":"additional","affiliation":[{"name":"Computer Science, and Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge, MA, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5709-9169","authenticated-orcid":false,"given":"Wei-Yun","family":"Yau","sequence":"additional","affiliation":[{"name":"Institute for Infocomm Research, Agency for Science, Technology and Research, Singapore"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2007.10.004"},{"key":"ref38","article-title":"Exact algorithms for the canadian traveller problem on paths and trees","author":"karger","year":"2008"},{"key":"ref33","first-page":"51","article-title":"High-quality policies for the canadian traveller problem","author":"eyerich","year":"0","journal-title":"Proc AAAI Conf Artif Intell"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-008-9156-y"},{"key":"ref31","first-page":"89","article-title":"Risk assignment: A new traffic assignment model considering risk of travel time variation","volume":"45","author":"uchida","year":"1993","journal-title":"Transportation Traffic Theory"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.44.11.S125"},{"key":"ref37","first-page":"5523","article-title":"The robust canadian traveller problem applied to robot routing","author":"guo","year":"0","journal-title":"Proc IEEE Int Conf Robot Automat"},{"key":"ref36","first-page":"969","article-title":"Route planning under uncertainty: The canadian traveller problem","author":"nikolova","year":"0","journal-title":"Proc AAAI Conf Artif Intell"},{"key":"ref35","first-page":"261","article-title":"The canadian traveller problem","author":"bar-noy","year":"0","journal-title":"Proc 2nd Annu ACM-SIAM Symp Discrete algorithms"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-013-9614-z"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2021.3082568"},{"key":"ref62","article-title":"Transportation network test problems","author":"bar-gera","year":"2021"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1038\/s41597-019-0060-3"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1002\/atr.5670390104"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/s11750-021-00592-3"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/j.trb.2012.01.005"},{"key":"ref2","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/j.trb.2017.12.015","article-title":"Pruning algorithm for the least expected travel time path on stochastic and time-dependent networks","volume":"108","author":"akkinepally","year":"2018","journal-title":"Transp Res Part B Methodological"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"ref20","author":"sutton","year":"2018","journal-title":"Reinforcement Learning An Introduction"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1177\/0278364910386259"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-005-7498-5"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2020.2964784"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.trb.2020.05.013"},{"key":"ref26","first-page":"59","article-title":"The alpha-reliable shortest path problem","volume":"3","author":"guerriero","year":"2008","journal-title":"Algorithmic Operational Research"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2021.3109169"},{"key":"ref50","author":"pearl","year":"1984","journal-title":"Heuristics Intelligent Search Strategies for Computer Problem Solving"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2004.1307491"},{"key":"ref59","first-page":"449","article-title":"A distributional perspective on reinforcement learning","author":"bellemare","year":"0","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2018.10.053"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-019-00378-1"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-020-00792-6"},{"key":"ref55","first-page":"1","article-title":"Shortest path under uncertainty: Exploration versus exploitation","author":"lim","year":"0","journal-title":"Proc Conf Uncertainty Artif Intell"},{"key":"ref54","first-page":"319","article-title":"A comparison of penalty and rollout-based algorithms for the canadian traveller problem","volume":"5","author":"sahin","year":"2015","journal-title":"Int J Mach Learn Comput"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.2015.0668"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2007.4434409"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.trc.2015.04.018"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2021.3096829"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-013-9634-8"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2021.3105415"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.35.1.37.10141"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.28.4.309"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-20086-6_29"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2018.01.054"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2020.113192"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/IROS45743.2020.9341736"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2019.8793782"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.trb.2015.04.002"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/S0965-8564(02)00021-6"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.trb.2017.04.006"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.trb.2018.12.011"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(91)90263-2"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.trb.2011.06.004"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2014.02.026"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.tre.2013.07.002"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-016-0079-8"},{"key":"ref45","first-page":"1","article-title":"Impact of traversability uncertainty on global navigation planning in planetary environments","author":"lamarre","year":"0","journal-title":"Proc IROS Workshop Planet Exploration Robots Challenges Opportunities"},{"key":"ref48","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1016\/j.tcs.2018.04.022","article-title":"Approximation and complexity of multi-target graph search and the canadian traveller problem","volume":"732","author":"ee","year":"2018","journal-title":"Theor Comput Sci"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.3233\/AIC-150665"},{"key":"ref42","first-page":"102","article-title":"The recoverable canadian traveller problem based on limited provision information","volume":"9","author":"su","year":"2009","journal-title":"Syst Eng"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85097-7_39"},{"key":"ref44","first-page":"1101","article-title":"Gauss meets canadian traveller: Shortest-path problems with correlated natural dynamics","author":"dey","year":"0","journal-title":"Proc Int Conf Auton Agents Multi-Agent Syst Int Found Auton Agents Multiagent Syst"},{"key":"ref43","first-page":"437","article-title":"Canadian traveller problem with remote sensing","author":"bnaya","year":"0","journal-title":"Proc 21st Int Joint Conf Artif Intell"}],"container-title":["IEEE Transactions on Vehicular Technology"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/25\/9950228\/09832500.pdf?arnumber=9832500","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,12]],"date-time":"2022-12-12T19:39:52Z","timestamp":1670873992000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9832500\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11]]},"references-count":63,"journal-issue":{"issue":"11"},"URL":"https:\/\/doi.org\/10.1109\/tvt.2022.3191490","relation":{},"ISSN":["0018-9545","1939-9359"],"issn-type":[{"value":"0018-9545","type":"print"},{"value":"1939-9359","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,11]]}}}