For rate control (RC) of hierarchical structure coding, an independent rate-quantization (R-Q) model was proposed based on mean absolute differences (MADs) in different temporal levels (TLs). In the proposed R-Q model...For rate control (RC) of hierarchical structure coding, an independent rate-quantization (R-Q) model was proposed based on mean absolute differences (MADs) in different temporal levels (TLs). In the proposed R-Q model, a novel MAD model was developed according to the hierarchical structure. The experimental results demonstrate that the proposed algorithm provides better performance, in terms of average peak signal-to-noise ratio (PSNR) and quality smoothness, than the H.264 reference model, JM14.2, under various sequences.展开更多
In this paper,we consider distributed Nash equilibrium(NE)seeking in potential games over a multi-agent network,where each agent can not observe the actions of all its rivals.Based on the best response dynamics,we des...In this paper,we consider distributed Nash equilibrium(NE)seeking in potential games over a multi-agent network,where each agent can not observe the actions of all its rivals.Based on the best response dynamics,we design a distributed NE seeking algorithm by incorporating the non-smooth finite-time average tracking dynamics,where each agent only needs to know its own action and exchange information with its neighbours through a communication graph.We give a sufficient condition for the Lipschitz continuity of the best response mapping for potential games,and then prove the convergence of the proposed algorithm based on the Lyapunov theory.Numerical simulations are given to verify the resultandillustrate the effectiveness of the algorithm.展开更多
There has been an increasing research interest in modeling,optimization and control of various multi-agent networks that have wide applications in industry,defense,security,and social areas,such as computing clusters,...There has been an increasing research interest in modeling,optimization and control of various multi-agent networks that have wide applications in industry,defense,security,and social areas,such as computing clusters,interconnected micro-grid systems,unmanned vessel swarms[1],power systems[2],multiple UAV systems[3]and sensor networks[4].For non-cooperative agents that only concern selfish profit-maximizing,the decision making problem can be modelled and solved with the help of game theory,while Nash equilibrium(NE)seeking is at the core to solve the non-cooperative multi-agent games[5-7].Distributed NE seeking methods are appealing compared with the center-based methods in large-scale networks due to its scalability,privacy protection,and adaptability.Recently,monotone operator theory is explored for distributed NE seeking,which is shown to provide an uniform framework for various algorithms in different scenarios.It has been gradually developing into a cutting-edge research field,with the prospect and necessity of future in-depth research.展开更多
This paper studies an event-tniggered control problem for nonlinear systems subject to both external disturbancoes and dy namic uncertainties.It is assumed that the system satisfies a global sector bound condition.To ...This paper studies an event-tniggered control problem for nonlinear systems subject to both external disturbancoes and dy namic uncertainties.It is assumed that the system satisfies a global sector bound condition.To avold infnitely fast samplng,a novel eventriggred sampling mechanism is propoeed,which use8 not only the measuned system state but also an estimation of the inluence of the disturbances.With the propoeed design,the intersampling intervals an be lower bounded by a poeitive constant,and it is independent of botb external disturbances and dynamie umcertainties.Moreover,the doeedl loop event-tniggered system i proved to be input-torstate stable with repect to the extemal disturbances.Advanced smalgain techmigues are;used for the stability analysis of the dloeeil-bop system.展开更多
Distributed Nash equilibrium seeking of aggregative games is investigated and a continuous-time algorithm is proposed.The algorithm is designed by virtue of projected gradient play dynamics and aggregation tracking dy...Distributed Nash equilibrium seeking of aggregative games is investigated and a continuous-time algorithm is proposed.The algorithm is designed by virtue of projected gradient play dynamics and aggregation tracking dynamics,and is applicable to games with constrained strategy sets and weight-balanced communication graphs.The key feature of our method is that the proposed projected dynamics achieves exponential convergence,whereas such convergence results are only obtained for non-projected dynamics in existing works on distributed optimization and equilibrium seeking.Numerical examples illustrate the effectiveness of our methods.展开更多
基金National Natural Science Foundations of China (No. 60972035,No. 61074009)Natural Science Foundation Program of Shanghai,China ( No. 10ZR1432800)
文摘For rate control (RC) of hierarchical structure coding, an independent rate-quantization (R-Q) model was proposed based on mean absolute differences (MADs) in different temporal levels (TLs). In the proposed R-Q model, a novel MAD model was developed according to the hierarchical structure. The experimental results demonstrate that the proposed algorithm provides better performance, in terms of average peak signal-to-noise ratio (PSNR) and quality smoothness, than the H.264 reference model, JM14.2, under various sequences.
基金This work was supported by the Shanghai Sailing Program(No.20YF1453000)the Fundamental Research Funds for the Central Universities(No.22120200048).
文摘In this paper,we consider distributed Nash equilibrium(NE)seeking in potential games over a multi-agent network,where each agent can not observe the actions of all its rivals.Based on the best response dynamics,we design a distributed NE seeking algorithm by incorporating the non-smooth finite-time average tracking dynamics,where each agent only needs to know its own action and exchange information with its neighbours through a communication graph.We give a sufficient condition for the Lipschitz continuity of the best response mapping for potential games,and then prove the convergence of the proposed algorithm based on the Lyapunov theory.Numerical simulations are given to verify the resultandillustrate the effectiveness of the algorithm.
基金This work was supported by the Shanghai Sailing Program(No.20YF1453000)the Fundamental Research Funds for the Central Universities(No.22120200048).
文摘There has been an increasing research interest in modeling,optimization and control of various multi-agent networks that have wide applications in industry,defense,security,and social areas,such as computing clusters,interconnected micro-grid systems,unmanned vessel swarms[1],power systems[2],multiple UAV systems[3]and sensor networks[4].For non-cooperative agents that only concern selfish profit-maximizing,the decision making problem can be modelled and solved with the help of game theory,while Nash equilibrium(NE)seeking is at the core to solve the non-cooperative multi-agent games[5-7].Distributed NE seeking methods are appealing compared with the center-based methods in large-scale networks due to its scalability,privacy protection,and adaptability.Recently,monotone operator theory is explored for distributed NE seeking,which is shown to provide an uniform framework for various algorithms in different scenarios.It has been gradually developing into a cutting-edge research field,with the prospect and necessity of future in-depth research.
基金supported in part by the National Natural Science Foundation of China under Grant U1911401Shanghai Municipal Science and Technology Major Project(2021SHZDZX0100)and in part by the U.S.National Science Foundation under Grant EPCN-1903781.
文摘This paper studies an event-tniggered control problem for nonlinear systems subject to both external disturbancoes and dy namic uncertainties.It is assumed that the system satisfies a global sector bound condition.To avold infnitely fast samplng,a novel eventriggred sampling mechanism is propoeed,which use8 not only the measuned system state but also an estimation of the inluence of the disturbances.With the propoeed design,the intersampling intervals an be lower bounded by a poeitive constant,and it is independent of botb external disturbances and dynamie umcertainties.Moreover,the doeedl loop event-tniggered system i proved to be input-torstate stable with repect to the extemal disturbances.Advanced smalgain techmigues are;used for the stability analysis of the dloeeil-bop system.
基金This work was partially supported by the National Natural Science Foundation of China under Grant 61903027,72171171,62003239Shanghai Municipal Science and Technology Major Project under Grant 2021SHZDZX0100Shanghai Sailing Program under Grant 20YF1453000.
文摘Distributed Nash equilibrium seeking of aggregative games is investigated and a continuous-time algorithm is proposed.The algorithm is designed by virtue of projected gradient play dynamics and aggregation tracking dynamics,and is applicable to games with constrained strategy sets and weight-balanced communication graphs.The key feature of our method is that the proposed projected dynamics achieves exponential convergence,whereas such convergence results are only obtained for non-projected dynamics in existing works on distributed optimization and equilibrium seeking.Numerical examples illustrate the effectiveness of our methods.
