TY - JOUR
T1 - Simultaneous Trajectory Optimization and Contact Selection for Contact-Rich Manipulation With High-Fidelity Geometry
AU - Zhang, Mengchao
AU - Jha, Devesh K.
AU - Raghunathan, Arvind U.
AU - Hauser, Kris
N1 - This work was supported by National Science Foundation under Grant #IIS- 1911087.
PY - 2025
Y1 - 2025
N2 - 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 us to make contact. This article 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.
AB - 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 us to make contact. This article 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.
KW - Infinite programming
KW - manipulation planning
KW - trajectory optimization
UR - http://www.scopus.com/inward/record.url?scp=105003578276&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=105003578276&partnerID=8YFLogxK
U2 - 10.1109/TRO.2025.3554380
DO - 10.1109/TRO.2025.3554380
M3 - Article
AN - SCOPUS:105003578276
SN - 1552-3098
VL - 41
SP - 2677
EP - 2690
JO - IEEE Transactions on Robotics
JF - IEEE Transactions on Robotics
ER -