Details
| Original language | English |
|---|---|
| Pages (from-to) | 7947-7952 |
| Number of pages | 6 |
| Journal | IFAC-PapersOnLine |
| Volume | 50 |
| Issue number | 1 |
| Publication status | Published - 1 Jul 2017 |
| Externally published | Yes |
Abstract
In this work, we propose a sequential distributed MPC algorithm for control of a linear supply chain. The algorithm is developed by closely taking into account supply chain specifics and requirements from practice, e.g., orders and leavings are both treated as decision variables at each stage and communication between stages is kept low. We present the rather surprising result that terminal equality constraints employed in the local MPC formulations are inherently satisfied for the overall system, despite the presence of bilateral dynamic couplings and solving the local MPC problems sequentially. This is due to the stock and flow nature of the problem. The proposed algorithm is shown to be recursively feasible, to asymptotically satisfy a constant customer demand and to achieve asymptotic convergence of the local stock and backlog to the desired levels. This is illustrated by numerical simulations.
Keywords
- Complex logistic systems, Decentralized, decision making in complex systems, distributed control, Modeling, Multiagent systems
ASJC Scopus subject areas
- Engineering(all)
- Control and Systems Engineering
Cite this
- Standard
- Harvard
- Apa
- Vancouver
- BibTeX
- RIS
In: IFAC-PapersOnLine, Vol. 50, No. 1, 01.07.2017, p. 7947-7952.
Research output: Contribution to journal › Article › Research
}
TY - JOUR
T1 - On Exploitation of Supply Chain Properties by Sequential Distributed MPC
AU - Köhler, Philipp N.
AU - Müller, Matthias A.
AU - Pannek, Jürgen
AU - Allgöwer, Frank
N1 - Funding information: Foundation(DFG)forsupportofthisworkwithingrantAL316/11-1 mandquentialongal DMPCthe supplyalgorithmchaipnr.opagatingThe separatetheMPC(customer)problemsde- FnoPdu.ndationwKdiatöthhiiolnenrt,(hDMeF.CGMlu)üsfortloleerrrsuppouafpnEpdxortFcret.lAofleflnlthisgcheöiwsinwerSotrimhkauwithinnliaktthtiiohnnegTGraeecnrhtmnAaonLloR316/11-1g1ye6s(/eEa1Xr1c-Ch1FoPu.nKdaöthiolenr,(DM.F.GMüller)üflolerrsuandpnpdoF.rt.AoflltghöiwswerothankrhkawnikththeihnegGermanraenrtmAanLResea31e6s/ea1r1c-h1 araenfdoramlounlagttehdeisnutphpelyfrcahmaienw.oTrhkeosfetpearrmatineaMl ePqCuaplritoyblceomns-andwithintheClusterofExcellenceinSimulationTechnology(EXC are formulated in the framework of terminal equality con-ano0du/nw2d)iattahitionntht(heDeUFCnGliu)vseftoresrritsoyufpoEpfxoScrettulolteftntgchaeirstin.wMSori.mkMuwlüiatlthlieionrnagTnraedcnhtJn.AoPLloa3gn1yn6e(/kE1Xa1r-C1e atrreafinoremduMlaPteCd. Winethperefsreanmtetwhoerskuropfrtiesrinmginraesluelqtutahlaittythcoense-310/2) at the University of Stuttgart. M. Müller and J. Pannek are strained MPC. We present the surprising result that these ans0do/w2su)itpahptiontrhttheedeUCbnyliuvtsehtreesritDoyfFoEGfx,ScgetrullatentngtcaeWrtin.OMS2i.m05Mu6lü/a1ltli.eornaTnedchJn. oPloagnyne(kEXarCe strained MPC. We present the surprising result that these also supported by the DFG, grant WO 2056/1. als0o/2su)paptotrhteedUbnyivtehresitDyFoGf,SgtruatntgtaWrt.OM2.05M6ü/1ll.er and J. Pannek are strained MPC. We present the surprising result that these also supported by the DFG, grant WO 2056/1. Copyright © 2017 IFAC 8223 C2o40p5y-r8i9g6h3t ©© 22001177, IIFFAC (International Federation of Automatic Cont8ro2l2) 3Hosting by Elsevier Ltd. All rights reserved. Copyright © 2017 IFAC 8223 Peer review under responsibility of International Federation of Automatic Control. Copyright © 2017 IFAC 8223 10.1016/j.ifacol.2017.08.706
PY - 2017/7/1
Y1 - 2017/7/1
N2 - In this work, we propose a sequential distributed MPC algorithm for control of a linear supply chain. The algorithm is developed by closely taking into account supply chain specifics and requirements from practice, e.g., orders and leavings are both treated as decision variables at each stage and communication between stages is kept low. We present the rather surprising result that terminal equality constraints employed in the local MPC formulations are inherently satisfied for the overall system, despite the presence of bilateral dynamic couplings and solving the local MPC problems sequentially. This is due to the stock and flow nature of the problem. The proposed algorithm is shown to be recursively feasible, to asymptotically satisfy a constant customer demand and to achieve asymptotic convergence of the local stock and backlog to the desired levels. This is illustrated by numerical simulations.
AB - In this work, we propose a sequential distributed MPC algorithm for control of a linear supply chain. The algorithm is developed by closely taking into account supply chain specifics and requirements from practice, e.g., orders and leavings are both treated as decision variables at each stage and communication between stages is kept low. We present the rather surprising result that terminal equality constraints employed in the local MPC formulations are inherently satisfied for the overall system, despite the presence of bilateral dynamic couplings and solving the local MPC problems sequentially. This is due to the stock and flow nature of the problem. The proposed algorithm is shown to be recursively feasible, to asymptotically satisfy a constant customer demand and to achieve asymptotic convergence of the local stock and backlog to the desired levels. This is illustrated by numerical simulations.
KW - Complex logistic systems
KW - Decentralized
KW - decision making in complex systems
KW - distributed control
KW - Modeling
KW - Multiagent systems
UR - http://www.scopus.com/inward/record.url?scp=85031811999&partnerID=8YFLogxK
U2 - 10.1016/j.ifacol.2017.08.706
DO - 10.1016/j.ifacol.2017.08.706
M3 - Article
VL - 50
SP - 7947
EP - 7952
JO - IFAC-PapersOnLine
JF - IFAC-PapersOnLine
SN - 2405-8963
IS - 1
ER -