June
1993
Finding Stable Orientations of Assemblies with Linear Programming
Authors:
Abstract:
In the paper by Mattikalli et al.[5], the stability of an assemblage of frictionless contacting bodies with uniform gravity was considered. The problem of finding a stable orientation for such an assembly was formulated as a constrained maximin problem. A solution to the maximin problem yielded an orientation of the assembly that was stable under gravity; however, if no such orientation existed, then the solution to the maximin problem yielded the most stable orientation possible for the assembly. The maximin problem was solved using a numerical iteration procedure that solved a linear program for each step of the iteration. In this paper, we show that the stability problem can be considered a variant of standard zero-sum matrix games. A solution to the maximin problem can be found by solving a single linear program.
copied = false, 2000);
">
@techreport{Baraff-1993-13516,
author = {David Baraff And Raju Mattikalli And Bruno Repetto And Pradeep Khosla},
title = {Finding Stable Orientations of Assemblies with Linear Programming},
year = {1993},
month = {June},
institute = {Carnegie Mellon University},
address = {Pittsburgh, PA},
number = {CMU-RI-TR-93-13},
}
author = {David Baraff And Raju Mattikalli And Bruno Repetto And Pradeep Khosla},
title = {Finding Stable Orientations of Assemblies with Linear Programming},
year = {1993},
month = {June},
institute = {Carnegie Mellon University},
address = {Pittsburgh, PA},
number = {CMU-RI-TR-93-13},
}