Computing the lowest equilibrium pose of a cable-suspended rigid body

Collard, Jean-François;Cardou, Philippe
(2013) Optimization and Engineering : international multidisciplinary journal to promote optimization theory and applications in engineering sciences — Vol. 14, n° 3, p. 457-476 (2013)

Files

Collard_and_Cardou_2012.pdf
  • Open Access
  • Adobe PDF
  • 155.51 KB
Download

Details

Authors
  • Collard, Jean-FrançoisUCLouvain
    Author
  • Cardou, PhilippeUniversité Laval
    Author
Abstract
We solve the problem of finding the lowest stable-equilibrium pose of a rigid body subjected to gravity and suspended in space by an arbitrary number of cables. Besides representing a contribution to fundamental rigid-body mechanics, this solution finds application in two areas of robotics research: underconstrained cable-driven parallel robots and cooperative towing. The proposed approach consists in globally minimizing the rigid-body potential energy. This is done by applying a branch-and-bound algorithm over the group of rotations, which is partitioned into boxes in the space of Euler-Rodrigues parameters. The lower bound on the objective is obtained through a semidefinite relaxation of the optimization problem, whereas the upper bound is obtained by solving the same problem for a fixed orientation. The resulting algorithm is applied to several examples drawn from the literature. The reported Matlab implementation converges to the lowest stable equilibrium pose generally in a few seconds for cable-robot applications. Interestingly, the proposed method is only mildly sensitive to the number of suspending cables, which is shown by solving an example with 1000 cables in two hours.
Affiliations

Citations

  • APA
  • Chicago
  • FWB

Collard, J.-F., & Cardou, P. (2013). Computing the lowest equilibrium pose of a cable-suspended rigid body. Optimization and Engineering : international multidisciplinary journal to promote optimization theory and applications in engineering sciences, 14(3), 457-476. https://doi.org/10.1007/s11081-012-9191-5 (Original work published 2013)