Path feasibility and modification
Kuu‐Young Young, Chi-Haur Wu
- Year
- 1992
- Citations
- 7
Abstract
Abstract Kinematic feasibility of a planned robot path is restrained by the kinematic constraints of the robot executing the task, such as workspace, configuration, and singularity. Since these kinematic constraints can be described utilizing the geometry of the given robot, corresponding regions within the robot workspace can be expressed in geometrical representation. Consequently, geometric information can be derived from the planned path and the geometric boundaries of these regions. Then, by utilizing the geometric information and proper modification strategies, a Cartesian robot path that is kinematically infeasible can be modified according to different task requirements. To demonstrate the proposed feasibility and modification schemes, simulations for a 6R robot manipulator are executed.
Keywords
Related papers
Statistical Learning Theory
Yuhai Wu, Vladimir Vapnik
1999
Artificial intelligence: a modern approach
1995
Applied Nonlinear Control
Jean-Jacques Slotine, Weiping Li
1991
A new optimizer using particle swarm theory
R.C. Eberhart, James Kennedy
2002