Table of Contents
Fetching ...

Fully Distributed Adaptive Nash Equilibrium Seeking Algorithm for Constrained Noncooperative Games with Prescribed Performance

Sichen Qian

Abstract

This paper investigates a fully distributed adaptive Nash equilibrium (NE) seeking algorithm for constrained noncooperative games with prescribed-time stability. On the one hand, prescribed-time stability for the proposed NE seeking algorithm is obtained by using an adaptive penalty technique, a time-varying control gain and a cosine-related time conversion function, which extends the prior asymptotic stability result. On the other hand, uncoordinated integral adaptive gains are incorporated in order to achieve the fully distribution of the algorithm. Finally, the theoretical result is validated through a numerical simulation based on a standard power market scenario.

Fully Distributed Adaptive Nash Equilibrium Seeking Algorithm for Constrained Noncooperative Games with Prescribed Performance

Abstract

This paper investigates a fully distributed adaptive Nash equilibrium (NE) seeking algorithm for constrained noncooperative games with prescribed-time stability. On the one hand, prescribed-time stability for the proposed NE seeking algorithm is obtained by using an adaptive penalty technique, a time-varying control gain and a cosine-related time conversion function, which extends the prior asymptotic stability result. On the other hand, uncoordinated integral adaptive gains are incorporated in order to achieve the fully distribution of the algorithm. Finally, the theoretical result is validated through a numerical simulation based on a standard power market scenario.

Paper Structure

This paper contains 9 sections, 26 equations, 2 figures.

Figures (2)

  • Figure 1: Communication Topology Among Five Power Plants
  • Figure 2: Diagrams of State Variables Varying with Time