Optimal bandwidth scheduling of networked learning control system based on Nash theory and auction mechanism (Q473789)

From MaRDI portal
Revision as of 07:50, 9 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)





scientific article
Language Label Description Also known as
English
Optimal bandwidth scheduling of networked learning control system based on Nash theory and auction mechanism
scientific article

    Statements

    Optimal bandwidth scheduling of networked learning control system based on Nash theory and auction mechanism (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    24 November 2014
    0 references
    Summary: This paper addresses the optimal bandwidth scheduling problem for a double-layer networked learning control system (NLCS). To deal with this issue, auction mechanism is employed, and a dynamic bandwidth scheduling methodology is proposed to allocate the bandwidth for each subsystem. A noncooperative game fairness model is formulated, and the utility function of subsystems is designed. Under this framework, estimation of distribution algorithm (EDA) is used to obtain Nash equilibrium for NLCS. Finally, simulation and experimental results are given to demonstrate the effectiveness of the proposed approach.
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references