2008
DOI: 10.1017/s0263574708004311
|View full text |Cite
|
Sign up to set email alerts
|

A novel multiple-heuristic approach for singularity-free motion planning of spatial parallel manipulators

Abstract: SUMMARYThe issue of motion planning for closed-loop mechanisms, such as parallel manipulators or robots, is still an open question. This paper proposes a novel approach for motion planning of spatial parallel robots. The framework for the geometric modeling is based on the visibility graph methodology. It is opted for a multiple-heuristics approach, where different influences are integrated in a multiplicative way within the heuristic cost function. Since the issue of singularities is a fundamental one for par… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
9
0

Year Published

2010
2010
2016
2016

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(9 citation statements)
references
References 23 publications
0
9
0
Order By: Relevance
“…This is a type-3 singularity for which the two legs are both parallel to the -axis. This is characterized by a geometric parameter condition given by (5) These parameters are designed, such that (5) never holds.…”
Section: Second Casementioning
confidence: 99%
See 3 more Smart Citations
“…This is a type-3 singularity for which the two legs are both parallel to the -axis. This is characterized by a geometric parameter condition given by (5) These parameters are designed, such that (5) never holds.…”
Section: Second Casementioning
confidence: 99%
“…One way to do so is by adding these efforts as disturbance inputs to the dynamic equations. The joint space inverse dynamic model including contact forces is given as [2]- [5], [7] ( 6) where is the torques vector produced by joint actuators, are joint positions, rates, and accelerations, is the inertia matrix, and are the Coriolis and centrifugal, and gravitational forces, respectively, is the PKM Jacobian and is the contact force. The model in (6) is represented as follows:…”
Section: B Dynamic Modelmentioning
confidence: 99%
See 2 more Smart Citations
“…All local path planning performed in this paper utilises the A* search, which is a graph-based search algorithm with heuristics for robot motion planning for discrete data sets [24,16]. As the global path planning returns an ordered list of workspaces to traverse (global path), the local path planning handles all planning to and from workspace boundaries and links them together to form an overall path from start to end configurations.…”
Section: Local Path Planning and Costingmentioning
confidence: 99%