Distributed Robustness Analysis of Interconnected Uncertain Systems Using Chordal Decomposition

Large-scale interconnected uncertain systems commonly have large state and uncertainty dimensions. Aside from the heavy computational cost of solving centralized robust stability analysis techniques, privacy requirements in the network can also introduce further issues. In this paper, we utilize IQC analysis for analyzing large-scale interconnected uncertain systems and we evade these issues by describing a decomposition scheme that is based on the interconnection structure of the system. This scheme is based on the so-called chordal decomposition and does not add any conservativeness to the analysis approach. The decomposed problem can be solved using distributed computational algorithms without the need for a centralized computational unit. We further discuss the merits of the proposed analysis approach using a numerical experiment.Comment: 3 figures. Submitted to the 19th IFAC world congres

Multi-agent network games with applications in smart electric mobility

The growing complexity and globalization of modern society brought to light novel problems and challenges for researchers that aim to model real-life phenomena. Nowadays communities and even single individuals cannot be considered as a closed system, since one's actions create a ripple effect that ends up influencing the action of others. Therefore, the study of decision-making processes over networks became a pivotal topic in the research community. The possible applications are virtually endless and span into many different fields. Two of the most relevant examples are smart mobility and energy management in highly populated cities, where a collection of (partially) noncooperative individuals interact over a network trying to reach an efficient equilibrium point, in the sense of Nash, and share limited resources due to the environment in which they operate. In this work, we approach these problems through the lens of game theory. We use different declinations of this powerful mathematical tool to study several aspects of these themes. We design decentralized iterative algorithms solving generalized network games that generate behavioral rules for the players that, if followed, ensure global convergence. Then, we question the classical assumption of perfect players’ rationality by introducing novel dynamics to model partial rationality and analyzing their properties. We conclude by focusing on the design of optimal policies to regulate smart mobility and energy management. In this case, we create a detailed and more realistic description of the problem and use a nudging mechanism, implemented by means of a semi-decentralized algorithm, to align the users' behavior with the one desired by the policymaker