Enrico Ferrentino

Dr. Enrico Ferrentino

DIEM, University of Salerno, Fisciano, Italy
orcid

Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

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

Representative Publications

View All Publications
1 June 2017
Verified
Conference Paper
Closed access
Sebastiano ChiodiniSebastiano Chiodini
Sebastiano Chiodini
MPMarco Pertile
Marco Pertile
SDStefano Debei
Stefano Debei
LBLorenzo Bramante
Lorenzo Bramante
Enrico FerrentinoEnrico Ferrentino
Enrico Ferrentino
MBMarco Barrera
Marco Barrera
In this work we have performed a sensitivity analysis of the Visual Position Estimator for Rover (VIPER) algorithm using data and images provided by NASA MER exploration rovers and NASA Mars Reconnaissance Orbiter. The algorithm retrieves the rover camera position and orientation relative to a Digital Elevation Model by comparing the skyline extracted from a panoramic image captured by the rover and a set of skylines simulated on a template positions grid over the DEM. This algorithm can be used to initialize the rover position after landing in a Mars Body-Fixed Frame and as verification of rover guidance and navigation outputs. In order to test the algorithm performances we have processed data and images provided by NASA Mars Exploration Rover PANCAM and DEM provided by NASA Mars Reconnaissance Orbiter HiRISE telescope. The sensitivity analysis has been performed by varying DEM resolution and template positions density. In the tested cases we show that this localization technique achieves an error up to 50 [m], thus it is possible to decrease the position uncertainty estimated with other localization techniques, like the Entry Descent and Landing estimation.

15 November 2023 in IEEE Transactions on Automation Science and Engineering
Verified
Journal Article
Closed access
Enrico FerrentinoEnrico Ferrentino
Enrico Ferrentino
HSHeitor J. Savino
Heitor J. Savino
AFAntonio Franchi
Antonio Franchi
PCPasquale Chiacchio
Pasquale Chiacchio
Offline optimal planning of trajectories for redundant robots along prescribed task space paths is usually broken down into two consecutive processes: first, the task space path is inverted to obtain a joint space path, then, the latter is parametrized with a time law. If the two processes are separated, they cannot optimize the same objective function, ultimately providing sub-optimal results. In this paper, a unified approach is presented where dynamic programming is the underlying optimization technique. Its flexibility allows accommodating arbitrary constraints and objective functions, thus providing a generic framework for optimal planning of real systems. To demonstrate its applicability to a real world scenario, the framework is instantiated for time-optimality on Franka Emika’s Panda robot. The well-known issues associated with the execution of non-smooth trajectories on a real controller are partially addressed at planning level, through the enforcement of constraints, and partially through post-processing of the optimal solution. The experiments show that the proposed framework is able to effectively exploit kinematic redundancy to optimize the performance index defined at planning level and generate feasible trajectories that can be executed on real hardware with satisfactory results. Note to Practitioners —The common planning algorithms which consolidated over the years for generating trajectories for non-redundant robots are not adequate to fully exploit the more advanced capabilities offered by redundant robots. This is especially true in performance-demanding tasks, as for robots employed on assembly lines in manufacturing industries, repeatedly performing the same activity. Once the assembly line engineer has defined the tool path in the task space, our planning algorithm unifies inverse kinematics and time parametrization so as to bring the manipulator at its physical limits to achieve specific efficiency goals, being execution time the most typical one. The algorithm is configurable in terms of constraints to consider and objective functions to optimize, therefore it can be easily adapted to optimize other custom-defined efficiency indices, to better respond to the needs of the automation plant. Being based on discrete dynamic programming, the global optimum is guaranteed for a given resolution of the problem. This can be configured by the operator to achieve the desired trade-off between efficiency and planning time. In our experiments, we go through the whole process of planning and executing a time-optimal trajectory on a real robot, and discuss some practical details, such as trajectory smoothness and actuator saturation, aiding the practitioners in deploying our algorithm effectively. Currently, the algorithm’s applicability is limited to those cases where hours are available for planning, hence it is not well-suited for those cases where the robot activity has to change frequently. By replacing the underlying dynamic programming engine with a different methodology, such as randomized algorithms, the planning time could be controlled to be upper-bounded, thus returning the most efficient solution that can be achieved in the time available for reconfiguring the production. Other applications of interest include optimal ground control of space robotic assets and performance benchmarking of online planning algorithms.

