{"id":"https://openalex.org/W4416723520","doi":"https://doi.org/10.1007/s44443-025-00352-4","title":"MEC: a robot number optimization algorithm for coverage path planning with efficient Dubins robots","display_name":"MEC: a robot number optimization algorithm for coverage path planning with efficient Dubins robots","publication_year":2025,"publication_date":"2025-11-26","ids":{"openalex":"https://openalex.org/W4416723520","doi":"https://doi.org/10.1007/s44443-025-00352-4"},"language":"en","primary_location":{"id":"doi:10.1007/s44443-025-00352-4","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s44443-025-00352-4","pdf_url":"https://link.springer.com/content/pdf/10.1007/s44443-025-00352-4.pdf","source":{"id":"https://openalex.org/S2764955546","display_name":"Journal of King Saud University - Computer and Information Sciences","issn_l":"1319-1578","issn":["1319-1578","2213-1248"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of King Saud University Computer and Information Sciences","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://link.springer.com/content/pdf/10.1007/s44443-025-00352-4.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5100459657","display_name":"Lin Li","orcid":"https://orcid.org/0000-0001-8645-0392"},"institutions":[{"id":"https://openalex.org/I916048824","display_name":"Hunan First Normal University","ror":"https://ror.org/00s9d1a36","country_code":"CN","type":"education","lineage":["https://openalex.org/I916048824"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Lin Li","raw_affiliation_strings":["School of Intelligent Manufacturing, Hunan First Normal University, FenglinLu, ChangSha, Hunan Province, 410205, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Intelligent Manufacturing, Hunan First Normal University, FenglinLu, ChangSha, Hunan Province, 410205, China","institution_ids":["https://openalex.org/I916048824"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101851239","display_name":"Xing Zhou","orcid":"https://orcid.org/0000-0001-6358-1621"},"institutions":[{"id":"https://openalex.org/I170215575","display_name":"National University of Defense Technology","ror":"https://ror.org/05d2yfz11","country_code":"CN","type":"education","lineage":["https://openalex.org/I170215575"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Xing Zhou","raw_affiliation_strings":["College of Intelligence Science and Technology, National University of Defense Technology, DeYalu, ChangSha, Hunan Province, 410073, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"College of Intelligence Science and Technology, National University of Defense Technology, DeYalu, ChangSha, Hunan Province, 410073, China","institution_ids":["https://openalex.org/I170215575"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100707142","display_name":"Songchang Jin","orcid":"https://orcid.org/0000-0002-5959-0768"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"SongChang Jin","raw_affiliation_strings":["Intelligent Game and Decision Lab, Beijing, 100071, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Intelligent Game and Decision Lab, Beijing, 100071, China","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101775102","display_name":"Dan Chen","orcid":"https://orcid.org/0000-0003-1635-229X"},"institutions":[{"id":"https://openalex.org/I916048824","display_name":"Hunan First Normal University","ror":"https://ror.org/00s9d1a36","country_code":"CN","type":"education","lineage":["https://openalex.org/I916048824"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Dan Chen","raw_affiliation_strings":["School of Intelligent Manufacturing, Hunan First Normal University, FenglinLu, ChangSha, Hunan Province, 410205, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Intelligent Manufacturing, Hunan First Normal University, FenglinLu, ChangSha, Hunan Province, 410205, China","institution_ids":["https://openalex.org/I916048824"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5089198064","display_name":"Junfeng Man","orcid":"https://orcid.org/0000-0002-9867-178X"},"institutions":[{"id":"https://openalex.org/I916048824","display_name":"Hunan First Normal University","ror":"https://ror.org/00s9d1a36","country_code":"CN","type":"education","lineage":["https://openalex.org/I916048824"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Junfeng Man","raw_affiliation_strings":["School of Intelligent Manufacturing, Hunan First Normal University, FenglinLu, ChangSha, Hunan Province, 410205, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Intelligent Manufacturing, Hunan First Normal University, FenglinLu, ChangSha, Hunan Province, 410205, China","institution_ids":["https://openalex.org/I916048824"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5019758816","display_name":"Dianxi Shi","orcid":"https://orcid.org/0000-0002-8112-371X"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Dianxi Shi","raw_affiliation_strings":["Academy of Military Sciences, Beijing, 100071, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Academy of Military Sciences, Beijing, 100071, China","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":6,"corresponding_author_ids":["https://openalex.org/A5019758816"],"corresponding_institution_ids":[],"apc_list":{"value":1350,"currency":"USD","value_usd":1350},"apc_paid":{"value":1350,"currency":"USD","value_usd":1350},"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.24924585,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"37","issue":"10","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10616","display_name":"Smart Agriculture and AI","score":0.7120000123977661,"subfield":{"id":"https://openalex.org/subfields/1110","display_name":"Plant Science"},"field":{"id":"https://openalex.org/fields/11","display_name":"Agricultural and Biological Sciences"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},"topics":[{"id":"https://openalex.org/T10616","display_name":"Smart Agriculture and AI","score":0.7120000123977661,"subfield":{"id":"https://openalex.org/subfields/1110","display_name":"Plant Science"},"field":{"id":"https://openalex.org/fields/11","display_name":"Agricultural and Biological Sciences"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T12201","display_name":"Agricultural Engineering and Mechanization","score":0.07039999961853027,"subfield":{"id":"https://openalex.org/subfields/2210","display_name":"Mechanical Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.06800000369548798,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.819100022315979},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5957000255584717},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.5636000037193298},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.5450999736785889},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5141000151634216},{"id":"https://openalex.org/keywords/reuse","display_name":"Reuse","score":0.44209998846054077},{"id":"https://openalex.org/keywords/variable","display_name":"Variable (mathematics)","score":0.3930000066757202}],"concepts":[{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.819100022315979},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5957000255584717},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5641999840736389},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.5636000037193298},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5527999997138977},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.5450999736785889},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5141000151634216},{"id":"https://openalex.org/C206588197","wikidata":"https://www.wikidata.org/wiki/Q846574","display_name":"Reuse","level":2,"score":0.44209998846054077},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.3930000066757202},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35989999771118164},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.33239999413490295},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.3199999928474426},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.3154999911785126},{"id":"https://openalex.org/C74222875","wikidata":"https://www.wikidata.org/wiki/Q16000312","display_name":"Robot kinematics","level":4,"score":0.3000999987125397},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.29580000042915344},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.29010000824928284},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.28200000524520874},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2797999978065491}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s44443-025-00352-4","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s44443-025-00352-4","pdf_url":"https://link.springer.com/content/pdf/10.1007/s44443-025-00352-4.pdf","source":{"id":"https://openalex.org/S2764955546","display_name":"Journal of King Saud University - Computer and Information Sciences","issn_l":"1319-1578","issn":["1319-1578","2213-1248"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of King Saud University Computer and Information Sciences","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:cd63f589bb064257a0b4d517cb76cdad","is_oa":true,"landing_page_url":"https://doaj.org/article/cd63f589bb064257a0b4d517cb76cdad","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Journal of King Saud University: Computer and Information Sciences, Vol 37, Iss 10, Pp 1-17 (2025)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.1007/s44443-025-00352-4","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s44443-025-00352-4","pdf_url":"https://link.springer.com/content/pdf/10.1007/s44443-025-00352-4.pdf","source":{"id":"https://openalex.org/S2764955546","display_name":"Journal of King Saud University - Computer and Information Sciences","issn_l":"1319-1578","issn":["1319-1578","2213-1248"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of King Saud University Computer and Information Sciences","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G7763311295","display_name":null,"funder_award_id":"62306325","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"}],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4416723520.pdf","grobid_xml":"https://content.openalex.org/works/W4416723520.grobid-xml"},"referenced_works_count":43,"referenced_works":["https://openalex.org/W1993992568","https://openalex.org/W2019738489","https://openalex.org/W2029258291","https://openalex.org/W2060761685","https://openalex.org/W2066873908","https://openalex.org/W2119520055","https://openalex.org/W2137880701","https://openalex.org/W2165311785","https://openalex.org/W2167050241","https://openalex.org/W2313274380","https://openalex.org/W2748110852","https://openalex.org/W2774251627","https://openalex.org/W2890332809","https://openalex.org/W2906764419","https://openalex.org/W2933065178","https://openalex.org/W2949845527","https://openalex.org/W2950752390","https://openalex.org/W3014601320","https://openalex.org/W3081866250","https://openalex.org/W3090939539","https://openalex.org/W3132673511","https://openalex.org/W3133088119","https://openalex.org/W3137809096","https://openalex.org/W3142077573","https://openalex.org/W3197167612","https://openalex.org/W3207286485","https://openalex.org/W4200598809","https://openalex.org/W4206270770","https://openalex.org/W4321608011","https://openalex.org/W4322503516","https://openalex.org/W4367048065","https://openalex.org/W4376120009","https://openalex.org/W4383097670","https://openalex.org/W4383172030","https://openalex.org/W4390968850","https://openalex.org/W4391539647","https://openalex.org/W4394984159","https://openalex.org/W4405362883","https://openalex.org/W4406687397","https://openalex.org/W4408017252","https://openalex.org/W4408780475","https://openalex.org/W4410040546","https://openalex.org/W4414321975"],"related_works":[],"abstract_inverted_index":{"Multi-robot":[0],"coverage":[1,28,78,150],"path":[2,79,105],"planning":[3,80],"(MCPP)":[4],"has":[5],"received":[6],"increasing":[7],"attention":[8],"in":[9],"agricultural":[10,14],"automation.":[11],"In":[12],"practical":[13],"applications,":[15],"robots":[16,46,145],"are":[17],"critical":[18],"resources,":[19],"and":[20,47,146,189],"optimizing":[21],"their":[22],"number":[23,44,143],"to":[24,100,123,182],"execute":[25],"a":[26,31,42,54,64,76,84,88,97,120,129],"specific":[27],"task":[29,60],"with":[30,53],"deadline":[32],"is":[33],"an":[34],"important":[35],"topic.":[36],"Existing":[37],"MCPP":[38,134],"methods":[39],"typically":[40],"assume":[41],"fixed":[43],"of":[45,66,96,110,119,144,165],"each":[48],"robot":[49,67,122,178,194],"covers":[50],"the":[51,102,111,117,142,147,154,158,163,177,185,202],"farmland":[52],"constant":[55,98],"speed,":[56,99],"which":[57],"may":[58],"increase":[59],"costs,":[61],"thereby":[62],"causing":[63],"waste":[65],"resources.":[68],"To":[69],"address":[70],"this":[71,73],"challenge,":[72],"article":[74],"proposes":[75],"resource-optimized":[77],"method.":[81],"First,":[82],"as":[83],"base,":[85],"we":[86,127],"formulate":[87],"generalized":[89,186,203],"Dubins":[90,104,113,187,204],"model,":[91,188],"containing":[92],"variable":[93],"speeds":[94],"instead":[95,109],"generate":[101],"(near-)fastest":[103],"between":[106],"two":[107],"poses":[108],"shortest":[112],"path,":[114],"thus":[115],"improving":[116],"efficiency":[118],"single":[121],"perform":[124],"tasks.":[125],"Next,":[126],"propose":[128],"multi-objective":[130],"evolutionary":[131],"algorithm":[132,139],"for":[133],"called":[135],"MEC.":[136],"The":[137,170],"MEC":[138,166,174,190],"optimally":[140],"minimizes":[141],"single-robot":[148],"maximum":[149],"time,":[151],"by":[152,180,196],"reusing":[153],"optimization":[155],"information":[156],"through":[157,167],"computing":[159],"process.":[160],"We":[161],"validate":[162],"performance":[164],"comparison":[168],"experiments.":[169],"results":[171],"demonstrate":[172],"that":[173],"can":[175,191],"reduce":[176,193],"usage":[179,195],"up":[181],"25%":[183],"without":[184],"further":[192],"at":[197],"least":[198],"33.3%":[199],"when":[200],"incorporating":[201],"model.":[205]},"counts_by_year":[],"updated_date":"2026-05-06T08:25:59.206177","created_date":"2025-11-27T00:00:00"}
