1999
DOI: 10.1109/70.781970
|View full text |Cite
|
Sign up to set email alerts
|

The kinematic roadmap: a motion planning based global approach for inverse kinematics of redundant robots

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
54
0
4

Year Published

2001
2001
2019
2019

Publication Types

Select...
5
2
2

Relationship

0
9

Authors

Journals

citations
Cited by 78 publications
(58 citation statements)
references
References 34 publications
0
54
0
4
Order By: Relevance
“…Equation (7) rotates one vector into another vector and has two degrees of freedom (e.g. longitude and latitude) [7]. A unit vector with respect to a unit reference vector is referred to as direction.…”
Section: B Quaternions and Rotationsmentioning
confidence: 99%
“…Equation (7) rotates one vector into another vector and has two degrees of freedom (e.g. longitude and latitude) [7]. A unit vector with respect to a unit reference vector is referred to as direction.…”
Section: B Quaternions and Rotationsmentioning
confidence: 99%
“…In cases when the number of degrees of freedom (DoF) of the robot affecting gross end-effector motion are small (less than 5), the best-first planning approach provides a fast and reliable solution . For highly redundant robots, a different search strategy can be employed, such as randomized planning (Barraquand and Latombe, 1991), or probabilistic roadmap planning (Kavraki, Svestka et al, 1996;Ahuactzin and Gupta, 1999;Choset and Burdick, 2000;Yu and Gupta, 2000). For example, either random sampling of the configuration space (Kavraki, Svestka et al, 1996), or the Generalized Voronoi Graph (Choset and Burdick, 2000), can be used to generate a roadmap of the connected free regions in the configuration space.…”
Section: Danger Criterionmentioning
confidence: 99%
“…Systems finding a collision-free joint space path (Latombe and Barraquand, 1991), and problems that require maintaining end-effector constraints throughout the path (Stilman, 2007;Gupta, 2005;Berenson and Kuffner, 2011) have been explored. It is usually distinguished between problems where a single goal is specified (Ahuactzin and Gupta, 1999) and problems where the entire end-effector path is predetermined (Guo and Hsia, 1990;Oriolo et al, 2002). Applying this, Lacevic and Rocco (2010) presented an approach using Danger Fields based on a kinetostatic image of the current situation.…”
Section: Introductionmentioning
confidence: 99%