Name
Abstract | ||
|---|---|---|
In this paper a mathematical formalism for the configuration space evaluation of robots is presented, that tries to optimise the computational time. The use of the proposed method and the choice of a suitable coordinate system, in the workspace, as well as in the configuration space, lead to the fact that the obstacle representation in the configuration space could be seen as a convolution of two functions that describe the robot and the obstacles respectively. The method has been applied to mobile and articulated robots in the two dimensional plane, but its application to the most popular robots can be easily done. Additionally, the computational load is independent of the shape and number of obstacles and of the robot shape. The mathematical tool that has been used is the FFT (fast Fourier transform) since it eases the parallel implementation of the resulting algorithms reducing significantly the computational load. |
Year | DOI | Venue |
|---|---|---|
1997 | 10.1109/CIRA.1997.613858 | CIRA |
Keywords | Field | DocType |
computational complexity,fast Fourier transforms,mobile robots,path planning,articulated robots,computational load,computational time,configuration space,coordinate system,fast Fourier transform,fast evaluation,obstacle representation,parallel implementation,workspace | Motion planning,Robot control,Computer vision,Parallel manipulator,Convolution,Computer science,Robot kinematics,Artificial intelligence,Robot,Mobile robot,Configuration space | Conference |
ISBN | Citations | PageRank |
0-8186-8138-1 | 4 | 0.52 |
References | Authors | |
4 | 2 | |