Force Design of Tensegrity Structures by Enumeration of Vertices of Feasible Region

Abstract

An optimization approach is presented for force design of tensegrity structures by enumeration of the vertices of the feasible region of the prestresses, which is defined as the linear combinations of the coefficients of the self-equilibrium force vectors. The unilateral properties of the stresses in cables and struts are taken into consideration. In order to design the stiffest structure against uncertain external loads as well as specific external loads, a multiobjective optimization problem is formulated for simultaneous maximization of the lowest eigenvalue of the tangent stiffness matrix and minimization of the compliance against a specified set of external loads. In the numerical example, Pareto optimal solutions are found by enumerating the vertices of the feasible region of prestresses of a tensegrity grid, and the monotonicity properties of the objective functions are investigated.

Keywords

Tensegrity force design self-equilibrium force multiobjective programming vertex enumeration

Get full access to this article

View all access options for this article.

References

Motro

, 1992. Tensegrity systems: The state of the art. Int. J. Space Structures. Vol. 7, No. 2, pp. 75–83.

Lalvani

, 1996. Origins of tensegrity: Views of Emmerich, Fuller and Snel-son, Int. J. Space Structures, Vol.11, No. 1 & 2, pp. 27–55.

Connelly

, 1999. Tensegrity Structures: Why are they Stable? Rigidity Theory and Applications, Edited by Thorpe Duxbury , Kluwer/Plenum Publishers, pp. 47–54.

Tibert

A. G.

Pellegrino

, 2003. Review of form-finding methods for tensegrity structures, Int. J. Space Structures, Vol.18, No.4, pp. 209–223.

Zhang

J. Y.

Ohsaki

, 2007. Optimization methods for force and shape design of tensegrity structures, Proc. 7th World Congress on Structural and Multidisciplinary Optimization, Seoul, Korea.

Ohsaki

Zhang

J. Y.

, 2006. Stability conditions of prestressed pin-jointed structures, Int. J. Non-Linear Mechanics, Vol. 41, pp. 1109–1117.

Schek

H. J.

, 1974. The force density method for form finding and computation of general networks, Comp. Meth. Appl. Mech. Engng., Vol. 3, pp. 115–134.

Horn

R. A.

Johnson

C.R.

, 1990. Matrix Analysis. Cambridge University Press (Reprint edition).

Zhang

J. Y.

Ohsaki

, 2006. Adaptive force density method for form-finding problem of tensegrity structures. Int. J. Solids Struct., Vol. 43, pp. 5658–5673.

10.

Cohon

J. L.

, 1978. Multiobjective Programming and Planning, vol. 140, Mathematics in Science and Engineering, Academic Press.

11.

Avis

Fukuda

, 1992. A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra, Discrete Comput. Geom., Vol. 8, pp. 295–313.

12.

Avis

Fukuda

, 1996. Reverse search for enumeration. Discrete Applied Math., Vol. 65(1–3), pp. 21–46.

13.

Motro

, 2003. Tensegrity Structural Systems for the Future, Butterworth-Heinemann.

14.

Fukuda

, 1999. cdd+ V e r. 0.76 User's Manual, Inst. Operation Res., ETH-Zentrum, Zurich, Switzerland.