Searcharxiv⌕ Search

arXiv subjects

Marco Coraggio

Publications and source records attributed to Marco Coraggio.

At least 19 recordsLinked to original sources
arXiv2026

Persistent homology broadens the controllable subspace in human structural connectomes

Network control theory applied to structural connectomes typically ranks brain regions as candidate driver nodes by their structural connectivity strength, and evaluates performance through scalar control energy. We test whether this framing captures the most relevant information about how driver-node selection shapes brain network control. We introduce an alternative criterion based on the persistent topological cycles in which each node participates---a measure of mesoscale integration that captures features beyond local connectivity---and compare it to standard degree-based selection across 70 human structural connectomes at three parcellation scales. Topology- and degree-informed driver sets achieve nearly identical scalar control energy, differing by approximately 0.2%. The geometry of the controllable subspace, however, differs substantially: topology-informed sets distribute controllability across more dimensions of state space and produce better-conditioned controllability matrices. This geometric advantage is preserved when high-degree hub nodes are removed, and it carries a functional signature: because the two criteria place driver nodes in different cortical territory, each most efficiently reaches a different class of target state. The choice of node-ranking criterion therefore shapes which brain-state transitions are energetically favored even when average control cost is unchanged. The results reveal a dissociation between control cost and control geometry, and demonstrate that persistent topology captures information about brain network control that scalar energy summaries miss.

q-bio.NC↗
arXiv2026

How haptic feedback enables human group synchronization

Synchronization often emerges spontaneously among interacting people, yielding practical benefits for tasks such as sports, physical rehabilitation, and collaborative manufacturing, and fostering a sense of unity and trust. Although visual interaction is typically considered the primary channel for achieving synchronization, it is constrained by sensorimotor delays, occlusions, and limited attentional resources. Here, we tested whether haptic communication can induce or enhance synchronization in a group motor task. Six quartets performed oscillatory wrist flexion/extension while being connected via virtual elastic bands; we compared haptic only, visual only, combined haptic\&visual, and no feedback conditions. Even weak haptic coupling induced group synchronization, and combining haptic with visual feedback yielded higher and more stable synchronization than either modality alone. Haptic feedback also increased the frequency at which groups coordinated, and movement smoothness rose with frequency. These findings lay the groundwork for designing haptic interaction protocols for collaborative group environments.

eess.SY↗
arXiv2025

ROPE: A Novel Method for Real-Time Phase Estimation of Complex Biological Rhythms

Accurate phase estimation -- the process of assigning phase values between $0$ and $2\pi$ to repetitive or periodic signals -- is a cornerstone in the analysis of oscillatory signals across diverse fields, from neuroscience to robotics, where it is fundamental, e.g., to understanding coordination in neural networks, cardiorespiratory coupling, and human-robot interaction. However, existing methods are often limited to offline processing and/or constrained to one-dimensional signals. In this paper, we introduce ROPE, which, to the best of our knowledge, is the first phase-estimation algorithm capable of (i) handling signals of arbitrary dimension and (ii) operating in real-time, with minimal error. ROPE identifies repetitions within the signal to segment it into (pseudo-)periods and assigns phase values by performing efficient, tractable searches over previous signal segments. We extensively validate the algorithm on a variety of signal types, including trajectories from chaotic dynamical systems, human motion-capture data, and electrocardiographic recordings. Our results demonstrate that ROPE is robust against noise and signal drift, and achieves significantly superior performance compared to state-of-the-art phase estimation methods. This advancement enables real-time analysis of complex biological rhythms, opening new pathways, for example, for early diagnosis of pathological rhythm disruptions and developing rhythm-based therapeutic interventions in neurological and cardiovascular disorders.

eess.SP↗
arXiv2025

When higher-order interactions enhance synchronization: the case of the Kuramoto model

Synchronization is a fundamental phenomenon in complex systems, observed across a wide range of natural and engineered contexts. The Kuramoto model provides a foundational framework for understanding synchronization among coupled oscillators, traditionally assuming pairwise interactions. However, many real-world systems exhibit group and many-body interactions, which can be effectively modeled through hypergraphs. Here we show that the effect of such higher-order interactions on synchronization is non-monotonic. Through a numerical study of higher-order Kuramoto models on random hypergraphs and on globally coupled systems, we find that the degree of synchronization reached from incoherent initial conditions is maximized at a small but nonzero higher-order coupling strength: weak higher-order interactions enhance synchronization when added to pairwise ones, whereas strong ones work against it, in line with earlier reports of reduced basins and of cluster states. We further show, through a cost-constrained allocation analysis, that under a constrained budget for interactions a mixed allocation of pairwise and higher-order couplings consistently achieves higher synchronization than relying on either type alone. These findings clarify the role of higher-order interactions in shaping collective dynamics and point to design principles for optimizing synchronization in complex systems.

nlin.AO↗
arXiv2025

Controlling Complex Systems