10 January 2020 in Journal of Mechanisms and Robotics
Verified
Journal Article
Closed access
PDF file
Enrico FerrentinoEnrico Ferrentino
Enrico Ferrentino
PCPasquale Chiacchio
Pasquale Chiacchio
The redundancy resolution schemes based on the optimization of an integral performance index are investigated from the topological point of view. The topological notions of self-motion manifold, C-path-homotopy and extended aspect are clarified in relation to the limitations of the necessary conditions of optimality provided by calculus of variations. On one hand, they do not guarantee the achievement of the optimal solution, and on the other hand, they translate into a two-point boundary value problem (TPBVP), whose resolution, under certain circumstances, may not lead to a feasible solution at all. In response to the limitations of calculus of variations, a dynamic-programming-inspired formalism is developed, which is based on the discretization of the state space and on its representation in the form of multiple grids. Building upon the topological analysis, effective algorithms are designed that are able to find the optimal solution in any condition, across all C-path homotopy classes and self-motion manifolds, with no limitation due to the passage through singularities. Moreover, if the grids are representative of the manipulator’s extended aspects, the topological notion of the transitional point can be used to reduce the computational complexity of the optimal redundancy resolution algorithm. The results are demonstrated on a canonical 4R planar robot in two different scenarios.

18 July 2022 in IEEE Robotics and Automation Letters
Verified
Journal Article
Closed access
Vincenzo PetroneVincenzo Petrone
Vincenzo Petrone
Enrico FerrentinoEnrico Ferrentino
Enrico Ferrentino
PCPasquale Chiacchio
Pasquale Chiacchio
Optimal motion planning along prescribed paths can be solved with several techniques, but most of them do not take into account the wrenches exerted by the end-effector when in contact with the environment. When a dynamic model of the environment is not available, no consolidated methodology exists to consider the effect of the interaction. Regardless of the specific performance index to optimize, this article proposes a strategy to include external wrenches in the optimal planning algorithm, considering the task specifications. This procedure is instantiated for minimum-time trajectories and validated on a real robot performing an interaction task under admittance control. The results prove that the inclusion of end-effector wrenches affect the planned trajectory, in fact modifying the manipulator's dynamic capability.

13 February 2025 in IEEE Transactions on Industrial Informatics
Verified
Journal Article
Closed access
Vincenzo PetroneVincenzo Petrone
Vincenzo Petrone
Enrico FerrentinoEnrico Ferrentino
Enrico Ferrentino
PCPasquale Chiacchio
Pasquale Chiacchio
This article presents the full dynamic model of the UR10 industrial robot. A triple-stage identification approach is adopted to estimate the manipulator's dynamic coefficients. First, linear parameters are computed using a standard linear regression algorithm. Subsequently, nonlinear friction parameters are estimated according to a sigmoidal model. Lastly, motor drive gains are devised to map estimated joint currents to torques. The overall identified model can be used for both control and planning purposes, as the accompanied robot operating system (ROS)2 software can be easily reconfigured to account for a generic payload. The estimated robot model is experimentally validated against a set of exciting trajectories and compared to the state-of-the-art model for the same manipulator, achieving higher current prediction accuracy (up to a factor of 4.43) and more precise motor gains. The related software is available at https://codeocean.com/capsule/8515919/tree/v2.

16 November 2019 in Journal of Intelligent & Robotic Systems
Verified
Journal Article
Closed access
PDF file
Enrico FerrentinoEnrico Ferrentino
Enrico Ferrentino
Antonio Della CioppaAntonio Della Cioppa
Antonio Della Cioppa
Angelo MarcelliAngelo Marcelli
Angelo Marcelli
PCPasquale Chiacchio
Pasquale Chiacchio