The characterization of the self-supporting slender structure with the furthest length is of interest both from a mechanical and biological point of view. Indeed, from a mechanical perspective, this classical problem was developed and studied with different methods, for example using similarity solutions and stable manifolds. However, none of them led to a complete analytical solution. On the other hand, plant structures such as tree branches or searcher shoots in climbing plants can be considered elastic cantilevered beams. In this paper, we formulate the problem as a non-convex optimisation problem with mixed state constraints. The problem is solved by analysing the corresponding relaxation. With this method, it is possible to obtain an analytical characterization of the cross-section
An Optimal Control Approach to the Problem of the Longest Self-Supporting Structure
Palladino, Michele;Marcati, Pierangelo
2024-01-01
Abstract
The characterization of the self-supporting slender structure with the furthest length is of interest both from a mechanical and biological point of view. Indeed, from a mechanical perspective, this classical problem was developed and studied with different methods, for example using similarity solutions and stable manifolds. However, none of them led to a complete analytical solution. On the other hand, plant structures such as tree branches or searcher shoots in climbing plants can be considered elastic cantilevered beams. In this paper, we formulate the problem as a non-convex optimisation problem with mixed state constraints. The problem is solved by analysing the corresponding relaxation. With this method, it is possible to obtain an analytical characterization of the cross-sectionFile | Dimensione | Formato | |
---|---|---|---|
s00332-023-10011-5 (2).pdf
accesso aperto
Tipologia:
Documento in Versione Editoriale
Licenza:
Creative commons
Dimensione
1.07 MB
Formato
Adobe PDF
|
1.07 MB | Adobe PDF | Visualizza/Apri |
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.