2009 IEEE/RSJ International Conference on Intelligent Robots and Systems 2009
DOI: 10.1109/iros.2009.5354002
|View full text |Cite
|
Sign up to set email alerts
|

Planning and fast re-planning of safe motions for humanoid robots: Application to a kicking motion

Abstract: Optimal motions are usually used as joint reference trajectories for repetitive or complex motions. In the case of soccer robots, the kicking motion is usually a benchmark motion, computed off-line, without taking into account the current position of the robot or the direction of the goal. Moreover, robots must react quickly to any situation, even if not expected, and cannot spend time to generate a new optimal motion by the classical way. Therefore, we propose a new method for fast motion re-planning based on… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
8
0

Year Published

2010
2010
2022
2022

Publication Types

Select...
4
4

Relationship

1
7

Authors

Journals

citations
Cited by 11 publications
(8 citation statements)
references
References 22 publications
0
8
0
Order By: Relevance
“…where T = {t s ,t 1 , ...,t e } is the time-grid used for the discretization process; the constraints will be checked only for the discrete instants in T. As discussed in [1], [6], it is not easy to guess a time-grid discretization which guarantees that the constraint also holds in-between a pair of time-point of the grid. It is also difficult to compromise performance between having a reasonable sampling and constraint satisfaction of predefined single time constraints of type z.…”
Section: B How To Solve Sipmentioning
confidence: 99%
See 2 more Smart Citations
“…where T = {t s ,t 1 , ...,t e } is the time-grid used for the discretization process; the constraints will be checked only for the discrete instants in T. As discussed in [1], [6], it is not easy to guess a time-grid discretization which guarantees that the constraint also holds in-between a pair of time-point of the grid. It is also difficult to compromise performance between having a reasonable sampling and constraint satisfaction of predefined single time constraints of type z.…”
Section: B How To Solve Sipmentioning
confidence: 99%
“…To have an idea about the order of complexity, it took more than twenty hours to compute the motion planning of a humanoid robot of twelve degrees of freedom for a free kicking task [1]. Besides, neither the time-interval nor the time-grid discretization methods can deal efficiently with…”
Section: B How To Solve Sipmentioning
confidence: 99%
See 1 more Smart Citation
“…a set of discrete instant). As discussed in [15], it is not easy to set a time-grid discretization which guarantees in any circumstances that the constraints holds in-between a pair of sample time. Recently, we presented in [4], the time-interval discretization based on Taylor polynomial approximation of the constraints, that make possible to take into account:…”
Section: Solving Sip: Time-discretizationmentioning
confidence: 99%
“…Other dynamic kick engines such as [13] developed a kick engine for the THOR-MANG from Robotis that generate static kick motions. Lengagneua et al [6] have developed a kick engine that incorporates optimization offline and a re-planning step when the kick is executed but do not optimize on the physical robot or use a simulation software that takes into account hardware properties of the robot.…”
Section: Motivation and Backgroundmentioning
confidence: 99%