Papers
Topics
Authors
Recent
Search
2000 character limit reached

Decentralized Fuzzy MPC Framework

Updated 27 December 2025
  • Decentralized MPC is an approach that assigns local control to subsystems while ensuring robust overall stability and low computational cost.
  • It employs interval type‐2 fuzzy Takagi–Sugeno models to capture membership uncertainty and dynamic coupling among nonlinear subsystems.
  • The framework decomposes global optimization into parallel quadratic programs, significantly reducing online computational effort and enhancing disturbance rejection.

A decentralized Model Predictive Control (MPC) framework allocates control authority to local controllers associated with subsystems of a large‐scale system, while ensuring robust stability, recursive feasibility, low online computational cost, and effective handling of coupling and uncertainty. In the decentralized robust interval type‐2 fuzzy MPC (IT2‐Fuzzy‐MPC) for Takagi–Sugeno (T–S) large‐scale systems (Sarbaz et al., 2021), each nonlinear subsystem is modeled by an interval type‐2 fuzzy rule base capturing membership uncertainty, with affine dynamic couplings incorporated as additive terms, and the global online optimization is decomposed into parallel local quadratic programs (QPs).

1. Interval Type-2 Fuzzy Takagi–Sugeno Large-Scale System Modeling

Each subsystem SiS_i, for i=1,,Ni=1,\ldots,N, is described by an interval type‐2 (IT2) fuzzy T–S rule base with rir_i rules:

  • Rule l=1,,ril=1,\ldots,r_i:

IF zi1 is Fi1 and  and zig is Fig\text{IF } z_{i1} \text{ is } F_{i1} \text{ and } \ldots \text{ and } z_{ig} \text{ is } F_{ig}

THEN xi(k+1)=Ailxi(k)+Bilui(k)+Eildi(k)+j=1NGijlxj(k)\text{THEN } x_i(k+1) = A_i^l x_i(k) + B_i^l u_i(k) + E_i^l d_i(k) + \sum_{j=1}^N G_{ij}^l x_j(k)

  • The aggregated update over all rules and interval firing strengths wil(zi(k))[wil(zi(k)),wil(zi(k))]w_i^l(z_i(k)) \in [\,\underline w_i^l(z_i(k)),\,\overline w_i^l(z_i(k))\,] becomes:

xi(k+1)=l=1riwil(zi(k))[Ailxi(k)+Bilui(k)+Eildi(k)]+l=1rij=1Nwil(zi(k))Gijlxj(k)x_i(k+1) = \sum_{l=1}^{r_i} w_i^l(z_i(k)) [A_i^l x_i(k) + B_i^l u_i(k) + E_i^l d_i(k)] + \sum_{l=1}^{r_i} \sum_{j=1}^N w_i^l(z_i(k)) G_{ij}^l x_j(k)

  • The interval weights are defined with state‐dependent splitting:

wil(zi)=pil(xi)μil(zi),wil(zi)=pil(xi)μil(zi),pil(xi)+qil(xi)=1\underline w_i^l(z_i) = p_i^l(x_i)\,\underline{\mu}_{i^l}(z_i),\quad \overline w_i^l(z_i) = p_i^l(x_i)\,\overline{\mu}_{i^l}(z_i),\quad p_i^l(x_i) + q_i^l(x_i)=1

  • Footprint of uncertainty (FOU) is encoded in each membership function via μ(zi)=11+e(xic)±Δ(xi),Δ(xi)[δ,δ]\,\mu(z_i)=\frac{1}{1+e^{-(x_i-c)}} \pm \Delta(x_i),\,\Delta(x_i)\in[-\delta,\delta].

2. Formulation of the Decentralized Fuzzy-MPC Optimization Problem

Prediction Model:

For a receding horizon i=1,,Ni=1,\ldots,N0, predictions are computed for each subsystem by applying the IT2‐T–S update (with weights from current state measurements and predicted neighbor states): i=1,,Ni=1,\ldots,N1

Cost Function and Constraints:

Each local MPC solves a min–max Ho‐type cost: i=1,,Ni=1,\ldots,N2

  • Terminal set: i=1,,Ni=1,\ldots,N3 (robust positively invariant, RPI).
  • State, input, disturbance constraints: i=1,,Ni=1,\ldots,N4, i=1,,Ni=1,\ldots,N5, i=1,,Ni=1,\ldots,N6
  • Coupling: Only appears affinely via predicted subsystem states, no hard cross-subsystem inequalities.

Robust Tightening: Disturbance handling is embedded via the negative-definite Ho term and enforced through selection of RPI terminal sets.

3. Decentralized Parallel Implementation Strategy

  • The global MPC decomposes into i=1,,Ni=1,\ldots,N7 parallel QPs, one per subsystem, as neighbor coupling terms i=1,,Ni=1,\ldots,N8 require only immediate state information i=1,,Ni=1,\ldots,N9 at the current sample.
  • Controllers exchange only current neighbor states, with no multi-step look-ahead or future trajectory communication.
  • All local QPs are solved in parallel, leveraging measured or communicated neighbor states.

Pseudocode for Decentralized IT2-Fuzzy MPC:

  1. Measure rir_i0 and neighbor states rir_i1
  2. Evaluate firing intervals rir_i2
  3. Formulate the local LMI‐QP: minimize rir_i3 subject to LMIs (17),(18),(23),(26) for gains rir_i4, matrices rir_i5, constants rir_i6
  4. Apply rir_i7
  5. Send rir_i8 to neighbors