This chapter provides a comprehensive overview of controlling collective behavior in complex systems comprising large ensembles of interacting dynamical agents. Building upon traditional control theory's foundation in individual systems, we introduce tools designed to address the unique challenges of coordinating networks that exhibit emergent phenomena, including consensus, synchronization, and pattern formation. We analyze how local agent interactions generate macroscopic behaviors and investigate the fundamental role of network topology in determining system dynamics. Inspired by natural systems, we emphasize control strategies that achieve global coordination through localized interventions while considering practical implementation challenges. The chapter concludes by presenting novel frameworks for managing very large agent ensembles and leveraging interacting networks for control purposes.

eess.SY↗
arXiv2025

Reproducing Human Individual Motor Signatures: A Data-Driven Approach for Repetitive Motion

The deployment of autonomous virtual avatars (in extended reality) and robots in human group activities---such as rehabilitation therapy, sports, and manufacturing---is expected to increase as these technologies become more pervasive. Designing cognitive architectures and control strategies to drive these agents requires realistic models of human motion. Furthermore, recent research has shown that each person exhibits a unique velocity signature, highlighting how individual motor behaviors are both rich in variability and internally consistent. However, existing models only provide simplified descriptions of human motor behavior, hindering the development of effective cognitive architectures. In this work, we first show that motion amplitude provides a useful characterization of individual motor signatures, complementary to existing ones. Then, we propose a fully data-driven approach to generate original one-dimensional motion that captures the unique features of specific individuals, based on long short-term memory neural networks. We validate the architecture using real human data from participants performing spontaneous oscillatory motion. Thorough statistical analyses support that our model reproduces the velocity distribution and amplitude envelopes of the individual it was trained on, while remaining distinct from others.

cs.GR↗
arXiv2024

Learning-based cognitive architecture for enhancing coordination in human groups

As interactions with autonomous agents-ranging from robots in physical settings to avatars in virtual and augmented realities-become more prevalent, developing advanced cognitive architectures is critical for enhancing the dynamics of human-avatar groups. This paper presents a reinforcement-learning-based cognitive architecture, trained via a sim-to-real approach, designed to improve synchronization in periodic motor tasks, crucial for applications in group rehabilitation and sports training. Extensive numerical validation consistently demonstrates improvements in synchronization. Theoretical derivations and numerical investigations are complemented by preliminary experiments with real participants, showing that our avatars can integrate seamlessly into human groups, often being indistinguishable from humans.

eess.SY↗
arXiv2023

Guaranteeing Control Requirements via Reward Shaping in Reinforcement Learning

In addressing control problems such as regulation and tracking through reinforcement learning, it is often required to guarantee that the acquired policy meets essential performance and stability criteria such as a desired settling time and steady-state error prior to deployment. Motivated by this necessity, we present a set of results and a systematic reward shaping procedure that (i) ensures the optimal policy generates trajectories that align with specified control requirements and (ii) allows to assess whether any given policy satisfies them. We validate our approach through comprehensive numerical experiments conducted in two representative environments from OpenAI Gym: the Inverted Pendulum swing-up problem and the Lunar Lander. Utilizing both tabular and deep reinforcement learning methods, our experiments consistently affirm the efficacy of our proposed framework, highlighting its effectiveness in ensuring policy adherence to the prescribed control requirements.

eess.SY↗
arXiv2023

Data-driven design of complex network structures to promote synchronization

We consider the problem of optimizing the interconnection graphs of complex networks to promote synchronization. When traditional optimization methods are inapplicable, due to uncertain or unknown node dynamics, we propose a data-driven approach leveraging datasets of relevant examples. We analyze two case studies, with linear and nonlinear node dynamics. First, we show how including node dynamics in the objective function makes the optimal graphs heterogeneous. Then, we compare various design strategies, finding that the best either utilize data samples close to a specific Pareto front or a combination of a neural network and a genetic algorithm, with statistically better performance than the best examples in the datasets.

eess.SY↗
arXiv2023

Local convergence of multi-agent systems towards triangular patterns

Geometric pattern formation is an important emergent behavior in many applications involving large-scale multi-agent systems, such as sensor networks deployment and collective transportation. Attraction/repulsion virtual forces are the most common control approach to achieve such behavior in a distributed and scalable manner. Nevertheless, for most existing solutions only numerical and/or experimental evidence of their convergence is available. Here, we revisit the problem of achieving pattern formation giving sufficient conditions to prove analytically that under the influence of appropriate virtual forces, a large-scale multi-agent swarming system locally converges towards a stable and robust triangular lattice configuration. Specifically, the proof is carried out using LaSalle's invariance principle and geometry-based arguments. Our theoretical results are complemented by exhaustive numerical simulations confirming their effectiveness and estimating the region of asymptotic stability of the triangular configuration.

eess.SY↗
arXiv2023

Consensus-based Distributed Intentional Controlled Islanding of Power Grids

The problem of partitioning a power grid into a set of islands can be a solution to restore power dispatchment in sections of a grid affected by an extreme failure. Current solutions to this problem usually involve finding the partition of the grid into islands that minimizes the sum of their absolute power imbalances. This combinatorial problem is often solved through heuristic offline methods. In this paper, we propose instead a distributed online algorithm through which nodes can migrate among islands, self-organizing the network into a suitable partition. We prove that, under a set of appropriate assumptions, the proposed solution yields a partition whose absolute power imbalance falls within a given bound of the optimal solution. We validate our analytical results by testing our partitioning strategy on the IEEE 118 and 300 benchmark problems.

