z-logo
open-access-imgOpen Access
Practical high curvature path planning algorithm in joint space
Author(s) -
Delgado Raimarius,
Choi Byoung Wook
Publication year - 2015
Publication title -
electronics letters
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.375
H-Index - 146
eISSN - 1350-911X
pISSN - 0013-5194
DOI - 10.1049/el.2014.3926
Subject(s) - path (computing) , motion planning , mobile robot , curvature , joint (building) , trajectory , limit (mathematics) , interpolation (computer graphics) , mathematics , robot , space (punctuation) , obstacle , computer science , control theory (sociology) , algorithm , mathematical analysis , geometry , computer vision , artificial intelligence , engineering , motion (physics) , physics , architectural engineering , control (management) , programming language , operating system , astronomy , law , political science
A practical high curvature path planning algorithm that considers the velocity limit of a mobile robot in joint space is proposed. The existence of obstacles that constrict the smooth movement of mobile robots is inevitable. To avoid incoming collision, the robot is redirected to a new path with respect to the dimensions of the obstacle and a safety factor. The redirected path consists of geometric constraints such as high curvatures on its turning points which cause difficulty in controlling the mobile robot. Thus, a central velocity generation method that considers both velocity limits through a convolution operator and high curvatures at turning points is suggested. The central velocity is able to be within the configured velocity limit, otherwise actual velocity commands in joint space could result. Therefore, interpolation to obtain uniform sampling and velocity downscaling is performed to generate a feasible joint space trajectory. The result shows short travelling time compared with previous methods while satisfying velocity limits in the joint space.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here