Task-space Redundancy Resolution
Task-Space Redundancy Resolution is a computational method in robotics and control theory that resolves the non-uniqueness of joint-space solutions for a given task-space objective by systematically selecting optimal or feasible configurations according to a specified performance criterion.
58
Publications
3.1K
Citations
143
Authors
83
Institutions
Publications per year
2017–2026
15
Parents
58
1–5 of 58
143
4
h-index
3
h-index
3
h-index
3
h-index
3
h-index
1–5 of 143
83

University of Naples Federico II
Naples, Italy
5 h-index
9 publications
550 citations
University of Science and Technology of China
Hefei, China
4 h-index
10 publications
957 citations
Bielefeld University
Bielefeld, Germany
4 h-index
20 publications
772 citations
Ritsumeikan University
Kyoto, Japan
3 h-index
8 publications
445 citations

University of Hawaiʻi at Mānoa
Honolulu, United States
3 h-index
6 publications
192 citations

Vanderbilt University
Nashville, United States
3 h-index
6 publications
136 citations

University of Zielona Góra
Zielona Góra, Poland
2 h-index
3 publications
53 citations

Université de Montpellier
Montpellier, France
2 h-index
4 publications
96 citations
1–8 of 83
4 publications · 527 citations
4
h-index
2 publications · 145 citations
2
h-index
2 publications · 61 citations
2
h-index
2 publications · 139 citations
2
h-index
2 publications · 65 citations
2
h-index
1–5