2013
DOI: 10.1016/j.robot.2012.08.012
|View full text |Cite
|
Sign up to set email alerts
|

A direct variational method for planning monotonically optimal paths for redundant manipulators in constrained workspaces

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
26
0

Year Published

2013
2013
2021
2021

Publication Types

Select...
5
3
2

Relationship

1
9

Authors

Journals

citations
Cited by 42 publications
(26 citation statements)
references
References 30 publications
0
26
0
Order By: Relevance
“…To find the next solution, the inverse Jacobian matrix is used to convert the position error to the error of the joint variable. Of course, other algorithms can be found to solve this problem by using particle swarm optimization [8], direct variational method [9], and other methods that consider this problem as multiobjective optimization problems [10].…”
Section: Related Workmentioning
confidence: 99%
“…To find the next solution, the inverse Jacobian matrix is used to convert the position error to the error of the joint variable. Of course, other algorithms can be found to solve this problem by using particle swarm optimization [8], direct variational method [9], and other methods that consider this problem as multiobjective optimization problems [10].…”
Section: Related Workmentioning
confidence: 99%
“…Multi-objective Genetic Algorithm had been applied to handle the highly constrained environments and to preserve a good exploration space. The author's team had also explored the application of Variational principle in the optimal path planning of serial manipulators, working in cluttered workspaces (Shukla et al 2013). The approach involves formulating the path planning problem as a constrained minimization of a functional representing the total joint movement over the complete path.…”
Section: Evolutionary Robotics Designmentioning
confidence: 99%
“…More general criteria can be used in smoothing techniques [18][19][20], although the optimization is still local. Globally-optimal paths can be approximated in particular problems using variational methods [21] or in general problems combining the construction of an RRT with stochastic optimization [22]. However, in the latter case, the difference between the obtained solution and the optimal path can be large in some cases, and it is not reduced over time.…”
Section: Related Workmentioning
confidence: 99%