4. Robustness and Stability Analysis

RPI Terminal Set and Feasibility:

For each subsystem, construct rir_i9 and seek state-feedback gains l=1,,ril=1,\ldots,r_i0 guaranteeing, for all l=1,,ril=1,\ldots,r_i1: l=1,,ril=1,\ldots,r_i2 with l=1,,ril=1,\ldots,r_i3, l=1,,ril=1,\ldots,r_i4, and l=1,,ril=1,\ldots,r_i5.

ISS Lyapunov Argument:

Defining l=1,,ril=1,\ldots,r_i6, under the closed-loop policy: l=1,,ril=1,\ldots,r_i7 guarantees input-to-state stability (ISS) under bounded disturbances.

5. Computational Efficiency and Numerical Performance

  • Online cost is minimized by precomputing and fixing l=1,,ril=1,\ldots,r_i8 offline so that the online QP (subject to the required LMIs) is low-dimensional for each subsystem.
  • Parallel computation: All local QPs are solved independently and in parallel.
  • Solve time: Examples report l=1,,ril=1,\ldots,r_i92 ms per local QP on standard PC hardware.

Numerical Studies:

  • Chain of three subsystems (IF zi1 is Fi1 and  and zig is Fig\text{IF } z_{i1} \text{ is } F_{i1} \text{ and } \ldots \text{ and } z_{ig} \text{ is } F_{ig}0): IF zi1 is Fi1 and  and zig is Fig\text{IF } z_{i1} \text{ is } F_{i1} \text{ and } \ldots \text{ and } z_{ig} \text{ is } F_{ig}1, IF zi1 is Fi1 and  and zig is Fig\text{IF } z_{i1} \text{ is } F_{i1} \text{ and } \ldots \text{ and } z_{ig} \text{ is } F_{ig}2, IF zi1 is Fi1 and  and zig is Fig\text{IF } z_{i1} \text{ is } F_{i1} \text{ and } \ldots \text{ and } z_{ig} \text{ is } F_{ig}3, IF zi1 is Fi1 and  and zig is Fig\text{IF } z_{i1} \text{ is } F_{i1} \text{ and } \ldots \text{ and } z_{ig} \text{ is } F_{ig}4. Horizon IF zi1 is Fi1 and  and zig is Fig\text{IF } z_{i1} \text{ is } F_{i1} \text{ and } \ldots \text{ and } z_{ig} \text{ is } F_{ig}5, quadratic weights, disturbance bound IF zi1 is Fi1 and  and zig is Fig\text{IF } z_{i1} \text{ is } F_{i1} \text{ and } \ldots \text{ and } z_{ig} \text{ is } F_{ig}6.
  • Double-inverted pendulum (IF zi1 is Fi1 and  and zig is Fig\text{IF } z_{i1} \text{ is } F_{i1} \text{ and } \ldots \text{ and } z_{ig} \text{ is } F_{ig}7 rules/subsystem): Closed-loop tracking error within IF zi1 is Fi1 and  and zig is Fig\text{IF } z_{i1} \text{ is } F_{i1} \text{ and } \ldots \text{ and } z_{ig} \text{ is } F_{ig}8 s, disturbance rejection tested.
  • Compared to decentralized PI, the decentralized fuzzy-MPC reduces settling time by IF zi1 is Fi1 and  and zig is Fig\text{IF } z_{i1} \text{ is } F_{i1} \text{ and } \ldots \text{ and } z_{ig} \text{ is } F_{ig}9 and control effort by THEN xi(k+1)=Ailxi(k)+Bilui(k)+Eildi(k)+j=1NGijlxj(k)\text{THEN } x_i(k+1) = A_i^l x_i(k) + B_i^l u_i(k) + E_i^l d_i(k) + \sum_{j=1}^N G_{ij}^l x_j(k)0.

6. Advantages, Limitations, and Scalability

Advantages:

  • True decentralization: Only current states are exchanged—no higher-order coms or trajectory sharing.
  • Interval type-2 fuzzy modeling: Models membership uncertainty directly, greatly reducing conservatism while retaining robust performance.
  • Min–max Ho-MPC: Guarantees robust ISS and effective disturbance rejection by explicit handling in cost/terminal set.
  • Low online computational cost: Off-line LMI pre-tuning and parallel QP solution for each subsystem enable real-time capabilities even in large networks.

Limitations:

  • Model structure is tailored to IT2 fuzzy T–S systems—the benefits of membership uncertainty handling are specific to this formulation.
  • Performance is contingent on the linearity of coupling and measurement/communication accessibility of neighbor states at every sample.

7. Context within Modern Decentralized MPC Research

This decentralized IT2-Fuzzy-MPC (Sarbaz et al., 2021) advances the scalable and robust control of nonlinear large-scale networked systems by combining interval type-2 fuzzy modeling with min–max MPC for each subsystem, relying solely on neighbor state exchange. It directly addresses key limitations of existing fuzzy-MPC approaches (excessive computational burden and conservatism) by decomposing the global optimization and exploiting parallel structure. The method is demonstrably more effective and computationally efficient than contemporary decentralized PI schemes in disturbance rejection and stabilization metrics.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (1)

Topic to Video (Beta)

No one has generated a video about this topic yet.

Whiteboard

No one has generated a whiteboard explanation for this topic yet.

Follow Topic

Get notified by email when new papers are published related to Decentralized Model Predictive Control (MPC) Framework.