Title :
Towards a dominant-polytope complexity reduction in explicit MPC
Author :
Stevek, Juraj ; Kvasnica, Michal ; Fikar, Miroslav
Author_Institution :
Fac. of Chem. & Food Technol., Slovak Univ. of Technol. in Bratislava, Bratislava, Slovakia
Abstract :
In this paper a complexity reduction method of explicit MPC based on a dominant polytope is proposed. When a partitioning of explicit MPC consists of many small regions and a single big region it is reasonable to expect more frequent call of the control law associated with the big region than another ones during the control performance. Such an organization of the regions favors the online evaluation of explicit MPC. In the paper a problem to find a dominant polytope over the regions that share the same affine control law is studied. The problem of finding maximum volume polytope inscribed in nonconvex area is known as potato peeling problem in the literature. In this paper we focus to find a suboptimal solution by means of stochastic search.
Keywords :
computational complexity; computational geometry; concave programming; piecewise constant techniques; predictive control; search problems; stochastic processes; suboptimal control; NP-hard; affine control law; control performance; dominant-polytope complexity reduction; explicit MPC partitioning; maximum volume polytope; nonconvex area; online evaluation; piecewise affine function; potato peeling problem; stochastic search; suboptimal solution; Approximation methods; Biological cells; Complexity theory; Genetic algorithms; Genetics; Hardware; Upper bound;
Conference_Titel :
Process Control (PC), 2013 International Conference on
Conference_Location :
Strbske Pleso
Print_ISBN :
978-1-4799-0926-1
DOI :
10.1109/PC.2013.6581395