Computational Technology Resources - CCC

M. Bruggi, B. Toth, J. Logo, "Form-finding of reticulated shells for a given plan layout with geometric constraints", in P. Iványi, J. Logo, B.H.V. Topping, (Editors), "Proceedings of the Sixth International Conference on Soft Computing, Machine Learning and Optimisation in Civil, Structural and Environmental Engineering", Civil-Comp Press, Edinburgh, UK, Online volume: CCC 5, Paper 5.2, 2023, doi:10.4203/ccc.5.5.2

Keywords: funicular analysis, form-finding, force density method, structural optimization, mathematical programming, geometric constraints.

Abstract

A numerical tool is implemented to address the design of reticulated shells through funicular analysis. As discussed in the literature, the force density method can be conveniently implemented to cope with the equilibrium of funicular networks, using independent sets of branches in the case of grids having fixed plan projection. In this contribution, optimal networks are sought not only in terms of an independent set of force densities, but also in the vertical coordinates of the restrained nodes. Constraints are enforced on the coordinates of the nodes, to prescribe a feasible design domain, and on the geometry of the members, to control their length and inclination with respect to a given reference direction. Due to its peculiar form, the arising multiconstrained problem can be efficiently solved through techniques of sequential convex programming that were originally conceived to handle formulations of size optimization for elastic structures. Networks that are fully feasible with respect to the enforced local constraints are retrieved in a limited number of iterations, with no need to initialize the procedure with a feasible starting guess. The same algorithm applies to general networks with any type of geometry and restraints.

download the full-text of this paper (PDF, 8 pages, 622 Kb)

go to the previous paper
go to the next paper
return to the table of contents
return to the volume description

	Computational & Technology Resources an online resource for computational, engineering & technology publications
	not logged in - login
Front Page Browse CCC CCP CSETS CTR IJRT Other Authors Search Purchase Guide FAQ Contact us	Civil-Comp Conferences ISSN 2753-3239 CCC: 5 PROCEEDINGS OF THE SIXTH INTERNATIONAL CONFERENCE ON SOFT COMPUTING, MACHINE LEARNING AND OPTIMISATION IN CIVIL, STRUCTURAL AND ENVIRONMENTAL ENGINEERING Edited by: P. Iványi, J. Logo and B.H.V. Topping Paper 5.2 Form-finding of reticulated shells for a given plan layout with geometric constraints M. Bruggi¹, B. Toth ^1,2 and J. Logo ² ¹Department of Civil and Environmental Engineering, Politecnico di Milano, Milano, Italy ²Department of Structural Mechanics, Budapest University of Technology and Economics, Budapest, Hungary doi:10.4203/ccc.5.5.2 Full Bibliographic Reference for this paper M. Bruggi, B. Toth, J. Logo, "Form-finding of reticulated shells for a given plan layout with geometric constraints", in P. Iványi, J. Logo, B.H.V. Topping, (Editors), "Proceedings of the Sixth International Conference on Soft Computing, Machine Learning and Optimisation in Civil, Structural and Environmental Engineering", Civil-Comp Press, Edinburgh, UK, Online volume: CCC 5, Paper 5.2, 2023, doi:10.4203/ccc.5.5.2 Keywords: funicular analysis, form-finding, force density method, structural optimization, mathematical programming, geometric constraints. Abstract A numerical tool is implemented to address the design of reticulated shells through funicular analysis. As discussed in the literature, the force density method can be conveniently implemented to cope with the equilibrium of funicular networks, using independent sets of branches in the case of grids having fixed plan projection. In this contribution, optimal networks are sought not only in terms of an independent set of force densities, but also in the vertical coordinates of the restrained nodes. Constraints are enforced on the coordinates of the nodes, to prescribe a feasible design domain, and on the geometry of the members, to control their length and inclination with respect to a given reference direction. Due to its peculiar form, the arising multiconstrained problem can be efficiently solved through techniques of sequential convex programming that were originally conceived to handle formulations of size optimization for elastic structures. Networks that are fully feasible with respect to the enforced local constraints are retrieved in a limited number of iterations, with no need to initialize the procedure with a feasible starting guess. The same algorithm applies to general networks with any type of geometry and restraints. download the full-text of this paper (PDF, 8 pages, 622 Kb) go to the previous paper go to the next paper return to the table of contents return to the volume description
Back to top	©Civil-Comp Limited 2023 - terms & conditions