Source author record

Adriano Fagiolini

Adriano Fagiolini appears in the imported research catalog. Authorship, coauthor and topic links are available while profile ownership is still unclaimed.

ResearcherUnclaimed source record

Catalog footprint

What is connected

8works
4topics
4close collaborators

Actions

Connect this record

Log in to claim

Research graph

See the researcher in context

Open full explorer

Inspect adjacent papers, topics, institutions and collaborators without losing the researcher page.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

8 published item(s)

preprint2026arXiv

Learned Lyapunov Shielding for Adaptive Control

We augment the Slotine--Li adaptive controller for Euler--Lagrange systems with three learned components: a structured-quadratic Lyapunov function \(V_ψ\) whose positive-definiteness follows from a Cholesky parameterization, a residual Soft Actor--Critic policy that adds bounded torque corrections to the analytic baseline, and a physics-informed neural network that estimates unmodeled dynamics. A closed-form safety filter, derived from the single affine constraint \(\dot V_ψ+ αV_ψ\le 0\), projects every policy output onto the safe set without requiring an online QP solver. We prove: global feasibility of the filter under a drift-decay condition on the control-degeneracy set; exponential stability under exact shielding, with a robust extension whose margin depends on the PINN approximation error; almost-sure convergence of the three-timescale policy--certificate--multiplier updates to a KKT point; and a PAC generalization bound for the certificate over compacts. On a 2-DOF manipulator with nonlinear friction and variable payload, the learned certificate accounts for most of the empirical gain: tracking error drops by 41\% on nominal friction and 24\% on aggressive friction at the centroid of the training distribution. A 7-DOF scalability study on a Franka Emika Panda confirms clean convergence of the full pipeline at industrial scale, identifies the conditions under which gains over exact model-based baselines should and should not be expected, and documents a warm-start pathology of the learned certificate that has practical implications for deployment.

preprint2026arXiv

Temporal Attention for Adaptive Control of Euler-Lagrange Systems with Unobservable Memory

Adaptive control of Euler-Lagrange systems is challenging when friction is governed by a finite-horizon internal state that is not directly observable from joint measurements. In this setting, the measured closed-loop state is no longer Markovian, and standard certainty-equivalence adaptive laws may lose their convergence guarantees. The paper proposes a meta-control architecture in which the gains of a computed-torque controller are generated by a self-attention block processing a short window of recent motion history. The number of attention heads is selected before policy training through a surrogate analysis of the autocovariance of the memory-state gradient along the temporal window. This surrogate is based on a temporal adaptation of an incremental rank-tracking framework previously developed by the authors. The selected head count is then fixed and used as an architectural hyperparameter in a reinforcement-learning stage, where the policy is trained under a shielded admissibility constraint. The approach is tested on a 2-DOF manipulator with nonlinear friction and variable payload. In the short and matched memory regimes, the single-layer attention-only meta-controller outperforms a deeper Transformer baseline, with tracking-error reductions of 12 and 19 percentage points, respectively. The reported effect sizes are large, with d approximately -1.1 and -2.1, and Mann-Whitney p < 0.05 in both cases. In the long memory regime, however, the advantage disappears. Four out of ten training runs show either divergence or payload-invariant policy collapse, revealing a weakness in the static Phase-1 head-count prescription. This motivates moving rank-tracking inside the reinforcement-learning loop, allowing attention heads to be pruned or grown at runtime instead of fixed before training.

preprint2011arXiv

Casting Robotic End-effectors To Reach Faraway Moving Objects

In this article we address the problem of catching objects that move at a relatively large distance from the robot, of the order of tens of times the size of the robot itself. To this purpose, we adopt casting manipulation and visual-based feedback control. Casting manipulation is a technique to deploy a robotic end-effector far from the robot's base, by throwing the end-effector and controlling its ballistic flight using forces transmitted through a light tether connected to the end-effector itself. The tether cable can then be used to retrieve the end- effector to exert forces on the robot's environment. In previous work, planar casting manipulation was demon- strated to aptly catch static objects placed at a distant, known position, thus proving it suitable for applications such as sample acquisition and return, rescue, etc. In this paper we propose an extension of the idea to controlling the position of the end- effector to reach moving targets in 3D. The goal is achieved by an innovative design of the casting mechanism, and by closing a real-time control loop on casting manipulation using visual feedback of moving targets. To achieve this result, simplified yet accurate models of the system suitable for real-time computation are developed, along with a suitable visual feedback scheme for the flight phase. Effectiveness of the visual feedback controller is demonstrated through experiments with a 2D casting robot.

