← Search

Thierry Siméon

7 accepted papers

2025

Robust Sensitivity-Aware Chance-Constrained MPC for Efficient Handling of Multiple Uncertainty Sources

RA-L 2025

Robust motion planning under uncertainty is critical for unlocking real-world robotics applications. This paper introduces SupeR-MPC, a computationally-efficient, sensitivity-aware, chance-constrained optimization framework that systematically accounts for multiple sources of uncertainty, including

Cited by 1SourceScholar
2024

Extending Task and Motion Planning with Feasibility Prediction: Towards Multi-Robot Manipulation Planning of Realistic Objects

IROS 2024poster

The hybrid discrete/continuous nature of task and motion planning (TAMP) results often in a combinatorial explosion. This challenge is even more pronounced in multi-robot TAMP problems due to the increase in dimensionality of the action space. Previous works use action feasibility prediction as a he…

Cited by 0SourceScholar
2024

Robust Motion Planning With Accuracy Optimization Based on Learned Sensitivity Metrics

RA-L 2024

This letter addresses the problem of generating robust and accurate trajectories taking into account uncertainties in the robot dynamic model. Based on the notion of <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">closed-loop sensitivity</i>, which q

Cited by 3SourceScholar
2023

A Sensitivity-Aware Motion Planner (SAMP) to Generate Intrinsically-Robust Trajectories

ICRA 2023poster

Closed-loop state sensitivity [1], [2] is a recently introduced notion that can be used to quantify deviations of the closed-loop trajectory of a robot/controller pair against variations of uncertain parameters in the robot model. While local optimization techniques are used in [1], [2] to generate…

Cited by 17SourceScholar
2023

Learning to Predict Action Feasibility for Task and Motion Planning in 3D Environments

ICRA 2023poster

In Task and motion planning (TAMP), symbolic search is combined with continuous geometric planning. A task planner finds an action sequence while a motion planner checks its feasibility and plans the corresponding sequence of motions. However, due to the high combinatorial complexity of discrete sea…

Cited by 9SourceScholar
2023

Simultaneous Action and Grasp Feasibility Prediction for Task and Motion Planning Through Multi-Task Learning

IROS 2023poster

In this paper, we address task and motion plan-ning (TAMP) which is an important yet challenging robotics problem. It is known to suffer from the high combinatorial complexity of discrete search, often requiring a large number of geometric planning calls. We build upon recent works in TAMP by taking…

Cited by 1SourceScholar
2015

Enhancing sampling-based kinodynamic motion planning for quadrotors

IROS 2015poster

The overall performance of sampling-based motion planning algorithms strongly depends on the use of suitable sampling and connection strategies, as well as on the accuracy of the distance metric considered to select neighbor states. Defining appropriate strategies and metrics is particularly hard wh…

Cited by 17SourceScholar