2003 IEEE International Conference on Robotics and Automation (Cat. No.03CH37422)
DOI: 10.1109/robot.2003.1241685
|View full text |Cite
|
Sign up to set email alerts
|

Singularity-free path planning of parallel manipulators using clustering algorithm and line geometry

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
27
0

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 33 publications
(29 citation statements)
references
References 13 publications
0
27
0
Order By: Relevance
“…Complex arithmetic problems like those discussed in refs. [8,12,19] are not necessary any more, since neither the computation of constraints nor the calculation of direct kinematics has to be achieved. Of course, this property is also due to the definition of planning task in the operational workspace.…”
Section: Multiple Heuristics Approachmentioning
confidence: 99%
See 3 more Smart Citations
“…Complex arithmetic problems like those discussed in refs. [8,12,19] are not necessary any more, since neither the computation of constraints nor the calculation of direct kinematics has to be achieved. Of course, this property is also due to the definition of planning task in the operational workspace.…”
Section: Multiple Heuristics Approachmentioning
confidence: 99%
“…To the best knowledge of the authors, only two works have dealt previously with this problem for parallel manipulators. 12,19 Even if the proposed methods are different, both have a two-step strategy in common. The first step consists in providing a nominal path, which should be as much as possible free from singularities.…”
Section: Singularity Avoidance In Path Planningmentioning
confidence: 99%
See 2 more Smart Citations
“…Path planning involved singularity investigation to avoid instantaneous self-motion, (Nenchev and Uchiyama 1996). Singularities were extensively studied (Bhattacharya, Hatwal and Ghosh 1998), (Dasgupta and Mruthyunjaya 1998), (Dash et al 2003). The problem evolved into multi-objective optimization finding the optimum path according to a certain number of criterias (Carbone et al 1997), (Merlet 2001).…”
Section: Introductionmentioning
confidence: 99%