{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,5]],"date-time":"2026-01-05T21:03:15Z","timestamp":1767646995162,"version":"3.48.0"},"reference-count":54,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T00:00:00Z","timestamp":1764115200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T00:00:00Z","timestamp":1764115200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"funder":[{"name":"The key project of Hunan Provincial Department of Education","award":["No.24A0671"],"award-info":[{"award-number":["No.24A0671"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62306325"],"award-info":[{"award-number":["62306325"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"The key laboratory in college of Hunan Province","award":["2023-213(Xiang Jiao Tong)"],"award-info":[{"award-number":["2023-213(Xiang Jiao Tong)"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J. King Saud Univ. Comput. Inf. Sci."],"published-print":{"date-parts":[[2025,12]]},"DOI":"10.1007\/s44443-025-00352-4","type":"journal-article","created":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T10:48:33Z","timestamp":1764154113000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["MEC: a robot number optimization algorithm for coverage path planning with efficient Dubins robots"],"prefix":"10.1007","volume":"37","author":[{"given":"Lin","family":"Li","sequence":"first","affiliation":[]},{"given":"Xing","family":"Zhou","sequence":"additional","affiliation":[]},{"given":"SongChang","family":"Jin","sequence":"additional","affiliation":[]},{"given":"Dan","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Junfeng","family":"Man","sequence":"additional","affiliation":[]},{"given":"Dianxi","family":"Shi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,11,26]]},"reference":[{"key":"352_CR1","doi-asserted-by":"publisher","first-page":"1664","DOI":"10.1109\/TRO.2024.3355802","volume":"40","author":"S Agarwal","year":"2024","unstructured":"Agarwal S, Akella S (2024) Line coverage with multiple robots: algorithms and experiments. IEEE Trans Rob 40:1664\u20131683","journal-title":"IEEE Trans Rob"},{"key":"352_CR2","unstructured":"Bui X-N, Boissonnat J-D (1994) Accessibility region for a car that only moves forwards along optimal paths. PhD thesis, INRIA"},{"issue":"1","key":"352_CR3","doi-asserted-by":"publisher","first-page":"4","DOI":"10.3390\/drones3010004","volume":"3","author":"TM Cabreira","year":"2019","unstructured":"Cabreira TM, Brisolara LB, Ferreira PR Jr (2019) Survey on coverage path planning with unmanned aerial vehicles. Drones 3(1):4","journal-title":"Drones"},{"issue":"12","key":"352_CR4","doi-asserted-by":"publisher","first-page":"25546","DOI":"10.1109\/TITS.2021.3066240","volume":"23","author":"J Chen","year":"2021","unstructured":"Chen J, Du C, Zhang Y, Han P, Wei W (2021) A clustering-based coverage path planning method for autonomous heterogeneous uavs. IEEE Trans Intell Transp Syst 23(12):25546\u201325556","journal-title":"IEEE Trans Intell Transp Syst"},{"issue":"9","key":"352_CR5","doi-asserted-by":"publisher","first-page":"16842","DOI":"10.1109\/TITS.2021.3131473","volume":"23","author":"J Chen","year":"2021","unstructured":"Chen J, Zhang Y, Wu L, You T, Ning X (2021) An adaptive clustering-based algorithm for automatic path planning of heterogeneous uavs. IEEE Trans Intell Transp Syst 23(9):16842\u201316853","journal-title":"IEEE Trans Intell Transp Syst"},{"key":"352_CR6","doi-asserted-by":"crossref","unstructured":"Chen J, Chen T, Cao Y, Zhang Z, Le W, Han Y (2024) Information-integration-based optimal coverage path planning of agricultural unmanned systems formations: From theory to practice. J Ind Inf Integr 40:100617","DOI":"10.1016\/j.jii.2024.100617"},{"key":"352_CR7","unstructured":"Choton JC, Hsu WH (2024) Coverage path planning in precision agriculture: Algorithms, applications, and key benefits. arXiv:2412.19813"},{"key":"352_CR8","doi-asserted-by":"crossref","unstructured":"Choton JC, Prabhakar P (2023) Optimal multi-robot coverage path planning for agricultural fields using motion dynamics. In: 2023 IEEE International Conference on Robotics and Automation (ICRA), IEEE pp 11817\u201311823","DOI":"10.1109\/ICRA48891.2023.10160265"},{"key":"352_CR9","unstructured":"Davis L, et al (1985) Applying adaptive algorithms to epistatic domains. In: IJCAI, vol 85, pp 162\u2013164. Citeseer"},{"issue":"3","key":"352_CR10","doi-asserted-by":"publisher","first-page":"497","DOI":"10.2307\/2372560","volume":"79","author":"LE Dubins","year":"1957","unstructured":"Dubins LE (1957) On curves of minimal length with a constraint on average curvature, and with prescribed initial and terminal positions and tangents. Am J Math 79(3):497\u2013516","journal-title":"Am J Math"},{"key":"352_CR11","doi-asserted-by":"crossref","unstructured":"Faigl J, V\u00e1\u0148a P, Drchal J (2020) Fast sequence rejection for multi-goal planning with dubins vehicle. In: 2020 IEEE\/RSJ International Conference on Intelligent Robots and Systems (IROS), IEEE, pp 6773\u20136780","DOI":"10.1109\/IROS45743.2020.9340644"},{"key":"352_CR12","unstructured":"Food and Agriculture Organization of the United Nations (2017) The future of food and agriculture \u2013 trends and challenges. Technical report, Food and Agriculture Organization of the United Nations, Rome. https:\/\/www.fao.org\/3\/i6583e\/i6583e.pdf"},{"issue":"1","key":"352_CR13","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1109\/TCYB.2023.3265926","volume":"54","author":"J Fu","year":"2023","unstructured":"Fu J, Sun G, Liu J, Yao W, Wu L (2023) On hierarchical multi-uav dubins traveling salesman problem paths in a complex obstacle environment. IEEE Trans Cybern 54(1):123\u2013135","journal-title":"IEEE Trans Cybern"},{"issue":"1","key":"352_CR14","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1109\/TCYB.2023.3265926","volume":"54","author":"J Fu","year":"2024","unstructured":"Fu J, Sun G, Liu J, Yao W, Wu L (2024) On hierarchical multi-uav dubins traveling salesman problem paths in a complex obstacle environment. IEEE Trans Cybern 54(1):123\u2013135. https:\/\/doi.org\/10.1109\/TCYB.2023.3265926","journal-title":"IEEE Trans Cybern"},{"issue":"12","key":"352_CR15","doi-asserted-by":"publisher","first-page":"1258","DOI":"10.1016\/j.robot.2013.09.004","volume":"61","author":"E Galceran","year":"2013","unstructured":"Galceran E, Carreras M (2013) A survey on coverage path planning for robotics. Robot Auton Syst 61(12):1258\u20131276","journal-title":"Robot Auton Syst"},{"key":"352_CR16","unstructured":"Gretenstette J, Gopal R, Rosmaita B, Van\u00a0Gucht D (1985) Genetic algorithms for the travelling salesman problem. In: Proceedings First International Conference on Genetic Algorithms and Their Applications, pp 160\u2013168. Lawrence Erlbaum Associates Publisher NJ"},{"key":"352_CR17","doi-asserted-by":"crossref","unstructured":"Guimaraes\u00a0Macharet D, Alves\u00a0Neto A, Camara\u00a0Neto V, Montenegro\u00a0Campos M (2012) An evolutionary approach for the dubins\u2019 traveling salesman problem with neighborhoods. In: Proceedings of the 14th Annual Conference on Genetic and Evolutionary Computation, (2012), pp 377\u2013384","DOI":"10.1145\/2330163.2330218"},{"key":"352_CR18","doi-asserted-by":"crossref","unstructured":"Guo H, Miao Z, Ji J, Pan Q (2024) An effective collaboration evolutionary algorithm for multi-robot task allocation and scheduling in a smart farm. Knowl-Based Syst 289:111474","DOI":"10.1016\/j.knosys.2024.111474"},{"issue":"2","key":"352_CR19","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/j.orl.2007.05.001","volume":"36","author":"R Hassin","year":"2008","unstructured":"Hassin R, Keinan A (2008) Greedy heuristics with regret, with application to the cheapest insertion algorithm for the tsp. Oper Res Lett 36(2):243\u2013246","journal-title":"Oper Res Lett"},{"key":"352_CR20","doi-asserted-by":"crossref","unstructured":"Hazon N, Mieli F, Kaminka GA (2006) Towards robust on-line multi-robot coverage. In: Proceedings 2006 IEEE International Conference on Robotics and Automation, 2006. ICRA 2006., IEEE, pp 1710\u20131715","DOI":"10.1109\/ROBOT.2006.1641953"},{"key":"352_CR21","doi-asserted-by":"crossref","unstructured":"Karapetyan N, Moulton J, Lewis JS, Li AQ, O\u2019Kane JM, Rekleitis I (2018) Multi-robot dubins coverage with autonomous surface vehicles. In: International Conference on Robotics and Automation (ICRA), Brisbane, Australia, IEEE, pp 2373\u20132379","DOI":"10.1109\/ICRA.2018.8460661"},{"key":"352_CR22","doi-asserted-by":"crossref","unstructured":"Ku\u010derov\u00e1 K, V\u00e1\u0148a P, Faigl J (2021) Variable-speed traveling salesman problem for vehicles with curvature constrained trajectories. In: 2021 IEEE\/RSJ International Conference on Intelligent Robots and Systems (IROS), IEEE, pp 4714\u20134719","DOI":"10.1109\/IROS51168.2021.9636762"},{"key":"352_CR23","doi-asserted-by":"crossref","unstructured":"Ku\u010derov\u00e1 K, V\u00e1\u0148a P, Faigl J (2021) Variable-speed traveling salesman problem for vehicles with curvature constrained trajectories. In: 2021 IEEE\/RSJ International Conference on Intelligent Robots and Systems (IROS). IEEE","DOI":"10.1109\/IROS51168.2021.9636762"},{"key":"352_CR24","doi-asserted-by":"crossref","unstructured":"Ku\u010derov\u00e1 K, V\u00e1\u0148 P, Faigl J (2020) On finding time-efficient trajectories for fixed-wing aircraft using dubins paths with multiple radii. In: Proceedings of the 35th Annual ACM Symposium on Applied Computing, pp 829\u2013831","DOI":"10.1145\/3341105.3374112"},{"key":"352_CR25","doi-asserted-by":"crossref","unstructured":"Lal R, Prabhakar P (2021) Time-optimal multi-quadrotor trajectory planning for pesticide spraying. In: 2021 IEEE International Conference on Robotics and Automation (ICRA), IEEE, pp 7965\u20137971","DOI":"10.1109\/ICRA48506.2021.9561972"},{"key":"352_CR26","doi-asserted-by":"crossref","unstructured":"Lewis JS, Edwards W, Benson K, Rekleitis I, O\u2019Kane JM (2017) Semi-boustrophedon coverage with a dubins vehicle. In: 2017 IEEE\/RSJ International Conference on Intelligent Robots and Systems (IROS), Vancouver, BC, USA, IEEE, pp 5630\u20135637","DOI":"10.1109\/IROS.2017.8206451"},{"issue":"5","key":"352_CR27","doi-asserted-by":"publisher","first-page":"2560","DOI":"10.3390\/s23052560","volume":"23","author":"L Li","year":"2023","unstructured":"Li L, Shi D, Jin S, Yang S, Zhou C, Lian Y, Liu H (2023) Exact and heuristic multi-robot dubins coverage path planning for known environments. Sensors 23(5):2560","journal-title":"Sensors"},{"key":"352_CR28","doi-asserted-by":"crossref","unstructured":"Li L, Shi D, Jin S, Sun Y, Zhou X, Yang S, Liu H (2023) Collision-free coverage path planning for the variable-speed curvature-constrained robot. In: 2023 IEEE International Conference on Robotics and Automation (ICRA), IEEE, pp 3600\u20133606","DOI":"10.1109\/ICRA48891.2023.10160621"},{"key":"352_CR29","doi-asserted-by":"crossref","unstructured":"Li Y, Wu T, Xiao Y, Gong L, Liu C (2023) Path planning in continuous adjacent farmlands and robust path-tracking control of a rice-seeding robot in paddy field. Comput Electron Agric 210:107900","DOI":"10.1016\/j.compag.2023.107900"},{"key":"352_CR30","doi-asserted-by":"crossref","unstructured":"Ma X, Castanon DA (2006) Receding horizon planning for Dubins traveling salesman problems. In: Proceedings of the 45th IEEE Conference on Decision and Control. IEEE","DOI":"10.1109\/CDC.2006.376928"},{"issue":"2","key":"352_CR31","doi-asserted-by":"publisher","first-page":"2280","DOI":"10.1109\/LRA.2021.3061004","volume":"6","author":"DG Macharet","year":"2021","unstructured":"Macharet DG, Neto AA, Shishika D (2021) Minimal exposure Dubins orienteering problem. IEEE Robot Automat Lett 6(2):2280\u20132287","journal-title":"IEEE Robot Automat Lett"},{"issue":"9","key":"352_CR32","doi-asserted-by":"publisher","first-page":"2252","DOI":"10.1016\/j.automatica.2012.06.030","volume":"48","author":"AS Matveev","year":"2012","unstructured":"Matveev AS, Teimoori H, Savkin AV (2012) Method for tracking of environmental level sets by a unicycle-like vehicle. Automatica 48(9):2252\u20132261","journal-title":"Automatica"},{"issue":"4","key":"352_CR33","doi-asserted-by":"publisher","first-page":"2166","DOI":"10.1109\/LRA.2023.3248439","volume":"8","author":"G Mier","year":"2023","unstructured":"Mier G, Valente J, Bruin S (2023) Fields2cover: An open-source coverage path planning library for unmanned agricultural vehicles. IEEE Robot Automat Lett 8(4):2166\u20132172","journal-title":"IEEE Robot Automat Lett"},{"key":"352_CR34","doi-asserted-by":"crossref","unstructured":"Min HJ, Papanikolopoulos N (2011) The multi-robot coverage problem for optimal coordinated search with an unknown number of robots. In: 2011 IEEE International Conference on Robotics and Automation, IEEE, pp 2866\u20132871","DOI":"10.1109\/ICRA.2011.5979995"},{"issue":"6","key":"352_CR35","doi-asserted-by":"publisher","first-page":"982","DOI":"10.1287\/opre.1040.0205","volume":"53","author":"L Muyldermans","year":"2005","unstructured":"Muyldermans L, Beullens P, Cattrysse D, Van Oudheusden D (2005) Exploring variants of 2-opt and 3-opt for the general routing problem. Oper Res 53(6):982\u2013995","journal-title":"Oper Res"},{"key":"352_CR36","unstructured":"NEXAT GmbH (2025) NEXAT GmbH. Available online: https:\/\/www.nexat.de\/. Accessed: 2025-09-16"},{"issue":"12","key":"352_CR37","first-page":"22261","volume":"6","author":"N Saini","year":"2017","unstructured":"Saini N (2017) Review of selection methods in genetic algorithms. Int J Eng Comput Sci 6(12):22261\u201322263","journal-title":"Int J Eng Comput Sci"},{"key":"352_CR38","doi-asserted-by":"crossref","unstructured":"Savla K, Frazzoli E, Bullo F (2005) On the point-to-point and traveling salesperson problems for Dubins\u2019 vehicle. In: Proceedings of the 2005 American Control Conference. IEEE","DOI":"10.1109\/CDC.2006.377461"},{"issue":"3","key":"352_CR39","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1007\/s10514-019-09870-3","volume":"44","author":"J Song","year":"2020","unstructured":"Song J, Gupta S (2020) Care: Cooperative autonomy for resilience and efficiency of robot teams for complete coverage of unknown environments under robot failures. Auton Robot 44(3):647\u2013671","journal-title":"Auton Robot"},{"issue":"1","key":"352_CR40","first-page":"33","volume":"4","author":"J Song","year":"2018","unstructured":"Song J, Gupta S, Wettergren TA (2018) T*: Time-optimal risk-aware motion planning for curvature-constrained vehicles. IEEE Robot Automat Lett 4(1):33\u201340","journal-title":"IEEE Robot Automat Lett"},{"issue":"3","key":"352_CR41","first-page":"139","volume":"1","author":"OS Taiwo","year":"2013","unstructured":"Taiwo OS, Josiah O, Taiwo A, Dkhrullahi S, Sade OK (2013) Implementation of heuristics for solving travelling salesman problem using nearest neighbor and nearest insertion approaches. Int J Adv Res 1(3):139\u2013155","journal-title":"Int J Adv Res"},{"key":"352_CR42","doi-asserted-by":"crossref","unstructured":"Tan CS, Mohd-Mokhtar R, Arshad MR (2021) A comprehensive review of coverage path planning in robotics using classical and heuristic algorithms. IEEE Access","DOI":"10.1109\/ACCESS.2021.3108177"},{"key":"352_CR43","doi-asserted-by":"crossref","unstructured":"Vin\u00edcius\u00a0Faria, L.C., Caio\u00a0Ribeiro, C.G., Macharet, D.G.: Variable-speed dubins orienteering problem. In: 2024 Latin American Robotics Symposium (LARS), pp. 1\u20136 (2024). 10.1109\/LARS64411.2024.10786481","DOI":"10.1109\/LARS64411.2024.10786481"},{"key":"352_CR44","doi-asserted-by":"crossref","unstructured":"Wang N, Jin Z, Wang T, Xiao J, Zhang Z, Wang H, Zhang M, Li H (2025) Hybrid path planning methods for complete coverage in harvesting operation scenarios. Comput Electron Agric 231:109946","DOI":"10.1016\/j.compag.2025.109946"},{"key":"352_CR45","doi-asserted-by":"crossref","unstructured":"Wilson JP, Gupta S, Wettergren TA (2025) Generalized multi-speed dubins motion model. IEEE Trans Robot","DOI":"10.1109\/TRO.2025.3554436"},{"key":"352_CR46","doi-asserted-by":"crossref","unstructured":"Wilson JP, Shen Z, Gupta S, Wettergren TA (2020) $$t^{\\star }$$-lite: A fast time-risk optimal motion planning algorithm for multi-speed autonomous vehicles. In: Global Oceans 2020: Singapore \u2013 U.S. Gulf Coast, pp 1\u20136","DOI":"10.1109\/IEEECONF38699.2020.9389426"},{"issue":"1","key":"352_CR47","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/s10514-020-09946-5","volume":"45","author":"A Wolek","year":"2021","unstructured":"Wolek A, McMahon J, Dzikowicz BR, Houston BH (2021) The orbiting dubins traveling salesman problem: planning inspection tours for a minehunting auv. Auton Robot 45(1):31\u201349","journal-title":"Auton Robot"},{"key":"352_CR48","doi-asserted-by":"publisher","first-page":"1543643","DOI":"10.3389\/fncom.2025.1543643","volume":"19","author":"Z Xing","year":"2025","unstructured":"Xing Z, Meng Z, Zheng G, Ma G, Yang L, Guo X, Tan L, Jiang Y, Wu H (2025) Intelligent rehabilitation in an aging population: empowering human-machine interaction for hand function rehabilitation through 3d deep learning and point cloud. Front Comput Neurosci 19:1543643","journal-title":"Front Comput Neurosci"},{"key":"352_CR49","doi-asserted-by":"crossref","unstructured":"Xing Z, Ma G, Wang L, Yang L, Guo X, Chen S (2025) Towards visual interaction: hand segmentation by combining 3d graph deep learning and laser point cloud for intelligent rehabilitation. IEEE Internet of Things J","DOI":"10.1109\/JIOT.2025.3546874"},{"key":"352_CR50","doi-asserted-by":"crossref","unstructured":"Yu X, Hung JY (2012) A genetic algorithm for the dubins traveling salesman problem. In: 2012 IEEE International Symposium on Industrial Electronics, pp 1256\u20131261","DOI":"10.1109\/ISIE.2012.6237270"},{"key":"352_CR51","doi-asserted-by":"crossref","unstructured":"Zheng Y, Chen Z, Shao X, Zhao W (2021) Time-optimal guidance for intercepting moving targets by dubins vehicles. Automatica 128:109557","DOI":"10.1016\/j.automatica.2021.109557"},{"key":"352_CR52","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.knosys.2019.03.033","volume":"177","author":"X Zhou","year":"2019","unstructured":"Zhou X, Wang H, Ding B, Peng W, Wang R (2019) Multi-objective evolutionary computation for topology coverage assessment problem. Knowl-Based Syst 177:1\u201310","journal-title":"Knowl-Based Syst"},{"key":"352_CR53","doi-asserted-by":"publisher","unstructured":"Zhou X, Li L, Zhang X, Gao H, Yao K, Xu X (2025) A unified and quality-guaranteed approach for dubins vehicle path planning with obstacle avoidance and curvature constraint. IEEE Trans Intell Transport Syst, 1\u201317. https:\/\/doi.org\/10.1109\/TITS.2025.3606479","DOI":"10.1109\/TITS.2025.3606479"},{"key":"352_CR54","doi-asserted-by":"crossref","unstructured":"Zhou X, Wang H, Ding B (2018) How many robots are enough: A multi-objective genetic algorithm for the single-objective time-limited complete coverage problem. In: IEEE 2018 International Conference on Robotics and Automation (ICRA), Brisbane, Australia, pp 2380\u20132387. IEEE","DOI":"10.1109\/ICRA.2018.8461028"}],"container-title":["Journal of King Saud University Computer and Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s44443-025-00352-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s44443-025-00352-4","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s44443-025-00352-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,5]],"date-time":"2026-01-05T18:47:50Z","timestamp":1767638870000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s44443-025-00352-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,26]]},"references-count":54,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2025,12]]}},"alternative-id":["352"],"URL":"https:\/\/doi.org\/10.1007\/s44443-025-00352-4","relation":{},"ISSN":["1319-1578","2213-1248"],"issn-type":[{"type":"print","value":"1319-1578"},{"type":"electronic","value":"2213-1248"}],"subject":[],"published":{"date-parts":[[2025,11,26]]},"assertion":[{"value":"14 August 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 October 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 November 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of Interest\/Competing Interests"}}],"article-number":"337"}}