Finding all gravitationally stable orientations of assemblies

R. Mattikalli, David Baraff, and Pradeep Khosla
International Conference on Robotics and Automation, May, 1994, pp. 251 - 257.


Download
  • Adobe portable document format (pdf) (298KB)
Copyright notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.

Abstract
Previous work by Mattikalli et al.[1] considered the stability of assemblies of frictionless contacting bodies with uniform gravity. A linear programming-based technique was described that would automatically determine a single stable orientation for an assembly (if such an orientation existed). In this paper, we give an exact characterization of the entire set of stable orientations of any assembly under uniform gravity. Our characterization reveals that the set of stable orientations maps out a convex region on the unit-sphere of directions. The region is bounded by a sequence of vertices adjoined with great arcs. Linear programming techniques are used to automatically find this set of vertices, yielding a precise description of the range of stable orientations for any frictionless assembly.

Notes

Text Reference
R. Mattikalli, David Baraff, and Pradeep Khosla, "Finding all gravitationally stable orientations of assemblies," International Conference on Robotics and Automation, May, 1994, pp. 251 - 257.

BibTeX Reference
@inproceedings{Baraff_1994_1595,
   author = "R. Mattikalli and David Baraff and Pradeep Khosla",
   title = "Finding all gravitationally stable orientations of assemblies",
   booktitle = "International Conference on Robotics and Automation",
   pages = "251 - 257",
   publisher = "IEEE",
   month = "May",
   year = "1994",
}