Probability Distributions.- Linear Models for Regression.- Linear Models for Classification.- Neural Networks.- Kernel Methods.- Sparse Kernel Machines.- Graphical Models.- Mixture Models and EM.- Approximate Inference.- Sampling Methods.- Continuous Latent Variables.- Sequential Data.- Combining Models.

Pattern Recognition and Machine Learning

This paper provides a theoretical framework for analysis of consensus algorithms for multi-agent networked systems with an emphasis on the role of directed information flow, robustness to changes in network topology due to link/node failures, time-delays, and performance guarantees. An overview of basic concepts of information consensus in networks and methods of convergence and performance analysis for the algorithms are provided. Our analysis framework is based on tools from matrix theory, algebraic graph theory, and control theory. We discuss the connections between consensus problems in networked dynamic systems and diverse applications including synchronization of coupled oscillators, flocking, formation control, fast consensus in small-world networks, Markov processes and gossip-based algorithms, load balancing in networks, rendezvous in space, distributed sensor fusion in sensor networks, and belief propagation. We establish direct connections between spectral and structural properties of complex networks and the speed of information diffusion of consensus algorithms. A brief introduction is provided on networked systems with nonlocal information flow that are considerably faster than distributed systems with lattice-type nearest neighbor interactions. Simulation results are presented that demonstrate the role of small-world effects on the speed of consensus algorithms and cooperative control of multivehicle formations

/pdf/consensus-and-cooperation-in-networked-multi-agent-systems-5ame7z72ny.pdf

Consensus and Cooperation in Networked Multi-Agent Systems

Data Mining Practical Machine Learning Tools and Techniques

This paper reviews some main results and progress in distributed multi-agent coordination, focusing on papers published in major control systems and robotics journals since 2006. Distributed coordination of multiple vehicles, including unmanned aerial vehicles, unmanned ground vehicles, and unmanned underwater vehicles, has been a very active research subject studied extensively by the systems and control community. The recent results in this area are categorized into several directions, such as consensus, formation control, optimization, and estimation. After the review, a short discussion section is included to summarize the existing research and to propose several promising research directions along with some open problems that are deemed important for further investigations.

/pdf/an-overview-of-recent-progress-in-the-study-of-distributed-1xnb6e12se.pdf

An Overview of Recent Progress in the Study of Distributed Multi-Agent Coordination

System Identification I

This paper deals with energy management in a district where multiple buildings can communicate over a time-varying network and aim at optimizing the use of shared resources like storage systems. We focus on building cooling, and propose an iterative, distributed algorithm that accounts for information privacy, since buildings are not required to disclose information about their individual utility functions and constraint sets encoding, e.g., their consumption profiles, and overcomes the communication and computational challenges imposed by centralized management paradigms. Our approach relies on a methodology based on proximal minimization that has recently appeared in the literature. Motivated by the structure of the considered energy management optimization program, we provide a theoretical extension of this novel methodology, that is applicable to any problem that exhibits such structural properties. The efficacy of the resulting energy management algorithm is illustrated by means of a detailed simulation based study, considering different network topologies.

Energy management for building district cooling: a distributed approach to resource sharing

In this paper we study the issue of characterizing the complexity of air traffic to support Air Traffic Management (ATM) operations. We discuss, in particular, the relevant features of a complexity metric in advanced automated ATM systems where part of the responsibility for separation maintenance is delegated to the aircrews, and trajectory management functions are further automated and distributed. A probabilistic complexity metric is described and analyzed in some detail. Possible applications to conflict detection and resolution and trajectory management operations are presented through numerical examples.

Air traffic complexity in advanced automated Air Traffic Management systems

Identification of a constitutive model for epoxy resins.

https://re.public.polimi.it/bitstream/11311/1134112/1/sMPC_relax_h.pdf

A randomized relaxation method to ensure feasibility in stochastic control of linear systems subject to state and input constraints

Tuning a system to an operating environment calls for experimentation, and a question that arises naturally is: how many experiments are needed to come up with a system meeting certain performance specifications? This paper is an attempt to answer this fundamental question at a somehow general level. We shall here refer to a set-up where adaptation is done according to a worst-case approach, but many facts established are central to adaptation in general.

Maria Prandini

Papers

Energy management for building district cooling: a distributed approach to resource sharing

Air traffic complexity in advanced automated Air Traffic Management systems

Identification of a constitutive model for epoxy resins.

A randomized relaxation method to ensure feasibility in stochastic control of linear systems subject to state and input constraints

Adaptation and the effort needed to adapt