{"id":"https://openalex.org/W2734993473","doi":"https://doi.org/10.23919/acc.2017.7963240","title":"Sequential convex programming for nonlinear optimal control problem in UAV path planning","display_name":"Sequential convex programming for nonlinear optimal control problem in UAV path planning","publication_year":2017,"publication_date":"2017-05-01","ids":{"openalex":"https://openalex.org/W2734993473","doi":"https://doi.org/10.23919/acc.2017.7963240","mag":"2734993473"},"language":"en","primary_location":{"id":"doi:10.23919/acc.2017.7963240","is_oa":false,"landing_page_url":"https://doi.org/10.23919/acc.2017.7963240","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 American Control Conference (ACC)","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/A5055652487","display_name":"Zhe Zhang","orcid":"https://orcid.org/0000-0003-1816-3740"},"institutions":[{"id":"https://openalex.org/I183067930","display_name":"Shanghai Jiao Tong University","ror":"https://ror.org/0220qvk04","country_code":"CN","type":"education","lineage":["https://openalex.org/I183067930"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Zhe Zhang","raw_affiliation_strings":["Department of Automation, Shanghai Jiao Tong University, Shanghai, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Automation, Shanghai Jiao Tong University, Shanghai, China","institution_ids":["https://openalex.org/I183067930"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5083135905","display_name":"Jianxun Li","orcid":"https://orcid.org/0000-0002-6347-6677"},"institutions":[{"id":"https://openalex.org/I183067930","display_name":"Shanghai Jiao Tong University","ror":"https://ror.org/0220qvk04","country_code":"CN","type":"education","lineage":["https://openalex.org/I183067930"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Jianxun Li","raw_affiliation_strings":["Department of Automation, Shanghai Jiao Tong University, Shanghai, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Automation, Shanghai Jiao Tong University, Shanghai, China","institution_ids":["https://openalex.org/I183067930"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100384686","display_name":"Jun Wang","orcid":"https://orcid.org/0000-0002-1305-5735"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jun Wang","raw_affiliation_strings":["Electronic Equipment Test Center of China, Luoyang, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Electronic Equipment Test Center of China, Luoyang, China","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.1847,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.56538491,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"1966","last_page":"1971"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9995999932289124,"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.9995999932289124,"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/T11133","display_name":"UAV Applications and Optimization","score":0.9907000064849854,"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"}},{"id":"https://openalex.org/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.9854999780654907,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/nonlinear-programming","display_name":"Nonlinear programming","score":0.7810838222503662},{"id":"https://openalex.org/keywords/karush\u2013kuhn\u2013tucker-conditions","display_name":"Karush\u2013Kuhn\u2013Tucker conditions","score":0.7411456108093262},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6834070682525635},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.6320668458938599},{"id":"https://openalex.org/keywords/interior-point-method","display_name":"Interior point method","score":0.5444977283477783},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5402066707611084},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.48425886034965515},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.4620921015739441},{"id":"https://openalex.org/keywords/optimal-control","display_name":"Optimal control","score":0.4588722288608551},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.44467827677726746},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.44298452138900757},{"id":"https://openalex.org/keywords/fractional-programming","display_name":"Fractional programming","score":0.4387257695198059},{"id":"https://openalex.org/keywords/linear-matrix-inequality","display_name":"Linear matrix inequality","score":0.4179905354976654},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.37418240308761597},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.36289161443710327},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.09621143341064453}],"concepts":[{"id":"https://openalex.org/C115527620","wikidata":"https://www.wikidata.org/wiki/Q769909","display_name":"Nonlinear programming","level":3,"score":0.7810838222503662},{"id":"https://openalex.org/C50454189","wikidata":"https://www.wikidata.org/wiki/Q2075125","display_name":"Karush\u2013Kuhn\u2013Tucker conditions","level":2,"score":0.7411456108093262},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6834070682525635},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.6320668458938599},{"id":"https://openalex.org/C155253501","wikidata":"https://www.wikidata.org/wiki/Q461992","display_name":"Interior point method","level":2,"score":0.5444977283477783},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5402066707611084},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.48425886034965515},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.4620921015739441},{"id":"https://openalex.org/C91575142","wikidata":"https://www.wikidata.org/wiki/Q1971426","display_name":"Optimal control","level":2,"score":0.4588722288608551},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.44467827677726746},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.44298452138900757},{"id":"https://openalex.org/C169069869","wikidata":"https://www.wikidata.org/wiki/Q5477546","display_name":"Fractional programming","level":4,"score":0.4387257695198059},{"id":"https://openalex.org/C201829737","wikidata":"https://www.wikidata.org/wiki/Q2022760","display_name":"Linear matrix inequality","level":2,"score":0.4179905354976654},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.37418240308761597},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.36289161443710327},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.09621143341064453},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.0},{"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/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"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/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.23919/acc.2017.7963240","is_oa":false,"landing_page_url":"https://doi.org/10.23919/acc.2017.7963240","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 American Control Conference (ACC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11","score":0.699999988079071}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1966185282","https://openalex.org/W1997413930","https://openalex.org/W2013000222","https://openalex.org/W2019400639","https://openalex.org/W2043230024","https://openalex.org/W2139753395","https://openalex.org/W2162218551","https://openalex.org/W2166765763","https://openalex.org/W2615593440","https://openalex.org/W2802627035","https://openalex.org/W2980995577","https://openalex.org/W4205183907","https://openalex.org/W6729319880"],"related_works":["https://openalex.org/W4244338775","https://openalex.org/W4299713359","https://openalex.org/W2035372690","https://openalex.org/W2963941240","https://openalex.org/W2486286901","https://openalex.org/W2015244536","https://openalex.org/W2169913650","https://openalex.org/W2051721398","https://openalex.org/W2363989901","https://openalex.org/W2153271882"],"abstract_inverted_index":{"Usually,":[0],"a":[1,11,17,37,87,95,102,117],"UAV":[2,118],"(unmanned":[3],"aerial":[4],"vehicle)":[5],"path-planning":[6,119],"problem":[7,25],"is":[8,26,49,72,114],"abstracted":[9],"into":[10],"nonlinear":[12,18,54,96],"optimal":[13],"control":[14],"model,":[15],"i.e.":[16],"programming":[19,40,55,71,97],"problem.":[20],"However,":[21],"this":[22,35,92],"kind":[23],"of":[24,78,104,110],"always":[27],"difficult":[28],"to":[29,51,56,74],"obtain":[30,57],"stable":[31],"solutions":[32],"quickly.":[33],"In":[34],"paper,":[36],"sequential":[38,69,105],"convex":[39,48,70,106],"whose":[41],"cost":[42],"function":[43],"and":[44],"inequality":[45],"constraints":[46],"are":[47],"proposed":[50,112],"approximate":[52],"the":[53,58,63,68,75,79,111],"solution.":[59],"Under":[60],"mild":[61],"condition,":[62],"solution":[64],"sequence":[65],"generated":[66],"by":[67,86,101,116],"convergent":[73],"KKT(Karush-Kuhn-Tucker)":[76],"point":[77],"origin":[80],"problem,":[81],"which":[82],"has":[83],"been":[84],"verified":[85,115],"rigorous":[88],"theoretical":[89],"proof":[90],"in":[91],"paper.":[93],"Thus,":[94],"can":[98],"be":[99],"solved":[100],"series":[103],"programming.":[107],"The":[108],"effectiveness":[109],"method":[113],"application.":[120]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}