2009
DOI: 10.1002/oca.897
|View full text |Cite
|
Sign up to set email alerts
|

Bi‐criteria optimal control of redundant robot manipulators using LVI‐based primal‐dual neural network

Abstract: In this paper, a bi-criteria weighting scheme is proposed for the optimal motion control of redundant robot manipulators. To diminish the discontinuity phenomenon of pure infinity-norm velocity minimization (INVM) scheme, the proposed bi-criteria redundancy-resolution scheme combines the minimum kinetic energy scheme and the INVM scheme via a weighting factor. Joint physical limits such as joint limits and joint-velocity limits could also be incorporated simultaneously into the scheme formulation. The optimal … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
19
0

Year Published

2014
2014
2024
2024

Publication Types

Select...
4
2
1

Relationship

2
5

Authors

Journals

citations
Cited by 37 publications
(19 citation statements)
references
References 53 publications
0
19
0
Order By: Relevance
“…We see that the computation of the LASSO solution is a Quadratic Programming (QP) problem. The QP problem could be solved readily using the MATLAB routine “QUADPROG” [24], or solved preferably by using neural networks [25,26]. Note that when s is large enough (i.e., λ = 0), LASSO is multiple linear least squares regression; when s ≥ 0 (i.e., λ > 0) is a smaller value, LASSO solutions are shrunken versions of the least squares estimates [19].…”
Section: Methodsmentioning
confidence: 99%
“…We see that the computation of the LASSO solution is a Quadratic Programming (QP) problem. The QP problem could be solved readily using the MATLAB routine “QUADPROG” [24], or solved preferably by using neural networks [25,26]. Note that when s is large enough (i.e., λ = 0), LASSO is multiple linear least squares regression; when s ≥ 0 (i.e., λ > 0) is a smaller value, LASSO solutions are shrunken versions of the least squares estimates [19].…”
Section: Methodsmentioning
confidence: 99%
“…x As for the above QP problem (30)-(31), according to the previous work [30,31], it can be converted into the following piecewise-linear projection equation (PLPE):…”
Section: Mke-type Zhang Equivalency (Mke-ze)mentioning
confidence: 99%
“…where  Ω (⋅) is a piecewise-linear projection operator [25,30,31], and the primal-dual decision variable vector y is defined as y = [x T , u T ] T ∈ R n+m , with u ∈ R m denoting the dual decision vector defined for equality constraint (31). In addition, the augmented coefficient matrix M ∈ R (n+m)×(n+m) and vector q ∈ R n+m are defined, respectively, as…”
Section: Mke-type Zhang Equivalency (Mke-ze)mentioning
confidence: 99%
See 1 more Smart Citation
“…Relatively, the online methods could be used to conquer the defects of the pseudo inverse based methods. In the online scheme, the equality and inequality constraints in the joint-velocity level [17,18] or in the acceleration-level [19,20] could be considered effectively. These schemes are generally configured as a quadratic program (QP) [20,21].…”
Section: Introductionmentioning
confidence: 99%