Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
By Topic

Almost decentralized lyapunov-based nonlinear model predictive control

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Hermans, R.M. ; Dept. of Electr. Eng., Eindhoven Univ. of Technol., Eindhoven, Netherlands ; Lazar, M. ; Jokić, A.

This paper proposes an almost decentralized solution to the problem of stabilizing a network of discrete-time nonlinear systems with coupled dynamics that are subject to local state/input constraints. By “almost decentralized” we mean that each local controller is allowed to use the states of neighboring systems for feedback, whereas it is not permitted to employ iterations between the systems in the network to compute the control action. The controller synthesis method used in this work is Lyapunov-based model predictive control (MPC). The stabilization conditions are decentralized via a set of structured control Lyapunov functions (CLFs) for which the maximum over all the functions in the set is a CLF for the global network of systems. However, this does not necessarily imply that each function is a CLF for its corresponding subsystem. Additionally, we provide a solution for relaxing the temporal monotonicity of the CLF for the overall network. For structured CLFs defined using the infinity norm, we show that the decentralized MPC algorithm can be implemented by solving a single linear program in each network node. A nontrivial example illustrates the effectiveness of the developed theory and shows that the proposed method can perform as well as more complex distributed, iteration-based MPC algorithms.

Published in:

American Control Conference (ACC), 2010

Date of Conference:

June 30 2010-July 2 2010