Dynamics over graph are large-scale systems in which the dynamic coupling among subsystems is modeled by a graph. Examples arise in spatially distributed systems (as discretized PDEs), multi-agent control systems or social dynamics. In this paper, we propose a cloud-assisted distributed algorithm to solve optimal control problems for nonlinear dynamics over graph. Inspired by the centralized Hauser's projection operator approach for optimal control, our main contribution is the design of a descent method in which at each step agents of a network compute a local descent direction, and then obtain a new system trajectory through a distributed feedback controller. Such a controller, iteratively designed by a cloud, allows agents of the network to use only information from neighboring agents, thus resulting into a distributed projection operator over graph. The main advantages of our globally convergent algorithm are dynamic feasibility at each iteration and numerical robustness (thanks to the closed-loop updates) even for unstable dynamics. In order to show the effectiveness of our strategy, we present numerical computations on a discretized model of the Burgers’ nonlinear partial differential equation.

Cloud-assisted Distributed Nonlinear Optimal Control for Dynamics over Graph

Spedicato, Sara;Notarstefano, Giuseppe
2018

Abstract

Dynamics over graph are large-scale systems in which the dynamic coupling among subsystems is modeled by a graph. Examples arise in spatially distributed systems (as discretized PDEs), multi-agent control systems or social dynamics. In this paper, we propose a cloud-assisted distributed algorithm to solve optimal control problems for nonlinear dynamics over graph. Inspired by the centralized Hauser's projection operator approach for optimal control, our main contribution is the design of a descent method in which at each step agents of a network compute a local descent direction, and then obtain a new system trajectory through a distributed feedback controller. Such a controller, iteratively designed by a cloud, allows agents of the network to use only information from neighboring agents, thus resulting into a distributed projection operator over graph. The main advantages of our globally convergent algorithm are dynamic feasibility at each iteration and numerical robustness (thanks to the closed-loop updates) even for unstable dynamics. In order to show the effectiveness of our strategy, we present numerical computations on a discretized model of the Burgers’ nonlinear partial differential equation.
7th IFAC Workshop on Distributed Estimation and Control in Networked Systems NECSYS 2018
361
366
Spedicato, Sara; Notarstefano, Giuseppe
File in questo prodotto:
File Dimensione Formato  
main_distributed_optimal_control_necsys_post.pdf

accesso aperto

Tipo: Postprint
Licenza: Licenza per accesso libero gratuito
Dimensione 717.17 kB
Formato Adobe PDF
717.17 kB Adobe PDF Visualizza/Apri

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11585/678707
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 2
  • ???jsp.display-item.citation.isi??? ND
social impact