{"id":"https://openalex.org/W3112356661","doi":"https://doi.org/10.1109/smc42975.2020.9282894","title":"A Memetic Algorithm for Curvature-Constrained Path Planning of Messenger UAV in Air-Ground Coordination","display_name":"A Memetic Algorithm for Curvature-Constrained Path Planning of Messenger UAV in Air-Ground Coordination","publication_year":2020,"publication_date":"2020-10-11","ids":{"openalex":"https://openalex.org/W3112356661","doi":"https://doi.org/10.1109/smc42975.2020.9282894","mag":"3112356661"},"language":"en","primary_location":{"id":"doi:10.1109/smc42975.2020.9282894","is_oa":false,"landing_page_url":"https://doi.org/10.1109/smc42975.2020.9282894","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 IEEE International Conference on Systems, Man, and Cybernetics (SMC)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5046128691","display_name":"Yulong Ding","orcid":"https://orcid.org/0000-0001-9178-9892"},"institutions":[{"id":"https://openalex.org/I125839683","display_name":"Beijing Institute of Technology","ror":"https://ror.org/01skt4w74","country_code":"CN","type":"education","lineage":["https://openalex.org/I125839683","https://openalex.org/I890469752"]},{"id":"https://openalex.org/I4210136793","display_name":"Peng Cheng Laboratory","ror":"https://ror.org/03qdqbt06","country_code":"CN","type":"facility","lineage":["https://openalex.org/I4210136793"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yulong Ding","raw_affiliation_strings":["Peng Cheng Laboratory, Shenzhen, China","School of Automation, Beijing Institute of Technology, Beijing, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Peng Cheng Laboratory, Shenzhen, China","institution_ids":["https://openalex.org/I4210136793"]},{"raw_affiliation_string":"School of Automation, Beijing Institute of Technology, Beijing, China","institution_ids":["https://openalex.org/I125839683"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5020307082","display_name":"Bin Xin","orcid":"https://orcid.org/0000-0001-9989-0418"},"institutions":[{"id":"https://openalex.org/I125839683","display_name":"Beijing Institute of Technology","ror":"https://ror.org/01skt4w74","country_code":"CN","type":"education","lineage":["https://openalex.org/I125839683","https://openalex.org/I890469752"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Bin Xin","raw_affiliation_strings":["Key Laboratory of Intelligent Control and Decision of Complex Systems, Beijing, China","School of Automation, Beijing Institute of Technology, Beijing, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Key Laboratory of Intelligent Control and Decision of Complex Systems, Beijing, China","institution_ids":[]},{"raw_affiliation_string":"School of Automation, Beijing Institute of Technology, Beijing, China","institution_ids":["https://openalex.org/I125839683"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100396911","display_name":"Hao Zhang","orcid":"https://orcid.org/0000-0002-4527-9610"},"institutions":[{"id":"https://openalex.org/I125839683","display_name":"Beijing Institute of Technology","ror":"https://ror.org/01skt4w74","country_code":"CN","type":"education","lineage":["https://openalex.org/I125839683","https://openalex.org/I890469752"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Hao Zhang","raw_affiliation_strings":["School of Automation, Beijing Institute of Technology, Beijing, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Automation, Beijing Institute of Technology, Beijing, China","institution_ids":["https://openalex.org/I125839683"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100333005","display_name":"Jie Chen","orcid":"https://orcid.org/0000-0003-2449-9793"},"institutions":[{"id":"https://openalex.org/I125839683","display_name":"Beijing Institute of Technology","ror":"https://ror.org/01skt4w74","country_code":"CN","type":"education","lineage":["https://openalex.org/I125839683","https://openalex.org/I890469752"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Jie Chen","raw_affiliation_strings":["Key Laboratory of Intelligent Control and Decision of Complex Systems, Beijing, China","School of Automation, Beijing Institute of Technology, Beijing, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Key Laboratory of Intelligent Control and Decision of Complex Systems, Beijing, China","institution_ids":[]},{"raw_affiliation_string":"School of Automation, Beijing Institute of Technology, Beijing, China","institution_ids":["https://openalex.org/I125839683"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"1","issue":null,"first_page":"1465","last_page":"1472"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9998999834060669,"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"}},{"id":"https://openalex.org/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.9976000189781189,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11133","display_name":"UAV Applications and Optimization","score":0.9973999857902527,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/memetic-algorithm","display_name":"Memetic algorithm","score":0.7944297790527344},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.6673873662948608},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.6111114025115967},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5833051204681396},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5608389973640442},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5075255632400513},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.4708905816078186},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.469400554895401},{"id":"https://openalex.org/keywords/unmanned-ground-vehicle","display_name":"Unmanned ground vehicle","score":0.42526113986968994},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3385241627693176},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.3276691436767578},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2663955092430115},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.19582268595695496},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.17682147026062012},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.10176372528076172},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.08069312572479248}],"concepts":[{"id":"https://openalex.org/C35129592","wikidata":"https://www.wikidata.org/wiki/Q324793","display_name":"Memetic algorithm","level":3,"score":0.7944297790527344},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.6673873662948608},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.6111114025115967},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5833051204681396},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5608389973640442},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5075255632400513},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.4708905816078186},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.469400554895401},{"id":"https://openalex.org/C2776548393","wikidata":"https://www.wikidata.org/wiki/Q2031473","display_name":"Unmanned ground vehicle","level":2,"score":0.42526113986968994},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3385241627693176},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.3276691436767578},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2663955092430115},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.19582268595695496},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.17682147026062012},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.10176372528076172},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.08069312572479248},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/smc42975.2020.9282894","is_oa":false,"landing_page_url":"https://doi.org/10.1109/smc42975.2020.9282894","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 IEEE International Conference on Systems, Man, and Cybernetics (SMC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6800000071525574,"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"},{"id":"https://openalex.org/F4320321543","display_name":"China Postdoctoral Science Foundation","ror":"https://ror.org/0426zh255"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W192124392","https://openalex.org/W1968420376","https://openalex.org/W1982421201","https://openalex.org/W2008316291","https://openalex.org/W2090486865","https://openalex.org/W2091756921","https://openalex.org/W2216368278","https://openalex.org/W2313274380","https://openalex.org/W2765533623","https://openalex.org/W2775755471","https://openalex.org/W2798572826","https://openalex.org/W2894814252","https://openalex.org/W2905321185","https://openalex.org/W2915000460","https://openalex.org/W2962910458","https://openalex.org/W2971626339","https://openalex.org/W6688628309"],"related_works":["https://openalex.org/W3104258108","https://openalex.org/W7992011","https://openalex.org/W8175827","https://openalex.org/W14666565","https://openalex.org/W1072516","https://openalex.org/W6380705","https://openalex.org/W12208660","https://openalex.org/W212752","https://openalex.org/W3694153","https://openalex.org/W3941961"],"abstract_inverted_index":{"This":[0],"paper":[1],"addresses":[2],"a":[3,9,38,51,69,114,118,122],"UAV":[4,48,65,91],"path":[5,61],"planning":[6,62],"problem":[7],"for":[8],"team":[10],"of":[11,16,63,104],"cooperating":[12],"heterogeneous":[13],"vehicles":[14,26],"composed":[15],"one":[17],"unmanned":[18,24],"aerial":[19],"vehicle":[20],"(UAV)":[21],"and":[22,35,45,107,121,141],"multiple":[23],"ground":[25],"(UGVs).":[27],"The":[28,60,135],"UGVs":[29,56],"are":[30],"used":[31,127],"as":[32,50,68,153],"mobile":[33],"actuators":[34],"scattered":[36],"in":[37,117],"large":[39,142],"area.":[40],"To":[41],"achieve":[42],"multi-UGV":[43],"communication":[44],"collaboration,":[46],"the":[47,86,90,99,102,130,146,156],"serves":[49],"messenger":[52,64],"to":[53,57,84,92,112,128],"fly":[54,93],"all":[55,95],"transmit":[58],"information.":[59],"is":[66,82,110,126],"formulated":[67],"Dynamic":[70],"Dubins":[71],"Traveling":[72],"Salesman":[73],"Problem":[74],"with":[75,155],"Neighborhood":[76],"(DDTSPN).":[77],"A":[78],"novel":[79],"memetic":[80,100],"algorithm":[81,106],"proposed":[83,147],"find":[85,113],"shortest":[87],"route":[88],"enabling":[89],"over":[94],"requested":[96],"UGVs.":[97],"In":[98],"algorithm,":[101],"combination":[103],"genetic":[105],"local":[108],"search":[109],"employed":[111],"high-quality":[115,151],"solution":[116],"reasonable":[119],"time,":[120],"gradient-based":[123],"repair":[124,129],"strategy":[125],"individuals":[131],"violating":[132],"dynamic":[133],"constraints.":[134],"calculation":[136],"results":[137],"on":[138],"both":[139],"small":[140],"instances":[143],"show":[144],"that":[145],"method":[148],"can":[149],"generate":[150],"solutions":[152],"compared":[154],"state-of-the-art":[157],"algorithms.":[158]},"counts_by_year":[{"year":2022,"cited_by_count":2}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}