Mixed integer predictive control and shortest path reformulation

Details Mixed integer predictive control and shortest path reformulation Mixed integer predictive control and shortest path reformulation

2010-03-15

arxiv.org/abs/1003.2889v1

Mathematics

Optimization and Control

Scientific paper

Mixed integer predictive control deals with optimizing integer and real control variables over a receding horizon. The mixed integer nature of controls might be a cause of intractability for instances of larger dimensions. To tackle this little issue, we propose a decomposition method which turns the original $n$-dimensional problem into $n$ indipendent scalar problems of lot sizing form. Each scalar problem is then reformulated as a shortest path one and solved through linear programming over a receding horizon. This last reformulation step mirrors a standard procedure in mixed integer programming. The approximation introduced by the decomposition can be lowered if we operate in accordance with the predictive control technique: i) optimize controls over the horizon ii) apply the first control iii) provide measurement updates of other states and repeat the procedure.

Affiliated with

Also associated with

No associations

Rating

Mixed integer predictive control and shortest path reformulation does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Mixed integer predictive control and shortest path reformulation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Mixed integer predictive control and shortest path reformulation will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-214214