TR2024-100

Simultaneous Trajectory Optimization and Contact Selection for Contact-rich Manipulation with High-Fidelity Geometry


    •  Zhang, M., Jha, D.K., Raghunathan, A., Hauser, K., "Simultaneous Trajectory Optimization and Contact Selection for Contact-rich Manipulation with High-Fidelity Geometry", RSS Workshop on Frontiers of Optimization for Robotics (RSS Workshop FOR), July 2024.
      BibTeX TR2024-100 PDF
      • @inproceedings{Zhang2024jul3,
      • author = {Zhang, Mengchao and Jha, Devesh K. and Raghunathan, Arvind and Hauser, Kris}},
      • title = {Simultaneous Trajectory Optimization and Contact Selection for Contact-rich Manipulation with High-Fidelity Geometry},
      • booktitle = {RSS Workshop on Frontiers of Optimization for Robotics (RSS Workshop FOR)},
      • year = 2024,
      • month = jul,
      • url = {https://www.merl.com/publications/TR2024-100}
      • }
  • MERL Contacts:
  • Research Areas:

    Optimization, Robotics

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.