{"id":"https://openalex.org/W4385656104","doi":"https://doi.org/10.1109/cacre58689.2023.10209036","title":"Rectangular Spraying Task Assignment Via a Genetic Algorithm","display_name":"Rectangular Spraying Task Assignment Via a Genetic Algorithm","publication_year":2023,"publication_date":"2023-07-01","ids":{"openalex":"https://openalex.org/W4385656104","doi":"https://doi.org/10.1109/cacre58689.2023.10209036"},"language":"en","primary_location":{"id":"doi:10.1109/cacre58689.2023.10209036","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cacre58689.2023.10209036","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 8th International Conference on Automation, Control and Robotics Engineering (CACRE)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5023090653","display_name":"Yan Ding","orcid":"https://orcid.org/0000-0002-6446-5064"},"institutions":[{"id":"https://openalex.org/I4210118629","display_name":"NARI Group (China)","ror":"https://ror.org/02egn3136","country_code":"CN","type":"facility","lineage":["https://openalex.org/I4210118629"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Ding Yan","raw_affiliation_strings":["Jiangsu Automation Research Institute,Lianyungang,China","Jiangsu Automation Research Institute, Lianyungang, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Jiangsu Automation Research Institute,Lianyungang,China","institution_ids":["https://openalex.org/I4210118629"]},{"raw_affiliation_string":"Jiangsu Automation Research Institute, Lianyungang, China","institution_ids":["https://openalex.org/I4210118629"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5039768948","display_name":"Jiajian He","orcid":null},"institutions":[{"id":"https://openalex.org/I4210118629","display_name":"NARI Group (China)","ror":"https://ror.org/02egn3136","country_code":"CN","type":"facility","lineage":["https://openalex.org/I4210118629"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Jiajian He","raw_affiliation_strings":["Jiangsu Automation Research Institute,Lianyungang,China","Jiangsu Automation Research Institute, Lianyungang, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Jiangsu Automation Research Institute,Lianyungang,China","institution_ids":["https://openalex.org/I4210118629"]},{"raw_affiliation_string":"Jiangsu Automation Research Institute, Lianyungang, China","institution_ids":["https://openalex.org/I4210118629"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5004481542","display_name":"Shuchen He","orcid":"https://orcid.org/0009-0004-9746-0077"},"institutions":[{"id":"https://openalex.org/I76569877","display_name":"Southeast University","ror":"https://ror.org/04ct4d772","country_code":"CN","type":"education","lineage":["https://openalex.org/I76569877"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Shuchen He","raw_affiliation_strings":["Southeast University,School of Automation,Nanjing,China","School of Automation, Southeast University, Nanjing, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Southeast University,School of Automation,Nanjing,China","institution_ids":["https://openalex.org/I76569877"]},{"raw_affiliation_string":"School of Automation, Southeast University, Nanjing, China","institution_ids":["https://openalex.org/I76569877"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100760190","display_name":"Yang\u2010Yang Chen","orcid":"https://orcid.org/0000-0003-0136-0174"},"institutions":[{"id":"https://openalex.org/I76569877","display_name":"Southeast University","ror":"https://ror.org/04ct4d772","country_code":"CN","type":"education","lineage":["https://openalex.org/I76569877"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yang-Yang Chen","raw_affiliation_strings":["Southeast University,School of Automation,Nanjing,China","School of Automation, Southeast University, Nanjing, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Southeast University,School of Automation,Nanjing,China","institution_ids":["https://openalex.org/I76569877"]},{"raw_affiliation_string":"School of Automation, Southeast University, Nanjing, China","institution_ids":["https://openalex.org/I76569877"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3762,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.66998841,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"167","last_page":"171"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9983999729156494,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9983999729156494,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9983999729156494,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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.9979000091552734,"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/vertex","display_name":"Vertex (graph theory)","score":0.7241939306259155},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.6010853052139282},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5415191650390625},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.49380502104759216},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.49045035243034363},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.47927066683769226},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.4688837230205536},{"id":"https://openalex.org/keywords/feedback-vertex-set","display_name":"Feedback vertex set","score":0.4438855051994324},{"id":"https://openalex.org/keywords/suurballes-algorithm","display_name":"Suurballe's algorithm","score":0.4364796578884125},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.4276728630065918},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.4204508662223816},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.40718746185302734},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.28655457496643066},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.21297487616539001},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.1560620367527008},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.1336773931980133}],"concepts":[{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.7241939306259155},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.6010853052139282},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5415191650390625},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.49380502104759216},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.49045035243034363},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.47927066683769226},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.4688837230205536},{"id":"https://openalex.org/C28723256","wikidata":"https://www.wikidata.org/wiki/Q1400918","display_name":"Feedback vertex set","level":4,"score":0.4438855051994324},{"id":"https://openalex.org/C98779529","wikidata":"https://www.wikidata.org/wiki/Q7650417","display_name":"Suurballe's algorithm","level":5,"score":0.4364796578884125},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.4276728630065918},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.4204508662223816},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.40718746185302734},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.28655457496643066},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.21297487616539001},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.1560620367527008},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.1336773931980133},{"id":"https://openalex.org/C201995342","wikidata":"https://www.wikidata.org/wiki/Q682496","display_name":"Systems engineering","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cacre58689.2023.10209036","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cacre58689.2023.10209036","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 8th International Conference on Automation, Control and Robotics Engineering (CACRE)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W2010868970","https://openalex.org/W2015261337","https://openalex.org/W2025896589","https://openalex.org/W2040466547","https://openalex.org/W2107941094","https://openalex.org/W2118288559","https://openalex.org/W2124903056","https://openalex.org/W2126366668","https://openalex.org/W2143560894","https://openalex.org/W2185062546","https://openalex.org/W2624187131","https://openalex.org/W2752768378","https://openalex.org/W2981058782","https://openalex.org/W4231884806","https://openalex.org/W4231937944","https://openalex.org/W4297498453","https://openalex.org/W6682642761"],"related_works":["https://openalex.org/W2951429970","https://openalex.org/W2145212918","https://openalex.org/W2100214387","https://openalex.org/W2597144308","https://openalex.org/W3112180780","https://openalex.org/W2990531685","https://openalex.org/W4387914616","https://openalex.org/W2578319993","https://openalex.org/W2383519316","https://openalex.org/W2351427475"],"abstract_inverted_index":{"This":[0],"paper":[1],"deals":[2],"with":[3,10,83],"the":[4,11,18,24,28,32,37,44,55,59,71,76,79,84,89,93],"assignment":[5],"problem":[6],"of":[7,21,78,86],"multiple":[8],"robot":[9],"rectangular":[12],"spaying":[13],"tasks.":[14],"Without":[15],"pointing":[16],"to":[17,53,69],"starting":[19],"points":[20],"each":[22],"task,":[23],"upper":[25,29],"left":[26,34],"vertex,":[27,31],"right":[30,39],"lower":[33,38],"vertex":[35,40],"and":[36,58,74,99],"are":[41],"selected":[42],"by":[43,97,102],"genetic":[45,49,90],"algorithm.":[46,81],"The":[47,63],"ergodic-based":[48],"algorithm":[50,91],"is":[51,67],"designed":[52],"achieve":[54],"shortest":[56],"time":[57,95],"lowest":[60],"path":[61],"cost.":[62],"improved":[64],"mutation":[65],"operator":[66],"set":[68],"accelerate":[70],"convergence":[72],"process":[73],"improve":[75],"practicability":[77],"proposed":[80],"Compared":[82],"strategy":[85],"market-based":[87],"algorithm,":[88],"reduces":[92],"average":[94],"cost":[96],"16.98%":[98],"distance":[100],"costs":[101],"9.05%,":[103],"respectively.":[104]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}