Simultaneous Trajectory Optimization and Contact Selection for Contact-rich Manipulation with High-Fidelity Geometry
Mengchao Zhang, Devesh K. Jha, Arvind U. Raghunathan, Kris Hauser
TL;DR
The paper tackles the scaling bottleneck of contact-implicit trajectory optimization (CITO) in contact-rich manipulation by introducing STOCS, which embeds simultaneous trajectory optimization and contact selection inside an infinite-programming framework. STOCS dynamically instantiates salient contact points and times via an exchange method, using an outer Oracle (MVO or TAMVO with SD/TS) to keep the inner MPCC small while handling high-fidelity 3D geometries represented as dense point clouds and environment SDFs. Key contributions include the Time-active Maximum Violation Oracle (TAMVO) and spatial/temporal smoothing techniques that accelerate convergence, enabling feasible planning for tens of thousands of vertices in 3D. The approach enables perception-to-action pipelines from raw sensor data, reduces geometry simplification requirements, and significantly broadens the practical applicability of CITO in manipulation tasks.
Abstract
Contact-implicit trajectory optimization (CITO) is an effective method to plan complex trajectories for various contact-rich systems including manipulation and locomotion. CITO formulates a mathematical program with complementarity constraints (MPCC) that enforces that contact forces must be zero when points are not in contact. However, MPCC solve times increase steeply with the number of allowable points of contact, which limits CITO's applicability to problems in which only a few, simple geometries are allowed to make contact. This paper introduces simultaneous trajectory optimization and contact selection (STOCS), as an extension of CITO that overcomes this limitation. The innovation of STOCS is to identify salient contact points and times inside the iterative trajectory optimization process. This effectively reduces the number of variables and constraints in each MPCC invocation. The STOCS framework, instantiated with key contact identification subroutines, renders the optimization of manipulation trajectories computationally tractable even for high-fidelity geometries consisting of tens of thousands of vertices.
