Patrizio Perugini

Patrizio Perugini


Research Focus & Metrics

Academic Career Length

3Years (2024-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 February 2024 in Sensors
Verified
Journal Article
Open access
PDF file
EGEmanuele Giacomini
Emanuele Giacomini
LBLeonardo Brizi
Leonardo Brizi
LGLuca Di Giammarino
Luca Di Giammarino
OSOmar Ashraf Ahmed Khairy Salem
Omar Ashraf Ahmed Khairy Salem
PPPatrizio Perugini
Patrizio Perugini
GGGiorgio Grisetti
Giorgio Grisetti
Modern visual perception techniques often rely on multiple heterogeneous sensors to achieve accurate and robust estimates. Knowledge of their relative positions is a mandatory prerequisite to accomplish sensor fusion. Typically, this result is obtained through a calibration procedure that correlates the sensors’ measurements. In this context, we focus on LiDAR and RGB sensors that exhibit complementary capabilities. Given the sparsity of LiDAR measurements, current state-of-the-art calibration techniques often rely on complex or large calibration targets to resolve the relative pose estimation. As such, the geometric properties of the targets may hinder the calibration procedure in those cases where an ad hoc environment cannot be guaranteed. This paper addresses the problem of LiDAR-RGB calibration using common calibration patterns (i.e., A3 chessboard) with minimal human intervention. Our approach exploits the flatness of the target to find associations between the sensors’ measurements, leading to robust features and retrieval of the solution through nonlinear optimization. The results of quantitative and comparative experiments with other state-of-the-art approaches show that our simple schema performs on par or better than existing methods that rely on complex calibration targets.

17 March 2025 in IEEE Robotics and Automation Letters
Verified
Journal Article
Open access
PPPatrizio Perugini
Patrizio Perugini
JLJens Lundell
Jens Lundell
KFKatharina Friedl
Katharina Friedl
DKDanica Kragic
Danica Kragic
We address prehensile pushing, the problem of manipulating a grasped object by pushing against the environment. Our solution is an efficient nonlinear trajectory optimization problem relaxed from an exact mixed integer non-linear trajectory optimization formulation. The critical insight is recasting the external pushers (environment) as a discrete probability distribution instead of binary variables and minimizing the entropy of the distribution. The probabilistic reformulation allows all pushers to be used simultaneously, but at the optimum, the probability mass concentrates onto one due to the entropy minimization. We numerically compare our method against a state-of-the-art sampling-based baseline on a prehensile pushing task. The results demonstrate that our method finds trajectories 8 times faster and at a 20 times lower cost than the baseline. Finally, we demonstrate that a simulated and real Frank Panda robot can successfully manipulate different objects following the trajectories proposed by our method.