2020
DOI: 10.1016/j.mechmachtheory.2019.103664
|View full text |Cite
|
Sign up to set email alerts
|

Real-time trajectory planning based on joint-decoupled optimization in human-robot interaction

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
8
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 21 publications
(8 citation statements)
references
References 23 publications
0
8
0
Order By: Relevance
“…Trajectory planning in Cartesian space is intuitive, and the movement trajectory and attitude of the end-effector are easy to observe. But, this method did not consider problems caused by kinematic singularities [1][2][3][4]. Trajectory planning in joint space can avoid those problems.…”
Section: Introductionmentioning
confidence: 99%
“…Trajectory planning in Cartesian space is intuitive, and the movement trajectory and attitude of the end-effector are easy to observe. But, this method did not consider problems caused by kinematic singularities [1][2][3][4]. Trajectory planning in joint space can avoid those problems.…”
Section: Introductionmentioning
confidence: 99%
“…At every cycle, the high-speed motions are restored as soon as the safety issue is resolved. Non-linear optimization problems in real-time are presented in [61], where the trajectory planning problem is solved by using a decoupling method that transforms the original coupled optimization problem into multiple independent optimization problems, to reduce the computational burden. A non-linear programming problem (NLP) with human-in-the-loop constraints is also solved in the reference [62] in order to optimize the desired path subdivided into multiple segments.…”
Section: Motion Planningmentioning
confidence: 99%
“…Since the task of designing a fast motion function is so elementary, a considerable number of research articles have appeared, particularly in the last two decades. This work can roughly be organized into two classes: in the first one, the task has been formulated as a restricted optimization problem, and algorithms from this field have been applied (e.g., [15][16][17][18][19][20][21][22][23][24][25]). This approach has the advantage that other aspects such as position errors regarding a given path or energy consumption can be easily included, and even a multiobjective optimization can be performed [22].…”
Section: Introductionmentioning
confidence: 99%