{"id":"https://openalex.org/W4391020461","doi":"https://doi.org/10.1109/cdc49753.2023.10383259","title":"Multi-UAV Trajectory Planning Problem Using the Difference of Convex Function Programming","display_name":"Multi-UAV Trajectory Planning Problem Using the Difference of Convex Function Programming","publication_year":2023,"publication_date":"2023-12-13","ids":{"openalex":"https://openalex.org/W4391020461","doi":"https://doi.org/10.1109/cdc49753.2023.10383259"},"language":"en","primary_location":{"id":"doi:10.1109/cdc49753.2023.10383259","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/cdc49753.2023.10383259","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 62nd IEEE Conference on Decision and Control (CDC)","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/A5014204499","display_name":"Anh Phuong Ngo","orcid":"https://orcid.org/0009-0006-0648-3009"},"institutions":[{"id":"https://openalex.org/I35777872","display_name":"North Carolina Agricultural and Technical State University","ror":"https://ror.org/02aze4h65","country_code":"US","type":"education","lineage":["https://openalex.org/I35777872"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Anh Phuong Ngo","raw_affiliation_strings":["North Carolina A&T State University,Dept. of Electrical & Computer Eng.,Greensboro,NC,USA,27411"],"affiliations":[{"raw_affiliation_string":"North Carolina A&T State University,Dept. of Electrical & Computer Eng.,Greensboro,NC,USA,27411","institution_ids":["https://openalex.org/I35777872"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5049989670","display_name":"Christan M. Thomas","orcid":null},"institutions":[{"id":"https://openalex.org/I1287521167","display_name":"Lockheed Martin (United States)","ror":"https://ror.org/026er9r08","country_code":"US","type":"company","lineage":["https://openalex.org/I1287521167"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Christan Thomas","raw_affiliation_strings":["Lockheed Martin Corporation,Dept. of Flight Test,Fort Worth,TX,USA,76108"],"affiliations":[{"raw_affiliation_string":"Lockheed Martin Corporation,Dept. of Flight Test,Fort Worth,TX,USA,76108","institution_ids":["https://openalex.org/I1287521167"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5082128797","display_name":"Ali Karimoddini","orcid":"https://orcid.org/0000-0001-6084-6831"},"institutions":[{"id":"https://openalex.org/I35777872","display_name":"North Carolina Agricultural and Technical State University","ror":"https://ror.org/02aze4h65","country_code":"US","type":"education","lineage":["https://openalex.org/I35777872"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ali Karimoddini","raw_affiliation_strings":["North Carolina A&T State University,Dept. of Electrical & Computer Eng.,Greensboro,NC,USA,27411"],"affiliations":[{"raw_affiliation_string":"North Carolina A&T State University,Dept. of Electrical & Computer Eng.,Greensboro,NC,USA,27411","institution_ids":["https://openalex.org/I35777872"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5074340406","display_name":"Hieu T. Nguyen","orcid":"https://orcid.org/0000-0003-1667-1135"},"institutions":[{"id":"https://openalex.org/I35777872","display_name":"North Carolina Agricultural and Technical State University","ror":"https://ror.org/02aze4h65","country_code":"US","type":"education","lineage":["https://openalex.org/I35777872"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Hieu T. Nguyen","raw_affiliation_strings":["North Carolina A&T State University,Dept. of Electrical & Computer Eng.,Greensboro,NC,USA,27411"],"affiliations":[{"raw_affiliation_string":"North Carolina A&T State University,Dept. of Electrical & Computer Eng.,Greensboro,NC,USA,27411","institution_ids":["https://openalex.org/I35777872"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5014204499"],"corresponding_institution_ids":["https://openalex.org/I35777872"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.18798298,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"52","issue":null,"first_page":"7367","last_page":"7372"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9991999864578247,"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.9991999864578247,"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.9884999990463257,"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.9833999872207642,"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/mathematical-optimization","display_name":"Mathematical optimization","score":0.7633244395256042},{"id":"https://openalex.org/keywords/penalty-method","display_name":"Penalty method","score":0.7284994125366211},{"id":"https://openalex.org/keywords/collision-avoidance","display_name":"Collision avoidance","score":0.6588799953460693},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6048997640609741},{"id":"https://openalex.org/keywords/particle-swarm-optimization","display_name":"Particle swarm optimization","score":0.5325841903686523},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.49375471472740173},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.49076423048973083},{"id":"https://openalex.org/keywords/trajectory","display_name":"Trajectory","score":0.48909837007522583},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.4605085253715515},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.45550015568733215},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4403477609157562},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.4287700951099396},{"id":"https://openalex.org/keywords/feasible-region","display_name":"Feasible region","score":0.4268075227737427},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.4012267589569092},{"id":"https://openalex.org/keywords/collision","display_name":"Collision","score":0.36395347118377686},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2792688012123108},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.11224207282066345},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.08704248070716858}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7633244395256042},{"id":"https://openalex.org/C6180225","wikidata":"https://www.wikidata.org/wiki/Q3411771","display_name":"Penalty method","level":2,"score":0.7284994125366211},{"id":"https://openalex.org/C2780864053","wikidata":"https://www.wikidata.org/wiki/Q5147495","display_name":"Collision avoidance","level":3,"score":0.6588799953460693},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6048997640609741},{"id":"https://openalex.org/C85617194","wikidata":"https://www.wikidata.org/wiki/Q2072794","display_name":"Particle swarm optimization","level":2,"score":0.5325841903686523},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.49375471472740173},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.49076423048973083},{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.48909837007522583},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4605085253715515},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.45550015568733215},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4403477609157562},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.4287700951099396},{"id":"https://openalex.org/C177067428","wikidata":"https://www.wikidata.org/wiki/Q17013331","display_name":"Feasible region","level":2,"score":0.4268075227737427},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.4012267589569092},{"id":"https://openalex.org/C121704057","wikidata":"https://www.wikidata.org/wiki/Q352070","display_name":"Collision","level":2,"score":0.36395347118377686},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2792688012123108},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.11224207282066345},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.08704248070716858},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C1276947","wikidata":"https://www.wikidata.org/wiki/Q333","display_name":"Astronomy","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cdc49753.2023.10383259","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/cdc49753.2023.10383259","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 62nd IEEE Conference on Decision and Control (CDC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1530411706","https://openalex.org/W1988778152","https://openalex.org/W1993266907","https://openalex.org/W2012597414","https://openalex.org/W2104694562","https://openalex.org/W2107395148","https://openalex.org/W2109335081","https://openalex.org/W2126047620","https://openalex.org/W2173586229","https://openalex.org/W2963718773","https://openalex.org/W3105161877"],"related_works":["https://openalex.org/W4381746183","https://openalex.org/W2175677697","https://openalex.org/W2912146214","https://openalex.org/W2145479420","https://openalex.org/W2602608806","https://openalex.org/W1500017135","https://openalex.org/W2068533472","https://openalex.org/W2109961475","https://openalex.org/W2111202110","https://openalex.org/W4247974938"],"abstract_inverted_index":{"Trajectory":[0],"planning":[1,117,134],"for":[2,26],"a":[3,10,18,81,90,135],"swarm":[4],"of":[5,21,29,45,92,115,129,138],"UAVs":[6,30,139],"is":[7],"known":[8],"as":[9],"challenging":[11],"nonconvex":[12],"optimization":[13,94],"problem,":[14],"particularly":[15],"due":[16],"to":[17,55,69],"large":[19,136],"number":[20,137],"collision":[22,60,100],"avoidance":[23,61,101],"constraints":[24],"required":[25],"individual":[27],"pairs":[28],"in":[31,85,133,140],"the":[32,43,52,59,65,72,75,99,107,112,116,120,127,130],"swarm.":[33],"In":[34],"this":[35,39],"paper,":[36],"we":[37,79,87],"tackle":[38],"nonconvexity":[40],"by":[41,97],"leveraging":[42],"difference":[44],"convex":[46,93],"function":[47,67],"(DC)":[48],"programming.":[49],"We":[50],"introduce":[51],"slack":[53],"variables":[54],"relax":[56],"and":[57,63,110,119],"reformulate":[58],"conditions":[62],"employ":[64],"penalty":[66,82,122],"term":[68],"equivalently":[70],"convert":[71],"problem":[73,118],"into":[74],"DC":[76,83],"form.":[77],"Consequently,":[78],"construct":[80],"algorithm":[84,104],"which":[86],"sequentially":[88],"solve":[89],"set":[91],"problems":[95],"obtained":[96],"linearizing":[98],"constraint.":[102],"The":[103],"iteratively":[105],"tightens":[106],"safety":[108],"condition":[109],"reduces":[111],"objective":[113],"cost":[114],"additional":[121],"term.":[123],"Numerical":[124],"results":[125],"demonstrate":[126],"effectiveness":[128],"proposed":[131],"approach":[132],"congested":[141],"space.":[142]},"counts_by_year":[],"updated_date":"2025-12-21T01:58:51.020947","created_date":"2025-10-10T00:00:00"}