2015
DOI: 10.1016/j.proeng.2015.01.539
|View full text |Cite
|
Sign up to set email alerts
|

Implementation of Mixed-integer Programming on Embedded System

Abstract: One of the most widespread modern control strategies is the discrete-time Model Predictive Control (MPC) method which requires the solution of the quadratic programming problem. For systems with binary input variables the quadratic problem is replaced by more challenging Mixed-Integer Quadratic Programming (MIQP) problem. The objective of this work is the implementation of MIQP problem solver in a low power embedded computing platform with limited computational power and limited memory. The MIQP problem is sol… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
5
0

Year Published

2016
2016
2020
2020

Publication Types

Select...
3
2

Relationship

2
3

Authors

Journals

citations
Cited by 5 publications
(5 citation statements)
references
References 13 publications
0
5
0
Order By: Relevance
“…are valid because only kM = 1 is allowed for cold water kC=1 as given in the value set (7). Increasing the horizons may increase the performance of the controller, but it increases the complexity of the mixed-integer programming procedure.…”
Section: Simulation Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…are valid because only kM = 1 is allowed for cold water kC=1 as given in the value set (7). Increasing the horizons may increase the performance of the controller, but it increases the complexity of the mixed-integer programming procedure.…”
Section: Simulation Resultsmentioning
confidence: 99%
“…The main methods are tailored optimization methods for particular embedded platform. Several application of embedded MIQP solvers have been proposed in [6], [7]. Many methods have been developed for solution of the MIQP problem, however branch-and-bound method have proved superior to other methods such as decomposition method or logic-based method [8].…”
Section: Introductionmentioning
confidence: 99%
“…Moreover, it could be feasible to run the optimization in real-time (implicit or online MPC), which is not covered in this work. Successful MCU implementation of the B&B algorithm was reported in [13], thus real-time decision algorithm could also be the possible direction in this field.…”
Section: Discussionmentioning
confidence: 99%
“…The problem is constrained by limits for input variables, binary variables  and relations defining the evolution of the predicted states. The problem is solved using the branch-and-bound strategy and interior point method is used for solution of the relaxed problems (Novak and Chalupa, 2015). Using the successive linearization strategy the parameters of augmented model are obtained at each sampling period using the current state ( ) x k and linearization of (12).…”
Section: Simulation Examplementioning
confidence: 99%