{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T11:04:11Z","timestamp":1762254251723,"version":"3.37.3"},"reference-count":49,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,9,1]],"date-time":"2022-09-01T00:00:00Z","timestamp":1661990400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,9,1]],"date-time":"2022-09-01T00:00:00Z","timestamp":1661990400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Ministry of Science and ICT, the Republic of Korea"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Intell Robot Syst"],"published-print":{"date-parts":[[2022,9]]},"DOI":"10.1007\/s10846-022-01732-y","type":"journal-article","created":{"date-parts":[[2022,9,17]],"date-time":"2022-09-17T17:02:32Z","timestamp":1663434152000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Robust Task Allocation for Multiple Cooperative Robotic Vehicles Considering Node Position Uncertainty"],"prefix":"10.1007","volume":"106","author":[{"given":"Sukmin","family":"Yoon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haggi","family":"Do","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6886-2449","authenticated-orcid":false,"given":"Jinwhan","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,9,17]]},"reference":[{"issue":"99","key":"1732_CR1","first-page":"1","volume":"1","author":"N Geng","year":"2018","unstructured":"Geng, N., Meng, Q., Gong, D., Chung, P.W.: How good are distributed allocation algorithms for solving urban search and rescue problems? a comparative study with centralized algorithms. IEEE Trans. Autom. Sci. Eng. 1(99), 1\u20138 (2018)","journal-title":"IEEE Trans. Autom. Sci. Eng."},{"key":"1732_CR2","doi-asserted-by":"crossref","unstructured":"Meuth, R.J., Saad, E.W., Wunsch, D.C., Vian, J.: Adaptive task allocation for search area coverage. In: 2009 IEEE International Conference on Technologies for Practical Robot Applications, pp 67\u201374. IEEE (2009)","DOI":"10.1109\/TEPRA.2009.5339643"},{"issue":"1","key":"1732_CR3","doi-asserted-by":"publisher","first-page":"41","DOI":"10.26748\/KSOE.2021.097","volume":"36","author":"J Jang","year":"2022","unstructured":"Jang, J., Do, H., Kim, J.: Mission planning for underwater survey with autonomous marine vehicles. J. Ocean Eng. Technol. 36(1), 41\u201349 (2022)","journal-title":"J. Ocean Eng. Technol."},{"key":"1732_CR4","doi-asserted-by":"publisher","first-page":"1577","DOI":"10.1007\/978-3-319-32552-1\u2216_60","volume-title":"Disaster Robotics","author":"RR Murphy","year":"2016","unstructured":"Murphy, R.R., Tadokoro, S., Kleiner, A.: Disaster Robotics, pp 1577\u20131604. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-32552-1\u2216_60"},{"key":"1732_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-1-84882-474-4\u2216_1","volume-title":"Earthquake Disaster and Expectation for Robotics","author":"S Tadokoro","year":"2009","unstructured":"Tadokoro, S.: Earthquake Disaster and Expectation for Robotics, pp 1\u201316. Springer, London (2009). https:\/\/doi.org\/10.1007\/978-1-84882-474-4\u2216_1"},{"issue":"3","key":"1732_CR6","doi-asserted-by":"publisher","first-page":"516","DOI":"10.1109\/TASE.2012.2201470","volume":"9","author":"J Chen","year":"2012","unstructured":"Chen, J., Sun, D.: Coalition-based approach to task allocation of multiple robots with resource constraints. IEEE Trans. Autom. Sci. Eng. 9(3), 516\u2013528 (2012)","journal-title":"IEEE Trans. Autom. Sci. Eng."},{"key":"1732_CR7","doi-asserted-by":"crossref","unstructured":"Fu, B., Smith, W., Rizzo, D., Castanier, M., Ghaffari, M., Barton, K.: Robust task scheduling for heterogeneous robot teams under capability uncertainty. arXiv:2106.12111 (2021)","DOI":"10.26226\/morressier.608c2248dc2fa1af562471c6"},{"issue":"3","key":"1732_CR8","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/j.omega.2004.10.004","volume":"34","author":"T Bektas","year":"2006","unstructured":"Bektas, T.: The multiple traveling salesman problem: an overview of formulations and solution procedures. Omega 34(3), 209\u2013219 (2006)","journal-title":"Omega"},{"issue":"1","key":"1732_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2011.07.037","volume":"218","author":"R Baldacci","year":"2012","unstructured":"Baldacci, R., Mingozzi, A., Roberti, R.: Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints. Eur. J. Oper. Res. 218(1), 1\u20136 (2012)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"1732_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2013.02.053","volume":"231","author":"T Vidal","year":"2013","unstructured":"Vidal, T., Crainic, T.G., Gendreau, M., Prins, C.: Heuristics for multi-attribute vehicle routing problems: a survey and synthesis. Eur. J. Oper. Res. 231(1), 1\u201321 (2013)","journal-title":"Eur. J. Oper. Res."},{"key":"1732_CR11","unstructured":"Lindemann, L., Nowak, J., Sch\u00f6nb\u00e4chler, L., Guo, M., Tumova, J., Dimarogonas, D.V.: Coupled multi-robot systems under linear temporal logic and signal temporal logic tasks. IEEE Trans. Control Syst. Technol. (2019)"},{"issue":"11","key":"1732_CR12","doi-asserted-by":"publisher","first-page":"1017","DOI":"10.1057\/jors.1980.188","volume":"31","author":"G Laporte","year":"1980","unstructured":"Laporte, G., Nobert, Y.: A cutting planes algorithm for the m-salesmen problem. J. Oper. Res. Soc. 31(11), 1017\u20131023 (1980)","journal-title":"J. Oper. Res. Soc."},{"issue":"2","key":"1732_CR13","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/s10107-003-0481-8","volume":"100","author":"J Lysgaard","year":"2004","unstructured":"Lysgaard, J., Letchford, A.N., Eglese, R.W.: A new branch-and-cut algorithm for the capacitated vehicle routing problem. Math. Program. 100(2), 423\u2013445 (2004)","journal-title":"Math. Program."},{"key":"1732_CR14","unstructured":"Fogel, D.B.: A parallel processing approach to a multiple travelling salesman problem using evolutionary programming. In: Proceedings of the Fourth Annual Symposium on Parallel Processing, pp 318\u2013326, Fullerton, CA (1990)"},{"issue":"3","key":"1732_CR15","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1287\/opre.1120.1048","volume":"60","author":"T Vidal","year":"2012","unstructured":"Vidal, T., Crainic, T.G., Gendreau, M., Lahrichi, N., Rei, W.: A hybrid genetic algorithm for multidepot and periodic vehicle routing problems. Oper. Res. 60(3), 611\u2013624 (2012)","journal-title":"Oper. Res."},{"issue":"3","key":"1732_CR16","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1007\/s10846-012-9800-8","volume":"72","author":"K Zhang","year":"2013","unstructured":"Zhang, K., Collins, E.G., Barbu, A.: An efficient stochastic clustering auction for heterogeneous robotic collaborative teams. J. Intell. Robot. Syst. 72(3), 541\u2013558 (2013)","journal-title":"J. Intell. Robot. Syst."},{"key":"1732_CR17","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1016\/j.engappai.2014.10.015","volume":"38","author":"A Kir\u00e1ly","year":"2015","unstructured":"Kir\u00e1ly, A., Abonyi, J.: Redesign of the supply of mobile mechanics based on a novel genetic optimization algorithm using Google Maps API. Eng. Appl. Artif. Intel. 38, 122\u2013130 (2015)","journal-title":"Eng. Appl. Artif. Intel."},{"key":"1732_CR18","doi-asserted-by":"crossref","unstructured":"Arbelaez, A., Mehta, D., O\u2019Sullivan, B., Quesada, L.: A constraint-based local search for edge disjoint rooted distance-constrained minimum spanning tree problem. In: International Conference on AI and OR Techniques in Constriant Programming for Combinatorial Optimization Problems, pp 31\u201346. Springer (2015)","DOI":"10.1007\/978-3-319-18008-3_3"},{"key":"1732_CR19","doi-asserted-by":"crossref","unstructured":"Shaw, P.: Using constraint programming and local search methods to solve vehicle routing problems. In: International Conference on Principles and Practice of Constraint Programming, pp 417\u2013431. Springer (1998)","DOI":"10.1007\/3-540-49481-2_30"},{"key":"1732_CR20","doi-asserted-by":"crossref","unstructured":"Pesant, G.: Counting-based search for constraint optimization problems. In: Thirtieth AAAI Conference on Artificial Intelligence (2016)","DOI":"10.1609\/aaai.v30i1.10433"},{"issue":"2","key":"1732_CR21","doi-asserted-by":"publisher","first-page":"732","DOI":"10.1109\/TASE.2017.2679278","volume":"15","author":"A Whitbrook","year":"2018","unstructured":"Whitbrook, A., Meng, Q., Chung, P.W.: Reliable, distributed scheduling and rescheduling for time-critical, multiagent systems. IEEE Trans. Autom. Sci. Eng. 15(2), 732\u2013747 (2018)","journal-title":"IEEE Trans. Autom. Sci. Eng."},{"issue":"2","key":"1732_CR22","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1016\/j.ejor.2013.04.058","volume":"235","author":"G Pantuso","year":"2014","unstructured":"Pantuso, G., Fagerholt, K., Hvattum, L.M.: A survey on maritime fleet size and mix problems. Eur. J. Oper. Res. 235(2), 341\u2013349 (2014)","journal-title":"Eur. J. Oper. Res."},{"key":"1732_CR23","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/j.cor.2015.05.004","volume":"64","author":"\u00c7 Ko\u00e7","year":"2015","unstructured":"Ko\u00e7, \u00c7, Bekta\u015f, T., Jabali, O., Laporte, G.: A hybrid evolutionary algorithm for heterogeneous fleet vehicle routing problems with time windows. Comput. Oper. Res 64, 11\u201327 (2015)","journal-title":"Comput. Oper. Res"},{"issue":"11","key":"1732_CR24","doi-asserted-by":"publisher","first-page":"1912","DOI":"10.1016\/j.cor.2009.07.004","volume":"37","author":"C Duhamel","year":"2010","unstructured":"Duhamel, C., Lacomme, P., Prins, C., Prodhon, C.: AGRASP\u00d7 ELS approach for the capacitated location-routing problem. Comput. Oper. Res. 37(11), 1912\u20131923 (2010)","journal-title":"Comput. Oper. Res."},{"issue":"12","key":"1732_CR25","doi-asserted-by":"publisher","first-page":"3215","DOI":"10.1016\/j.cor.2012.04.007","volume":"39","author":"VC Hemmelmayr","year":"2012","unstructured":"Hemmelmayr, V.C., Cordeau, J.-F., Crainic, T.G.: An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics. Comput. Oper. Res. 39(12), 3215\u20133228 (2012)","journal-title":"Comput. Oper. Res."},{"issue":"7","key":"1732_CR26","doi-asserted-by":"publisher","first-page":"1633","DOI":"10.3934\/dcdss.2021145","volume":"15","author":"V Djordjevic","year":"2022","unstructured":"Djordjevic, V., Stojanovic, V., Tao, H., Song, X., He, S., Gao, W.: Data-driven control of hydraulic servo actuator based on adaptive dynamic programming. Discret. Contin. Dyn. Syst.-S 15(7), 1633 (2022)","journal-title":"Discret. Contin. Dyn. Syst.-S"},{"key":"1732_CR27","doi-asserted-by":"publisher","first-page":"105042","DOI":"10.1016\/j.conengprac.2021.105042","volume":"121","author":"Y Jiang","year":"2022","unstructured":"Jiang, Y., Gao, W., Na, J., Zhang, D., H\u00e4m\u00e4l\u00e4inen, T.T., Stojanovic, V., Lewis, F.L.: Value iteration and adaptive optimal output regulation with assured convergence rate. Control. Eng. Pract. 121, 105042 (2022)","journal-title":"Control. Eng. Pract."},{"issue":"1","key":"1732_CR28","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1287\/trsc.1050.0134","volume":"40","author":"S Lan","year":"2006","unstructured":"Lan, S., Clarke, J.-P., Barnhart, C.: Planning for robust airline operations: Optimizing aircraft routings and flight departure times to minimize passenger disruptions. Transp. Sci. 40(1), 15\u201328 (2006)","journal-title":"Transp. Sci."},{"issue":"1","key":"1732_CR29","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/j.ejor.2016.09.062","volume":"259","author":"J Kallrath","year":"2017","unstructured":"Kallrath, J., Klosterhalfen, S., Walter, M., Fischer, G., Blackburn, R.: Payload-based fleet optimization for rail cars in the chemical industry. Eur. J. Oper. Res. 259(1), 113\u2013129 (2017)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"1732_CR30","doi-asserted-by":"publisher","first-page":"844","DOI":"10.1016\/j.ejor.2018.02.023","volume":"269","author":"AS Elgesem","year":"2018","unstructured":"Elgesem, A.S., Skogen, E.S., Wang, X., Fagerholt, K.: A traveling salesman problem with pickups and deliveries and stochastic travel times: An application from chemical shipping. Eur. J. Oper. Res. 269 (3), 844\u2013859 (2018)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"1732_CR31","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1287\/mnsc.1120.1615","volume":"59","author":"S Zymler","year":"2013","unstructured":"Zymler, S., Kuhn, D., Rustem, B.: Worst-case value at risk of nonlinear portfolios. Manag. Sci. 59(1), 172\u2013188 (2013)","journal-title":"Manag. Sci."},{"issue":"2","key":"1732_CR32","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1016\/j.ejor.2013.10.060","volume":"234","author":"PN Kolm","year":"2014","unstructured":"Kolm, P.N., T\u00fct\u00fcnc\u00fc, R., Fabozzi, F.J.: 60 years of portfolio optimization: Practical challenges and current trends. Eur. J. Oper. Res. 234(2), 356\u2013371 (2014)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"1732_CR33","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0167-6377(99)00016-4","volume":"25","author":"A Ben-Tal","year":"1999","unstructured":"Ben-Tal, A., Nemirovski, A.: Robust solutions of uncertain linear programs. Oper. Res. Lett. 25(1), 1\u201313 (1999)","journal-title":"Oper. Res. Lett."},{"issue":"3","key":"1732_CR34","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1137\/080734510","volume":"53","author":"D Bertsimas","year":"2011","unstructured":"Bertsimas, D., Brown, D.B., Caramanis, C.: Theory and applications of robust optimization. SIAM Rev. 53(3), 464\u2013501 (2011)","journal-title":"SIAM Rev."},{"issue":"3","key":"1732_CR35","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1016\/j.ejor.2013.09.036","volume":"235","author":"V Gabrel","year":"2014","unstructured":"Gabrel, V., Murat, C., Thiele, A.: Recent advances in robust optimization: An overview. Eur. J. Oper. Res. 235(3), 471\u2013483 (2014)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"1732_CR36","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1287\/opre.1030.0065","volume":"52","author":"D Bertsimas","year":"2004","unstructured":"Bertsimas, D., Sim, M.: The price of robustness. Oper. Res. 52(1), 35\u201353 (2004)","journal-title":"Oper. Res."},{"key":"1732_CR37","doi-asserted-by":"crossref","unstructured":"Ponda, S.S., Johnson, L.B., How, J.P.: Distributed chance-constrained task allocation for autonomous multi-agent teams. In: American Control Conference (ACC) 2012, pp 4528\u20134533. IEEE (2012)","DOI":"10.1109\/ACC.2012.6315626"},{"issue":"1","key":"1732_CR38","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/s10514-021-10022-9","volume":"46","author":"S Choudhury","year":"2022","unstructured":"Choudhury, S., Gupta, J.K., Kochenderfer, M.J., Sadigh, D., Bohg, J.: Dynamic multi-robot task allocation under uncertainty and temporal constraints. Auton. Robot. 46(1), 231\u2013247 (2022)","journal-title":"Auton. Robot."},{"issue":"4","key":"1732_CR39","doi-asserted-by":"publisher","first-page":"2025","DOI":"10.1109\/TASE.2020.2986641","volume":"17","author":"A Prorok","year":"2020","unstructured":"Prorok, A.: Robust assignment using redundant robots on transport networks with uncertain travel time. IEEE Trans. Autom. Sci. Eng. 17(4), 2025\u20132037 (2020)","journal-title":"IEEE Trans. Autom. Sci. Eng."},{"issue":"1","key":"1732_CR40","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/s10957-014-0638-z","volume":"166","author":"L Bertazzi","year":"2015","unstructured":"Bertazzi, L., Maggioni, F.: Solution approaches for the stochastic capacitated traveling salesmen location problem with recourse. J. Optim. Theory Appl. 166(1), 321\u2013342 (2015)","journal-title":"J. Optim. Theory Appl."},{"key":"1732_CR41","unstructured":"Ponda, S.S.: Robust distributed planning strategies for autonomous multi-agent teams. PhD thesis Massachusetts Institute of Technology (2012)"},{"issue":"8","key":"1732_CR42","doi-asserted-by":"publisher","first-page":"2258","DOI":"10.1109\/TAC.2014.2303232","volume":"59","author":"K Margellos","year":"2014","unstructured":"Margellos, K., Goulart, P., Lygeros, J.: On the road between robust optimization and the scenario approach for chance constrained optimization problems. IEEE Trans. Autom. Control 59(8), 2258\u20132263 (2014)","journal-title":"IEEE Trans. Autom. Control"},{"issue":"1","key":"1732_CR43","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/j.ejor.2016.06.019","volume":"256","author":"Y Sun","year":"2017","unstructured":"Sun, Y., Aw, G., Loxton, R., Teo, K.L.: Chance-constrained optimization for pension fund portfolios in the presence of default risk. Eur. J. Oper. Res. 256(1), 205\u2013214 (2017)","journal-title":"Eur. J. Oper. Res."},{"issue":"02","key":"1732_CR44","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1142\/S0217595907001115","volume":"24","author":"C-J Lin","year":"2007","unstructured":"Lin, C.-J., Wen, U.-P.: Sensitivity analysis of objective function coefficients of the assignment problem. Asia-Pacific J. Oper. Res. 24(02), 203\u2013221 (2007)","journal-title":"Asia-Pacific J. Oper. Res."},{"issue":"7","key":"1732_CR45","doi-asserted-by":"publisher","first-page":"936","DOI":"10.1177\/0278364911404579","volume":"30","author":"L Liu","year":"2011","unstructured":"Liu, L., Shell, D.A.: Assessing optimal assignment under uncertainty: An interval-based algorithm. Int. J. Robot. Res. 30(7), 936\u2013953 (2011)","journal-title":"Int. J. Robot. Res."},{"issue":"12","key":"1732_CR46","doi-asserted-by":"publisher","first-page":"1495","DOI":"10.1177\/0278364913496484","volume":"32","author":"GA Korsah","year":"2013","unstructured":"Korsah, G.A., Stentz, A., Dias, M.B.: A comprehensive taxonomy for multi-robot task allocation. Int. J. Robot. Res. 32(12), 1495\u20131512 (2013)","journal-title":"Int. J. Robot. Res."},{"key":"1732_CR47","unstructured":"van Leeuwen, J., Schoone, A.A., et al.: Untangling a Traveling Salesman Tour in the Plane. Rijksuniversiteit. Vakgroep Informatica, Utrecht (1980)"},{"key":"1732_CR48","unstructured":"Kettani, H., Ostrouchov, G.: On the distribution of the distance between two multivariate normally distributed points. Department of Computer Science and Information Systems Engineering, Fort Hays State University, Fort Hays (KS) (2005)"},{"issue":"2","key":"1732_CR49","first-page":"327","volume":"10","author":"V Ejov","year":"2006","unstructured":"Ejov, V., Filar, J., Lucas, S., Nelson, J.: Solving the Hamiltonian cycle problem using symbolic determinants. Taiw. J. Math. 10(2), 327 (2006)","journal-title":"Taiw. J. Math."}],"container-title":["Journal of Intelligent & Robotic Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10846-022-01732-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10846-022-01732-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10846-022-01732-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,22]],"date-time":"2022-09-22T12:34:21Z","timestamp":1663850061000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10846-022-01732-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9]]},"references-count":49,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,9]]}},"alternative-id":["1732"],"URL":"https:\/\/doi.org\/10.1007\/s10846-022-01732-y","relation":{},"ISSN":["0921-0296","1573-0409"],"issn-type":[{"type":"print","value":"0921-0296"},{"type":"electronic","value":"1573-0409"}],"subject":[],"published":{"date-parts":[[2022,9]]},"assertion":[{"value":"18 November 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 August 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 September 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics Approval"}},{"value":"Not applicable","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for Publication"}},{"value":"Not applicable","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to Participate"}},{"value":"The authors have no relevant financial or non-financial interests to disclose.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing Interests"}}],"article-number":"23"}}