Riccardo Abbati
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Riccardo Abbati has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Alessandro Tasora
University of Parma
3 shared publications - Marco Riboli
Department on Innovative Technologies, University of Applied Sciences and Arts of Southern Switzerland, SUPSI, Lugano, Switzerland
3 shared publications - Marco Silvestri
Department of Engineering for Industrial Systems and Technologies, University of Parma, Parma, Italy
3 shared publications - Alessandra Aimi
Department of Mathematical, Physical and Computer Sciences, University of Parma
2 shared publications - Manuel Alò2 shared publications
- Michel Rosselli
SUPSI - ISTePS
1 shared publication
Latest Publications
- Open Access
- 6 September 2026
- Published by Elsevier in Mechatronics
- Vol. 120
Task-constrained path planning on implicit manifolds via successive projections
- 6 September 2026
- Published by Elsevier in Mechatronics
- Vol. 120
Open AccessTask-constrained path planning on implicit manifolds via successive projections
- Open Access
- 1 April 2026
- Published by Elsevier in SSRN Electronic Journal
Uniformly ε-adherent B-spline path on implicit manifolds via successive projections
This paper proposes a projection-based layer for constrained path planning, where task requirements are encoded as equality constraints defining an implicit manifold. The method is compatible with geometric planners that optimise a path inside a corridor represented as a sequence of convex safety regions, and returns a collision-free B-spline path, with user-prescribed degree and continuity, that is uniformly ε-adherent to the manifold. Corridor construction is biased toward task feasibility by projecting exploration seeds onto the manifold, so that each corridor element contains at least one feasible configuration. After corridor optimisation, manifold adherence is restored by projecting the B-spline control points through a constrained closest-point problem that preserves corridor containment. Continuity is then recovered by a smoothing procedure based on alternating projections that preserves the manifold constraint. Uniform ε-adherence along the whole path is finally enforced by an outer loop that recomputes the knot vector with progressively more knots and repeats optimisation and projection until the prescribed tolerance is satisfied. The approach is validated through simulations and a real-world experiment.
- 1 April 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessUniformly ε-adherent B-spline path on implicit manifolds via successive projections
This paper proposes a projection-based layer for constrained path planning, where task requirements are encoded as equality constraints defining an implicit manifold. The method is compatible with geometric planners that optimise a path inside a corridor represented as a sequence of convex safety regions, and returns a collision-free B-spline path, with user-prescribed degree and continuity, that is uniformly ε-adherent to the manifold. Corridor construction is biased toward task feasibility by projecting exploration seeds onto the manifold, so that each corridor element contains at least one feasible configuration. After corridor optimisation, manifold adherence is restored by projecting the B-spline control points through a constrained closest-point problem that preserves corridor containment. Continuity is then recovered by a smoothing procedure based on alternating projections that preserves the manifold constraint. Uniform ε-adherence along the whole path is finally enforced by an outer loop that recomputes the knot vector with progressively more knots and repeats optimisation and projection until the prescribed tolerance is satisfied. The approach is validated through simulations and a real-world experiment.
- Open Access
- 14 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Robotics and Automation Letters
- Vol. 11 (1) , 578-585
A General Approach to Path Planning Within C-Space Safe Corridors
This letter presents a novel strategy for collision-free path planning in robotic manipulators. The method operates in two stages: first, a sampling-based exploration of the configuration space is performed to construct a safe corridor composed of axis-aligned bounding boxes. Within this corridor, an optimisation-based trajectory generation phase addresses the channel problem by computing smooth joint trajectories as non-rational splines. A multi-objective cost function is minimised to reduce geometric acceleration along the path, while also maximising the distance from obstacles to improve safety margins. The proposed algorithm is general and applicable to a wide range of kinematic structures, and supports user-defined path degree and geometric continuity. Simulation results demonstrate superior performance compared to existing methods, and experimental validation further confirms its practical effectiveness. Our implementation is open-sourced and available on Github.
- 14 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Robotics and Automation Letters
- Vol. 11 (1) , 578-585
Open AccessA General Approach to Path Planning Within C-Space Safe Corridors
This letter presents a novel strategy for collision-free path planning in robotic manipulators. The method operates in two stages: first, a sampling-based exploration of the configuration space is performed to construct a safe corridor composed of axis-aligned bounding boxes. Within this corridor, an optimisation-based trajectory generation phase addresses the channel problem by computing smooth joint trajectories as non-rational splines. A multi-objective cost function is minimised to reduce geometric acceleration along the path, while also maximising the distance from obstacles to improve safety margins. The proposed algorithm is general and applicable to a wide range of kinematic structures, and supports user-defined path degree and geometric continuity. Simulation results demonstrate superior performance compared to existing methods, and experimental validation further confirms its practical effectiveness. Our implementation is open-sourced and available on Github.