Skip to content
naulon
Not checkedNot checked for notices yet.

Maximal Singularity-Free Orientation Subregions Associated with Initial Parallel Manipulator Configuration

Luis Garcia, Alexandre Campos

Robotics · 2018

doi:10.3390/robotics7030057 (opens in a new tab)

We email you when a new notice or a question about this paper appears.

Abstract

Reduced workspace is the main parallel robot disadvantage. It is generally due to the robot configuration, mainly the platform orientation constraint, the present work intends to find the maximum sphere within the orientation workspace, i.e., the singularity-free orientation regions. These regions are related to the platform orientation through Roll-Pitch-Yaw angles. Therefore, an optimization genetic algorithm is used to determine the initial platform orientation corresponding to the largest sphere volume. In this algorithm, the geometrical parameters and the direct and inverse singularities are the optimization constraints. The geometrical constraints may be studied using vectorial analysis. The reciprocity property from screw theory is implemented to analyze the direct and inverse kinematic. In this work it is used a methodology to verify the singularity closeness measure associated with direct kinematic. This measure is related to the rate of work done by each leg upon the platform twist. To determine how close is the parallel robot to a direct singularity a index value is proposed. It is considered that the passive joints reachable regions may be limited by a cone, whereby the cone symmetric axis is the same than the passive joint axis. In the optimization problem, the sphere volume, i.e., the maximal angular displacement of the moving platform around any axis is the objective function. Thus, the genetic algorithm individuals explore all feasible regions looking for an optimal solution.

Abstract licence: CC BY

Reads

Read by people on this page

None yet.

Checked or read by AI through naulon

None yet.

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

Are you an author?

Is this your paper?

Claim it to add your note and be paid when agents cite it. Free.