{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,20]],"date-time":"2025-05-20T04:01:29Z","timestamp":1747713689889,"version":"3.40.5"},"reference-count":57,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2024,8,8]],"date-time":"2024-08-08T00:00:00Z","timestamp":1723075200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,8,8]],"date-time":"2024-08-08T00:00:00Z","timestamp":1723075200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"National Science Foundation","award":["DMS-1738010 and DMS-1645643","DMS-1738010 and DMS-1645643","DMS-1738010 and DMS-1645643"],"award-info":[{"award-number":["DMS-1738010 and DMS-1645643","DMS-1738010 and DMS-1645643","DMS-1738010 and DMS-1645643"]}]},{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"publisher","award":["FA9550-22-1-0528"],"award-info":[{"award-number":["FA9550-22-1-0528"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000893","name":"Simons Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000893","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Dyn Games Appl"],"published-print":{"date-parts":[[2025,5]]},"DOI":"10.1007\/s13235-024-00586-3","type":"journal-article","created":{"date-parts":[[2024,8,8]],"date-time":"2024-08-08T08:02:36Z","timestamp":1723104156000},"page":"637-663","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Optimality and Robustness in Path-Planning Under Initial Uncertainty"],"prefix":"10.1007","volume":"15","author":[{"given":"Dongping","family":"Qi","sequence":"first","affiliation":[]},{"given":"Adam","family":"Dhillon","sequence":"additional","affiliation":[]},{"given":"Alexander","family":"Vladimirsky","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,8,8]]},"reference":[{"key":"586_CR1","doi-asserted-by":"crossref","unstructured":"Achdou Y, Lasry J-M (2019) Mean field games for modeling crowd motion. In: Contributions to partial differential equations and applications. Springer, pp\u00a017\u201342","DOI":"10.1007\/978-3-319-78325-3_4"},{"key":"586_CR2","doi-asserted-by":"crossref","first-page":"2402","DOI":"10.1137\/10080258X","volume":"33","author":"S Ahmed","year":"2011","unstructured":"Ahmed S, Bak S, McLaughlin J, Renzi D (2011) A third order accurate fast marching method for the Eikonal equation in two dimensions. SIAM J Sci Comput 33:2402\u20132420","journal-title":"SIAM J Sci Comput"},{"key":"586_CR3","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1007\/s10915-011-9512-4","volume":"51","author":"K Alton","year":"2012","unstructured":"Alton K, Mitchell IM (2012) An ordered upwind method with precomputed stencil and monotone node acceptance for solving static convex Hamilton\u2013Jacobi equations. J Sci Comput 51:313\u2013348","journal-title":"J Sci Comput"},{"key":"586_CR4","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1016\/0020-0190(79)90072-3","volume":"9","author":"AM Andrew","year":"1979","unstructured":"Andrew AM (1979) Another efficient algorithm for convex hulls in two dimensions. Inf Process Lett 9:216\u2013219","journal-title":"Inf Process Lett"},{"key":"586_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.4171\/ifb\/312","volume":"16","author":"J Andrews","year":"2014","unstructured":"Andrews J, Vladimirsky A (2014) Deterministic control of randomly-terminated processes. Interfaces Free Bound 16:1\u201340","journal-title":"Interfaces Free Bound"},{"key":"586_CR6","doi-asserted-by":"crossref","first-page":"2853","DOI":"10.1137\/090749645","volume":"32","author":"S Bak","year":"2010","unstructured":"Bak S, McLaughlin J, Renzi D (2010) Some improvements for the fast sweeping method. SIAM J Sci Comput 32:2853\u20132874","journal-title":"SIAM J Sci Comput"},{"key":"586_CR7","doi-asserted-by":"crossref","unstructured":"Bardi M, Capuzzo-Dolcetta I (1997) Optimal control and viscosity solutions of Hamilton\u2013Jacobi\u2013Bellman equations, vol 12. Springer","DOI":"10.1007\/978-0-8176-4755-1"},{"key":"586_CR8","doi-asserted-by":"crossref","unstructured":"Barles G, Souganidis PE (1991) Convergence of approximation schemes for fully nonlinear second order equations. Asymptot Anal 4(3):271\u2013283","DOI":"10.3233\/ASY-1991-4305"},{"key":"586_CR9","doi-asserted-by":"crossref","unstructured":"Ba\u015far T, Bernhard P (2008) $$H^{\\infty }$$-optimal control and related minimax design problems. Springer","DOI":"10.1007\/978-0-8176-4757-5"},{"key":"586_CR10","doi-asserted-by":"crossref","first-page":"667","DOI":"10.1137\/S0036142997323521","volume":"36","author":"M Bou\u00e9","year":"1999","unstructured":"Bou\u00e9 M, Dupuis P (1999) Markov chain approximations for deterministic control problems with affine dynamics and quadratic cost in the control. SIAM J Numer Anal 36:667\u2013695","journal-title":"SIAM J Numer Anal"},{"key":"586_CR11","doi-asserted-by":"crossref","first-page":"4065","DOI":"10.1214\/21-AAP1715","volume":"32","author":"R Carmona","year":"2022","unstructured":"Carmona R, Lauri\u00e8re M (2022) Convergence analysis of machine learning algorithms for the numerical solution of mean field control and games: II-the finite horizon case. Ann Appl Probab 32:4065\u20134105","journal-title":"Ann Appl Probab"},{"key":"586_CR12","doi-asserted-by":"crossref","first-page":"A547","DOI":"10.1137\/10080909X","volume":"34","author":"A Chacon","year":"2012","unstructured":"Chacon A, Vladimirsky A (2012) Fast two-scale methods for Eikonal equations. SIAM J Sci Comput 34:A547\u2013A578","journal-title":"SIAM J Sci Comput"},{"key":"586_CR13","doi-asserted-by":"crossref","first-page":"A156","DOI":"10.1137\/12088197X","volume":"37","author":"A Chacon","year":"2015","unstructured":"Chacon A, Vladimirsky A (2015) A parallel two-scale method for Eikonal equations. SIAM J Sci Comput 37:A156\u2013A180","journal-title":"SIAM J Sci Comput"},{"key":"586_CR14","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1007\/BF02712873","volume":"16","author":"TM Chan","year":"1996","unstructured":"Chan TM (1996) Optimal output-sensitive convex hull algorithms in two and three dimensions. Discrete Comput Geometry 16:361\u2013368","journal-title":"Discrete Comput Geometry"},{"key":"586_CR15","first-page":"3304","volume":"2015","author":"M Chen","year":"2015","unstructured":"Chen M, Fisac JF, Sastry S, Tomlin CJ (2015) Safe sequential path planning of multi-vehicle systems via double-obstacle Hamilton\u2013Jacobi\u2013Isaacs variational inequality. Eur Control Conf (ECC) IEEE 2015:3304\u20133309","journal-title":"Eur Control Conf (ECC) IEEE"},{"key":"586_CR16","doi-asserted-by":"crossref","first-page":"A2478","DOI":"10.1137\/130936531","volume":"36","author":"Z Clawson","year":"2014","unstructured":"Clawson Z, Chacon A, Vladimirsky A (2014) Causal domain restriction for Eikonal equations. SIAM J Sci Comput 36:A2478\u2013A2505","journal-title":"SIAM J Sci Comput"},{"key":"586_CR17","doi-asserted-by":"crossref","unstructured":"Crandall MG, Lions P-L (1983) Viscosity solutions of Hamilton\u2013Jacobi equations. Trans Am Math Soc 277:1\u201342","DOI":"10.1090\/S0002-9947-1983-0690039-8"},{"key":"586_CR18","doi-asserted-by":"crossref","first-page":"1979","DOI":"10.1137\/050637625","volume":"45","author":"E Cristiani","year":"2007","unstructured":"Cristiani E, Falcone M (2007) Fast semi-Lagrangian schemes for the Eikonal equation and applications. SIAM J Numer Anal 45:1979\u20132011","journal-title":"SIAM J Numer Anal"},{"key":"586_CR19","doi-asserted-by":"crossref","first-page":"1351","DOI":"10.1007\/s10915-017-0590-9","volume":"75","author":"D Dahiya","year":"2018","unstructured":"Dahiya D, Cameron M (2018) Ordered line integral methods for computing the quasi-potential. J Sci Comput 75:1351\u20131384","journal-title":"J Sci Comput"},{"key":"586_CR20","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1287\/opre.1090.0741","volume":"58","author":"E Delage","year":"2010","unstructured":"Delage E, Ye Y (2010) Distributionally robust optimization under moment uncertainty with application to data-driven problems. Oper Res 58:595\u2013612","journal-title":"Oper Res"},{"key":"586_CR21","doi-asserted-by":"crossref","first-page":"A1625","DOI":"10.1137\/19M1305136","volume":"43","author":"S Dolgov","year":"2021","unstructured":"Dolgov S, Kalise D, Kunisch KK (2021) Tensor decomposition methods for high-dimensional Hamilton\u2013Jacobi\u2013Bellman equations. SIAM J Sci Comput 43:A1625\u2013A1650","journal-title":"SIAM J Sci Comput"},{"key":"586_CR22","unstructured":"Ermon S, Gomes C, Selman B, Vladimirsky A (2012) Probabilistic planning with non-linear utility functions and worst-case guarantees. In: Proceedings of the 11th international conference on autonomous agents and multiagent systems-Vol 2, International Foundation for Autonomous Agents and Multiagent Systems, pp\u00a0965\u2013972"},{"key":"586_CR23","unstructured":"Falcone M (1994) The minimum time problem and its applications to front propagation, Motion by mean curvature and related topics (Trento, 1992) de Gruyter. Berlin pp 70\u201388"},{"key":"586_CR24","doi-asserted-by":"crossref","unstructured":"Falcone M, Ferretti R (2013) Semi-Lagrangian approximation schemes for linear and Hamilton\u2013Jacobi equations. SIAM","DOI":"10.1137\/1.9781611973051"},{"key":"586_CR25","volume-title":"Controlled Markov processes and viscosity solutions","author":"WH Fleming","year":"2006","unstructured":"Fleming WH, Soner HM (2006) Controlled Markov processes and viscosity solutions, vol 25. Springer Science & Business Media, Cham"},{"key":"586_CR26","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/j.ifacol.2022.08.076","volume":"55","author":"ME Gaspard","year":"2022","unstructured":"Gaspard ME, Vladimirsky A (2022) Optimal driving under traffic signal uncertainty. IFAC-PapersOnLine 55:25\u201331","journal-title":"IFAC-PapersOnLine"},{"key":"586_CR27","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1016\/0020-0190(72)90045-2","volume":"1","author":"RL Graham","year":"1972","unstructured":"Graham RL (1972) An efficient algorithm for determining the convex hull of a finite planar set. Info Pro Lett 1:132\u2013133","journal-title":"Info Pro Lett"},{"key":"586_CR28","doi-asserted-by":"crossref","first-page":"356","DOI":"10.1287\/mnsc.18.7.356","volume":"18","author":"RA Howard","year":"1972","unstructured":"Howard RA, Matheson JE (1972) Risk-sensitive Markov decision processes. Manag Sci 18:356\u2013369","journal-title":"Manag Sci"},{"key":"586_CR29","doi-asserted-by":"crossref","first-page":"1480","DOI":"10.1109\/TVCG.2007.70571","volume":"13","author":"W-K Jeong","year":"2007","unstructured":"Jeong W-K, Fletcher PT, Tao R, Whitaker RT (2007) Interactive visualization of volumetric white matter connectivity in DT-MRI using a parallel-hardware Hamilton\u2013Jacobi solver. Visualization Computer Graph IEEE Trans 13:1480\u20131487","journal-title":"Visualization Computer Graph IEEE Trans"},{"key":"586_CR30","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/S0004-3702(98)00023-X","volume":"101","author":"LP Kaelbling","year":"1998","unstructured":"Kaelbling LP, Littman ML, Cassandra AR (1998) Planning and acting in partially observable stochastic domains. Artif Intell 101:99\u2013134","journal-title":"Artif Intell"},{"key":"586_CR31","doi-asserted-by":"crossref","unstructured":"Lauriere M (2021) Numerical methods for mean field games and mean field type control. In: Proceedings of symposia in applied mathematics 78","DOI":"10.1090\/psapm\/078\/06"},{"key":"586_CR32","doi-asserted-by":"crossref","first-page":"8191","DOI":"10.1016\/j.jcp.2008.05.018","volume":"227","author":"F Li","year":"2008","unstructured":"Li F, Shu C-W, Zhang Y-T, Zhao H (2008) A second order discontinuous Galerkin fast sweeping method for Eikonal equations. J Comput Phys 227:8191\u20138208","journal-title":"J Comput Phys"},{"key":"586_CR33","doi-asserted-by":"crossref","first-page":"B1341","DOI":"10.1137\/22M1472206","volume":"44","author":"T Meng","year":"2022","unstructured":"Meng T, Zhang Z, Darbon J, Karniadakis G (2022) Sympocnet: solving optimal control problems with applications to high-dimensional multiagent path planning problems. SIAM J Sci Comput 44:B1341\u2013B1368","journal-title":"SIAM J Sci Comput"},{"key":"586_CR34","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1007\/s00211-013-0571-3","volume":"126","author":"J-M Mirebeau","year":"2014","unstructured":"Mirebeau J-M (2014) Efficient fast marching with Finsler metrics. Numer Math 126:515\u2013557","journal-title":"Numer Math"},{"key":"586_CR35","doi-asserted-by":"crossref","first-page":"2608","DOI":"10.1137\/17M1127466","volume":"57","author":"J-M Mirebeau","year":"2019","unstructured":"Mirebeau J-M (2019) Riemannian fast-marching on cartesian grids, using Voronoi\u2019s first reduction of quadratic forms. SIAM J Numer Anal 57:2608\u20132655","journal-title":"SIAM J Numer Anal"},{"key":"586_CR36","doi-asserted-by":"crossref","first-page":"A1221","DOI":"10.1137\/19M1288802","volume":"43","author":"T Nakamura-Zimmerer","year":"2021","unstructured":"Nakamura-Zimmerer T, Gong Q, Kang W (2021) Adaptive deep learning for high-dimensional Hamilton\u2013Jacobi\u2013Bellman equations. SIAM J Sci Comput 43:A1221\u2013A1247","journal-title":"SIAM J Sci Comput"},{"key":"586_CR37","doi-asserted-by":"crossref","first-page":"795","DOI":"10.1007\/s10957-017-1183-3","volume":"175","author":"AZ Palmer","year":"2017","unstructured":"Palmer AZ, Vladimirsky A (2017) Optimal stopping with a probabilistic constraint. J Optim Theory Appl 175:795\u2013817","journal-title":"J Optim Theory Appl"},{"key":"586_CR38","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/0304-3975(91)90263-2","volume":"84","author":"CH Papadimitriou","year":"1991","unstructured":"Papadimitriou CH, Yannakakis M (1991) Shortest paths without a map. Theoret Comput Sci 84:127\u2013150","journal-title":"Theoret Comput Sci"},{"key":"586_CR39","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1007\/s00245-016-9378-9","volume":"77","author":"L Pfeiffer","year":"2018","unstructured":"Pfeiffer L (2018) Two approaches to stochastic optimal control problems with a final-time expectation constraint. Appl Math Optim 77:377\u2013404","journal-title":"Appl Math Optim"},{"key":"586_CR40","first-page":"133","volume":"27","author":"GH Polychronopoulos","year":"1996","unstructured":"Polychronopoulos GH, Tsitsiklis JN (1996) Stochastic shortest path problems with recourse. Netw Int J 27:133\u2013143","journal-title":"Netw Int J"},{"key":"586_CR41","doi-asserted-by":"crossref","first-page":"2010","DOI":"10.1007\/s10915-019-01077-z","volume":"81","author":"SF Potter","year":"2019","unstructured":"Potter SF, Cameron MK (2019) Ordered line integral methods for solving the Eikonal equation. J Sci Comput 81:2010\u20132050","journal-title":"J Sci Comput"},{"key":"586_CR42","doi-asserted-by":"crossref","first-page":"1215","DOI":"10.1109\/LRA.2018.2794582","volume":"3","author":"DR Robinson","year":"2018","unstructured":"Robinson DR, Mar RT, Estabridis K, Hewer G (2018) An efficient algorithm for optimal trajectory generation for heterogeneous multi-agent systems in non-convex environments. IEEE Robot Autom Lett 3:1215\u20131222","journal-title":"IEEE Robot Autom Lett"},{"key":"586_CR43","doi-asserted-by":"crossref","unstructured":"Sadovsky AV, Bilimoria KD (2016) Risk-hedged approach for re-routing air traffic under weather uncertainty. In: 16th AIAA aviation technology, integration, and operations conference, p\u00a03601","DOI":"10.2514\/6.2016-3601"},{"key":"586_CR44","doi-asserted-by":"crossref","first-page":"1591","DOI":"10.1073\/pnas.93.4.1591","volume":"93","author":"JA Sethian","year":"1996","unstructured":"Sethian JA (1996) A fast marching level set method for monotonically advancing fronts. Proc Natl Acad Sci 93:1591\u20131595","journal-title":"Proc Natl Acad Sci"},{"key":"586_CR45","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1137\/S0036144598347059","volume":"41","author":"JA Sethian","year":"1999","unstructured":"Sethian JA (1999) Fast marching methods. SIAM Rev 41:199\u2013235","journal-title":"SIAM Rev"},{"key":"586_CR46","doi-asserted-by":"crossref","first-page":"5699","DOI":"10.1073\/pnas.090060097","volume":"97","author":"JA Sethian","year":"2000","unstructured":"Sethian JA, Vladimirsky A (2000) Fast methods for the Eikonal and related Hamilton\u2013Jacobi equations on unstructured meshes. Proc Natl Acad Sci 97:5699\u20135703","journal-title":"Proc Natl Acad Sci"},{"key":"586_CR47","doi-asserted-by":"crossref","first-page":"11069","DOI":"10.1073\/pnas.201222998","volume":"98","author":"JA Sethian","year":"2001","unstructured":"Sethian JA, Vladimirsky A (2001) Ordered upwind methods for static Hamilton\u2013Jacobi equations. Proc Natl Acad Sci 98:11069\u201311074","journal-title":"Proc Natl Acad Sci"},{"key":"586_CR48","doi-asserted-by":"crossref","unstructured":"Shapiro A, Dentcheva D, Ruszczy\u0144ski A (2021) Lectures on stochastic programming: modeling and theory. SIAM","DOI":"10.1137\/1.9781611976595"},{"key":"586_CR49","doi-asserted-by":"crossref","first-page":"673","DOI":"10.1137\/S0036142901396533","volume":"41","author":"Y-HR Tsai","year":"2003","unstructured":"Tsai Y-HR, Cheng L-T, Osher S, Zhao H-K (2003) Fast sweeping algorithms for a class of Hamilton\u2013Jacobi equations. SIAM J Numer Anal 41:673\u2013694","journal-title":"SIAM J Numer Anal"},{"key":"586_CR50","doi-asserted-by":"crossref","first-page":"1528","DOI":"10.1109\/9.412624","volume":"40","author":"JN Tsitsiklis","year":"1995","unstructured":"Tsitsiklis JN (1995) Efficient algorithms for globally optimal trajectories. IEEE Trans Autom Control 40:1528\u20131538","journal-title":"IEEE Trans Autom Control"},{"key":"586_CR51","volume-title":"Optimal transport: old and new","author":"C Villani","year":"2008","unstructured":"Villani C (2008) Optimal transport: old and new, vol 338. Springer Science & Business Media, Cham"},{"key":"586_CR52","unstructured":"Vladimirsky A, Zheng C (2015) A fast implicit method for time-dependent Hamilton-Jacobi PDEs, Unpublished manuscript. Available at arXiv: http:\/\/arxiv.org\/abs\/1512.08734"},{"key":"586_CR53","doi-asserted-by":"crossref","first-page":"654","DOI":"10.1287\/opre.22.3.654","volume":"22","author":"D White","year":"1974","unstructured":"White D (1974) Dynamic programming and probabilistic constraints. Oper Res 22:654\u2013664","journal-title":"Oper Res"},{"key":"586_CR54","doi-asserted-by":"crossref","unstructured":"Yershov DS, LaValle SM (2013) Simplicial label correcting algorithms for continuous stochastic shortest path problems. In: Robotics and automation (ICRA), 2013 IEEE international conference on, IEEE, pp\u00a05062\u20135067","DOI":"10.1109\/ICRA.2013.6631300"},{"key":"586_CR55","volume-title":"Fundamentals of Kalman filtering: a practical approach","author":"P Zarchan","year":"2013","unstructured":"Zarchan P, Musoff H (2013) Fundamentals of Kalman filtering: a practical approach. American Institute of Aeronautics and Astronautics Inc, UK"},{"key":"586_CR56","doi-asserted-by":"crossref","first-page":"1873","DOI":"10.1137\/090770291","volume":"33","author":"Y-T Zhang","year":"2011","unstructured":"Zhang Y-T, Chen S, Li F, Zhao H, Shu C-W (2011) Uniformly accurate discontinuous Galerkin fast sweeping methods for Eikonal equations. SIAM J Sci Comput 33:1873\u20131896","journal-title":"SIAM J Sci Comput"},{"key":"586_CR57","doi-asserted-by":"crossref","first-page":"603","DOI":"10.1090\/S0025-5718-04-01678-3","volume":"74","author":"H Zhao","year":"2005","unstructured":"Zhao H (2005) A fast sweeping method for Eikonal equations. Math Comput 74:603\u2013627","journal-title":"Math Comput"}],"container-title":["Dynamic Games and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13235-024-00586-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s13235-024-00586-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13235-024-00586-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,19]],"date-time":"2025-05-19T07:11:03Z","timestamp":1747638663000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s13235-024-00586-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8,8]]},"references-count":57,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,5]]}},"alternative-id":["586"],"URL":"https:\/\/doi.org\/10.1007\/s13235-024-00586-3","relation":{},"ISSN":["2153-0785","2153-0793"],"issn-type":[{"type":"print","value":"2153-0785"},{"type":"electronic","value":"2153-0793"}],"subject":[],"published":{"date-parts":[[2024,8,8]]},"assertion":[{"value":"28 July 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 August 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical Approval"}}]}}