National audienceProbabilistic algorithms offer powerful possibilities as for solving motion planning problems for complex robots in arbitrary environments. However, the quality of obtained solution paths is questionable. This thesis presents a tool to optimize these paths and improve their quality. The method is based on constrained numerical optimization and on collision checking to reduce the path length while avoiding collisions. The modularity of probabilistic methods also inspired us to design a motion generation algorithm for jumping characters. This algorithm is described by three steps of motion planning, from the trajectory of the character's center to the wholebody motion. Each step benefits from the rigor of motion planning to a...
In this paper, we investigate methods for motion plan-ning for deformable robots. Our framework is b...
Many algorithms in probabilistic sampling-based motion planning have been proposed to create a path ...
The goal of this thesis is to develop motion planning algorithms for human-like figures that take in...
National audienceProbabilistic algorithms offer powerful possibilities as for solving motion plannin...
Most algorithms in probabilistic sampling-based path planning compute collision-free paths made of s...
This thesis deals with the development and study of algorithms for planning optimal motions for anth...
This thesis deals with the development and analysis of motion planning algorithms for high dimension...
International audienceMost algorithms in probabilistic sampling-based path planning compute collisio...
This manuscript highlights the ability of a humanoid robot to perform a task hard to achieve by othe...
These works deal with the computation of optimal motions for the humanoid robots. Most of the motion...
The goal of this work is to develop motion planning algorithms for human-like figures taking into ac...
This paper addresses the problem of walk planning for a humanoid robot on a flat ground cluttered by...
Abstract—Motion planning for humanoid robotic systems with many degrees of freedom is an important a...
In this paper, we investigate methods for motion plan-ning for deformable robots. Our framework is b...
Many algorithms in probabilistic sampling-based motion planning have been proposed to create a path ...
The goal of this thesis is to develop motion planning algorithms for human-like figures that take in...
National audienceProbabilistic algorithms offer powerful possibilities as for solving motion plannin...
Most algorithms in probabilistic sampling-based path planning compute collision-free paths made of s...
This thesis deals with the development and study of algorithms for planning optimal motions for anth...
This thesis deals with the development and analysis of motion planning algorithms for high dimension...
International audienceMost algorithms in probabilistic sampling-based path planning compute collisio...
This manuscript highlights the ability of a humanoid robot to perform a task hard to achieve by othe...
These works deal with the computation of optimal motions for the humanoid robots. Most of the motion...
The goal of this work is to develop motion planning algorithms for human-like figures taking into ac...
This paper addresses the problem of walk planning for a humanoid robot on a flat ground cluttered by...
Abstract—Motion planning for humanoid robotic systems with many degrees of freedom is an important a...
In this paper, we investigate methods for motion plan-ning for deformable robots. Our framework is b...
Many algorithms in probabilistic sampling-based motion planning have been proposed to create a path ...
The goal of this thesis is to develop motion planning algorithms for human-like figures that take in...