Wang, YafengXu, XianLuo, Yaozhi2021-04-242021-04-242021-04-242021-04-0110.1016/j.compstruc.2021.106486https://infoscience.epfl.ch/handle/20.500.14299/177522WOS:000632503100006This paper presents a unifying framework for the form-finding and topology-finding of tensegrity structures. The novel computational framework is based on rank-constrained linear matrix inequalities. For form-finding, given the topology (i.e., member connectivities), the determination of the member force densities is formulated into a linear matrix inequality (LMI) problem with a constraint on the rank of the force density matrix. The positive semi-definiteness and rank deficiency condition of the force density matrix are well managed by the rank-constrained LMI-based formulation. A Newton-like algorithm is employed to solve the rank-constrained LMI problem. Two methods, named direct method and indirect method, are proposed to determine the nodal coordinates once the force densities have been obtained. For topology-finding, given the geometry (i.e., nodal coordinates), the determination of the topology is also formulated into an LMI problem with a constraint on the rank of the tangent stiffness matrix. Numerical examples demonstrate that different types of form-finding problems (such as tensegrity structures with single and with multiple self-stress states, symmetric and irregular tensegrity structures) can be uniformly and efficiently solved by the proposed approach. Furthermore, three well-known tensegrity structures are reproduced to verify the effectiveness of the proposed formulation on the topology-finding of tensegrity structures. (C) 2021 Elsevier Ltd. All rights reserved.Computer Science, Interdisciplinary ApplicationsEngineering, CivilComputer ScienceEngineeringtensegrity structuresform-findingtopology-findingrank-constrainedlinear matrix inequalitytext::journal::journal article::research article