2009 IEEE International Conference on Robotics and Automation 2009
DOI: 10.1109/robot.2009.5152477
|View full text |Cite
|
Sign up to set email alerts
|

Extending iTaSC to support inequality constraints and non-instantaneous task specification

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
67
0

Year Published

2010
2010
2022
2022

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 60 publications
(75 citation statements)
references
References 12 publications
0
67
0
Order By: Relevance
“…As shown in [6], in case of constant accelerationq m , the position evolution in s iteration is q(k + s) = q(k) + sq(k)δt + 1 2 (s 2 − s)q m δt 2 .…”
Section: A Discrete Calculusmentioning
confidence: 99%
See 3 more Smart Citations
“…As shown in [6], in case of constant accelerationq m , the position evolution in s iteration is q(k + s) = q(k) + sq(k)δt + 1 2 (s 2 − s)q m δt 2 .…”
Section: A Discrete Calculusmentioning
confidence: 99%
“…Since the n DOFs of a robot can only instantaneously comply with n equality conditions, the latter approach is doomed to fail given, for example, the 2n constraints associated to joint limits. To deal with this strong limitation, the most general approaches consist in formulating the control problem as a convex optimization one where constraints are naturally expressed both through equalities and inequalities ( [4], [5] and [6]). This type of approach induces, in the case of complex systems with multiple hierarchical levels, computation times which may not be suitable for a real-time implementation (even though some very recent work described in [7] exhibits a rather low computational complexity).…”
Section: Introductionmentioning
confidence: 99%
See 2 more Smart Citations
“…The same kind of approach is being used in the work of Escande et al ([8]) at the inverse velocity kinematics level with efficient implementation on a humanoid robot in mind and allowing to enforce priorities both at the tasks and constraints levels. Finally, even though not applied to the humanoid case directly, the work of Decré et al ( [9]) makes use of cascading LQPs to formulate complex control problems with priorities between tasks as well as unilateral constraints.…”
Section: Introductionmentioning
confidence: 99%