检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]State Key Laboratory of Industry Control Technology,Zhejiang University [2]Institute of Information and Control,Hangzhou Dianzi University
出 处:《Chinese Journal of Chemical Engineering》2014年第2期141-145,共5页中国化学工程学报(英文版)
基 金:Supported by the National Natural Science Foundation of China(U1162130);the National High Technology Research and Development Program of China(2006AA05Z226);Outstanding Youth Science Foundation of Zhejiang Province(R4100133)
摘 要:This paper considers dealing with path constraints in the framework of the improved control vector iteration (CVI) approach. Two available ways for enforcing equality path constraints are presented, which can be directly incorporated into the improved CVI approach. Inequality path constraints are much more difficult to deal with, even for small scale problems, because the time intervals where the inequality path constraints are active are unknown in advance. To overcome the challenge, the ll penalty function and a novel smoothing technique are in-troduced, leading to a new effective approach. Moreover, on the basis of the relevant theorems, a numerical algo-rithm is proposed for nonlinear dynamic optimization problems with inequality path constraints. Results obtained from the classic batch reaCtor operation problem are in agreement with the literature reoorts, and the comoutational efficiency is also high.This paper considers dealing with path constraints in the framework of the improved control vector iteration(CVI)approach.Two available ways for enforcing equality path constraints are presented,which can be directly incorporated into the improved CVI approach.Inequality path constraints are much more difficult to deal with,even for small scale problems,because the time intervals where the inequality path constraints are active are unknown in advance.To overcome the challenge,the l1penalty function and a novel smoothing technique are introduced,leading to a new effective approach.Moreover,on the basis of the relevant theorems,a numerical algorithm is proposed for nonlinear dynamic optimization problems with inequality path constraints.Results obtained from the classic batch reactor operation problem are in agreement with the literature reports,and the computational efficiency is also high.
关 键 词:nonlinear dynamic optimization control vector iteration path constraint penalty function method
分 类 号:O224[理学—运筹学与控制论]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.3