分布式模型預(yù)測(cè)控制算法相關(guān)研究
發(fā)布時(shí)間：2018-10-12 15:42
【摘要】：隨著科學(xué)技術(shù)的不斷發(fā)展,現(xiàn)代工業(yè)過(guò)程呈現(xiàn)出結(jié)構(gòu)復(fù)雜、規(guī)模龐大、子系統(tǒng)間能量、物料耦合強(qiáng)烈等特性。分布式模型預(yù)測(cè)控制(Distributed Model Predictive Control, DMPC)是一種有效的解決大規(guī)模系統(tǒng)控制問(wèn)題的方法。DMPC的優(yōu)勢(shì)在于：(1)減小每個(gè)子系統(tǒng)的計(jì)算負(fù)擔(dān)；(2)多個(gè)控制器之下可以提高系統(tǒng)的可擴(kuò)展性；(3)系統(tǒng)的容錯(cuò)能力強(qiáng)等。DMPC算法的主要設(shè)計(jì)目標(biāo)在于：在盡可能簡(jiǎn)單的系統(tǒng)通信方式和盡可能少的通信負(fù)擔(dān)之下達(dá)到盡可能好的控制性能,同時(shí)保證算法的收斂性和系統(tǒng)的穩(wěn)定性。針對(duì)DMPC算法以及控制器設(shè)計(jì)中的相關(guān)問(wèn)題,本文圍繞DMPC快速算法設(shè)計(jì),大系統(tǒng)結(jié)構(gòu)拆解以及MPC控制系統(tǒng)性能評(píng)估問(wèn)題進(jìn)行研究,取得以下成果：1.針對(duì)分布式預(yù)測(cè)控制大系統(tǒng)拆解問(wèn)題,提出了一種基于遺傳算法(GA)的最優(yōu)結(jié)構(gòu)分解方法。該方法包括兩個(gè)新的拆解指標(biāo)分別對(duì)應(yīng)分解的兩個(gè)階段,包括輸入分組(Input Clustering Decomposition, ICD)以及輸入輸出配對(duì)(Input-Output Pairing Decomposition IOPD)。ICD可以用來(lái)消除子系統(tǒng)之間輸入的耦合,同時(shí)還能平衡各個(gè)子系統(tǒng)之間的計(jì)算負(fù)擔(dān), IOPD是為了找到合適的輸入輸出之間的配對(duì)。ICD和IOPD所對(duì)應(yīng)的優(yōu)化問(wèn)題是通過(guò)GA來(lái)求解的。2.針對(duì)DMPC分布式算法設(shè)計(jì)問(wèn)題,提出了一種基于SVD分解的DMPC算法有效降低了子系統(tǒng)間的通信負(fù)擔(dān)。該方法在無(wú)約束的情況下,把集中式MPC在線(xiàn)二次優(yōu)化問(wèn)題轉(zhuǎn)到共軛空間進(jìn)行處理。每個(gè)子系統(tǒng)可以獨(dú)立并行地求解各自的最優(yōu)控制輸入,全局的最優(yōu)輸入可以由各個(gè)子系統(tǒng)的解合并來(lái)產(chǎn)生。該方法同樣可以推廣到有約束的情況之下,得到的無(wú)約束解首先在共軛空間中并行檢查,然后再根據(jù)奇異值的大小去除小的奇異值所對(duì)應(yīng)的解,最終可以得到帶有約束情況下的最優(yōu)解。3.針對(duì)DMPC在線(xiàn)優(yōu)化問(wèn)題,提出了一種基于有效集方法(active-set)的快速DMPC算法,該算法利用Hessian矩陣的離線(xiàn)求逆來(lái)快速求解一個(gè)帶約束的分布式有效集二次規(guī)劃問(wèn)題。根據(jù)無(wú)約束解的大小,提出了一種雙模式優(yōu)化策略來(lái)加快在線(xiàn)計(jì)算速度。該算法可以提前停止迭代,同時(shí)可以保證系統(tǒng)穩(wěn)定性,并且易于實(shí)現(xiàn)。最后,一種利用前一時(shí)刻DMPC最優(yōu)值的暖啟動(dòng)的策略可以進(jìn)一步加快算法迭代收斂速度。4.針對(duì)串聯(lián)結(jié)構(gòu)DMPC算法的設(shè)計(jì)問(wèn)題,提出了一種分布式模型預(yù)測(cè)算法,該算法利用串聯(lián)結(jié)構(gòu)各個(gè)子系統(tǒng)的輸出僅與其上游子和其本身系統(tǒng)輸入相關(guān)的特點(diǎn),對(duì)傳統(tǒng)的迭代式DMPC算法進(jìn)行改進(jìn),得到一種非迭代的遞階求解DMPC算法。5.針對(duì)MPC性能評(píng)估及改進(jìn)問(wèn)題,提出了一種在線(xiàn)提升MPC控制系統(tǒng)經(jīng)濟(jì)性能的方法。該方法根據(jù)系統(tǒng)在線(xiàn)收集的數(shù)據(jù),利用迭代學(xué)習(xí)方法不斷在線(xiàn)調(diào)整MPC控制器參數(shù),從而不斷在線(xiàn)提升MPC控制器的經(jīng)濟(jì)性能。本文同時(shí)也對(duì)該方法在分布式MPC系統(tǒng)上擴(kuò)展的可能性進(jìn)行了相關(guān)討論。
[Abstract]:With the continuous development of science and technology, modern industrial processes show the characteristics of complex structure, large scale, strong coupling of energy and materials between subsystems, and so on. Distributed model predictive control (Distributed Model Predictive Control, DMPC) is an effective method to solve large-scale system control problems. The advantages of DMPC are: (1) reducing the computational burden of each subsystem; (2) improving the scalability of the system under multiple controllers; (3) strong fault-tolerant ability of the system. The main design goal of DMPC algorithm is to achieve the best control performance under the simple system communication mode and the minimum communication burden. At the same time, the convergence of the algorithm and the stability of the system are guaranteed. Aiming at the related problems of DMPC algorithm and controller design, this paper focuses on the design of DMPC fast algorithm, the disassembly of large system structure and the performance evaluation of MPC control system. The results are as follows: 1. An optimal structure decomposition method based on genetic algorithm (GA) is proposed to solve the problem of large scale system disassembly in distributed predictive control (DPC). The method consists of two new disassembly indexes corresponding to two stages of decomposition, including input grouping (Input Clustering Decomposition, ICD) and input and output pairing (Input-Output Pairing Decomposition IOPD). ICD can be used to eliminate input coupling between subsystems). At the same time, it can balance the computational burden between subsystems. IOPD is to find the right pairing between input and output. The optimization problem corresponding to ICD and IOPD is solved by GA. 2. To solve the problem of DMPC distributed algorithm design, a DMPC algorithm based on SVD decomposition is proposed to effectively reduce the communication burden between subsystems. In this method, the centralized MPC online quadratic optimization problem is transferred to conjugate space without constraint. Each subsystem can solve its own optimal control input independently and in parallel, and the global optimal input can be generated by merging the solutions of each subsystem. This method can also be extended to the constrained case. The obtained unconstrained solution is checked in conjugate space in parallel, and then the solution corresponding to the small singular value is removed according to the size of the singular value. Finally, the optimal solution with constraints. 3. A fast DMPC algorithm based on efficient set method (active-set) is proposed to solve DMPC online optimization problem. The algorithm solves a constrained distributed efficient set quadratic programming problem by using offline inverse of Hessian matrix. According to the size of the unconstrained solution, a two-mode optimization strategy is proposed to speed up the on-line computation. The algorithm can stop the iteration ahead of time, ensure the stability of the system, and be easy to implement. Finally, a warm start strategy using the DMPC optimal value at the previous time can further accelerate the iterative convergence rate of the algorithm. A distributed model prediction algorithm is proposed for the design of series structure DMPC algorithm. The algorithm utilizes the characteristics that the output of each subsystem of the series structure is only related to the upper runaway and its own system input. The traditional iterative DMPC algorithm is improved to obtain a non-iterative hierarchical DMPC algorithm. 5. Aiming at the problem of MPC performance evaluation and improvement, a method to improve the economic performance of MPC control system on line is proposed. According to the data collected online, the iterative learning method is used to continuously adjust the parameters of the MPC controller on line, so as to improve the economic performance of the MPC controller on line. This paper also discusses the possibility of extending this method to distributed MPC systems.
【學(xué)位授予單位】：浙江大學(xué)
【學(xué)位級(jí)別】：博士
【學(xué)位授予年份】：2015
【分類(lèi)號(hào)】：TP13
本文編號(hào)：2266681
[Abstract]:With the continuous development of science and technology, modern industrial processes show the characteristics of complex structure, large scale, strong coupling of energy and materials between subsystems, and so on. Distributed model predictive control (Distributed Model Predictive Control, DMPC) is an effective method to solve large-scale system control problems. The advantages of DMPC are: (1) reducing the computational burden of each subsystem; (2) improving the scalability of the system under multiple controllers; (3) strong fault-tolerant ability of the system. The main design goal of DMPC algorithm is to achieve the best control performance under the simple system communication mode and the minimum communication burden. At the same time, the convergence of the algorithm and the stability of the system are guaranteed. Aiming at the related problems of DMPC algorithm and controller design, this paper focuses on the design of DMPC fast algorithm, the disassembly of large system structure and the performance evaluation of MPC control system. The results are as follows: 1. An optimal structure decomposition method based on genetic algorithm (GA) is proposed to solve the problem of large scale system disassembly in distributed predictive control (DPC). The method consists of two new disassembly indexes corresponding to two stages of decomposition, including input grouping (Input Clustering Decomposition, ICD) and input and output pairing (Input-Output Pairing Decomposition IOPD). ICD can be used to eliminate input coupling between subsystems). At the same time, it can balance the computational burden between subsystems. IOPD is to find the right pairing between input and output. The optimization problem corresponding to ICD and IOPD is solved by GA. 2. To solve the problem of DMPC distributed algorithm design, a DMPC algorithm based on SVD decomposition is proposed to effectively reduce the communication burden between subsystems. In this method, the centralized MPC online quadratic optimization problem is transferred to conjugate space without constraint. Each subsystem can solve its own optimal control input independently and in parallel, and the global optimal input can be generated by merging the solutions of each subsystem. This method can also be extended to the constrained case. The obtained unconstrained solution is checked in conjugate space in parallel, and then the solution corresponding to the small singular value is removed according to the size of the singular value. Finally, the optimal solution with constraints. 3. A fast DMPC algorithm based on efficient set method (active-set) is proposed to solve DMPC online optimization problem. The algorithm solves a constrained distributed efficient set quadratic programming problem by using offline inverse of Hessian matrix. According to the size of the unconstrained solution, a two-mode optimization strategy is proposed to speed up the on-line computation. The algorithm can stop the iteration ahead of time, ensure the stability of the system, and be easy to implement. Finally, a warm start strategy using the DMPC optimal value at the previous time can further accelerate the iterative convergence rate of the algorithm. A distributed model prediction algorithm is proposed for the design of series structure DMPC algorithm. The algorithm utilizes the characteristics that the output of each subsystem of the series structure is only related to the upper runaway and its own system input. The traditional iterative DMPC algorithm is improved to obtain a non-iterative hierarchical DMPC algorithm. 5. Aiming at the problem of MPC performance evaluation and improvement, a method to improve the economic performance of MPC control system on line is proposed. According to the data collected online, the iterative learning method is used to continuously adjust the parameters of the MPC controller on line, so as to improve the economic performance of the MPC controller on line. This paper also discusses the possibility of extending this method to distributed MPC systems.
【學(xué)位授予單位】：浙江大學(xué)
【學(xué)位級(jí)別】：博士
【學(xué)位授予年份】：2015
【分類(lèi)號(hào)】：TP13
【相似文獻(xiàn)】
相關(guān)期刊論文 前10條
1 徐建良,李善平,馬丹;非結(jié)構(gòu)化產(chǎn)品信息的分布式模型研究[J];計(jì)算機(jī)輔助設(shè)計(jì)與圖形學(xué)學(xué)報(bào);1999年05期
2 孫兆林,李一兵,田園;分布式模型的分析研究[J];信息技術(shù);2002年07期
3 曾靜;薛定宇;袁德成;;分布式模型預(yù)測(cè)控制方法的研究[J];系統(tǒng)仿真學(xué)報(bào);2008年21期
4 楊洋;劉水平;;分布式模型預(yù)測(cè)電壓控制方法研究[J];華北電力大學(xué)學(xué)報(bào)(自然科學(xué)版);2012年04期
5 王紅樓,周建新,劉瑞祥,陳立亮;基于分布式模型的鑄造企業(yè)ERP系統(tǒng)開(kāi)發(fā)[J];鑄造技術(shù);2005年02期
6 W.A.Muhanna;馬文騫;;分布式模型管理系統(tǒng)的幾個(gè)問(wèn)題[J];計(jì)算機(jī)工程與應(yīng)用;1991年Z1期
7 黃卓,張濤,郭波;基于Web Services的分布式模型管理方法研究[J];計(jì)算機(jī)工程與設(shè)計(jì);2004年03期
8 周靜;劉全菊;;分布式模型應(yīng)用于.NET框架的研究與設(shè)計(jì)[J];通信技術(shù);2009年06期
9 解紹詞,葛君偉,汪維華;對(duì)帶有中間主進(jìn)程CORBA分布式模型的研究[J];計(jì)算機(jī)工程與設(shè)計(jì);2005年03期
10 張永;常學(xué)飛;韓春雷;任學(xué)海;;基于分布式模型預(yù)測(cè)控制算法在AGC系統(tǒng)的應(yīng)用研究[J];吉林電力;2013年05期
相關(guān)會(huì)議論文 前1條
1 楊大文;龔偉;劉志雨;周?chē)?guó)良;;基于分布式模型土壤含水量評(píng)估的山洪預(yù)警指標(biāo)體系[A];中國(guó)水利學(xué)會(huì)2010學(xué)術(shù)年會(huì)論文集（上冊(cè)）[C];2010年
相關(guān)博士學(xué)位論文 前1條
1 蔡星;分布式模型預(yù)測(cè)控制算法相關(guān)研究[D];浙江大學(xué);2015年
相關(guān)碩士學(xué)位論文 前2條
1 鄧艷君;日太陽(yáng)輻射分布式模型研究[D];南京信息工程大學(xué);2012年
2 張芳;基于分布式模型的動(dòng)車(chē)組預(yù)測(cè)控制方法[D];華東交通大學(xué);2014年
，本文編號(hào)：2266681
本文鏈接：http://www.sikaile.net/shoufeilunwen/xxkjbs/2266681.html
最近更新
教材專(zhuān)著
