Abstract
This letter presents a distributed waterfilling algorithm for networked control systems where users communicate with neighbors only. Waterfilling—a well-known optimization approach in communication systems—has inspired practical resolution methods for several control engineering and decision-making problems. This letter proposes a fully distributed solution for waterfilling of networked control systems. We consider multiple coupled waterlevels among users that locally communicate only with neighbors, without a central decision maker. We define two alternative versions (an exact one and an approximated one) of a novel distributed algorithm combining consensus, proximity, and the fixed point mapping theory, and show its convergence. We illustrate the technique by a case study on the charging of a fleet of electric vehicles.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
