Searcharxiv⌕ Search

arXiv subjects

Andrea Da Col

Publications and source records attributed to Andrea Da Col.

3 recordsLinked to original sources

Do Hierarchical Networks Actually Learn? Insights from Word-of-Mouth Estimation

We study recursive estimation of a constant state vector by a hierarchical network of asymmetrically informed linear estimators, modeled as a directed tree. Only the leaves observe the regression signal, whereas every other estimator learns by word of mouth from noisy signal estimates relayed by its children. Authority within the hierarchy is expressed through common prior information: after each round, every estimator adopts the estimate and error covariance broadcast by the root. The more accurate this common information, the larger the effective noise variance on local observations, which makes estimation intrinsically self-defeating. The resulting performance is the subject of this paper. We show that recursive least-squares (RLS) estimators do learn the state in mean square, albeit slowly. Under strong persistency of excitation, the broadcast error covariance decays polynomially in time, at a rate that we characterize by upper and lower bounds of matching order. The exponent is determined by the smallest number of relays between a leaf and the root, and it decreases exponentially with this number.

eess.SP↗

On Word-of-Mouth and Private-Prior Sequential Social Learning

Social learning constitutes a fundamental framework for studying interactions among rational agents who observe each other's actions but lack direct access to individual beliefs. This paper investigates a specific social learning paradigm known as Word-of-Mouth (WoM), where a series of agents seeks to estimate the state of a dynamical system. The first agent receives noisy measurements of the state, while each subsequent agent relies solely on a degraded version of her predecessor's estimate. A defining feature of WoM is that the final agent's belief is publicly broadcast and subsequently adopted by all agents, in place of their own. We analyze this setting theoretically and through numerical simulations, noting that some agents benefit from using the belief of the last agent, while others experience performance deterioration.

cs.MA↗

Robust Model Predictive Control for Aircraft Intent-Aware Collision Avoidance

This paper presents the use of robust model predictive control for the design of an intent-aware collision avoidance system for multi-agent aircraft engaged in horizontal maneuvering scenarios. We assume that information from other agents is accessible in the form of waypoints or destinations. Consequently, we consider that other agents follow their optimal Dubin's path--a trajectory that connects their current state to their intended state--while accounting for potential uncertainties. We propose using scenario tree model predictive control as a robust approach that demonstrates computational efficiency. We demonstrate that the proposed method can easily integrate intent information and offer a robust scheme that handles different uncertainties. The method is illustrated through simulation results.

eess.SY↗