Legs interference checking of parallel robots over a given workspace or trajectory
Jean‐Pierre Merlet, David Daney
Abstract
Jean‐Pierre Merlet, David Daney
Abstract
We are considering a 6 d.o.f. Gough platform that has to move within a given workspace or on a trajectory. The legs of the robot are assumed to be constituted of a set of finite cylindrical elements and we address the problem of determining if any pair of such element would intersect during the robot motion. Collision conditions may be written mathematically according to various equivalent formulations. We show however that these formulations are not numerically equivalent and exhibit an efficient interference checking algorithm based on interval analysis that allows to check 6D workspace or arbitrary time-function trajectories for interference
OpenAlex reports 48 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
We are considering a 6 d.o.f. Gough platform that has to move within a given workspace or on a trajectory. The legs of the robot are assumed to be constituted of a set of finite cylindrical elements and we address the problem of determining if any pair of such element would intersect during the robot motion. Collision conditions may be written mathematically according to various equivalent formulations. We show however that these formulations are not numerically equivalent and exhibit an efficient interference checking algorithm based on interval analysis that allows to check 6D workspace or arbitrary time-function trajectories for interference
Key concepts: Workspace, Trajectory, Interference (communication), Set (abstract data type), Robot, Computer science, Function (biology), Interval (graph theory)