Teng Xue

Teng Xue

Auto-generated profile, based on publicly available information

Teng Xue

Idiap Research Institute

Research Focus & Metrics

Academic Career Length

3Years (2024-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
5 September 2024 in IEEE Transactions on Robotics
Verified
Journal Article
Closed access
SYShenli Yuan
Shenli Yuan
LSLin Shao
Lin Shao
YFYunhai Feng
Yunhai Feng
JSJiatong Sun
Jiatong Sun
TXTeng Xue
Teng Xue
JSJ. Kenneth Salisbury
J. Kenneth Salisbury
Robot in-hand manipulation is an important skill for robots to carry out sophisticated tasks that require moving the grasped object within hand. In this work, we present the Roller Grasper V3, a non-anthropomorphic robot grasper with a steerable roller on each of its four fingertips, and a manipulation architecture that enables the Roller Grasper V3 to achieve full 6-DoF manipulation of the grasped object in $SE(3)$ . The manipulation architecture consists of a high-level planner that searches for a feasible path with waypoints for the object to be manipulated, and a low-level control policy that is used to navigate the object in between the adjacent waypoints. The method was experimentally validated on the Roller Grasper V3 to manipulate multiple objects with different geometries and topologies.

9 January 2026 in The International Journal of Robotics Research
Verified
Journal Article
Closed access
ARAmirreza Razmjoo
Amirreza Razmjoo
TXTeng Xue
Teng Xue
SSSuhan Shetty
Suhan Shetty
SCSylvain Calinon
Sylvain Calinon
We present a novel approach to enhance the performance of sampling-based model predictive control (MPC) in constrained optimization by leveraging products of experts. Our methodology divides the main problem into two components: one focused on optimality and the other on feasibility. By combining the solutions from each component, represented as distributions, we apply products of experts to implement a project - then - sample strategy. In this strategy, the optimality distribution is projected into the feasible area, allowing for more efficient sampling. This approach contrasts with the traditional sample - then - project and naïve sample - then - reject method, leading to more diverse exploration and reducing the accumulation of samples on the boundaries. We demonstrate an effective implementation of this principle using a tensor train-based distribution model, which is characterized by its non-parametric nature, ease of combination with other distributions at the task level, and straightforward sampling technique. We adapt existing tensor train models to suit this purpose and validate the efficacy of our approach through experiments in various tasks, including obstacle avoidance, non-prehensile manipulation, and tasks involving staying in a restricted volume. Our experimental results demonstrate that the proposed method consistently outperforms known baselines, providing strong empirical support for its effectiveness. Sample code for this project is available at: https://github.com/idiap/smpc_poe .

12 June 2025 in The International Journal of Robotics Research
Verified
Journal Article
Closed access
TXTeng Xue
Teng Xue
ARAmirreza Razmjoo
Amirreza Razmjoo
SSSuhan Shetty
Suhan Shetty
SCSylvain Calinon
Sylvain Calinon
Contact-rich manipulation plays an important role in daily human activities. However, uncertain physical parameters often pose significant challenges for both planning and control. A promising strategy is to develop policies that are robust across a wide range of parameters. Domain adaptation and domain randomization are widely used, but they tend to either limit generalization to new instances or perform conservatively due to neglecting instance-specific information. Explicit motor adaptation addresses these issues by estimating system parameters online and then retrieving the parameter-conditioned policy from a parameter-augmented base policy. However, it typically requires precise system identification or additional training of a student policy, both of which are challenging in contact-rich manipulation tasks with diverse physical parameters. In this work, we propose implicit motor adaptation , which enables parameter-conditioned policy retrieval given a roughly estimated parameter distribution instead of a single estimate. We leverage tensor train as an implicit representation of the base policy, facilitating efficient retrieval of the parameter-conditioned policy by exploiting the separable structure of tensor cores. This framework eliminates the need for precise system estimation and policy retraining while preserving optimal behavior and strong generalization. We provide a theoretical analysis to validate the approach, supported by numerical evaluations on three contact-rich manipulation primitives. Both simulation and real-world experiments demonstrate its ability to generate robust policies across diverse instances. Project website: https://sites.google.com/view/implicit-ma .

6 November 2025 in IEEE Robotics and Automation Letters
Verified
Journal Article
Closed access
YZYan Zhang
Yan Zhang
TXTeng Xue
Teng Xue
ARAmirreza Razmjoo
Amirreza Razmjoo
SCSylvain Calinon
Sylvain Calinon
We present an efficient task and motion replanning approach for sequential multi-object manipulation in dynamic environments. Conventional Task And Motion Planning (TAMP) solvers experience an exponential increase in planning time as the planning horizon and number of objects grow, limiting their applicability in real-world scenarios. To address this, we propose learning problem decompositions from demonstrations to accelerate TAMP solvers. Our approach consists of three key components: goal decomposition learning, computational distance learning, and object reduction. Goal decomposition identifies the necessary sequences of states that the system must pass through before reaching the final goal, treating them as subgoal sequences. Computational distance learning predicts the computational complexity between two states, enabling the system to identify the temporally closest subgoal from a disturbed state. Object reduction minimizes the set of active objects considered during replanning, further improving efficiency. We evaluate our approach on three benchmarks, demonstrating its effectiveness in improving replanning efficiency for sequential multi-object manipulation tasks in dynamic environments.