{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T16:41:02Z","timestamp":1757608862053,"version":"3.44.0"},"reference-count":30,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,5,19]],"date-time":"2025-05-19T00:00:00Z","timestamp":1747612800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,5,19]],"date-time":"2025-05-19T00:00:00Z","timestamp":1747612800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100000266","name":"EPSRC","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,5,19]]},"DOI":"10.1109\/icra55743.2025.11128792","type":"proceedings-article","created":{"date-parts":[[2025,9,2]],"date-time":"2025-09-02T17:28:56Z","timestamp":1756834136000},"page":"5401-5407","source":"Crossref","is-referenced-by-count":0,"title":["An Efficient NSGA-II-Based Algorithm for Multi-Robot Coverage Path Planning"],"prefix":"10.1109","author":[{"given":"Ashley J. I.","family":"Foster","sequence":"first","affiliation":[{"name":"University of Plymouth"}]},{"given":"Mario","family":"Gianni","sequence":"additional","affiliation":[{"name":"University of Liverpool"}]},{"given":"Amir","family":"Aly","sequence":"additional","affiliation":[{"name":"University of Plymouth"}]},{"given":"Hooman","family":"Samani","sequence":"additional","affiliation":[{"name":"University of the Arts London"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2018.8460661"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.3390\/rs15010093"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2004.10.004"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.55417\/fr.2022064"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2023.3322230"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2021.107612"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.3390\/drones8010010"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/IROS45743.2020.9341089"},{"volume-title":"Multi-Objective Optimization Using Evolutionary Algorithms.","year":"2001","author":"Deb","key":"ref9"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/358923.358929"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/4235.797969"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2010.2059031"},{"volume-title":"Evolutionary Algorithms for Solving Multi-Objective Problems.","year":"2007","author":"Coello","key":"ref13"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1080\/21642583.2019.1674220"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.1070.0209"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1177\/1729881416663664"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ICEC.1995.489161"},{"issue":"July.","key":"ref18","first-page":"416","article-title":"Genetic algorithms for multi-objective optimization: formulationdiscussion and generalization","volume-title":"Icga","volume":"93","author":"Fonseca","year":"1993"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/4235.996017"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/VTC2023-Fall60731.2023.10333601"},{"key":"ref21","doi-asserted-by":"crossref","first-page":"103520","DOI":"10.1016\/j.adhoc.2024.103520","article-title":"Multi-objective path planning for multi-uav connectivity and area coverage","volume":"160","author":"G\u00fcven","year":"2024","journal-title":"Ad Hoc Networks"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44874-8"},{"key":"ref23","first-page":"154","article-title":"AllelesLociand the traveling salesman problem","volume-title":"1st International Conference on Genetic Algorithms.","author":"Goldberg"},{"volume-title":"Handbook of Genetic Algorithms","year":"1991","author":"Davis","key":"ref24"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1155\/2017\/7430125"},{"key":"ref26","first-page":"224","article-title":"A study of permutation crossover operators on the traveling salesman problem","volume-title":"2nd International Conference on Genetic Algorithms on Genetic Algorithms and Their Application.","author":"Oliver"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2022.3151791"},{"key":"ref28","article-title":"Design and application of genetic algorithms for the multiple traveling salesperson assignment problem","volume-title":"Ph.D. dissertation","author":"Carter","year":"2003"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2017.12.031"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ICUAS60882.2024.10556959"}],"event":{"name":"2025 IEEE International Conference on Robotics and Automation (ICRA)","start":{"date-parts":[[2025,5,19]]},"location":"Atlanta, GA, USA","end":{"date-parts":[[2025,5,23]]}},"container-title":["2025 IEEE International Conference on Robotics and Automation (ICRA)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11127273\/11127223\/11128792.pdf?arnumber=11128792","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,3]],"date-time":"2025-09-03T06:53:38Z","timestamp":1756882418000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11128792\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5,19]]},"references-count":30,"URL":"https:\/\/doi.org\/10.1109\/icra55743.2025.11128792","relation":{},"subject":[],"published":{"date-parts":[[2025,5,19]]}}}