preprint2011arXiv

Distributed Collision-free Protocol for AGVs in Industrial Environments

In this paper, we propose a decentralized coordina- tion algorithm for safe and efficient management of a group of mobile robots following predefined paths in a dynamic industrial environment. The proposed algorithm is based on a shared resources protocol and a replanning strategy. It is proved to guarantee ordered traffic flows avoiding collisions, deadlocks (stall situations) and livelock (agents move without reaching final destinations). Mutual access to resources has been proved for the proposed approach while condition on the maximum number of AGVs is given to ensure the absence of deadlocks during system evolutions. Finally conditions to verify a local livelocks will also be proposed. In consistency with the model of distributed robotic systems (DRS), no centralized mechanism, synchronized clock, shared memory or ground support is needed. A local inter-robot communication, based on sign-boards, is considered among a small number of spatially adjacent robotic units.

preprint2011arXiv

Distributed Consensus on Set-valued Information

This paper focuses on the convergence of infor- mation in distributed systems of agents communicating over a network. The information on which the convergence is sought is not represented by real numbers, rather by sets of real numbers, whose possible dynamics are given by the class of so-called Boolean maps, involving only unions, intersections, and complements of sets. Based on a notion of contractivity, a necessary and sufficient condition ensuring the global and local convergence toward an equilibrium point is presented. In particular the analysis of global convergence recovers results already obtained by the authors, but the more general approach used in this paper allows analogue results to be found to characterize the local convergence.

preprint2011arXiv

Distributed Intrusion Detection for the Security of Societies of Robots

This paper addresses the problem of detecting possible intruders in a group of autonomous robots, which coexist in a shared environment and interact with each other according to a set of "social behaviors", or common rules. Such rules specify what actions each robot is allowed to perform in the pursuit of its individual goals: rules are distributed, i.e. they can evaluated based only on the state of the individual robot, and on information that can be sensed directly or through communication with immediate neighbors. We consider intruders as robots which misbehave, i.e. do not follow the rules, because of either spontaneous failures or malicious reprogramming. Our goal is to detect intruders by observing the congruence of their behavior with the social rules as applied to the current state of the overall system. Moreover, in accordance with the fully distributed nature of the problem, the detection itself must be peformed by individual robots, based only on local information. The paper introduces a formalism that allows to model uniformly a large variety of possible robot societies. The main contribution consists in the proposal of an Intrusion Detection System, i.e. a protocol that, under suitabkle conditions, allows individual robots to detect possible misbehaving robots in their vicinity, and trigger possible further actions to secure the society. It is worth noting that the generality of the protocol formalism makes so that local monitors can be automatically generated once the cooperation rules and the robot dynamics are specified. The effectiveness of the proposed technique is shown through application to examples of automated robotic systems.

preprint2011arXiv

Logical Consensus for Distributed and Robust Intrusion Detection

In this paper we introduce a novel consensus mech- anism where agents of a network are able to share logical values, or Booleans, representing their local opinions on e.g. the presence of an intruder or of a fire within an indoor environment. We first formulate the logical consensus problem, and then we review relevant results in the literature on cellular automata and convergence of finite-state iteration maps. Under suitable joint conditions on the visibility of agents and their communication capability, we provide an algorithm for generating a logical linear consensus system that is globally stable. The solution is optimal in terms of the number of messages to be exchanged and the time needed to reach a consensus. Moreover, to cope with possible sensor failure, we propose a second design approach that produces robust logical nonlinear consensus systems tolerating a given maximum number of faults. Finally, we show applicability of the agreement mechanism to a case study consisting of a distributed Intrusion Detection System (IDS).