FTFederico Trombetti

Federico Trombetti

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Federico Trombetti has a total of 9 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Demo: Developing a Fully Autonomous DJI Payload

    by Federico Trombetti, Riccardo Tittarelli, Elena Valsecchi, Francesco Palandra, Gaia Maselli

    In this demo, we showcase the collaborative effort that was put into bringing an offloading protocol for UAVs, Stop & Offload [1], on real-world hardware. The process includes multiple stages, from hardware configuration and testing in a simulated environment, to the final deployment in the field. The protocol enhances patrolling missions by improving coordination and data offloading among drones. We address the challenges of translating this protocol into a real hardware implementation using DJI Drones, and provide a detailed walkthrough of the process, from simulation to deployment. Our solution utilizes the DJI PSDK [2] libraries, ROS2 [5], and the Gazebo [4] simulator to ensure a secure and strong implementation.

  • On Fundamental Bounds on Failure Identifiability by Boolean Network Tomography

    by Novella Bartolini, Ting He, Viviana Arrigoni, Annalisa Massini, Federico Trombetti, Hana Khamfroush

    Boolean network tomography is a powerful tool to infer the state (working/failed) of individual nodes from path-level measurements obtained by edge-nodes. We consider the problem of optimizing the capability of identifying network failures through the design of monitoring schemes. Finding an optimal solution is NP-hard and a large body of work has been devoted to heuristic approaches providing lower bounds. Unlike previous works, we provide upper bounds on the maximum number of identifiable nodes, given the number of monitoring paths and different constraints on the network topology, the routing scheme, and the maximum path length. These upper bounds represent a fundamental limit on identifiability of failures via Boolean network tomography. Our analysis provides insights on how to design topologies and related monitoring schemes to achieve the maximum identifiability under various network settings. Through analysis and experiments we demonstrate the tightness of the bounds and efficacy of the design insights for engineered as well as real networks.