{"id":"https://openalex.org/W4410226520","doi":"https://doi.org/10.1109/tac.2025.3568559","title":"An Inner Approximation Algorithm for Dynamic Optimization with Strict Satisfaction of Path Constraints","display_name":"An Inner Approximation Algorithm for Dynamic Optimization with Strict Satisfaction of Path Constraints","publication_year":2025,"publication_date":"2025-01-01","ids":{"openalex":"https://openalex.org/W4410226520","doi":"https://doi.org/10.1109/tac.2025.3568559"},"language":"en","primary_location":{"id":"doi:10.1109/tac.2025.3568559","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tac.2025.3568559","pdf_url":null,"source":{"id":"https://openalex.org/S184954342","display_name":"IEEE Transactions on Automatic Control","issn_l":"0018-9286","issn":["0018-9286","1558-2523","2334-3303"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Automatic Control","raw_type":"journal-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/A5042145194","display_name":"Jun Fu","orcid":"https://orcid.org/0000-0003-2196-3669"},"institutions":[{"id":"https://openalex.org/I9224756","display_name":"Northeastern University","ror":"https://ror.org/03awzbc87","country_code":"CN","type":"education","lineage":["https://openalex.org/I9224756"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Jun Fu","raw_affiliation_strings":["State Key Laboratory of Synthetical Automation for Process Industries, Northeastern University, Shenyang, China"],"affiliations":[{"raw_affiliation_string":"State Key Laboratory of Synthetical Automation for Process Industries, Northeastern University, Shenyang, China","institution_ids":["https://openalex.org/I9224756"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5066676249","display_name":"Lizhong Jiang","orcid":null},"institutions":[{"id":"https://openalex.org/I9224756","display_name":"Northeastern University","ror":"https://ror.org/03awzbc87","country_code":"CN","type":"education","lineage":["https://openalex.org/I9224756"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Lizhong Jiang","raw_affiliation_strings":["State Key Laboratory of Synthetical Automation for Process Industries, Northeastern University, Shenyang, China"],"affiliations":[{"raw_affiliation_string":"State Key Laboratory of Synthetical Automation for Process Industries, Northeastern University, Shenyang, China","institution_ids":["https://openalex.org/I9224756"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5042145194"],"corresponding_institution_ids":["https://openalex.org/I9224756"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.04929446,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"8"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.8136000037193298,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.8136000037193298,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.7621999979019165,"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/T12288","display_name":"Optimization and Search Problems","score":0.7387999892234802,"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/mathematical-optimization","display_name":"Mathematical optimization","score":0.6146339178085327},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5405328273773193},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5041097402572632},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4288766086101532},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.41123002767562866},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.39797818660736084},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38948577642440796},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.10928419232368469}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6146339178085327},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5405328273773193},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5041097402572632},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4288766086101532},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.41123002767562866},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.39797818660736084},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38948577642440796},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.10928419232368469},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tac.2025.3568559","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tac.2025.3568559","pdf_url":null,"source":{"id":"https://openalex.org/S184954342","display_name":"IEEE Transactions on Automatic Control","issn_l":"0018-9286","issn":["0018-9286","1558-2523","2334-3303"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Automatic Control","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W4409439182","https://openalex.org/W2053286651","https://openalex.org/W2181743346","https://openalex.org/W2187401768","https://openalex.org/W2181413294","https://openalex.org/W2052122378","https://openalex.org/W2544423928","https://openalex.org/W2062023542"],"abstract_inverted_index":{"An":[0],"inner":[1],"approximation":[2],"algorithm":[3,42,78,100,113],"is":[4,27,35,43,59,101],"proposed":[5,44],"for":[6],"path-constrained":[7],"dynamic":[8],"optimization":[9],"(PCDO)":[10],"by":[11,50],"iteratively":[12,47],"solving":[13],"restrictions":[14],"of":[15,23,75,83,98,111,116,123],"PCDO":[16,49,84],"(RPCDO).":[17],"Firstly,":[18],"an":[19],"upper":[20],"bound":[21],"function":[22],"the":[24,41,54,62,72,91,95,99,105,109,112,117,124],"path":[25,92,125],"constraint":[26],"designed":[28],"based":[29,45],"on":[30,46],"interval":[31],"analysis":[32],"theory,":[33],"which":[34],"utilized":[36],"to":[37],"construct":[38],"RPCDO.":[39],"Secondly,":[40],"approximating":[48],"dividing":[51],"either":[52],"all":[53],"time":[55,64,119],"subintervals":[56,65],"if":[57,66],"RPCDO":[58],"infeasible":[60],"or":[61],"active":[63],"its":[67],"solution":[68],"does":[69],"not":[70],"satisfy":[71],"KKT":[73,81],"conditions":[74],"PCDO.":[76],"The":[77],"locates":[79],"a":[80],"point":[82],"with":[85],"specified":[86],"tolerances":[87],"while":[88],"strictly":[89],"satisfying":[90],"constraint.":[93,126],"Thirdly,":[94],"finite":[96],"convergence":[97],"proved":[102],"theoretically.":[103],"Finally,":[104],"numerical":[106],"experiments":[107],"show":[108],"effectiveness":[110],"in":[114],"terms":[115],"computational":[118],"and":[120],"strict":[121],"satisfaction":[122]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}