eess.SY↗
arXiv2022

CT-DQN: Control-Tutored Deep Reinforcement Learning

One of the major challenges in Deep Reinforcement Learning for control is the need for extensive training to learn the policy. Motivated by this, we present the design of the Control-Tutored Deep Q-Networks (CT-DQN) algorithm, a Deep Reinforcement Learning algorithm that leverages a control tutor, i.e., an exogenous control law, to reduce learning time. The tutor can be designed using an approximate model of the system, without any assumption about the knowledge of the system's dynamics. There is no expectation that it will be able to achieve the control objective if used stand-alone. During learning, the tutor occasionally suggests an action, thus partially guiding exploration. We validate our approach on three scenarios from OpenAI Gym: the inverted pendulum, lunar lander, and car racing. We demonstrate that CT-DQN is able to achieve better or equivalent data efficiency with respect to the classic function approximation solutions.

cs.LG↗
arXiv2022

Distributed control for geometric pattern formation of large-scale multirobot systems

Geometric pattern formation is crucial in many tasks involving large-scale multi-agent systems. Examples include mobile agents performing surveillance, swarm of drones or robots, or smart transportation systems. Currently, most control strategies proposed to achieve pattern formation in network systems either show good performance but require expensive sensors and communication devices, or have lesser sensor requirements but behave more poorly. Also, they often require certain prescribed structural interconnections between the agents (e.g., regular lattices, all-to-all networks etc). In this paper, we provide a distributed displacement-based control law that allows large group of agents to achieve triangular and square lattices, with low sensor requirements and without needing communication between the agents. Also, a simple, yet powerful, adaptation law is proposed to automatically tune the control gains in order to reduce the design effort, while improving robustness and flexibility. We show the validity and robustness of our approach via numerical simulations and experiments, comparing it with other approaches from the existing literature.

cs.MA↗
arXiv2022

Minimax Flow over Acyclic Networks: Distributed Algorithms and Microgrid Application

Given a flow network with variable suppliers and fixed consumers, the minimax flow problem consists in minimizing the maximum flow between nodes, subject to flow conservation and capacity constraints. We solve this problem over acyclic graphs in a distributed manner by showing that it can be recast as a consensus problem between the maximum downstream flows, which we define here for the first time. Additionally, we present a distributed algorithm to estimate these quantities. Finally, exploiting our theoretical results, we design an online distributed controller to prevent overcurrent in microgrids consisting of loads and droop-controlled inverters. Our results are validated numerically on the CIGRE benchmark microgrid.

eess.SY↗
arXiv2021

Synchronization of networks of piecewise-smooth systems

We study convergence in networks of piecewise-smooth (PWS) systems that commonly arise in applications to model dynamical systems whose evolution is affected by macroscopic events such as switches and impacts. Existing approaches were typically oriented toward guaranteeing global bounded synchronizability, local stability of the synchronization manifold, or achieving synchronization by exerting a control action on each node. Here we start by generalizing existing results on QUAD systems to the case of PWS systems, accounting for a large variety of nonlinear coupling laws. Then, we propose that a discontinuous coupling can be used to guarantee global synchronizability of a network of N PWS agents under mild assumptions on the individual dynamics. We provide extensive numerical simulations to gain insights on larger networks.

eess.SY↗
arXiv2021

Adaptive and quasi-sliding control of shimmy in landing gears

Shimmy is a dangerous phenomenon that occurs when aircraft's nose landing gears oscillate in a rapid and uncontrollable fashion. In this paper, we propose the use of two nonlinear control approaches (zero average control and model reference adaptive control based on minimal control synthesis) as simple yet effective strategies to suppress undesired oscillations, even in the presence of uncertainties and partial state measurements. Numerical results are presented to validate the proposed control approaches.

eess.SY↗
arXiv2021

Utilizing synchronization to partition power networks into microgrids

The problem of partitioning a power grid into a set of microgrids, or islands, is of interest for both the design of future smart grids, and as a last resort to restore power dispatchment in sections of a grid affected by an extreme failure. In the literature this problem is usually solved by turning it into a combinatorial optimization problem, often solved through generic heruristic methods such as Genetic Algorithms or Tabu Search. In this paper, we take a different route and obtain the grid partition by exploiting the synchronization dynamics of a cyberlayer of Kuramoto oscillators, each parameterized as a rough approximation of the dynamics of the grid's node it corresponds to. We present first a centralised algorithm and then a decentralised strategy. In the former, nodes are aggregated based on their internode synchronization times while in the latter they exploit synchronization of the oscillators in the cyber layer to selforganise into islands. Our preliminary results show that the heuristic synchronization based algorithms do converge towards partitions that are comparable to those obtained via other more cumbersome and computationally expensive optimization-based methods.

eess.SY↗