# American Institute of Mathematical Sciences

March  2021, 16(1): 1-29. doi: 10.3934/nhm.2020031

## A 2-dimensional shape optimization problem for tree branches

 1 Department of Mathematics, Penn State University, University Park, PA 16802, USA 2 Department of Mathematical Sciences, NTNU – Norwegian University of Science and Technology, NO-7491 Trondheim, Norway

* Corresponding author: Alberto Bressan

Received  June 2020 Revised  September 2020 Published  October 2020

The paper is concerned with a shape optimization problem, where the functional to be maximized describes the total sunlight collected by a distribution of tree leaves, minus the cost for transporting water and nutrient from the base of trunk to all the leaves. In a 2-dimensional setting, the solution is proved to be unique and explicitly determined.

Citation: Alberto Bressan, Sondre Tesdal Galtung. A 2-dimensional shape optimization problem for tree branches. Networks & Heterogeneous Media, 2021, 16 (1) : 1-29. doi: 10.3934/nhm.2020031
##### References:

show all references

##### References:
A stem $\gamma_1$ perpendicular to the sun rays is optimally shaped to collect the most light. For the stem $\gamma_2$ bending toward the light source, the upper leaves put the lower ones in shade
When the light rays impinge from a fixed direction ${{\bf n}}$, the optimal distribution of leaves is supported on the two rays $\Gamma_0$ and $\Gamma_1$
Density profile $u(s)$ for $s \in [0, \ell_1]$ along the ray $\Gamma_1$ for $c = 1$ and $\alpha = 2/3, 1/3$
According to the definition (31), the set $\chi^-(x)$ is a curve joining the origin to the point $x$. The set $\chi^+(x)$ is a subtree, containing all paths that start from $x$
If the set $\chi^+(x)$ is not contained in the slab $\Gamma_x$ (the shaded region), by taking the perpendicular projections $\pi^\sharp$ and $\pi^\flat$ we obtain another irrigation plan with strictly lower cost, which irrigates a new measure $\tilde{\mu}$ gathering exactly the same amount of sunlight. Notice that here $P$ is the point in the closed set $\overline{\chi^+(x)}\cap{{\mathbb R}}{{\bf e}}_1$ which has the largest inner product with ${{\bf n}}$.
After a rotation of coordinates, the sunlight comes from the vertical direction. Here the blue lines correspond to the set ${{\mathcal B}}^*$ in (36).
The construction used in the proof of Lemma 3.3.
The thick portions of the curve $\gamma$ are the only points where a left bifurcation can occur. If a horizontal branch $\sigma$ bifurcates from $C_j$, all the mass on this branch can be shifted downward to another branch $\sigma^*$ bifurcating from $C_j^*$. Furthermore, if some portion of the path $\gamma$ between $P^*$ and $Q$ lies above the segment $\gamma^*$ joining these two points, we can take a projection of $\gamma$ on $\gamma^*$. In both cases, the transportation cost is strictly reduced.
Left: an irrigation plan for a measure $\mu$ with two masses at $Q$ and at $P_1$. Right: an irrigation plan for a modified measure $\tilde{\mu}$ with two masses at $\tilde{Q}$ and at $P_1$. The lengths of the segments $PP^*$ and $P^* P_1$ will be denoted by $\ell_a, \ell_b$, respectively.
A more general configuration, considered in Lemma 4.2.
Left: in the shaded region $\Delta$ above the curve $\gamma$, the measure $\mu$ cannot concentrate any mass. Otherwise, by shifting this mass downward until it hits a point on $\gamma$, we would obtain a second measure $\tilde{\mu}$ which gathers the same amount of sunlight, but has a lower irrigation cost. As a consequence, by the interior regularity property, the flow out of $P^*$ is locally supported on a finite number of line segments. Right: the construction used in steps 4–6 of the proof of Theorem 2.5.
Changing the transport plan, when $\theta_0>0$ is very small. If in the irrigation problem the bifurcation angle satisfies $\theta>\theta_0 +{\pi\over 2}$, then the original configuration, where all the mass is supported along $\Gamma_0\cup\Gamma_1$, would not be optimal. The analysis at (102) shows that this situation never happens.
 [1] Anton Schiela, Julian Ortiz. Second order directional shape derivatives of integrals on submanifolds. Mathematical Control & Related Fields, 2021  doi: 10.3934/mcrf.2021017 [2] Guillaume Bal, Wenjia Jing. Homogenization and corrector theory for linear transport in random media. Discrete & Continuous Dynamical Systems - A, 2010, 28 (4) : 1311-1343. doi: 10.3934/dcds.2010.28.1311 [3] Luigi Barletti, Giovanni Nastasi, Claudia Negulescu, Vittorio Romano. Mathematical modelling of charge transport in graphene heterojunctions. Kinetic & Related Models, , () : -. doi: 10.3934/krm.2021010 [4] Wen-Bin Yang, Yan-Ling Li, Jianhua Wu, Hai-Xia Li. Dynamics of a food chain model with ratio-dependent and modified Leslie-Gower functional responses. Discrete & Continuous Dynamical Systems - B, 2015, 20 (7) : 2269-2290. doi: 10.3934/dcdsb.2015.20.2269 [5] Jingni Guo, Junxiang Xu, Zhenggang He, Wei Liao. Research on cascading failure modes and attack strategies of multimodal transport network. Journal of Industrial & Management Optimization, 2021  doi: 10.3934/jimo.2020159 [6] Eduardo Casas, Christian Clason, Arnd Rösch. Preface special issue on system modeling and optimization. Mathematical Control & Related Fields, 2021  doi: 10.3934/mcrf.2021008 [7] Ardeshir Ahmadi, Hamed Davari-Ardakani. A multistage stochastic programming framework for cardinality constrained portfolio optimization. Numerical Algebra, Control & Optimization, 2017, 7 (3) : 359-377. doi: 10.3934/naco.2017023 [8] Luke Finlay, Vladimir Gaitsgory, Ivan Lebedev. Linear programming solutions of periodic optimization problems: approximation of the optimal control. Journal of Industrial & Management Optimization, 2007, 3 (2) : 399-413. doi: 10.3934/jimo.2007.3.399 [9] Christophe Zhang. Internal rapid stabilization of a 1-D linear transport equation with a scalar feedback. Mathematical Control & Related Fields, 2021  doi: 10.3934/mcrf.2021006 [10] Hong Seng Sim, Wah June Leong, Chuei Yee Chen, Siti Nur Iqmal Ibrahim. Multi-step spectral gradient methods with modified weak secant relation for large scale unconstrained optimization. Numerical Algebra, Control & Optimization, 2018, 8 (3) : 377-387. doi: 10.3934/naco.2018024 [11] Abdulrazzaq T. Abed, Azzam S. Y. Aladool. Applying particle swarm optimization based on Padé approximant to solve ordinary differential equation. Numerical Algebra, Control & Optimization, 2021  doi: 10.3934/naco.2021008 [12] Mohsen Abdolhosseinzadeh, Mir Mohammad Alipour. Design of experiment for tuning parameters of an ant colony optimization method for the constrained shortest Hamiltonian path problem in the grid networks. Numerical Algebra, Control & Optimization, 2021, 11 (2) : 321-332. doi: 10.3934/naco.2020028 [13] Reza Lotfi, Yahia Zare Mehrjerdi, Mir Saman Pishvaee, Ahmad Sadeghieh, Gerhard-Wilhelm Weber. A robust optimization model for sustainable and resilient closed-loop supply chain network design considering conditional value at risk. Numerical Algebra, Control & Optimization, 2021, 11 (2) : 221-253. doi: 10.3934/naco.2020023

2019 Impact Factor: 1.053

## Tools

Article outline

Figures and Tables