arrow
Return

Optimal Path Planning Algorithm with Built-In Velocity Profiling for Collaborative Robot

delete2024-08-17
delete1
delete
OA
AI
R
Rafał Szczepański *
K
Krystian Erwiński
M
Mateusz Tejer
D
Dominika Daab
DOI:10.3390/s24165332delete
deleteOriginal
deleteShare
deleteSave
View PDF
Abstract

Abstract

En 中文
This paper proposes a method for solving the path planning problem for a collaborative robot. The time-optimal, smooth, collision-free B-spline path is obtained by the application of a nature-inspired optimization algorithm. The proposed approach can be especially useful when moving items that are delicate or contain a liquid in an open container using a robotic arm. The goal of the optimization is to obtain the shortest execution time of the production cycle, taking into account the velocity, velocity and jerk limits, and the derivative continuity of the final trajectory. For this purpose, the velocity profiling algorithm for B-spline paths is proposed. The methodology has been applied to the production cycle optimization of the pick-and-place process using a collaborative robot. In comparison with point-to-point movement and the solution provided by the RRT* algorithm with the same velocity profiling to ensure the same motion limitations, the proposed path planning algorithm decreased the entire production cycle time by 11.28% and 57.5%, respectively. The obtained results have been examined in a simulation with the entire production cycle visualization. Moreover, the smoothness of the movement of the robotic arm has been validated experimentally using a robotic arm.
Keywords:
path planning problem
collaborative robot
velocity profile
nature-inspired optimization algorithm
pick-and-place
B-spline
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

Sensors cover
Sensors
IF:
3.5
Papers:
7.1W
Citations:
20.9W

Organization

N
Nicolaus Copernicus University
Scholars:
6.8K
Papers: 5.6K
Citations: 5.5K