<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD Journal Publishing DTD v2.3 20070202//EN" "journalpublishing.dtd">
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" article-type="research-article" dtd-version="2.3" xml:lang="EN">
<front>
<journal-meta>
<journal-id journal-id-type="publisher-id">Front. Plant Sci.</journal-id>
<journal-title>Frontiers in Plant Science</journal-title>
<abbrev-journal-title abbrev-type="pubmed">Front. Plant Sci.</abbrev-journal-title>
<issn pub-type="epub">1664-462X</issn>
<publisher>
<publisher-name>Frontiers Media S.A.</publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="doi">10.3389/fpls.2025.1610571</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Plant Science</subject>
<subj-group>
<subject>Original Research</subject>
</subj-group>
</subj-group>
</article-categories>
<title-group>
<article-title>Dynamic optimization of stand structure in <italic>Pinus yunnanensis</italic> secondary forests based on deep reinforcement learning and structural prediction</article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname>Zhao</surname>
<given-names>Jian</given-names>
</name>
<xref ref-type="aff" rid="aff1">
<sup>1</sup>
</xref>
<role content-type="https://credit.niso.org/contributor-roles/conceptualization/"/>
<role content-type="https://credit.niso.org/contributor-roles/data-curation/"/>
<role content-type="https://credit.niso.org/contributor-roles/formal-analysis/"/>
<role content-type="https://credit.niso.org/contributor-roles/investigation/"/>
<role content-type="https://credit.niso.org/contributor-roles/methodology/"/>
<role content-type="https://credit.niso.org/contributor-roles/writing-original-draft/"/>
</contrib>
<contrib contrib-type="author" corresp="yes">
<name>
<surname>Wang</surname>
<given-names>Jianming</given-names>
</name>
<xref ref-type="aff" rid="aff1">
<sup>1</sup>
</xref>
<xref ref-type="author-notes" rid="fn001">
<sup>*</sup>
</xref>
<uri xlink:href="https://loop.frontiersin.org/people/2093591/overview"/>
<role content-type="https://credit.niso.org/contributor-roles/conceptualization/"/>
<role content-type="https://credit.niso.org/contributor-roles/data-curation/"/>
<role content-type="https://credit.niso.org/contributor-roles/funding-acquisition/"/>
<role content-type="https://credit.niso.org/contributor-roles/methodology/"/>
<role content-type="https://credit.niso.org/contributor-roles/project-administration/"/>
<role content-type="https://credit.niso.org/contributor-roles/resources/"/>
<role content-type="https://credit.niso.org/contributor-roles/supervision/"/>
<role content-type="https://credit.niso.org/contributor-roles/validation/"/>
<role content-type="https://credit.niso.org/contributor-roles/visualization/"/>
<role content-type="https://credit.niso.org/contributor-roles/writing-review-editing/"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname>Yin</surname>
<given-names>Jiting</given-names>
</name>
<xref ref-type="aff" rid="aff2">
<sup>2</sup>
</xref>
<role content-type="https://credit.niso.org/contributor-roles/data-curation/"/>
<role content-type="https://credit.niso.org/contributor-roles/visualization/"/>
<role content-type="https://credit.niso.org/contributor-roles/writing-review-editing/"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname>Chen</surname>
<given-names>Yuling</given-names>
</name>
<xref ref-type="aff" rid="aff3">
<sup>3</sup>
</xref>
<role content-type="https://credit.niso.org/contributor-roles/software/"/>
<role content-type="https://credit.niso.org/contributor-roles/validation/"/>
<role content-type="https://credit.niso.org/contributor-roles/visualization/"/>
<role content-type="https://credit.niso.org/contributor-roles/writing-review-editing/"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname>Wu</surname>
<given-names>Baoguo</given-names>
</name>
<xref ref-type="aff" rid="aff4">
<sup>4</sup>
</xref>
<role content-type="https://credit.niso.org/contributor-roles/validation/"/>
<role content-type="https://credit.niso.org/contributor-roles/visualization/"/>
<role content-type="https://credit.niso.org/contributor-roles/writing-review-editing/"/>
</contrib>
</contrib-group>
<aff id="aff1">
<sup>1</sup>
<institution>School of Mathematics and Computer Science, Dali University</institution>, <addr-line>Dali</addr-line>,&#xa0;<country>China</country>
</aff>
<aff id="aff2">
<sup>2</sup>
<institution>Dali Forestry and Grassland Science Research Institute</institution>, <addr-line>Dali</addr-line>,&#xa0;<country>China</country>
</aff>
<aff id="aff3">
<sup>3</sup>
<institution>Institute of Remote Sensing and Geographic Information System, School of Earth and Space Sciences, Peking University</institution>, <addr-line>Beijing</addr-line>,&#xa0;<country>China</country>
</aff>
<aff id="aff4">
<sup>4</sup>
<institution>School of Information Science and Technology, Beijing Forestry University</institution>, <addr-line>Beijing</addr-line>,&#xa0;<country>China</country>
</aff>
<author-notes>
<fn fn-type="edited-by">
<p>Edited by: C&#xe9;sar Mar&#xed;n, Santo Tom&#xe1;s University, Chile</p>
</fn>
<fn fn-type="edited-by">
<p>Reviewed by: <ext-link ext-link-type="uri" xlink:href="https://loop.frontiersin.org/people/1568290/overview">Sumit Chakravarty</ext-link>, Uttar Banga Krishi Viswavidyalaya, India</p>
<p>
<ext-link ext-link-type="uri" xlink:href="https://loop.frontiersin.org/people/3121933/overview">Kai Liu</ext-link>, Northeast Normal University, China</p>
</fn>
<fn fn-type="corresp" id="fn001">
<p>*Correspondence: Jianming Wang, <email xlink:href="mailto:wangjianming618@163.com">wangjianming618@163.com</email>
</p>
</fn>
</author-notes>
<pub-date pub-type="epub">
<day>15</day>
<month>10</month>
<year>2025</year>
</pub-date>
<pub-date pub-type="collection">
<year>2025</year>
</pub-date>
<volume>16</volume>
<elocation-id>1610571</elocation-id>
<history>
<date date-type="received">
<day>12</day>
<month>04</month>
<year>2025</year>
</date>
<date date-type="accepted">
<day>10</day>
<month>09</month>
<year>2025</year>
</date>
</history>
<permissions>
<copyright-statement>Copyright &#xa9; 2025 Zhao, Wang, Yin, Chen and Wu.</copyright-statement>
<copyright-year>2025</copyright-year>
<copyright-holder>Zhao, Wang, Yin, Chen and Wu</copyright-holder>
<license xlink:href="http://creativecommons.org/licenses/by/4.0/">
<p>This is an open-access article distributed under the terms of the Creative Commons Attribution License (CC BY). The use, distribution or reproduction in other forums is permitted, provided the original author(s) and the copyright owner(s) are credited and that the original publication in this journal is cited, in accordance with accepted academic practice. No use, distribution or reproduction is permitted which does not comply with these terms.</p>
</license>
</permissions>
<abstract>
<sec>
<title>Introduction</title>
<p>The rational structure of forest stands plays a crucial role in maintaining ecosystem functions, enhancing community stability, and ensuring sustainable management. Although progress has been made in stand structure optimization, most existing studies focus on static improvements and fail to adequately capture the dynamic nature of stand development. In addition, commonly used heuristic and traditional methods often suffer from limitations in computational efficiency and generalization ability.</p>
</sec>
<sec>
<title>Methods</title>
<p>To address these challenges, this study explores the potential and advantages of multi-agent deep reinforcement learning in forest management, offering innovative insights and methods for achieving sustainable forest ecosystem management. Using the secondary forests of <italic>Pinus yunnanensis</italic> in southwest China as the research subject, we constructed an objective function and constraints based on spatial and non-spatial structure indexes. Selective harvesting and replanting were employed as optimization measures, and experiments were conducted on five circular plots to compare the performance of multi-agent deep reinforcement learning with that of multi-agent reinforcement learning. To account for the dynamic characteristics of stand structure, we further integrated structure prediction with multi-agent deep reinforcement learning for dynamic optimization across the five plots.</p>
</sec>
<sec>
<title>Results</title>
<p>The results indicate that multi agent deep reinforcement learning consistently outperformed multi agent reinforcement learning across all plots. For the initial objective function values of each plot (0.3501, 0.3799, 0.3982, 0.3344, 0.4294), the optimized results obtained through multi agent deep reinforcement learning (0.5378, 0.5861, 0.5860, 0.5130, 0.6034) were significantly superior to the maximum objective function values achieved by multi agent reinforcement learning (0.5302, 0.5369, 0.5766, 0.5014, 0.5906). Furthermore, the dynamic optimization results incorporating structure prediction demonstrate that all plots progressively approached an ideal stand condition over multiple optimization cycles (0.5718, 0.6101, 0.6455, 0.5863, 0.6210), leading to a more balanced stand structure and improved long-term stability.</p>
</sec>
<sec>
<title>Discussion</title>
<p>This study proposes a novel stand structure optimization method that integrates multi agent deep reinforcement learning with structure prediction, providing theoretical support and practical guidance for the sustainable management of <italic>Pinus yunnanensis</italic> secondary forests.</p>
</sec>
</abstract>
<kwd-group>
<kwd>multi-agent deep reinforcement learning</kwd>
<kwd>stand structure</kwd>
<kwd>multi-objective optimization</kwd>
<kwd>structure prediction</kwd>
<kwd>secondary forests</kwd>
</kwd-group>
<counts>
<fig-count count="10"/>
<table-count count="8"/>
<equation-count count="18"/>
<ref-count count="63"/>
<page-count count="24"/>
<word-count count="12187"/>
</counts>
<custom-meta-wrap>
<custom-meta>
<meta-name>section-in-acceptance</meta-name>
<meta-value>Functional Plant Ecology</meta-value>
</custom-meta>
</custom-meta-wrap>
</article-meta>
</front>
<body>
<sec id="s1" sec-type="intro">
<label>1</label>
<title>Introduction</title>
<p>Secondary forests often face challenges such as unstable stand structure, reduced biodiversity, increased risk of forest fires, and susceptibility to natural disturbances, including insect infestations, diseases, and wildfires (<xref ref-type="bibr" rid="B27">Lei et&#xa0;al., 2008</xref>; <xref ref-type="bibr" rid="B9">Ding and Zang, 2021</xref>; <xref ref-type="bibr" rid="B57">Zaizhi, 2001</xref>). To enhance the stability and sustainability of secondary forests, stand structure optimization has become a key technical approach in forest management and planning, providing essential support for their scientific management.</p>
<p>Selective harvesting is a crucial measure for optimizing stand structure and has received widespread attention (<xref ref-type="bibr" rid="B10">Dong et&#xa0;al., 2022</xref>; <xref ref-type="bibr" rid="B12">Dongsheng et&#xa0;al., 2020</xref>; <xref ref-type="bibr" rid="B7">Chi et&#xa0;al., 2019</xref>; <xref ref-type="bibr" rid="B11">Dong et&#xa0;al., 2020</xref>). By removing trees with limited growth potential and weak competitiveness, the growth environment and resource allocation of the remaining trees can be improved, thereby optimizing stand structure.</p>
<p>Common stand structure optimization algorithms include heuristic methods such as particle swarm optimization (PSO) (<xref ref-type="bibr" rid="B51">Wu et&#xa0;al., 2022</xref>), Monte Carlo algorithm (<xref ref-type="bibr" rid="B18">Haight and Travis, 1997</xref>; <xref ref-type="bibr" rid="B4">Boston and Bettinger, 1999</xref>), and genetic algorithms (GA) (<xref ref-type="bibr" rid="B22">Jianming et&#xa0;al., 2017</xref>; <xref ref-type="bibr" rid="B36">Okasha and Frangopol, 2009</xref>; <xref ref-type="bibr" rid="B13">Fotakis et&#xa0;al., 2012</xref>). PSO provides certain advantages in global search but is prone to local optima in complex problems; Monte Carlo methods explore the solution space through random sampling but often suffer from low computational efficiency; GA performs well in handling nonlinear problems but typically requires many iterations to converge. Overall, although these methods can address stand structure optimization tasks, they generally face limitations such as high computational cost, susceptibility to local optima, and insufficient solution efficiency. In our previous study, we applied deep reinforcement learning to improve the efficiency and accuracy of multi-objective stand structure optimization. By modeling tree-felling decisions as agent actions and incorporating neural networks with experience replay for stable training, this approach achieved superior optimization results compared with traditional heuristic algorithms and conventional reinforcement learning methods across multiple plots of Pinus yunnanensis secondary forests (<xref ref-type="bibr" rid="B62">Zhao et&#xa0;al., 2024</xref>).</p>
<p>A single selective harvesting measure can only reduce competition and adjust stand density, but it cannot restore species diversity or fill the spatial gaps created by harvesting; therefore, it is insufficient to achieve comprehensive optimization of stand structure. On this basis, replanting measures, namely the planting of native tree seedlings in appropriate locations, should be implemented to achieve overall optimization of stand structure. Common strategies for selecting replanting location include the Voronoi diagram method (<xref ref-type="bibr" rid="B49">Wang et&#xa0;al., 2019</xref>), the maximum Delaunay triangulation area method (<xref ref-type="bibr" rid="B8">Chunyan and Jiping, 2017</xref>), and the Kriging interpolation method (<xref ref-type="bibr" rid="B20">Jian et&#xa0;al., 2018</xref>). In general, these methods identify relatively sparse areas within the stand as potential replanting sites using different algorithms. However, they have certain limitations: on one hand, the replanting locations are relatively fixed and lack flexibility, which may lead to suboptimal replanting outcomes; on the other hand, these methods often overlook the competitive interactions between the replanting trees and neighboring trees, potentially increasing resource competition within the stand and affecting the optimization of stand structure.</p>
<p>Building on this foundation, our research team applied multi-agent reinforcement learning to integrate selective harvesting and replanting, using multiple agents for collaborative optimization. Compared to single selective harvesting or replanting, multi-agent reinforcement learning offers advantages such as improved harvesting effectiveness and more flexible replanting locations, providing high adaptability and variability (<xref ref-type="bibr" rid="B55">Xuan et&#xa0;al., 2024</xref>, <xref ref-type="bibr" rid="B54">2023</xref>). However, for such complex optimization problems, the trial-and-error cost in reinforcement learning increases, leading to unstable training and poor generalization capability. In contrast, multi-agent deep reinforcement learning not only retains the collaborative optimization advantages of multi-agent reinforcement learning but also exhibits superior computational efficiency. It achieves higher solution stability and efficiency when handling complex problems, along with enhanced generalization capability (<xref ref-type="bibr" rid="B50">Waschneck et&#xa0;al., 2018</xref>; <xref ref-type="bibr" rid="B35">Ning et&#xa0;al., 2023</xref>; <xref ref-type="bibr" rid="B16">Gronauer and Diepold, 2022</xref>; <xref ref-type="bibr" rid="B42">Shen et&#xa0;al., 2022</xref>).</p>
<p>Despite significant progress in current stand structure optimization research (<xref ref-type="bibr" rid="B37">Olsthoorn et&#xa0;al., 1999</xref>; <xref ref-type="bibr" rid="B6">Chen et&#xa0;al., 2023</xref>; <xref ref-type="bibr" rid="B60">Zhang et&#xa0;al., 2024</xref>), existing studies primarily focus on optimizing the present stand condition while overlooking the dynamic changes in stand structure. Research on optimizing dynamic stand structures remains relatively scarce (<xref ref-type="bibr" rid="B33">Na, 2019</xref>). As climate change, ecological shifts, and increasing complexities in forest management demand more adaptive strategies, dynamic stand structure optimization&#x2014;optimization from a long-term perspective&#x2014;will become increasingly important. Therefore, integrating scientific prediction with effective optimization methods to enhance the sustainability and adaptability of future stand management has emerged as a key challenge in contemporary forestry research.</p>
<p>Structure prediction is another important field in ecology and forest management. By analyzing existing stand data, it forecasts future stand growth trends and structural evolution.</p>
<p>Extensive research has been conducted on predicting stand variables such as DBH (<xref ref-type="bibr" rid="B17">Gyawali et&#xa0;al., 2015</xref>; <xref ref-type="bibr" rid="B3">Bohora and Cao, 2014</xref>), tree height (<xref ref-type="bibr" rid="B26">Lee et&#xa0;al., 2024</xref>; <xref ref-type="bibr" rid="B45">Siipilehto et&#xa0;al., 2023</xref>), crown width (<xref ref-type="bibr" rid="B39">Raptis et&#xa0;al., 2018</xref>; <xref ref-type="bibr" rid="B40">S&#xe1;nchez-Gonz&#xe1;lez et&#xa0;al., 2007</xref>), and crown length (<xref ref-type="bibr" rid="B32">Mengying et&#xa0;al., 2021</xref>; <xref ref-type="bibr" rid="B41">Sattler and LeMay, 2011</xref>). General growth models (<xref ref-type="bibr" rid="B23">Jiazheng et&#xa0;al., 2021</xref>) offer biologically interpretable insights, mixed-effects models (<xref ref-type="bibr" rid="B5">Chang and Fan, 2024</xref>) capture both population trends and individual variation, and machine learning methods such as random forests (<xref ref-type="bibr" rid="B53">Xiaonan et&#xa0;al., 2024</xref>) excel in nonlinear modeling and predictive accuracy. These approaches have all achieved promising results. Particularly in forest management and resource planning, these models provide critical scientific support for stand management. However, existing studies on structure prediction mainly focus on the interactions and trend predictions of multiple tree attributes (<xref ref-type="bibr" rid="B28">Ling-bo and Zhao-gang, 2011</xref>; <xref ref-type="bibr" rid="B52">Xi et&#xa0;al., 2015</xref>), with relatively little attention given to their overall impact on stand structural evolution (<xref ref-type="bibr" rid="B24">Jiping et&#xa0;al., 2020</xref>). Integrating prediction with optimization not only enhances our understanding of the dynamic changes in forest ecosystems but also provides scientific guidance for dynamic stand structure optimization, ultimately improving the long-term effectiveness of forest management.</p>
<p>In summary, although existing studies have made significant progress in stand structure optimization, they primarily focus on static improvements and fail to adequately address the dynamic nature of stand development over time. Moreover, heuristic algorithms and traditional reinforcement learning methods suffer from limitations in computational efficiency and generalization ability, restricting their applicability in long-term, complex ecosystem management. To bridge these gaps, this study proposes an innovative approach that integrates multi-agent deep reinforcement learning with stand structure prediction, focusing on the secondary forests of <italic>Pinus yunnanensis</italic>. By incorporating dynamic prediction into selective harvesting and replanting measures, we aim to achieve dynamic optimization of stand structure, not only enhancing the current structural condition but also improving long-term stability and sustainability.</p>
</sec>
<sec id="s2" sec-type="materials|methods">
<label>2</label>
<title>Materials and methods</title>
<sec id="s2_1">
<label>2.1</label>
<title>Study areas</title>
<p>The study area is located in the Cangshan region of the Dali Bai Autonomous Prefecture, Yunnan Province. <italic>Pinus yunnanensis</italic> is a typical pioneer and dominant species in this region, playing a key role in water conservation, soil and water preservation, and the maintenance of biodiversity. However, due to historical overexploitation, secondary <italic>Pinus yunnanensis</italic> forests in this area generally exhibit simple stand structures and poor stability, making them a focus and challenge for sustainable forest management. Therefore, conducting structural optimization studies on this typical forest type is of significant theoretical and practical importance for achieving precise improvement of regional forest ecosystems. The study area is located in Cangshan, Dali, Yunnan Province, southwestern China, spanning 25&#xb0;34<sup>&#x2032;</sup> &#x223c; 26&#xb0;00<sup>&#x2032;</sup>
<italic>N</italic>, 99&#xb0;55<sup>&#x2032;</sup> &#x223c; 100&#xb0;12<sup>&#x2032;</sup>
<italic>E</italic>, with a total area of approximately 293 km&#xb2; and an elevation range of 1966&#x2013;4122 m. The region has a plateau monsoon subtropical climate characterized by mild and stable weather, ample sunlight, small annual temperature variations, and large diurnal temperature fluctuations, with an annual average temperature of 16.1&#xb0;C. The prevailing wind direction is the southwest monsoon (<xref ref-type="bibr" rid="B44">Shuai et&#xa0;al., 2024</xref>). Annual precipitation is abundant, reaching 861.1 mm, with distinct dry and wet seasons. Rainfall is concentrated from May to October, accounting for 83% of the total annual precipitation. The predominant soil type in the area is Hyperdystric Clayic Ferralsol (Ferric). <italic>Pinus yunnanensis</italic> is the primary tree species, and the associated tree species in the canopy layer include <italic>Pinus armandii</italic> Franch., <italic>Betula alnoides</italic> Buch.-Ham. ex D. Don, <italic>Quercus acutissima</italic> Carruth., and <italic>Quercus variabilis</italic> Blume. The understory shrub layer includes species such as <italic>Vaccinium bracteatum</italic> Thunb., <italic>Rhododendron microphyton</italic> Franch., <italic>Gaultheria griffithiana</italic> Wight, <italic>Eurya nitida</italic> Korthals, and <italic>Ternstroemia gymnanthera</italic> (Wight &amp; Arn.) Bedd (<xref ref-type="fig" rid="f1">
<bold>Figure 1</bold>
</xref>).</p>
</sec>
<sec id="s2_2">
<label>2.2</label>
<title>Study site and data collection</title>
<p>When establishing standard sample plots, circular plots offer advantages over traditional ones, such as easier setup and positioning in complex terrains and a smaller edge effect for the same area (<xref ref-type="bibr" rid="B38">Packalen et&#xa0;al., 2023</xref>). Generally, common square plots are typically set at 20m&#xd7;20m as the initial size, which translates to a circular plot with a radius of approximately 11.29m. To study the structural characteristics and optimization methods of secondary <italic>Pinus yunnanensis</italic> forests at different scales, this research established circular plots of varying radii based on topographic conditions and plot accessibility, in accordance with predefined rules for standard plot radius division.</p>
<p>Based on the terrain conditions and stand characteristics, 11 fixed circular standard plots with radii ranging from 12 to 35 meters were established at elevations between 2100 and 2400 meters on Cangshan Mountain (<xref ref-type="bibr" rid="B38">Packalen et&#xa0;al., 2023</xref>). The geographical coordinates, elevation, slope, aspect, and plot radius of each plot were measured and recorded. For each circular standard plot, all living trees with a diameter at breast height of at least 5cm were individually measured. The species, relative coordinates, DBH, tree height, crown width, and other basic tree factors were recorded for each tree. The relative coordinates of each tree at the base were accurately measured using a total station (GTS-2002). Additionally, plots with better site conditions, P1-P5, were selected as the experimental plots for simulation optimization, with the basic plot information provided in <xref ref-type="table" rid="T1">
<bold>Table&#xa0;1</bold>
</xref>.</p>
<table-wrap id="T1" position="float">
<label>Table&#xa0;1</label>
<caption>
<p>Basic information of the sample plots.</p>
</caption>
<table frame="hsides">
<thead>
<tr>
<th valign="middle" align="center">Sample plots</th>
<th valign="middle" align="center">Altitude</th>
<th valign="middle" align="center">Slope (&#xb0;)</th>
<th valign="middle" align="center">Slope dir.</th>
<th valign="middle" align="center">Mean DBH (cm)</th>
<th valign="middle" align="center">Mean height (m)</th>
<th valign="middle" align="center">Sample plot radius (m)</th>
<th valign="middle" align="center">Survey time</th>
<th valign="middle" align="center">Stand density (trees&#xb7; ha<sup>&#x2212;1</sup>)</th>
</tr>
</thead>
<tbody>
<tr>
<td valign="middle" align="center">P1</td>
<td valign="middle" align="center">2254</td>
<td valign="middle" align="center">13.45</td>
<td valign="middle" align="center">E</td>
<td valign="middle" align="center">17.10</td>
<td valign="middle" align="center">11.97</td>
<td valign="middle" align="center">35</td>
<td valign="middle" align="center">2022</td>
<td valign="middle" align="center">1603</td>
</tr>
<tr>
<td valign="middle" align="center">P2</td>
<td valign="middle" align="center">2273</td>
<td valign="middle" align="center">16.16</td>
<td valign="middle" align="center">S</td>
<td valign="middle" align="center">13.79</td>
<td valign="middle" align="center">9.39</td>
<td valign="middle" align="center">32</td>
<td valign="middle" align="center">2022</td>
<td valign="middle" align="center">2182</td>
</tr>
<tr>
<td valign="middle" align="center">P3</td>
<td valign="middle" align="center">2205</td>
<td valign="middle" align="center">17.70</td>
<td valign="middle" align="center">NE</td>
<td valign="middle" align="center">14.50</td>
<td valign="middle" align="center">9.30</td>
<td valign="middle" align="center">20</td>
<td valign="middle" align="center">2022</td>
<td valign="middle" align="center">2109</td>
</tr>
<tr>
<td valign="middle" align="center">P4</td>
<td valign="middle" align="center">2138</td>
<td valign="middle" align="center">5.10</td>
<td valign="middle" align="center">NE</td>
<td valign="middle" align="center">14.26</td>
<td valign="middle" align="center">10.94</td>
<td valign="middle" align="center">19</td>
<td valign="middle" align="center">2021</td>
<td valign="middle" align="center">2618</td>
</tr>
<tr>
<td valign="middle" align="center">P5</td>
<td valign="middle" align="center">2253</td>
<td valign="middle" align="center">15.25</td>
<td valign="middle" align="center">SE</td>
<td valign="middle" align="center">16.03</td>
<td valign="middle" align="center">9.57</td>
<td valign="middle" align="center">30</td>
<td valign="middle" align="center">2023</td>
<td valign="middle" align="center">2631</td>
</tr>
<tr>
<td valign="middle" align="center">P6</td>
<td valign="middle" align="center">2226</td>
<td valign="middle" align="center">30.75</td>
<td valign="middle" align="center">E</td>
<td valign="middle" align="center">12.77</td>
<td valign="middle" align="center">9.48</td>
<td valign="middle" align="center">14</td>
<td valign="middle" align="center">2021</td>
<td valign="middle" align="center">3839</td>
</tr>
<tr>
<td valign="middle" align="center">P7</td>
<td valign="middle" align="center">2184</td>
<td valign="middle" align="center">36.80</td>
<td valign="middle" align="center">E</td>
<td valign="middle" align="center">15.62</td>
<td valign="middle" align="center">8.99</td>
<td valign="middle" align="center">12</td>
<td valign="middle" align="center">2021</td>
<td valign="middle" align="center">1415</td>
</tr>
<tr>
<td valign="middle" align="center">P8</td>
<td valign="middle" align="center">2393</td>
<td valign="middle" align="center">26.30</td>
<td valign="middle" align="center">NE</td>
<td valign="middle" align="center">21.33</td>
<td valign="middle" align="center">13.58</td>
<td valign="middle" align="center">12</td>
<td valign="middle" align="center">2021</td>
<td valign="middle" align="center">1627</td>
</tr>
<tr>
<td valign="middle" align="center">P9</td>
<td valign="middle" align="center">2136</td>
<td valign="middle" align="center">13.60</td>
<td valign="middle" align="center">NE</td>
<td valign="middle" align="center">15.51</td>
<td valign="middle" align="center">9.41</td>
<td valign="middle" align="center">15</td>
<td valign="middle" align="center">2021</td>
<td valign="middle" align="center">1627</td>
</tr>
<tr>
<td valign="middle" align="center">P10</td>
<td valign="middle" align="center">2194</td>
<td valign="middle" align="center">11.75</td>
<td valign="middle" align="center">S</td>
<td valign="middle" align="center">16.17</td>
<td valign="middle" align="center">9.88</td>
<td valign="middle" align="center">19</td>
<td valign="middle" align="center">2022</td>
<td valign="middle" align="center">2504</td>
</tr>
<tr>
<td valign="middle" align="center">P11</td>
<td valign="middle" align="center">2284</td>
<td valign="middle" align="center">30.35</td>
<td valign="middle" align="center">SE</td>
<td valign="middle" align="center">15.69</td>
<td valign="middle" align="center">8.58</td>
<td valign="middle" align="center">18</td>
<td valign="middle" align="center">2022</td>
<td valign="middle" align="center">2504</td>
</tr>
</tbody>
</table>
<table-wrap-foot>
<fn>
<p>E, east; S, south; NE, north-east; SE, south-east.</p>
</fn>
</table-wrap-foot>
</table-wrap>
</sec>
<sec id="s2_3">
<label>2.3</label>
<title>Determination of spatial structure units and edge correction</title>
<p>This study employed the Voronoi diagram method to determine spatial relationships among trees (<xref ref-type="bibr" rid="B29">Liu et&#xa0;al., 2023</xref>). Centered on a reference tree, the Voronoi diagram method accurately captures tree adjacency relationships while effectively reflecting their horizontal distribution pattern. During data processing, Voronoi diagrams were generated using R 4.2.0, with each polygon representing a spatial structural unit formed by a tree and its neighboring trees. To minimize errors in calculating spatial structure indexes caused by edge trees being fragmented at the plot boundary, this study adopted the buffer zone method. The plot boundary was contracted inward by 2 m to create a buffer zone (<xref ref-type="bibr" rid="B48">Von Gadow et&#xa0;al., 2003</xref>). When computing spatial structure indexes, trees within the buffer zone were only considered as neighboring trees for constructing spatial structural units and were not used as reference trees.</p>
</sec>
<sec id="s2_4">
<label>2.4</label>
<title>Stand structure indexes</title>
<p>Quantifying stand structure is a fundamental aspect of stand structure optimization. In this study, spatial structure was set as the primary objective, while non-spatial structure served as a constraint. The selected non-spatial structure indexes included tree diameter classes, number of species, canopy density, harvesting intensity, and planting density. The selected spatial structure indexes included the uniform angle index, complete mingling, crown competition index, stratification index, and neighbourhood comparison. Among these, the uniform angle index describes the horizontal distribution pattern of trees, complete mingling represents the degree of tree species segregation, the crown competition index quantifies competition pressure among trees, the stratification index characterizes the vertical distribution pattern, and neighborhood comparison measures the degree of size differentiation among trees.</p>
<sec id="s2_4_1">
<label>2.4.1</label>
<title>Non-spatial structure indexes</title>
<sec id="s2_4_1_1">
<label>2.4.1.1</label>
<title>Tree diameter classes</title>
<p>Trees are classified into different categories based on their DBH, with a greater number of diameter classes indicating better stand growth. In the optimization process, it is required that the diversity of tree diameter classes remains consistent before and after optimization. In this study, tree diameter classification starts from a DBH of 6 cm, with a 2 cm interval for each diameter class (<xref ref-type="disp-formula" rid="eq1">Equation 1</xref>).</p>
<disp-formula id="eq1">
<label>(1)</label>
<mml:math display="block" id="M1">
<mml:mrow>
<mml:mi>D</mml:mi>
<mml:mo>=</mml:mo>
<mml:msub>
<mml:mi>D</mml:mi>
<mml:mn>0</mml:mn>
</mml:msub>
</mml:mrow>
</mml:math>
</disp-formula>
<p>Where <italic>D</italic>
<sub>0</sub> represents the number of diameter classes of trees within the stand before harvesting, and <italic>D</italic> represents the number of diameter classes of trees within the stand after harvesting.</p>
</sec>
<sec id="s2_4_1_2">
<label>2.4.1.2</label>
<title>Number of species</title>
<p>During the optimization process, tree species diversity must be preserved, and no species should be artificially eliminated from the stand. It is required that the tree species diversity remains consistent before and after optimization to ensure that no species disappear (<xref ref-type="disp-formula" rid="eq2">Equation 2</xref>).</p>
<disp-formula id="eq2">
<label>(2)</label>
<mml:math display="block" id="M2">
<mml:mrow>
<mml:mi>T</mml:mi>
<mml:mo>=</mml:mo>
<mml:msub>
<mml:mi>T</mml:mi>
<mml:mn>0</mml:mn>
</mml:msub>
</mml:mrow>
</mml:math>
</disp-formula>
<p>Where <italic>T</italic>
<sub>0</sub> denotes the initial number of tree species, while <italic>T</italic> indicates the number of tree species after harvesting.</p>
</sec>
<sec id="s2_4_1_3">
<label>2.4.1.3</label>
<title>Canopy density</title>
<p>A healthy forest requires the canopy to form a continuous cover. Generally, a canopy density of no less than 0.7 is considered indicative of continuous forest cover (<xref ref-type="disp-formula" rid="eq3">Equation 3</xref>).</p>
<disp-formula id="eq3">
<label>(3)</label>
<mml:math display="block" id="M3">
<mml:mrow>
<mml:mi>C</mml:mi>
<mml:mi>d</mml:mi>
<mml:mo>&#x2265;</mml:mo>
<mml:mn>0.7</mml:mn>
</mml:mrow>
</mml:math>
</disp-formula>
</sec>
<sec id="s2_4_1_4">
<label>2.4.1.4</label>
<title>harvesting intensity</title>
<p>harvesting intensity determines whether the stand&#x2019;s growth condition remains favorable after optimization. According to harvesting requirements, the amount of selective harvesting should be less than the growth increment. Research indicates that the harvesting intensity of <italic>Pinus yunnanensis</italic> secondary forests should be controlled within 35% (<xref ref-type="bibr" rid="B46">Su et&#xa0;al., 2010</xref>; <xref ref-type="bibr" rid="B19">Han et&#xa0;al., 2011</xref>) (<xref ref-type="disp-formula" rid="eq4">Equation 4</xref>).</p>
<disp-formula id="eq4">
<label>(4)</label>
<mml:math display="block" id="M4">
<mml:mrow>
<mml:mi>N</mml:mi>
<mml:mo>&#x2265;</mml:mo>
<mml:msub>
<mml:mi>N</mml:mi>
<mml:mn>0</mml:mn>
</mml:msub>
<mml:mo stretchy="false">(</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>35</mml:mn>
<mml:mo>%</mml:mo>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:math>
</disp-formula>
<p>Where <italic>N</italic>
<sub>0</sub> represents the total number of trees before harvesting, while <italic>N</italic> represents the total number of trees after harvesting.</p>
</sec>
<sec id="s2_4_1_5">
<label>2.4.1.5</label>
<title>Planting density</title>
<p>The planting density is a key factor influencing the effectiveness of replanting. Previous studies have shown that the optimal planting density for Pinus yunnanensis ranges from 1667 to 3333 trees per hectare (<xref ref-type="bibr" rid="B61">Zhang et&#xa0;al., 2023</xref>). After replanting optimization, the stand density should fall within the range of [1,667, 3,333] trees per hectare (<xref ref-type="disp-formula" rid="eq5">Equation 5</xref>).</p>
<disp-formula id="eq5">
<label>(5)</label>
<mml:math display="block" id="M5">
<mml:mrow>
<mml:mn>1667</mml:mn>
<mml:mo>&#x2264;</mml:mo>
<mml:mi>P</mml:mi>
<mml:mi>D</mml:mi>
<mml:mo>&#x2264;</mml:mo>
<mml:mn>3333</mml:mn>
</mml:mrow>
</mml:math>
</disp-formula>
</sec>
</sec>
<sec id="s2_4_2">
<label>2.4.2</label>
<title>Spatial structure indexes</title>
<sec id="s2_4_2_1">
<label>2.4.2.1</label>    <title>Neighborhood comparison (<italic>U</italic>)</title>
<p>Neighborhood comparison (<xref ref-type="bibr" rid="B1">Aguirre et al., 2003</xref>) is used to describe the degree of size differentiation and competition among trees. It refers to the proportion of neighboring trees with a DBH larger than that of the reference tree among neighboring trees. The expression is given as (<xref ref-type="disp-formula" rid="eq6">Equation 6</xref>):</p>
<disp-formula id="eq6">
<label>(6)</label>
<mml:math display="block" id="M6">
<mml:mrow>
<mml:msub>
<mml:mi>U</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>=</mml:mo>
<mml:mfrac>
<mml:mn>1</mml:mn>
<mml:mi>n</mml:mi>
</mml:mfrac>
<mml:munderover>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mi>n</mml:mi>
</mml:munderover>
<mml:msub>
<mml:mi>k</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</disp-formula>
<p>
<italic>U<sub>i</sub></italic>represents the neighborhood comparison for reference tree <italic>i</italic>, If the diameter at breast height of neighboring tree <italic>j</italic> is greater than that of reference tree <italic>i</italic>, then <italic>k<sub>ij</sub>
</italic> = 1, otherwise, <italic>k<sub>ij</sub>
</italic> = 0. A smaller <italic>U<sub>i</sub>
</italic> indicates a greater dominance of the reference tree. The value of <italic>U<sub>i</sub>
</italic> can fall into five intervals: 0, (0, 0.25], (0.25, 0.5], (0.5, 0.75], and (0.75, 1], corresponding to the reference tree being in dominant, sub-dominant, intermediate, disadvantaged, and absolutely disadvantaged status within the stand, respectively.</p>
</sec>
<sec id="s2_4_2_2">
<label>2.4.2.2</label>
<title>Crown competition index</title>
<p>The crown competition index (<xref ref-type="bibr" rid="B21">Jianming, 2017</xref>) is a method used to describe the degree of competition among trees by calculating the crown overlap area based on tree characteristics such as crown width and crown length, thereby reflecting the competitive pressure during tree growth. The expression is given as (<xref ref-type="disp-formula" rid="eq7">Equations 7</xref>&#x2013;<xref ref-type="disp-formula" rid="eq10">10</xref>):</p>
<disp-formula id="eq7">
<label>(7)</label>
<mml:math display="block" id="M7">
<mml:mrow>
<mml:mi>C</mml:mi>
<mml:msub>
<mml:mi>I</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>=</mml:mo>
<mml:mfrac>
<mml:mn>1</mml:mn>
<mml:mrow>
<mml:msub>
<mml:mi>Z</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfrac>
<mml:mo>&#xd7;</mml:mo>
<mml:munderover>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mi>n</mml:mi>
</mml:munderover>
<mml:mi>A</mml:mi>
<mml:msub>
<mml:mi>O</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#xd7;</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:msub>
<mml:mi>L</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mrow>
<mml:msub>
<mml:mi>L</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfrac>
</mml:mrow>
</mml:math>
</disp-formula>
<p>
<italic>CI<sub>i</sub>
</italic> represents the crown competition index for reference tree <italic>i</italic>, and <italic>Z<sub>i</sub>
</italic> represents the crown projection area of reference tree <italic>i</italic>. <italic>L<sub>j</sub></italic>= <italic>H<sub>j</sub>
</italic> &#xd7; <italic>CW<sub>j</sub>
</italic> &#xd7; <italic>CL<sub>j</sub>
</italic> (height of competing tree <italic>j</italic> &#xd7; crown width of competing tree <italic>j</italic> &#xd7; crown length of competing tree <italic>j</italic>), <italic>L<sub>i</sub></italic>= <italic>H<sub>i</sub></italic>&#xd7; <italic>CW<sub>i</sub></italic>&#xd7; <italic>CL<sub>i</sub>
</italic> (height of reference tree <italic>i</italic> &#xd7; crown width of reference tree <italic>i</italic> &#xd7; crown length of reference tree <italic>i</italic>). <italic>AO<sub>ij</sub>
</italic> represents the crown overlap area between reference tree <italic>i</italic> and competitor tree <italic>j</italic>. If there is no overlap, <italic>AO<sub>ij</sub>
</italic> = 1. When there is overlap,</p>
<disp-formula id="eq8">
<label>(8)</label>
<mml:math display="block" id="M8">
<mml:mrow>
<mml:msub>
<mml:mi>S</mml:mi>
<mml:mn>0</mml:mn>
</mml:msub>
<mml:mo>=</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:mi>C</mml:mi>
<mml:msubsup>
<mml:mi>W</mml:mi>
<mml:mi>i</mml:mi>
<mml:mn>2</mml:mn>
</mml:msubsup>
</mml:mrow>
<mml:mn>2</mml:mn>
</mml:mfrac>
<mml:munderover>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mi>n</mml:mi>
</mml:munderover>
<mml:mi>a</mml:mi>
<mml:mi>r</mml:mi>
<mml:mi>c</mml:mi>
<mml:mi>c</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>s</mml:mi>
<mml:mo stretchy="false">(</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:msubsup>
<mml:mi>q</mml:mi>
<mml:mi>j</mml:mi>
<mml:mn>2</mml:mn>
</mml:msubsup>
</mml:mrow>
<mml:mrow>
<mml:mn>2</mml:mn>
<mml:mi>C</mml:mi>
<mml:msubsup>
<mml:mi>W</mml:mi>
<mml:mi>i</mml:mi>
<mml:mn>2</mml:mn>
</mml:msubsup>
</mml:mrow>
</mml:mfrac>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo stretchy="false">)</mml:mo>
<mml:mo>&#x2212;</mml:mo>
<mml:mfrac>
<mml:mn>1</mml:mn>
<mml:mrow><mml:mn>4</mml:mn></mml:mrow>
</mml:mfrac>
<mml:msub>
<mml:mi>q</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
<mml:msqrt>
<mml:mrow>
<mml:mn>4</mml:mn>
<mml:mi>C</mml:mi>
<mml:msubsup>
<mml:mi>W</mml:mi>
<mml:mi>i</mml:mi>
<mml:mn>2</mml:mn>
</mml:msubsup>
<mml:mo>&#x2212;</mml:mo>
<mml:msubsup>
<mml:mi>q</mml:mi>
<mml:mi>i</mml:mi>
<mml:mn>2</mml:mn>
</mml:msubsup>
</mml:mrow>
</mml:msqrt>
</mml:mrow>
</mml:math>
</disp-formula>
<disp-formula id="eq9">
<label>(9)</label>
<mml:math display="block" id="M9">
<mml:mrow>
<mml:msub>
<mml:mi>S</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:mo>=</mml:mo>
<mml:mfrac>
<mml:mn>1</mml:mn>
<mml:mrow><mml:mn>2</mml:mn></mml:mrow>
</mml:mfrac>
<mml:munderover>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mi>n</mml:mi>
</mml:munderover>
<mml:mo stretchy="false">{</mml:mo>
<mml:mo stretchy="false">[</mml:mo>
<mml:mi>C</mml:mi>
<mml:msubsup>
<mml:mi>W</mml:mi>
<mml:mi>j</mml:mi>
<mml:mn>2</mml:mn>
</mml:msubsup>
<mml:mi>a</mml:mi>
<mml:mi>r</mml:mi>
<mml:mi>c</mml:mi>
<mml:mi>c</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>s</mml:mi>
<mml:mo stretchy="false">(</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>&#x2212;</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:mn>4</mml:mn>
<mml:mi>C</mml:mi>
<mml:msubsup>
<mml:mi>W</mml:mi>
<mml:mi>i</mml:mi>
<mml:mn>2</mml:mn>
</mml:msubsup>
<mml:mo>&#x2212;</mml:mo>
<mml:msubsup>
<mml:mi>q</mml:mi>
<mml:mi>i</mml:mi>
<mml:mn>2</mml:mn>
</mml:msubsup>
</mml:mrow>
<mml:mrow>
<mml:mn>2</mml:mn>
<mml:mi>C</mml:mi>
<mml:msubsup>
<mml:mi>W</mml:mi>
<mml:mi>j</mml:mi>
<mml:mn>2</mml:mn>
</mml:msubsup>
</mml:mrow>
</mml:mfrac>
<mml:mo stretchy="false">)</mml:mo>
<mml:mo>&#x2212;</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:msqrt>
<mml:mrow>
<mml:mn>4</mml:mn>
<mml:mi>C</mml:mi>
<mml:msubsup>
<mml:mi>W</mml:mi>
<mml:mi>i</mml:mi>
<mml:mn>2</mml:mn>
</mml:msubsup>
<mml:mo>&#x2212;</mml:mo>
<mml:msubsup>
<mml:mi>q</mml:mi>
<mml:mi>j</mml:mi>
<mml:mn>2</mml:mn>
</mml:msubsup>
</mml:mrow>
</mml:msqrt>
</mml:mrow>
<mml:mn>2</mml:mn>
</mml:mfrac>
<mml:mo stretchy="false">]</mml:mo>
<mml:mo>&#xd7;</mml:mo>
<mml:msqrt>
<mml:mrow>
<mml:mn>4</mml:mn>
<mml:mi>C</mml:mi>
<mml:msubsup>
<mml:mi>W</mml:mi>
<mml:mi>i</mml:mi>
<mml:mn>2</mml:mn>
</mml:msubsup>
<mml:mo>&#x2212;</mml:mo>
<mml:mo stretchy="false">(</mml:mo>
<mml:mn>4</mml:mn>
<mml:mi>C</mml:mi>
<mml:msubsup>
<mml:mi>W</mml:mi>
<mml:mi>i</mml:mi>
<mml:mn>2</mml:mn>
</mml:msubsup>
<mml:mo>&#x2212;</mml:mo>
<mml:msubsup>
<mml:mi>q</mml:mi>
<mml:mi>j</mml:mi>
<mml:mn>2</mml:mn>
</mml:msubsup>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:msqrt>
<mml:mo stretchy="false">}</mml:mo>
</mml:mrow>
</mml:math>
</disp-formula>
<disp-formula id="eq10">
<label>(10)</label>
<mml:math display="block" id="M10">
<mml:mrow>
<mml:mi>A</mml:mi>
<mml:msub>
<mml:mi>O</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>=</mml:mo>
<mml:msub>
<mml:mi>S</mml:mi>
<mml:mn>0</mml:mn>
</mml:msub>
<mml:mo>+</mml:mo>
<mml:msub>
<mml:mi>S</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
</mml:mrow>
</mml:math>
</disp-formula>
<p>
<italic>S</italic>
<sub>0</sub> represents the total shaded area of reference tree <italic>i</italic> by <italic>n</italic> competitor trees, and <italic>S</italic>
<sub>1</sub> represents the total shaded area of <italic>n</italic> competitor trees by reference tree <italic>i</italic>. <inline-formula>
<mml:math display="inline" id="im1">
<mml:mrow>
<mml:msub>
<mml:mi>q</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
<mml:mo>=</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:msubsup>
<mml:mi>L</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
</mml:mrow>
<mml:mn>2</mml:mn>
</mml:msubsup>
<mml:mo>&#x2212;</mml:mo>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>C</mml:mi>
<mml:msubsup>
<mml:mi>W</mml:mi>
<mml:mi>j</mml:mi>
<mml:mn>2</mml:mn>
</mml:msubsup>
<mml:mo>&#x2212;</mml:mo>
<mml:mi>C</mml:mi>
<mml:msubsup>
<mml:mi>W</mml:mi>
<mml:mi>i</mml:mi>
<mml:mn>2</mml:mn>
</mml:msubsup>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
<mml:mrow>
<mml:msub>
<mml:mi>L</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfrac>
<mml:mo>,</mml:mo>
</mml:mrow>
</mml:math>
</inline-formula> <italic>L<sub>ij</sub>
</italic> represents the distance between competitor tree <italic>j</italic> and reference tree <italic>i</italic>, <italic>CW<sub>i</sub>
</italic> represents the crown width of reference tree <italic>i</italic>, <italic>CW<sub>j</sub>
</italic> represents the crown width of competitor tree <italic>j</italic>, and <italic>n</italic> represents the number of competitor trees.</p>
</sec>
<sec id="s2_4_2_3">
<label>2.4.2.3</label>
<title>Stratification index</title>
<p>The stratification index (<xref ref-type="bibr" rid="B62">Zhao et&#xa0;al., 2024</xref>; <xref ref-type="bibr" rid="B63">Zhou et&#xa0;al., 2022</xref>) reflects the vertical distribution pattern of trees and the diversity of stand structure. It is an extension of the storey index, incorporating the influence of terrain on forest stratification. The expression is given as (<xref ref-type="disp-formula" rid="eq11">Equations 11</xref>&#x2013;<xref ref-type="disp-formula" rid="eq13">13</xref>):</p>
<disp-formula id="eq11">
<label>(11)</label>
<mml:math display="block" id="M11">
<mml:mrow>
<mml:msub>
<mml:mi>S</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>=</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:msub>
<mml:mi>z</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mn>3</mml:mn>
</mml:mfrac>
<mml:mo>&#xd7;</mml:mo>
<mml:mfrac>
<mml:mn>1</mml:mn>
<mml:mi>n</mml:mi>
</mml:mfrac>
<mml:munderover>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mi>n</mml:mi>
</mml:munderover>
<mml:mo stretchy="false">(</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>&#x2212;</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:mo>|</mml:mo>
<mml:mi>F</mml:mi>
<mml:msub>
<mml:mi>L</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:mi>F</mml:mi>
<mml:msub>
<mml:mi>L</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
<mml:mo>|</mml:mo>
</mml:mrow>
<mml:mrow>
<mml:mi>m</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>x</mml:mi>
<mml:mo stretchy="false">(</mml:mo>
<mml:mo>|</mml:mo>
<mml:mi>F</mml:mi>
<mml:msub>
<mml:mi>L</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:mi>F</mml:mi>
<mml:msub>
<mml:mi>L</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
<mml:mo>|</mml:mo>
<mml:mo>,</mml:mo>
<mml:mo>&#xa0;</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:mfrac>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:math>
</disp-formula>
<disp-formula id="eq12">
<label>(12)</label>
<mml:math display="block" id="M12">
<mml:mrow>
<mml:mi>F</mml:mi>
<mml:msub>
<mml:mi>L</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>=</mml:mo>
<mml:mrow>
<mml:mo>{</mml:mo>
<mml:mrow>
<mml:mtable columnalign="left">
<mml:mtr columnalign="left">
<mml:mtd columnalign="left">
<mml:mrow>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>H</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>&#x2264;</mml:mo>
<mml:mfrac>
<mml:mn>1</mml:mn>
<mml:mrow><mml:mn>3</mml:mn></mml:mrow>
</mml:mfrac>
<mml:msub>
<mml:mi>H</mml:mi>
<mml:mi>d</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr columnalign="left">
<mml:mtd columnalign="left">
<mml:mrow>
<mml:mn>0</mml:mn>
<mml:mo>,</mml:mo>
<mml:mfrac>
<mml:mn>1</mml:mn>
<mml:mrow><mml:mn>3</mml:mn></mml:mrow>
</mml:mfrac>
<mml:msub>
<mml:mi>H</mml:mi>
<mml:mi>d</mml:mi>
</mml:msub>
<mml:mo>&#x2264;</mml:mo>
<mml:msub>
<mml:mi>H</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>&#x2264;</mml:mo>
<mml:mfrac>
<mml:mn>2</mml:mn>
<mml:mrow><mml:mn>3</mml:mn></mml:mrow>
</mml:mfrac>
<mml:msub>
<mml:mi>H</mml:mi>
<mml:mi>d</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr columnalign="left">
<mml:mtd columnalign="left">
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>H</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>&#x2265;</mml:mo>
<mml:mfrac>
<mml:mn>2</mml:mn>
<mml:mrow><mml:mn>3</mml:mn></mml:mrow>
</mml:mfrac>
<mml:msub>
<mml:mi>H</mml:mi>
<mml:mi>d</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mtd>
</mml:mtr>
</mml:mtable>
</mml:mrow>
</mml:mrow>
</mml:mrow>
</mml:math>
</disp-formula>
<disp-formula id="eq13">
<label>(13)</label>
<mml:math display="block" id="M13">
<mml:mrow>
<mml:msub>
<mml:mi>H</mml:mi>
<mml:mi>d</mml:mi>
</mml:msub>
<mml:mo>=</mml:mo>
<mml:mfrac>
<mml:mn>1</mml:mn>
<mml:mrow>
<mml:mo>&#x230a;</mml:mo>
<mml:mn>100</mml:mn>
<mml:mi>A</mml:mi>
<mml:mo>&#x230b;</mml:mo>
</mml:mrow>
</mml:mfrac>
<mml:msubsup>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mrow>
<mml:mo>&#x230a;</mml:mo>
<mml:mn>100</mml:mn>
<mml:mi>A</mml:mi>
<mml:mo>&#x230b;</mml:mo>
</mml:mrow>
</mml:msubsup>
<mml:mo stretchy="false">(</mml:mo>
<mml:msub>
<mml:mi>H</mml:mi>
<mml:mrow>
<mml:mi>s</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>r</mml:mi>
<mml:mi>t</mml:mi>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>i</mml:mi>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:msub>
<mml:mo>+</mml:mo>
<mml:msub>
<mml:mi>E</mml:mi>
<mml:mrow>
<mml:mi>s</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>r</mml:mi>
<mml:mi>t</mml:mi>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>i</mml:mi>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:msub>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:math>
</disp-formula>
<p>
<italic>S<sub>i</sub></italic>represents the stratification index for reference tree <italic>i</italic>, <italic>z<sub>i</sub>
</italic> denotes the number of layers within the spatial structure unit to which the reference tree <italic>i</italic> belongs. <italic>FL<sub>i</sub>
</italic> indicates the classification of reference tree <italic>i</italic> in the vertical stratification. <italic>H<sub>i</sub>
</italic> represents the height of reference tree <italic>i</italic>, while <italic>H<sub>d</sub>
</italic> denotes the dominant height. <italic>A</italic> stands for the per hectare plot area, and <italic>H<sub>sort</sub>
</italic>
<sub>(</sub>
<italic>
<sub>i</sub>
</italic>
<sub>)</sub> is the height of the <italic>i</italic>-th tree among the tallest &#x230a;100<italic>A</italic>&#x230b; trees per hectare, and <italic>E<sub>sort</sub>
</italic>
<sub>(</sub>
<italic>
<sub>i</sub>
</italic>
<sub>)</sub> indicates the relative elevation of the <italic>i</italic>-th tree among these &#x230a;100<italic>A</italic>&#x230b; trees. The closer the stratification index is to 1, the more complex the vertical stratification of the stand.</p>
</sec>
<sec id="s2_4_2_4">
<label>2.4.2.4</label>
<title>Complete mingling</title>
<p>Complete mingling (<xref ref-type="bibr" rid="B43">Sheng et&#xa0;al., 2023</xref>) introduces the Simpson index into the traditional mingling index to enhance the differentiation of tree species diversity. It is used to describe the degree of tree species segregation while also accounting for species diversity. The expression is given as (<xref ref-type="disp-formula" rid="eq14">Equation 14</xref>):</p>
<disp-formula id="eq14">
<label>(14)</label>
<mml:math display="block" id="M14">
<mml:mrow>
<mml:mi>M</mml:mi>
<mml:msub>
<mml:mi>c</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>=</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:msub>
<mml:mi>M</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mn>2</mml:mn>
</mml:mfrac>
<mml:mo stretchy="false">[</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>&#x2212;</mml:mo>
<mml:mfrac>
<mml:mn>1</mml:mn>
<mml:mrow>
<mml:msup>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>n</mml:mi>
<mml:mo>+</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
<mml:mn>2</mml:mn>
</mml:msup>
</mml:mrow>
</mml:mfrac>
<mml:munderover>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mrow>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:munderover>
<mml:msubsup>
<mml:mi>n</mml:mi>
<mml:mi>j</mml:mi>
<mml:mn>2</mml:mn>
</mml:msubsup>
<mml:mo>+</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:msub>
<mml:mi>n</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mi>n</mml:mi>
</mml:mfrac>
<mml:mo stretchy="false">]</mml:mo>
</mml:mrow>
</mml:math>
</disp-formula>
<p>
<italic>Mc<sub>i</sub>
</italic> represents the complete mingling of reference tree <italic>i</italic>. <italic>n<sub>j</sub>
</italic> is the number of different species among the neighboring trees, <italic>n<sub>j</sub>
</italic> is the number of trees of the <italic>j</italic>-th species among the neighboring trees, and <italic>s<sub>i</sub></italic>is the number of species within the spatial structure unit to which reference tree <italic>j</italic> belongs. <italic>M<sub>i</sub>
</italic> represents the mingling degree of reference tree <italic>i</italic> <inline-formula>
<mml:math display="inline" id="im2">
<mml:mrow>
<mml:msub>
<mml:mi>M</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>=</mml:mo>
<mml:mfrac>
<mml:mn>1</mml:mn>
<mml:mi>n</mml:mi>
</mml:mfrac>
<mml:msubsup>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mi>n</mml:mi>
</mml:msubsup>
<mml:msub>
<mml:mi>v</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>, When the reference tree <italic>i</italic> and neighboring tree <italic>j</italic> are of the same species, <italic>v<sub>ij</sub>
</italic> = 0; otherwise, <italic>v<sub>ij</sub>
</italic> = 1. The value of <italic>Mc<sub>i</sub>
</italic> can fall into five intervals: 0, (0, 0.25], (0.25, 0.5], (0.5, 0.75], and (0.75, 1], corresponding to zero mixing, low mixing, moderate mixing, high mixing, and complete mixing, respectively.</p>
</sec>
<sec id="s2_4_2_5">
<label>2.4.2.5</label>
<title>Uniform angle index (<italic>W</italic>)</title>
<p>The uniform angle index (<xref ref-type="bibr" rid="B59">Zhang et&#xa0;al., 2018</xref>) is used to describe the spatial distribution pattern of trees. It is defined as the proportion of &#x3b1; angles (the smaller angles between neighboring trees) that are less than the standard angle <inline-formula>
<mml:math display="inline" id="im3">
<mml:mrow>
<mml:msub>
<mml:mi>&#x3b1;</mml:mi>
<mml:mn>0</mml:mn>
</mml:msub>
<mml:mo stretchy="false">(</mml:mo>
<mml:msub>
<mml:mi>&#x3b1;</mml:mi>
<mml:mn>0</mml:mn>
</mml:msub>
<mml:mo>=</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:msup>
<mml:mrow>
<mml:mn>360</mml:mn>
</mml:mrow>
<mml:mo>&#x2218;</mml:mo>
</mml:msup>
</mml:mrow>
<mml:mrow>
<mml:mi>n</mml:mi>
<mml:mo>+</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:mfrac>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:math>
</inline-formula> out of a total of angles formed. Its expression is (<xref ref-type="disp-formula" rid="eq15">Equation 15</xref>):</p>
<disp-formula id="eq15">
<label>(15)</label>
<mml:math display="block" id="M15">
<mml:mrow>
<mml:msub>
<mml:mi>W</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>=</mml:mo>
<mml:mfrac>
<mml:mn>1</mml:mn>
<mml:mi>n</mml:mi>
</mml:mfrac>
<mml:munderover>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mi>n</mml:mi>
</mml:munderover>
<mml:msub>
<mml:mi>z</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</disp-formula>
<p>
<italic>W<sub>i</sub>
</italic> represents the uniform angle index for reference tree <italic>i</italic>. When the <italic>j</italic>-th <italic>&#x3b1;</italic> angle is smaller than the standard angle <italic>&#x3b1;</italic>
<sub>0</sub>, <italic>z<sub>ij</sub>
</italic> = 1; otherwise, <italic>z<sub>ij</sub>
</italic> = 0. The value of <italic>W<sub>i</sub>
</italic> can fall into five intervals: 0, (0, 0.25], (0.25, 0.5], (0.5, 0.75], and (0.75, 1], corresponding to absolutely uniform, uniform, random, non-uniform, and conmplete non-uniform distributions, respectively. The ideal range for the mean uniform angle index in a stand is between [0.475, 0.517].</p>
</sec>
</sec>
</sec>
<sec id="s2_5">
<label>2.5</label>
<title>Selective harvesting Strategy</title>
<p>Random selection (<xref ref-type="bibr" rid="B47">Tang et&#xa0;al., 2004</xref>), tree homogeneity index (<xref ref-type="bibr" rid="B56">Yitong, 2019</xref>), and spatial competition (<xref ref-type="bibr" rid="B58">Zhang et&#xa0;al., 2019</xref>) are common methods for determining felling decisions. In the random selection method, trees are randomly selected as candidates for felling from the initial stand. The tree homogeneity index-based method calculates a comprehensive index Li for each tree using spatial structure parameters and ranks the trees in ascending order to determine the felling candidates. The spatial competition-based method evaluates trees based on horizontal spatial patterns and competition pressure, selecting trees with a greater difference between the uniform angle index and 0.496, a higher neighborhood comparison value, and a larger crown competition index as felling candidates. In our previous research, we conducted an experimental comparison of these three methods and found that random selection was best suited for integration with the deep reinforcement learning algorithm <xref ref-type="bibr" rid="B62">Zhao et&#xa0;al. (2024)</xref>. Therefore, in this study, random selection is chosen as the preferred method for the felling optimization process.</p>
</sec>
<sec id="s2_6">
<label>2.6</label>
<title>Replanting strategy</title>
<sec id="s2_6_1">
<label>2.6.1</label>
<title>Planting location</title>
<p>The maximum Delaunay triangulation area method is a planting location determination approach based on Delaunay triangulation. In a Delaunay triangulation network, edge lengths represent the distances between neighboring trees, while nodes correspond to individual trees. Planting locations are determined by identifying the incenter of the largest triangle formed by the nodes, thereby reflecting both the presence of canopy gaps and the overall stand distribution pattern. To account for the influence of surrounding neighboring trees on the growth of replanted trees, the replanting foreground index (RFI) (<xref ref-type="bibr" rid="B55">Xuan et&#xa0;al., 2024</xref>) is incorporated to identify planting locations that have a greater impact on stand structure optimization. This method comprehensively considers various factors affecting the growth of replanted trees, thereby improving the accuracy and effectiveness of planting location determination and enhancing the efficiency of stand structure adjustment and optimization.</p>
<p>The calculation formula for the RFI is as follows (<xref ref-type="disp-formula" rid="eq16">Equation 16</xref>):</p>
<disp-formula id="eq16">
<label>(16)</label>
<mml:math display="block" id="M16">
<mml:mrow>
<mml:mi>R</mml:mi>
<mml:mi>F</mml:mi>
<mml:msub>
<mml:mi>I</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>=</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:mfrac>
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>+</mml:mo>
<mml:mi>D</mml:mi>
<mml:mi>A</mml:mi>
<mml:msub>
<mml:mi>A</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mrow>
<mml:msub>
<mml:mi>&#x3b4;</mml:mi>
<mml:mrow>
<mml:mi>D</mml:mi>
<mml:mi>A</mml:mi>
<mml:mi>A</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfrac>
<mml:mo>&#xb7;</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>+</mml:mo>
<mml:mi>M</mml:mi>
<mml:msub>
<mml:mi>c</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mrow>
<mml:msub>
<mml:mi>&#x3b4;</mml:mi>
<mml:mrow>
<mml:mi>M</mml:mi>
<mml:mi>c</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfrac>
<mml:mo>&#xb7;</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>+</mml:mo>
<mml:msub>
<mml:mi>U</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mrow>
<mml:msub>
<mml:mi>&#x3b4;</mml:mi>
<mml:mi>U</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfrac>
</mml:mrow>
<mml:mrow>
<mml:mfrac>
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>+</mml:mo>
<mml:mi>C</mml:mi>
<mml:msub>
<mml:mi>I</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mrow>
<mml:msub>
<mml:mi>&#x3b4;</mml:mi>
<mml:mrow>
<mml:mi>C</mml:mi>
<mml:mi>I</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfrac>
</mml:mrow>
</mml:mfrac>
</mml:mrow>
</mml:math>
</disp-formula>
<p>
<italic>RFI<sub>i</sub>
</italic> represents the replanting foreground index of the replanted tree <italic>i</italic>, <italic>DAA<sub>i</sub>
</italic> refers to the area of the Delaunay triangulation element in which tree <italic>i</italic> is located. <italic>Mc<sub>i</sub>
</italic> corresponds to the complete mingling of tree <italic>i</italic>, while <italic>U<sub>i</sub>
</italic> denotes its neighborhood comparison, and <italic>CI<sub>i</sub>
</italic> indicates its crown competition index. Moreover, <italic>&#x3b4;<sub>DAA</sub>
</italic>, <italic>&#x3b4;<sub>Mc</sub>
</italic>, <italic>&#x3b4;<sub>U</sub>
</italic> and <italic>&#x3b4;<sub>CI</sub>
</italic> represent the standard deviations of their respective structural parameters.</p>
</sec>
<sec id="s2_6_2">
<label>2.6.2</label>
<title>Planting number</title>
<p>Relevant studies have shown that the optimal planting density range for <italic>Pinus yunnanensis</italic> is 1667&#x2013;3333 trees per hectare. In this study, 3333 trees per hectare was selected as the upper limit for stand density after replanting. Based on the plot area, the maximum number of trees was determined for each plot: P1, P2, P3, P4, and P5 had upper limits of 1284, 1076, 418, 377, and 941 trees, respectively.</p>
</sec>
<sec id="s2_6_3">
<label>2.6.3</label>
<title>Spatial configuration of replanting</title>
<p>In mixed forests, the proportion and spatial arrangement of replanted tree species directly influence the degree of species mingling, while variations in DBH, H, and CW among different species substantially affect interspecific competition. In this study, replanting optimization simultaneously considered the spatial distribution and size structure of trees to achieve a more balanced species composition and stand structure. To promote the positive succession of secondary forests and enhance the mingling index, the main tree species widely distributed in the Cangshan region were selected. The seven chosen species&#x2014;<italic>Pinus yunnanensis</italic>, <italic>Pinus armandii</italic>, <italic>Quercus acutissima</italic>, <italic>Vaccinium bracteatum</italic>, <italic>Camellia sinensis</italic>, <italic>Betula alnoides</italic>, and <italic>Ternstroemia gymnanthera</italic>&#x2014;are either dominant or native tree species in the study area and represent the typical species composition and ecological characteristics of local secondary forests. Equal proportions were applied in the simulation to simplify the modeling framework and highlight species diversity and ecological complementarity. The replanted trees were initialized with an average DBH of 5 cm and an age of 5 years. Due to the limited availability of growth models for some species, models of ecologically similar species (<xref ref-type="bibr" rid="B52">Xi et&#xa0;al., 2015</xref>; <xref ref-type="bibr" rid="B30">Luo, 2021</xref>; <xref ref-type="bibr" rid="B23">Jiazheng et&#xa0;al., 2021</xref>) were adopted to estimate tree height, crown width, and crown length, and the results were subsequently validated using existing datasets. The configuration of replanted trees is shown in <xref ref-type="table" rid="T2">
<bold>Table&#xa0;2</bold>
</xref>.</p>
<table-wrap id="T2" position="float">
<label>Table&#xa0;2</label>
<caption>
<p>Configuration of replanted trees.</p>
</caption>
<table frame="hsides">
<thead>
<tr>
<th valign="middle" align="center">Tree species</th>
<th valign="middle" align="center">Variable</th>
<th valign="middle" align="center">Model</th>
<th valign="middle" align="center">Optimal parameters</th>
<th valign="middle" align="center">Stand factor</th>
</tr>
</thead>
<tbody>
<tr>
<td valign="middle" rowspan="3" align="center">
<italic>Pinus yunnanensis</italic>
</td>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im4">
<mml:mi>H</mml:mi>
</mml:math>
</inline-formula>
</td>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im5">
<mml:mrow>
<mml:mi>H</mml:mi>
<mml:mo>=</mml:mo>
<mml:mi>a</mml:mi>
<mml:mo>&#xd7;</mml:mo>
<mml:msup>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>&#x2212;</mml:mo>
<mml:msup>
<mml:mi>e</mml:mi>
<mml:mrow>
<mml:mo>&#x2212;</mml:mo>
<mml:mi>b</mml:mi>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>D</mml:mi>
<mml:mi>B</mml:mi>
<mml:mi>H</mml:mi>
</mml:mrow>
</mml:msup>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
<mml:mi>c</mml:mi>
</mml:msup>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="middle" align="center">
<italic>a</italic> = 16.7289, <italic>b</italic> = 0.0871, <italic>c</italic> = 1.1212</td>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im6">
<mml:mrow>
<mml:mi>H</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>5.20</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
</tr>
<tr>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im7">
<mml:mrow>
<mml:mi>C</mml:mi>
<mml:mi>W</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im8">
<mml:mrow>
<mml:mi>C</mml:mi>
<mml:mi>W</mml:mi>
<mml:mo>=</mml:mo>
<mml:mi>a</mml:mi>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>D</mml:mi>
<mml:mi>B</mml:mi>
<mml:msup>
<mml:mi>H</mml:mi>
<mml:mi>b</mml:mi>
</mml:msup>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im9">
<mml:mrow>
<mml:mi>a</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>0.5652</mml:mn>
<mml:mo>,</mml:mo>
<mml:mi>b</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>0.7023</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im10">
<mml:mrow>
<mml:mi>C</mml:mi>
<mml:mi>W</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>1.74</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
</tr>
<tr>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im11">
<mml:mrow>
<mml:mi>C</mml:mi>
<mml:mi>L</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im12">
<mml:mrow>
<mml:mi>C</mml:mi>
<mml:mi>L</mml:mi>
<mml:mo>=</mml:mo>
<mml:mi>a</mml:mi>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>D</mml:mi>
<mml:mi>B</mml:mi>
<mml:msup>
<mml:mi>H</mml:mi>
<mml:mi>b</mml:mi>
</mml:msup>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im13">
<mml:mrow>
<mml:mi>a</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>0.3646</mml:mn>
<mml:mo>,</mml:mo>
<mml:mi>b</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>0.7984</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im14">
<mml:mrow>
<mml:mi>C</mml:mi>
<mml:mi>L</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>1.32</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
</tr>
<tr>
<td valign="middle" rowspan="3" align="center">
<italic>Pinus armandii</italic>
</td>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im15">
<mml:mi>H</mml:mi>
</mml:math>
</inline-formula>
</td>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im16">
<mml:mrow>
<mml:mi>H</mml:mi>
<mml:mo>=</mml:mo>
<mml:mi>a</mml:mi>
<mml:mo>&#xd7;</mml:mo>
<mml:msup>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>&#x2212;</mml:mo>
<mml:msup>
<mml:mi>e</mml:mi>
<mml:mrow>
<mml:mo>&#x2212;</mml:mo>
<mml:mi>b</mml:mi>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>D</mml:mi>
<mml:mi>B</mml:mi>
<mml:mi>H</mml:mi>
</mml:mrow>
</mml:msup>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
<mml:mi>c</mml:mi>
</mml:msup>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="middle" align="center">
<italic>a</italic> = 17.0986, <italic>b</italic> = 0.0816, <italic>c</italic> = 0.9258</td>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im17">
<mml:mrow>
<mml:mi>H</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>5.19</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
</tr>
<tr>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im18">
<mml:mrow>
<mml:mi>C</mml:mi>
<mml:mi>W</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im19">
<mml:mrow>
<mml:mi>C</mml:mi>
<mml:mi>W</mml:mi>
<mml:mo>=</mml:mo>
<mml:mfrac>
<mml:mi>a</mml:mi>
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>+</mml:mo>
<mml:mi>b</mml:mi>
<mml:mo>&#xd7;</mml:mo>
<mml:msup>
<mml:mi>e</mml:mi>
<mml:mrow>
<mml:mo>&#x2212;</mml:mo>
<mml:mi>c</mml:mi>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>D</mml:mi>
<mml:mi>B</mml:mi>
<mml:mi>H</mml:mi>
</mml:mrow>
</mml:msup>
</mml:mrow>
</mml:mfrac>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="middle" align="center">
<italic>a</italic> = 4.2420, <italic>b</italic> = 2.2677, <italic>c</italic> = 0.0523</td>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im20">
<mml:mrow>
<mml:mi>C</mml:mi>
<mml:mi>W</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>1.54</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
</tr>
<tr>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im21">
<mml:mrow>
<mml:mi>C</mml:mi>
<mml:mi>L</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im22">
<mml:mrow>
<mml:mi>C</mml:mi>
<mml:mi>L</mml:mi>
<mml:mo>=</mml:mo>
<mml:mi>a</mml:mi>
<mml:mo>&#xd7;</mml:mo>
<mml:msup>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>&#x2212;</mml:mo>
<mml:msup>
<mml:mi>e</mml:mi>
<mml:mrow>
<mml:mo>&#x2212;</mml:mo>
<mml:mi>b</mml:mi>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>D</mml:mi>
<mml:mi>B</mml:mi>
<mml:mi>H</mml:mi>
</mml:mrow>
</mml:msup>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
<mml:mi>c</mml:mi>
</mml:msup>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="middle" align="center">
<italic>a</italic> = 41.0291, <italic>b</italic> = 0.0289, <italic>c</italic> = 0.4971</td>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im23">
<mml:mrow>
<mml:mi>C</mml:mi>
<mml:mi>L</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>2.56</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
</tr>
<tr>
<td valign="middle" rowspan="3" align="center">
<italic>Quercus acutissima</italic>
</td>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im24">
<mml:mi>H</mml:mi>
</mml:math>
</inline-formula>
</td>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im25">
<mml:mrow>
<mml:mi>H</mml:mi>
<mml:mo>=</mml:mo>
<mml:mi>a</mml:mi>
<mml:mo>&#xd7;</mml:mo>
<mml:msup>
<mml:mi>e</mml:mi>
<mml:mrow>
<mml:mi>b</mml:mi>
<mml:mo>+</mml:mo>
<mml:mi>c</mml:mi>
<mml:mo stretchy="false">/</mml:mo>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>D</mml:mi>
<mml:mi>B</mml:mi>
<mml:mi>H</mml:mi>
<mml:mo>+</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:msup>
<mml:mo>+</mml:mo>
<mml:mi>d</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="middle" align="center">
<italic>a</italic> = 1.0822, <italic>b</italic> = 3.2453, <italic>c</italic> = 17.2914,<break/>
<italic>d</italic> = 3.5632</td>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im26">
<mml:mrow>
<mml:mi>H</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>5.12</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
</tr>
<tr>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im27">
<mml:mrow>
<mml:mi>C</mml:mi>
<mml:mi>W</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im28">
<mml:mrow>
<mml:mi>C</mml:mi>
<mml:mi>W</mml:mi>
<mml:mo>=</mml:mo>
<mml:mi>a</mml:mi>
<mml:mo>+</mml:mo>
<mml:mi>b</mml:mi>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>D</mml:mi>
<mml:mi>B</mml:mi>
<mml:msup>
<mml:mi>H</mml:mi>
<mml:mn>2</mml:mn>
</mml:msup>
<mml:mo>+</mml:mo>
<mml:mi>c</mml:mi>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>D</mml:mi>
<mml:mi>B</mml:mi>
<mml:msup>
<mml:mi>H</mml:mi>
<mml:mn>3</mml:mn>
</mml:msup>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="middle" align="center">
<italic>a</italic> = 0.2574, <italic>b</italic> = 0.2442, <italic>c</italic> = &#x2013;0.0022</td>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im29">
<mml:mrow>
<mml:mi>C</mml:mi>
<mml:mi>W</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>1.82</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
</tr>
<tr>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im30">
<mml:mrow>
<mml:mi>C</mml:mi>
<mml:mi>L</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im31">
<mml:mrow>
<mml:mi>C</mml:mi>
<mml:mi>L</mml:mi>
<mml:mo>=</mml:mo>
<mml:mi>a</mml:mi>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>D</mml:mi>
<mml:mi>B</mml:mi>
<mml:msup>
<mml:mi>H</mml:mi>
<mml:mi>b</mml:mi>
</mml:msup>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im32">
<mml:mrow>
<mml:mi>a</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>0.4833</mml:mn>
<mml:mo>,</mml:mo>
<mml:mi>b</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>0.6892</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im33">
<mml:mrow>
<mml:mi>C</mml:mi>
<mml:mi>L</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>1.47</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
</tr>
<tr>
<td valign="middle" rowspan="3" align="center">
<italic>Betula alnoides</italic>
</td>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im34">
<mml:mi>H</mml:mi>
</mml:math>
</inline-formula>
</td>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im35">
<mml:mrow>
<mml:msup>
<mml:mi>H</mml:mi>
<mml:mrow>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msup>
<mml:mo>=</mml:mo>
<mml:mi>a</mml:mi>
<mml:mo>+</mml:mo>
<mml:mi>b</mml:mi>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>D</mml:mi>
<mml:mi>B</mml:mi>
<mml:mi>H</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im36">
<mml:mrow>
<mml:mi>a</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>0.0211</mml:mn>
<mml:mo>,</mml:mo>
<mml:mi>b</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>0.6850</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im37">
<mml:mrow>
<mml:mi>H</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>6.33</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
</tr>
<tr>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im38">
<mml:mrow>
<mml:mi>C</mml:mi>
<mml:mi>W</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im39">
<mml:mrow>
<mml:mi>C</mml:mi>
<mml:mi>W</mml:mi>
<mml:mo>=</mml:mo>
<mml:mfrac>
<mml:mi>a</mml:mi>
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>+</mml:mo>
<mml:mi>b</mml:mi>
<mml:mo>&#xd7;</mml:mo>
<mml:msup>
<mml:mi>e</mml:mi>
<mml:mrow>
<mml:mo>&#x2212;</mml:mo>
<mml:mi>c</mml:mi>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>D</mml:mi>
<mml:mi>B</mml:mi>
<mml:mi>H</mml:mi>
</mml:mrow>
</mml:msup>
</mml:mrow>
</mml:mfrac>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="middle" align="center">
<italic>a</italic> = 3.0360, <italic>b</italic> = 0.8446, <italic>c</italic> = 0.1345</td>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im40">
<mml:mrow>
<mml:mi>C</mml:mi>
<mml:mi>W</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>2.12</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
</tr>
<tr>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im41">
<mml:mrow>
<mml:mi>C</mml:mi>
<mml:mi>L</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im42">
<mml:mrow>
<mml:mi>C</mml:mi>
<mml:mi>L</mml:mi>
<mml:mo>=</mml:mo>
<mml:mi>a</mml:mi>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>D</mml:mi>
<mml:mi>B</mml:mi>
<mml:msup>
<mml:mi>H</mml:mi>
<mml:mi>b</mml:mi>
</mml:msup>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im43">
<mml:mrow>
<mml:mi>a</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>2.0317</mml:mn>
<mml:mo>,</mml:mo>
<mml:mi>b</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>0.2375</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im44">
<mml:mrow>
<mml:mi>C</mml:mi>
<mml:mi>L</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>2.98</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
</tr>
<tr>
<td valign="middle" rowspan="3" align="center">
<italic>Vaccinium bracteatum</italic>
</td>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im45">
<mml:mi>H</mml:mi>
</mml:math>
</inline-formula>
</td>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im46">
<mml:mrow>
<mml:mi>H</mml:mi>
<mml:mo>=</mml:mo>
<mml:mi>a</mml:mi>
<mml:mo>&#xd7;</mml:mo>
<mml:msup>
<mml:mi>e</mml:mi>
<mml:mrow>
<mml:mo>&#x2212;</mml:mo>
<mml:mi>b</mml:mi>
<mml:mo stretchy="false">/</mml:mo>
<mml:mi>D</mml:mi>
<mml:mi>B</mml:mi>
<mml:msup>
<mml:mi>H</mml:mi>
<mml:mi>c</mml:mi>
</mml:msup>
</mml:mrow>
</mml:msup>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="middle" align="center">
<italic>a</italic> = 2.2004, <italic>b</italic> = 0.5011, <italic>c</italic> = 4.9997</td>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im47">
<mml:mrow>
<mml:mi>H</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>2.20</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
</tr>
<tr>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im48">
<mml:mrow>
<mml:mi>C</mml:mi>
<mml:mi>W</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im49">
<mml:mrow>
<mml:mi>C</mml:mi>
<mml:mi>W</mml:mi>
<mml:mo>=</mml:mo>
<mml:mfrac>
<mml:mi>a</mml:mi>
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>+</mml:mo>
<mml:mi>b</mml:mi>
<mml:mo>&#xd7;</mml:mo>
<mml:msup>
<mml:mi>e</mml:mi>
<mml:mrow>
<mml:mo>&#x2212;</mml:mo>
<mml:mi>c</mml:mi>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>D</mml:mi>
<mml:mi>B</mml:mi>
<mml:mi>H</mml:mi>
</mml:mrow>
</mml:msup>
</mml:mrow>
</mml:mfrac>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="middle" align="center">
<italic>a</italic> = 2.9716, <italic>b</italic> = 1.0269, <italic>c</italic> = &#x2013;0.0314</td>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im50">
<mml:mrow>
<mml:mi>C</mml:mi>
<mml:mi>W</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>1.35</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
</tr>
<tr>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im51">
<mml:mrow>
<mml:mi>C</mml:mi>
<mml:mi>L</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im52">
<mml:mrow>
<mml:mi>C</mml:mi>
<mml:mi>L</mml:mi>
<mml:mo>=</mml:mo>
<mml:mfrac>
<mml:mi>a</mml:mi>
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>+</mml:mo>
<mml:mi>b</mml:mi>
<mml:mo>&#xd7;</mml:mo>
<mml:msup>
<mml:mi>e</mml:mi>
<mml:mrow>
<mml:mo>&#x2212;</mml:mo>
<mml:mi>c</mml:mi>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>D</mml:mi>
<mml:mi>B</mml:mi>
<mml:mi>H</mml:mi>
</mml:mrow>
</mml:msup>
</mml:mrow>
</mml:mfrac>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="middle" align="center">
<italic>a</italic> = 1.0123, <italic>b</italic> = 0.7829, <italic>c</italic> = 4.0326</td>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im53">
<mml:mrow>
<mml:mi>C</mml:mi>
<mml:mi>L</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>1.01</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
</tr>
<tr>
<td valign="middle" rowspan="3" align="center">
<italic>Camellia sinensis</italic>
</td>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im54">
<mml:mi>H</mml:mi>
</mml:math>
</inline-formula>
</td>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im55">
<mml:mrow>
<mml:mi>H</mml:mi>
<mml:mo>=</mml:mo>
<mml:mi>a</mml:mi>
<mml:mo>&#xd7;</mml:mo>
<mml:msup>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>&#x2212;</mml:mo>
<mml:msup>
<mml:mi>e</mml:mi>
<mml:mrow>
<mml:mo>&#x2212;</mml:mo>
<mml:mi>b</mml:mi>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>D</mml:mi>
<mml:mi>B</mml:mi>
<mml:mi>H</mml:mi>
</mml:mrow>
</mml:msup>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
<mml:mi>c</mml:mi>
</mml:msup>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="middle" align="center">
<italic>a</italic> = 10.0002, <italic>b</italic> = 0.2114, <italic>c</italic> = 1.9997</td>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im56">
<mml:mrow>
<mml:mi>H</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>4.26</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
</tr>
<tr>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im57">
<mml:mrow>
<mml:mi>C</mml:mi>
<mml:mi>W</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im58">
<mml:mrow>
<mml:mi>C</mml:mi>
<mml:mi>W</mml:mi>
<mml:mo>=</mml:mo>
<mml:mfrac>
<mml:mi>a</mml:mi>
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>+</mml:mo>
<mml:mi>b</mml:mi>
<mml:mo>&#xd7;</mml:mo>
<mml:msup>
<mml:mi>e</mml:mi>
<mml:mrow>
<mml:mo>&#x2212;</mml:mo>
<mml:mi>c</mml:mi>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>D</mml:mi>
<mml:mi>B</mml:mi>
<mml:mi>H</mml:mi>
</mml:mrow>
</mml:msup>
</mml:mrow>
</mml:mfrac>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="middle" align="center">
<italic>a</italic> = 1.9389, <italic>b</italic> = 0.5366, <italic>c</italic> = 0.1097</td>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im59">
<mml:mrow>
<mml:mi>C</mml:mi>
<mml:mi>W</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>1.48</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
</tr>
<tr>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im60">
<mml:mrow>
<mml:mi>C</mml:mi>
<mml:mi>L</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im61">
<mml:mrow>
<mml:mi>C</mml:mi>
<mml:mi>L</mml:mi>
<mml:mo>=</mml:mo>
<mml:mi>a</mml:mi>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>D</mml:mi>
<mml:mi>B</mml:mi>
<mml:msup>
<mml:mi>H</mml:mi>
<mml:mi>b</mml:mi>
</mml:msup>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im62">
<mml:mrow>
<mml:mi>a</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>0.9009</mml:mn>
<mml:mo>,</mml:mo>
<mml:mi>b</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>0.3250</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im63">
<mml:mrow>
<mml:mi>C</mml:mi>
<mml:mi>L</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>1.55</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
</tr>
<tr>
<td valign="middle" rowspan="3" align="center">
<italic>Ternstroemia gymnanthera</italic>
</td>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im64">
<mml:mi>H</mml:mi>
</mml:math>
</inline-formula>
</td>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im65">
<mml:mrow>
<mml:mi>H</mml:mi>
<mml:mo>=</mml:mo>
<mml:mi>a</mml:mi>
<mml:mo>+</mml:mo>
<mml:mi>b</mml:mi>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>D</mml:mi>
<mml:mi>B</mml:mi>
<mml:mi>H</mml:mi>
<mml:mo>+</mml:mo>
<mml:mi>c</mml:mi>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>D</mml:mi>
<mml:mi>B</mml:mi>
<mml:msup>
<mml:mi>H</mml:mi>
<mml:mn>2</mml:mn>
</mml:msup>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="middle" align="center">
<italic>a</italic> = 2.9963, <italic>b</italic> = 0.9818, <italic>c</italic> = &#x2013;0.1110</td>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im66">
<mml:mrow>
<mml:mi>H</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>5.13</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
</tr>
<tr>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im67">
<mml:mrow>
<mml:mi>C</mml:mi>
<mml:mi>W</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im68">
<mml:mrow>
<mml:mi>l</mml:mi>
<mml:mi>n</mml:mi>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>C</mml:mi>
<mml:mi>W</mml:mi>
<mml:mo stretchy="false">)</mml:mo>
<mml:mo>=</mml:mo>
<mml:mi>a</mml:mi>
<mml:mo>+</mml:mo>
<mml:mi>b</mml:mi>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>l</mml:mi>
<mml:mi>n</mml:mi>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>D</mml:mi>
<mml:mi>B</mml:mi>
<mml:mi>H</mml:mi>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im69">
<mml:mrow>
<mml:mi>a</mml:mi>
<mml:mo>=</mml:mo>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>0.1710</mml:mn>
<mml:mo>,</mml:mo>
<mml:mi>b</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>0.2247</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im70">
<mml:mrow>
<mml:mi>C</mml:mi>
<mml:mi>W</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>1.21</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
</tr>
<tr>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im71">
<mml:mrow>
<mml:mi>C</mml:mi>
<mml:mi>L</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im72">
<mml:mrow>
<mml:mi>C</mml:mi>
<mml:mi>L</mml:mi>
<mml:mo>=</mml:mo>
<mml:mi>a</mml:mi>
<mml:mo>&#xd7;</mml:mo>
<mml:msup>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>&#x2212;</mml:mo>
<mml:msup>
<mml:mi>e</mml:mi>
<mml:mrow>
<mml:mo>&#x2212;</mml:mo>
<mml:mi>b</mml:mi>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>D</mml:mi>
<mml:mi>B</mml:mi>
<mml:mi>H</mml:mi>
</mml:mrow>
</mml:msup>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
<mml:mi>c</mml:mi>
</mml:msup>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="middle" align="center">
<italic>a</italic> = 1.9964, <italic>b</italic> = 0.1762, <italic>c</italic> = 1.0005</td>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im73">
<mml:mrow>
<mml:mi>C</mml:mi>
<mml:mi>L</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>1.17</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
</sec>
<sec id="s2_7">
<label>2.7</label>
<title>Stand structure prediction</title>
<sec id="s2_7_1">
<label>2.7.1</label>
<title>Models</title>
<p>Based on the data characteristics of different tree factors and the requirements of the prediction tasks, this study selected four different machine learning models to ensure predictive accuracy and reliability. The CNN-PSO (<xref ref-type="bibr" rid="B31">Ma et&#xa0;al., 2022</xref>) model is suitable for handling continuous variables with complex nonlinear relationships; its convolutional layers can effectively capture latent spatial patterns among features, and thus it was used to predict age and crown length. The Random Forest (RF) model (<xref ref-type="bibr" rid="B53">Xiaonan et al., 2024</xref>), with its strong anti-overfitting capability and ability to handle high-dimensional data, can robustly manage complex interactions among tree growth factors, making it suitable for predicting tree height and crown width. The Multilayer Perceptron (MLP) (<xref ref-type="bibr" rid="B25">Kim et&#xa0;al., 2025</xref>), due to its powerful function approximation capability, was employed to model the growth of diameter at breast height (DBH), a complex nonlinear regression problem. The Gradient Boosting Decision Tree (GBDT) (<xref ref-type="bibr" rid="B34">Nhat-Duc and Van-Duc, 2023</xref>), which excels in classification tasks&#x2014;particularly with imbalanced data and combining multiple weak classifiers&#x2014;was used to predict the probability of tree mortality, a binary classification problem. This targeted model selection strategy aims to maximize the accuracy and robustness of each prediction task.</p>
<sec id="s2_7_1_1">
<label>2.7.1.1</label>
<title>CNN-PSO</title>
<p>CNN consists of an input layer, output layer, convolutional layers, pooling layers, and fully connected layers. Its core concept is to automatically learn local features through convolutional layers, eliminating the need for manual feature extraction required by traditional methods. Additionally, pooling layers perform downsampling on the features, reducing computational complexity while enhancing the model&#x2019;s robustness.</p>
<p>PSO is a global optimization algorithm that simulates swarm behavior, where each particle represents a potential solution. The particles continuously move through the solution space, searching for the optimal solution. PSO has strong global search capabilities and can efficiently identify high-quality solutions.</p>
<p>The CNN-PSO was adopted in this study, where the global search ability of PSO was utilized to optimize critical hyperparameters, such as the number of output channels in the convolutional layers, learning rate, and batch size. Traditional manual tuning is often constrained by experience and prone to getting stuck in local optima. By applying PSO to CNN hyperparameter optimization, the optimal parameter combination can be automatically identified, enhancing model performance while significantly reducing computational resources and time.</p>
<fig id="f1" position="float">
<label>Figure&#xa0;1</label>
<caption>
<p>Location of the study area.</p>
</caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fpls-16-1610571-g001.tif">
<alt-text content-type="machine-generated">Map showing the Dali Bai Autonomous Prefecture alongside a topographic map with elevation ranging from 1,338 to 4,071 meters. Sample plots P1 to P11 are marked with different colored shapes. The inset map highlights Dali City and the Prefecture.</alt-text>
</graphic>
</fig>
<p>In the model design, two convolutional layers were used to extract features from the input data, each followed by a batch normalization layer to accelerate training and improve stability. Then, pooling layers were applied to reduce data dimensionality, alleviating computational burden and enhancing the model&#x2019;s adaptability to local features. After convolution and pooling, the data was flattened and processed through fully connected layers before producing the final prediction output. To prevent overfitting, a Dropout layer was incorporated to randomly drop some neurons, encouraging the model to learn diverse features and thereby improving its predictive capability on new data. As shown in <xref ref-type="fig" rid="f2">
<bold>Figure&#xa0;2</bold>
</xref>.</p>
<fig id="f2" position="float">
<label>Figure&#xa0;2</label>
<caption>
<p>The architecture of the CNN-PSO model.</p>
</caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fpls-16-1610571-g002.tif">
<alt-text content-type="machine-generated">Diagram of a neural network architecture using Particle Swarm Optimization parameters. It shows an input layer connected to two convolutional blocks, each with a convolutional layer, batch normalization layer, and ReLU activation. The first block feeds into a pooling layer, then into the second block. The second block leads to a flatten layer, followed by a fully connected layer with ReLU, and finally a dropout layer, ending at the output layer.</alt-text>
</graphic>
</fig>
</sec>
<sec id="s2_7_1_2">
<label>2.7.1.2</label>
<title>Random Forest</title>
<p>RF is an ensemble learning algorithm based on the Bagging method and decision trees, using decision trees as its fundamental units. It constructs multiple decision trees and combines their predictions to enhance overall performance. During training, each tree is built using a randomly sampled subset of the original data, and feature selection at each node split is performed randomly. This approach reduces overfitting and improves the model&#x2019;s generalization ability. By integrating the outputs of multiple decision trees, random forest effectively captures complex feature interactions, exhibits strong noise resistance, and achieves high prediction accuracy.</p>
<p>To further enhance the predictive performance of the model, this study employed ten-fold cross-validation and grid search for hyperparameter optimization. Ten-fold cross-validation involves partitioning the dataset into ten subsets, using nine for training and the remaining one for validation in each iteration. This method effectively mitigates biases caused by data partitioning and improves the model&#x2019;s stability and generalization ability. Grid search systematically explores different hyperparameter combinations to optimize the performance of the random forest model. The tested hyperparameters include the number of trees (50, 100, 200), tree depth (10, 20, 30), the minimum number of samples required for node splitting (2, 5, 10), and the minimum number of samples required for leaf nodes (1, 2, 4). As shown in <xref ref-type="fig" rid="f3">
<bold>Figure&#xa0;3</bold>
</xref>.</p>
<fig id="f3" position="float">
<label>Figure&#xa0;3</label>
<caption>
<p>Framework of the Random Forest Model.</p>
</caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fpls-16-1610571-g003.tif">
<alt-text content-type="machine-generated">Flowchart illustrating a machine learning process: Input data undergoes preprocessing, followed by hyperparameter optimization using grid search and tenfold cross-validation. Multiple decision trees are created and averaged for aggregation, producing the final result.</alt-text>
</graphic>
</fig>
</sec>
<sec id="s2_7_1_3">
<label>2.7.1.3</label>
<title>Multilayer perceptron</title>
<p>MLP is a deep feedforward neural network composed of an input layer, multiple hidden layers, and an output layer. Each neuron in a layer is fully connected to the neurons in the previous layer. Input data undergoes weighted summation and activation function processing at each layer, ultimately producing the final prediction output. MLP possesses strong function approximation capabilities, enabling it to capture complex patterns and features in data through multiple hidden layers, thereby achieving high predictive accuracy.</p>
<p>In the model design, this study utilized MLP as the base model and constructed a Stacked-MLP model by stacking three MLPs. The prediction outputs of each MLP were used as inputs for a regressor, which generated the final prediction. To balance computational cost and model performance, the hyperparameters of the regressor were set as follows: learning rate (0.0001&#x2013;0.1), number of iterations (100&#x2013;500), and batch size (16, 32, 64, 128). As shown in <xref ref-type="fig" rid="f4">
<bold>Figure&#xa0;4</bold>
</xref>.</p>
<fig id="f4" position="float">
<label>Figure&#xa0;4</label>
<caption>
<p>The architecture of the Stacked-MLP model.</p>
</caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fpls-16-1610571-g004.tif">
<alt-text content-type="machine-generated">Diagram showing a neural network and stacking ensemble. On the left, a multilayer perceptron (MLP) consists of an input layer, two hidden layers, and an output layer. On the right, the stacking ensemble includes three MLPs, which make initial predictions. These are combined and fed into a regressor, resulting in a final prediction.</alt-text>
</graphic>
</fig>
</sec>
<sec id="s2_7_1_4">
<label>2.7.1.4</label>
<title>Gradient boosting decision tree</title>
<p>GBDT is an ensemble learning-based classification algorithm that incrementally trains multiple weak classifiers, combining their weighted predictions to obtain the final classification result. Each new model is optimized to correct the errors made by the previous model, focusing on misclassified samples and gradually adjusting the model parameters to improve classification performance. GBDT efficiently handles complex nonlinear relationships and can automatically identify interactions between features, reducing the need for extensive manual feature engineering. It offers high predictive accuracy and strong flexibility, making it a powerful tool for classification tasks.</p>
<p>To enhance model performance, improve stability, and strengthen generalization ability, this study employed grid search to explore the hyperparameter space and identify the optimal combination of parameters. The selected hyperparameters include learning rate (0.01, 0.1, 0.2), number of trees (50, 100, 200), and tree depth (10, 20, 30). As shown in <xref ref-type="fig" rid="f5">
<bold>Figure&#xa0;5</bold>
</xref>.</p>
<fig id="f5" position="float">
<label>Figure&#xa0;5</label>
<caption>
<p>Framework of the Gradient Boosting Decision Tree Model.</p>
</caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fpls-16-1610571-g005.tif">
<alt-text content-type="machine-generated">Flowchart depicting a machine learning process. It starts with &#x201c;Input Data,&#x201d; moves through &#x201c;Preprocessing&#x201d; and &#x201c;Grid Search.&#x201d; Two decision trees labeled &#x201c;Fitting Residuals&#x201d; are shown, leading to a &#x201c;Weighted Sum,&#x201d; and ending with the &#x201c;Result."</alt-text>
</graphic>
</fig>
</sec>
</sec>
<sec id="s2_7_2">
<label>2.7.2</label>
<title>Prediction</title>
<p>Stand structure prediction involves forecasting parameters such as diameter at breast height, tree height, age, crown width, crown length, and mortality rate to understand the dynamic changes in stand structure. This enables dynamic optimization of stand structure and provides decision-making support for forest management, resource conservation, and ecological restoration.</p>
<p>We selected various indicators to construct the model, including age (<italic>AGE</italic>), diameter at breast height (<italic>DBH</italic>,1<italic>/DBH,DBH</italic>
<sup>2</sup>), tree height (<italic>H</italic>), crown width (<italic>CW</italic>), crown length (<italic>CL</italic>), number of trees per hectare (<italic>NT</italic>), stand density index (<italic>SDI</italic>), slope (<italic>SLO</italic>), aspect (<italic>ASP</italic>), height-to-diameter ratio (<italic>HDR</italic>), the sum of basal area larger than the target tree (<italic>BAL</italic>), and Hegyi competition index (<italic>HCI</italic>). To eliminate multicollinearity when building different predictive models, independent variables with a variance inflation factor (VIF) greater than 10 were excluded.</p>
<p>The diameter growth model was developed using the Stacked-MLP algorithm, with <italic>AGE</italic>, <italic>ASP</italic>, <italic>NT</italic>, <italic>SLO</italic>, <italic>SDI</italic>, <italic>BAL</italic>, and <italic>DBH</italic>
<sup>2</sup> selected as feature variables. The model&#x2019;s target variable was set as the natural logarithm of diameter growth squared plus one, <italic>ln</italic>(<italic>DGI</italic> + 1). Since tree diameter growth occurs over long periods, shorter prediction intervals may fail to capture significant growth changes. Therefore, a five-year prediction cycle was used in the model.</p>
<p>The RF algorithm was used for tree height and crown width prediction models. The selected feature variables for tree height prediction were <italic>AGE</italic>, <italic>ASP</italic>, <italic>DBH</italic>, and <italic>SLOPE</italic>, with <italic>H</italic> as the target variable. For crown width prediction, the feature variables included <italic>AGE</italic>, 1<italic>/DBH</italic>, <italic>CL</italic>, <italic>ASP</italic>, <italic>SDI</italic>, <italic>HDR</italic>, and <italic>NT</italic>, with <italic>CW</italic> as the target variable.</p>
<p>The CNN-PSO was used for age and crown length prediction models. The feature variables for age prediction were 1<italic>/DBH</italic>, <italic>H</italic>, <italic>ASP</italic>, <italic>SLO</italic>, <italic>NT</italic>, and <italic>SDI</italic>, with <italic>AGE</italic> as the target variable. For crown length prediction, the selected feature variables were <italic>AGE</italic>, 1<italic>/DBH</italic>, <italic>ASP</italic>, <italic>SDI</italic>, <italic>HDR</italic>, and <italic>NT</italic>, with <italic>CL</italic> as the target variable.</p>
<p>Mortality prediction is a binary classification problem, and the GBDT model was chosen for this task. To improve prediction accuracy, the classification threshold was initially set at 0.5; however, this value is only applicable when the number of surviving and dead trees in the stand is approximately equal. In reality, mortality is a low-probability event, and cases where mortality and survival are equal are rare. Therefore, this study incorporated the HCI as an additional criterion. Trees with a mortality probability greater than 0.5 and experiencing high competition pressure (<italic>HCI &gt;</italic> 0.75) were classified as dead. The selected feature variables included 1/DBH, H, BAL, and HCI, with tree mortality status (<italic>STATE</italic>) used as the target label.</p>
<p>Since the stand structure prediction model simultaneously predicts multiple stand factors, redundancy in feature variable selection is inevitable, which may lead to internal inconsistencies within the model. To address this, predictions were conducted sequentially in the following order: age, diameter at breast height, tree height, mortality, crown width, and crown length. This ensures that the feature variables used in all prediction models are updated accordingly during the prediction process.</p>
<p>The VIF values of the feature variables and the prediction accuracy of each model are presented in <xref ref-type="table" rid="T3">
<bold>Tables&#xa0;3</bold>
</xref>&#x2013;<xref ref-type="table" rid="T5">
<bold>5</bold>
</xref>.</p>
<table-wrap id="T3" position="float">
<label>Table&#xa0;3</label>
<caption>
<p>VIF values of feature variables in different prediction models.</p>
</caption>
<table frame="hsides">
<thead>
<tr>
<th valign="middle" colspan="2" align="center">Age prediction</th>
<th valign="middle" colspan="2" align="center">DBH prediction</th>
<th valign="middle" colspan="2" align="center">H prediction</th>
<th valign="middle" colspan="2" align="center">CW prediction</th>
<th valign="middle" colspan="2" align="center">CL prediction</th>
<th valign="middle" colspan="2" align="center">Mortality prediction</th>
</tr>
<tr>
<th valign="middle" align="center">feature</th>
<th valign="middle" align="center">VIF</th>
<th valign="middle" align="center">feature</th>
<th valign="middle" align="center">VIF</th>
<th valign="middle" align="center">feature</th>
<th valign="middle" align="center">VIF</th>
<th valign="middle" align="center">feature</th>
<th valign="middle" align="center">VIF</th>
<th valign="middle" align="center">feature</th>
<th valign="middle" align="center">VIF</th>
<th valign="middle" align="center">feature</th>
<th valign="middle" align="center">VIF</th>
</tr>
</thead>
<tbody>
<tr>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im74">
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo stretchy="false">/</mml:mo>
<mml:mi>D</mml:mi>
<mml:mi>B</mml:mi>
<mml:mi>H</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="middle" align="center">1.5352</td>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im75">
<mml:mrow>
<mml:mi>D</mml:mi>
<mml:mi>B</mml:mi>
<mml:mi>H</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="middle" align="center">1.4852</td>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im76">
<mml:mrow>
<mml:mi>D</mml:mi>
<mml:mi>B</mml:mi>
<mml:mi>H</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="middle" align="center">4.6597</td>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im77">
<mml:mrow>
<mml:mi>A</mml:mi>
<mml:mi>G</mml:mi>
<mml:mi>E</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="middle" align="center">5.8744</td>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im78">
<mml:mrow>
<mml:mi>A</mml:mi>
<mml:mi>G</mml:mi>
<mml:mi>E</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="middle" align="center">3.5899</td>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im79">
<mml:mrow>
<mml:mi>D</mml:mi>
<mml:mi>B</mml:mi>
<mml:msup>
<mml:mi>H</mml:mi>
<mml:mn>2</mml:mn>
</mml:msup>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="middle" align="center">4.1586</td>
</tr>
<tr>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im80">
<mml:mi>H</mml:mi>
</mml:math>
</inline-formula>
</td>
<td valign="middle" align="center">1.6049</td>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im81">
<mml:mrow>
<mml:mi>A</mml:mi>
<mml:mi>G</mml:mi>
<mml:mi>E</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="middle" align="center">2.0224</td>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im82">
<mml:mrow>
<mml:mi>A</mml:mi>
<mml:mi>G</mml:mi>
<mml:mi>E</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="middle" align="center">4.6514</td>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im83">
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo stretchy="false">/</mml:mo>
<mml:mi>D</mml:mi>
<mml:mi>B</mml:mi>
<mml:mi>H</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="middle" align="center">4.4287</td>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im84">
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo stretchy="false">/</mml:mo>
<mml:mi>D</mml:mi>
<mml:mi>B</mml:mi>
<mml:mi>H</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="middle" align="center">4.4283</td>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im85">
<mml:mi>H</mml:mi>
</mml:math>
</inline-formula>
</td>
<td valign="middle" align="center">5.8075</td>
</tr>
<tr>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im86">
<mml:mrow>
<mml:mi>A</mml:mi>
<mml:mi>S</mml:mi>
<mml:mi>P</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="middle" align="center">2.1709</td>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im87">
<mml:mrow>
<mml:mi>A</mml:mi>
<mml:mi>S</mml:mi>
<mml:mi>P</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="middle" align="center">2.0374</td>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im88">
<mml:mrow>
<mml:mi>A</mml:mi>
<mml:mi>S</mml:mi>
<mml:mi>P</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="middle" align="center">1.3759</td>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im89">
<mml:mrow>
<mml:mi>C</mml:mi>
<mml:mi>L</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="middle" align="center">2.0131</td>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im90">
<mml:mrow>
<mml:mi>A</mml:mi>
<mml:mi>S</mml:mi>
<mml:mi>P</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="middle" align="center">2.2043</td>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im91">
<mml:mrow>
<mml:mi>B</mml:mi>
<mml:mi>A</mml:mi>
<mml:mi>L</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="middle" align="center">2.0631</td>
</tr>
<tr>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im92">
<mml:mrow>
<mml:mi>S</mml:mi>
<mml:mi>L</mml:mi>
<mml:mi>O</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="middle" align="center">1.1583</td>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im93">
<mml:mrow>
<mml:mi>S</mml:mi>
<mml:mi>L</mml:mi>
<mml:mi>O</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="middle" align="center">1.2576</td>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im94">
<mml:mrow>
<mml:mi>S</mml:mi>
<mml:mi>L</mml:mi>
<mml:mi>O</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="middle" align="center">1.3651</td>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im95">
<mml:mrow>
<mml:mi>A</mml:mi>
<mml:mi>S</mml:mi>
<mml:mi>P</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="middle" align="center">2.2399</td>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im96">
<mml:mrow>
<mml:mi>S</mml:mi>
<mml:mi>D</mml:mi>
<mml:mi>I</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="middle" align="center">2.3709</td>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im97">
<mml:mrow>
<mml:mi>H</mml:mi>
<mml:mi>C</mml:mi>
<mml:mi>I</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="middle" align="center">1.1315</td>
</tr>
<tr>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im98">
<mml:mrow>
<mml:mi>N</mml:mi>
<mml:mi>T</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="middle" align="center">1.5428</td>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im99">
<mml:mrow>
<mml:mi>N</mml:mi>
<mml:mi>T</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="middle" align="center">1.2727</td>
<td valign="middle" align="center"/>
<td valign="middle" align="center"/>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im100">
<mml:mrow>
<mml:mi>H</mml:mi>
<mml:mi>D</mml:mi>
<mml:mi>R</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="middle" align="center">1.6552</td>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im101">
<mml:mrow>
<mml:mi>H</mml:mi>
<mml:mi>D</mml:mi>
<mml:mi>R</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="middle" align="center">1.5049</td>
<td valign="middle" align="center"/>
<td valign="middle" align="center"/>
</tr>
<tr>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im102">
<mml:mrow>
<mml:mi>S</mml:mi>
<mml:mi>D</mml:mi>
<mml:mi>I</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="middle" align="center">2.5316</td>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im103">
<mml:mrow>
<mml:mi>B</mml:mi>
<mml:mi>A</mml:mi>
<mml:mi>L</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="middle" align="center">1.5647</td>
<td valign="middle" align="center"/>
<td valign="middle" align="center"/>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im104">
<mml:mrow>
<mml:mi>N</mml:mi>
<mml:mi>T</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="middle" align="center">1.0445</td>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im105">
<mml:mrow>
<mml:mi>N</mml:mi>
<mml:mi>T</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="middle" align="center">1.0434</td>
<td valign="middle" align="center"/>
<td valign="middle" align="center"/>
</tr>
<tr>
<td valign="middle" align="center"/>
<td valign="middle" align="center"/>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im106">
<mml:mrow>
<mml:mi>S</mml:mi>
<mml:mi>D</mml:mi>
<mml:mi>I</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="middle" align="center">2.5414</td>
<td valign="middle" align="center"/>
<td valign="middle" align="center"/>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im107">
<mml:mrow>
<mml:mi>S</mml:mi>
<mml:mi>D</mml:mi>
<mml:mi>I</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="middle" align="center">2.3858</td>
<td valign="middle" align="center"/>
<td valign="middle" align="center"/>
<td valign="middle" align="center"/>
<td valign="middle" align="center"/>
</tr>
</tbody>
</table>
</table-wrap>
<table-wrap id="T4" position="float">
<label>Table&#xa0;4</label>
<caption>
<p>Evaluation metrics of selected prediction models.</p>
</caption>
<table frame="hsides">
<thead>
<tr>
<th valign="middle" align="center">Target variable</th>
<th valign="middle" align="center">Model</th>
<th valign="middle" align="center">
<italic>R</italic>
<sup>2</sup>
</th>
<th valign="middle" align="center">
<italic>RMSE</italic>
</th>
<th valign="middle" align="center">
<italic>MAE</italic>
</th>
</tr>
</thead>
<tbody>
<tr>
<td valign="middle" align="center">
<italic>AGE</italic>
</td>
<td valign="middle" align="center">CNN-PSO</td>
<td valign="middle" align="center">0.4246</td>
<td valign="middle" align="center">5.3775</td>
<td valign="middle" align="center">4.1626</td>
</tr>
<tr>
<td valign="middle" align="center">
<italic>DBH</italic>
</td>
<td valign="middle" align="center">Stacked-MLP</td>
<td valign="middle" align="center">0.8461</td>
<td valign="middle" align="center">0.3055</td>
<td valign="middle" align="center">0.2041</td>
</tr>
<tr>
<td valign="middle" align="center">
<italic>H</italic>
</td>
<td valign="middle" align="center">RF</td>
<td valign="middle" align="center">0.8280</td>
<td valign="middle" align="center">1.4143</td>
<td valign="middle" align="center">1.0992</td>
</tr>
<tr>
<td valign="middle" align="center">
<italic>CW</italic>
</td>
<td valign="middle" align="center">RF</td>
<td valign="middle" align="center">0.6315</td>
<td valign="middle" align="center">0.3554</td>
<td valign="middle" align="center">0.2704</td>
</tr>
<tr>
<td valign="middle" align="center">
<italic>CL</italic>
</td>
<td valign="middle" align="center">CNN-PSO</td>
<td valign="middle" align="center">0.6403</td>
<td valign="middle" align="center">1.02485</td>
<td valign="middle" align="center">0.7951</td>
</tr>
</tbody>
</table>
</table-wrap>
<table-wrap id="T5" position="float">
<label>Table&#xa0;5</label>
<caption>
<p>Evaluation metrics for the mortality prediction model.</p>
</caption>
<table frame="hsides">
<thead>
<tr>
<th valign="middle" align="center">Target variable</th>
<th valign="middle" align="center">Model</th>
<th valign="middle" align="center">
<italic>Acc</italic>
</th>
<th valign="middle" align="center">
<italic>F</italic>1<italic>Score</italic>
</th>
<th valign="middle" align="center">
<italic>Recall</italic>
</th>
<th valign="middle" align="center">
<italic>ROCAUC</italic>
</th>
</tr>
</thead>
<tbody>
<tr>
<td valign="middle" align="center">
<italic>Mortality</italic>
</td>
<td valign="middle" align="center">GBDT</td>
<td valign="middle" align="center">0.9002</td>
<td valign="middle" align="center">0.7850</td>
<td valign="middle" align="center">0.7287</td>
<td valign="middle" align="center">0.9486</td>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
</sec>
<sec id="s2_8">
<label>2.8</label>
<title>Optimization model of stand structure</title>
<sec id="s2_8_1">
<label>2.8.1</label>
<title>Constrain</title>
<p>After optimization adjustments, the values of each sub-objective must not fall below their pre-optimization levels to ensure that the diversity of stand spatial structure does not decline. This means that the horizontal distribution pattern of the stand should become closer to a random distribution, the degree of species mingling should increase, the richness of vertical structure should be enhanced, and both size differentiation and competition pressure should be correspondingly reduced. During the optimization process, the number of tree diameter classes and species should not decrease, harvesting intensity should be controlled within 35%, and canopy density should not fall below 0.7. The number of replanted trees should remain within the stand density range, and after replanting, both the degree of mingling and the horizontal distribution pattern should be improved compared to prereplanting conditions (<xref ref-type="disp-formula" rid="eq17">Equation 17</xref>).</p>
<disp-formula id="eq17">
<label>(17)</label>
<mml:math display="block" id="M17">
<mml:mrow>
<mml:mi>s</mml:mi>
<mml:mo>.</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>.</mml:mo>
<mml:mo>{</mml:mo>
<mml:mtable columnalign="left" equalrows="true" equalcolumns="true">
<mml:mtr columnalign="left">
<mml:mtd columnalign="left">
<mml:mrow>
<mml:mover accent="true">
<mml:mrow>
<mml:mi>M</mml:mi>
<mml:msub>
<mml:mi>c</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
</mml:mrow>
<mml:mo stretchy="true">&#xaf;</mml:mo>
</mml:mover>
<mml:mo>&#x2265;</mml:mo>
<mml:mover accent="true">
<mml:mrow>
<mml:mi>M</mml:mi>
<mml:msub>
<mml:mi>c</mml:mi>
<mml:mn>0</mml:mn>
</mml:msub>
</mml:mrow>
<mml:mo stretchy="true">&#xaf;</mml:mo>
</mml:mover>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr columnalign="left">
<mml:mtd columnalign="left">
<mml:mrow>
<mml:mover accent="true">
<mml:mrow>
<mml:msub>
<mml:mi>S</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
</mml:mrow>
<mml:mo stretchy="true">&#xaf;</mml:mo>
</mml:mover>
<mml:mo>&#x2265;</mml:mo>
<mml:mover accent="true">
<mml:mrow>
<mml:msub>
<mml:mi>S</mml:mi>
<mml:mn>0</mml:mn>
</mml:msub>
</mml:mrow>
<mml:mo stretchy="true">&#xaf;</mml:mo>
</mml:mover>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr columnalign="left">
<mml:mtd columnalign="left">
<mml:mrow>
<mml:mover accent="true">
<mml:mrow>
<mml:msub>
<mml:mi>U</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
</mml:mrow>
<mml:mo stretchy="true">&#xaf;</mml:mo>
</mml:mover>
<mml:mo>&#x2264;</mml:mo>
<mml:mover accent="true">
<mml:mrow>
<mml:msub>
<mml:mi>U</mml:mi>
<mml:mn>0</mml:mn>
</mml:msub>
</mml:mrow>
<mml:mo stretchy="true">&#xaf;</mml:mo>
</mml:mover>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr columnalign="left">
<mml:mtd columnalign="left">
<mml:mrow>
<mml:mover accent="true">
<mml:mrow>
<mml:mi>C</mml:mi>
<mml:msub>
<mml:mi>I</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
</mml:mrow>
<mml:mo stretchy="true">&#xaf;</mml:mo>
</mml:mover>
<mml:mo>&#x2264;</mml:mo>
<mml:mover accent="true">
<mml:mrow>
<mml:mi>C</mml:mi>
<mml:msub>
<mml:mi>I</mml:mi>
<mml:mn>0</mml:mn>
</mml:msub>
</mml:mrow>
<mml:mo stretchy="true">&#xaf;</mml:mo>
</mml:mover>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr columnalign="left">
<mml:mtd columnalign="left">
<mml:mrow>
<mml:mo>|</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mover accent="true">
<mml:mi>W</mml:mi>
<mml:mo stretchy="true">&#xaf;</mml:mo>
</mml:mover>
</mml:mrow>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>0.496</mml:mn>
<mml:mo>|</mml:mo>
<mml:mo>&#x2264;</mml:mo>
<mml:mo>|</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mover accent="true">
<mml:mi>W</mml:mi>
<mml:mo stretchy="true">&#xaf;</mml:mo>
</mml:mover>
</mml:mrow>
<mml:mn>0</mml:mn>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>0.496</mml:mn>
<mml:mo>|</mml:mo>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr columnalign="left">
<mml:mtd columnalign="left">
<mml:mrow>
<mml:msub>
<mml:mi>D</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:mo>=</mml:mo>
<mml:msub>
<mml:mi>D</mml:mi>
<mml:mn>0</mml:mn>
</mml:msub>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr columnalign="left">
<mml:mtd columnalign="left">
<mml:mrow>
<mml:msub>
<mml:mi>T</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:mo>=</mml:mo>
<mml:msub>
<mml:mi>T</mml:mi>
<mml:mn>0</mml:mn>
</mml:msub>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr columnalign="left">
<mml:mtd columnalign="left">
<mml:mrow>
<mml:mi>C</mml:mi>
<mml:mi>d</mml:mi>
<mml:mo>&#x2265;</mml:mo>
<mml:mn>0.7</mml:mn>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr columnalign="left">
<mml:mtd columnalign="left">
<mml:mrow>
<mml:msub>
<mml:mi>N</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:mo>&#x2265;</mml:mo>
<mml:msub>
<mml:mi>N</mml:mi>
<mml:mn>0</mml:mn>
</mml:msub>
<mml:mo stretchy="false">(</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>35</mml:mn>
<mml:mo>%</mml:mo>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr columnalign="left">
<mml:mtd columnalign="left">
<mml:mrow>
<mml:mo>|</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mover accent="true">
<mml:mi>W</mml:mi>
<mml:mo stretchy="true">&#xaf;</mml:mo>
</mml:mover>
</mml:mrow>
<mml:mn>2</mml:mn>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>0.496</mml:mn>
<mml:mo>|</mml:mo>
<mml:mo>&#x2264;</mml:mo>
<mml:mo>|</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mover accent="true">
<mml:mi>W</mml:mi>
<mml:mo stretchy="true">&#xaf;</mml:mo>
</mml:mover>
</mml:mrow>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>0.496</mml:mn>
<mml:mo>|</mml:mo>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr columnalign="left">
<mml:mtd columnalign="left">
<mml:mrow>
<mml:mover accent="true">
<mml:mrow>
<mml:mi>M</mml:mi>
<mml:msub>
<mml:mi>c</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
</mml:mrow>
<mml:mo stretchy="true">&#xaf;</mml:mo>
</mml:mover>
<mml:mo>&#x2265;</mml:mo>
<mml:mover accent="true">
<mml:mrow>
<mml:mi>M</mml:mi>
<mml:msub>
<mml:mi>c</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
</mml:mrow>
<mml:mo stretchy="true">&#xaf;</mml:mo>
</mml:mover>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr columnalign="left">
<mml:mtd columnalign="left">
<mml:mrow>
<mml:mn>1667</mml:mn>
<mml:mo>&#x2264;</mml:mo>
<mml:mi>P</mml:mi>
<mml:mi>D</mml:mi>
<mml:mo>&#x2264;</mml:mo>
<mml:mn>3333</mml:mn>
</mml:mrow>
</mml:mtd>
</mml:mtr>
</mml:mtable>
</mml:mrow>
</mml:math>
</disp-formula>
<p>
<inline-formula>
<mml:math display="inline" id="im108">
<mml:mrow>
<mml:mover accent="true">
<mml:mrow>
<mml:mi>M</mml:mi>
<mml:msub>
<mml:mi>c</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
</mml:mrow>
<mml:mo stretchy="true">&#xaf;</mml:mo>
</mml:mover>
</mml:mrow>
</mml:math>
</inline-formula>, <inline-formula>
<mml:math display="inline" id="im109">
<mml:mrow>
<mml:mover accent="true">
<mml:mrow>
<mml:msub>
<mml:mi>S</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
</mml:mrow>
<mml:mo stretchy="true">&#xaf;</mml:mo>
</mml:mover>
</mml:mrow>
</mml:math>
</inline-formula>, <inline-formula>
<mml:math display="inline" id="im110">
<mml:mrow>
<mml:mover accent="true">
<mml:mrow>
<mml:msub>
<mml:mi>U</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
</mml:mrow>
<mml:mo stretchy="true">&#xaf;</mml:mo>
</mml:mover>
</mml:mrow>
</mml:math>
</inline-formula>, <inline-formula>
<mml:math display="inline" id="im111">
<mml:mrow>
<mml:mover accent="true">
<mml:mrow>
<mml:mi>C</mml:mi>
<mml:msub>
<mml:mi>I</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
</mml:mrow>
<mml:mo stretchy="true">&#xaf;</mml:mo>
</mml:mover>
</mml:mrow>
</mml:math>
</inline-formula>, <inline-formula>
<mml:math display="inline" id="im112">
<mml:mrow>
<mml:mover accent="true">
<mml:mrow>
<mml:msub>
<mml:mi>W</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
</mml:mrow>
<mml:mo stretchy="true">&#xaf;</mml:mo>
</mml:mover>
</mml:mrow>
</mml:math>
</inline-formula>, <inline-formula>
<mml:math display="inline" id="im113">
<mml:mrow>
<mml:msub>
<mml:mi>D</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>, <inline-formula>
<mml:math display="inline" id="im114">
<mml:mrow>
<mml:msub>
<mml:mi>T</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>, <inline-formula>
<mml:math display="inline" id="im115">
<mml:mrow>
<mml:mi>C</mml:mi>
<mml:mi>d</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>, <inline-formula>
<mml:math display="inline" id="im116">
<mml:mrow>
<mml:msub>
<mml:mi>N</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> respectively represent the values of complete mingling, stratification index, neighborhood comparison, crown competition index, uniform angle index, tree diameter classes, number of species, canopy density, and harvesting intensity after selective harvesting. <inline-formula>
<mml:math display="inline" id="im117">
<mml:mrow>
<mml:mo>&#xa0;</mml:mo>
<mml:mover accent="true">
<mml:mrow>
<mml:mi>M</mml:mi>
<mml:msub>
<mml:mi>c</mml:mi>
<mml:mn>0</mml:mn>
</mml:msub>
</mml:mrow>
<mml:mo stretchy="true">&#xaf;</mml:mo>
</mml:mover>
</mml:mrow>
</mml:math>
</inline-formula>, <inline-formula>
<mml:math display="inline" id="im118">
<mml:mrow>
<mml:mover accent="true">
<mml:mrow>
<mml:msub>
<mml:mi>S</mml:mi>
<mml:mn>0</mml:mn>
</mml:msub>
</mml:mrow>
<mml:mo stretchy="true">&#xaf;</mml:mo>
</mml:mover>
</mml:mrow>
</mml:math>
</inline-formula>, <inline-formula>
<mml:math display="inline" id="im119">
<mml:mrow>
<mml:mover accent="true">
<mml:mrow>
<mml:msub>
<mml:mi>U</mml:mi>
<mml:mn>0</mml:mn>
</mml:msub>
</mml:mrow>
<mml:mo stretchy="true">&#xaf;</mml:mo>
</mml:mover>
</mml:mrow>
</mml:math>
</inline-formula>, <inline-formula>
<mml:math display="inline" id="im120">
<mml:mrow>
<mml:mover accent="true">
<mml:mrow>
<mml:mi>C</mml:mi>
<mml:msub>
<mml:mi>I</mml:mi>
<mml:mn>0</mml:mn>
</mml:msub>
</mml:mrow>
<mml:mo stretchy="true">&#xaf;</mml:mo>
</mml:mover>
</mml:mrow>
</mml:math>
</inline-formula>, <inline-formula>
<mml:math display="inline" id="im121">
<mml:mrow>
<mml:mover accent="true">
<mml:mrow>
<mml:msub>
<mml:mi>W</mml:mi>
<mml:mn>0</mml:mn>
</mml:msub>
</mml:mrow>
<mml:mo stretchy="true">&#xaf;</mml:mo>
</mml:mover>
</mml:mrow>
</mml:math>
</inline-formula>, <inline-formula>
<mml:math display="inline" id="im122">
<mml:mrow>
<mml:msub>
<mml:mi>D</mml:mi>
<mml:mn>0</mml:mn>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>, <inline-formula>
<mml:math display="inline" id="im123">
<mml:mrow>
<mml:msub>
<mml:mi>T</mml:mi>
<mml:mn>0</mml:mn>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>, <inline-formula>
<mml:math display="inline" id="im124">
<mml:mrow>
<mml:mi>C</mml:mi>
<mml:mi>d</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>, <inline-formula>
<mml:math display="inline" id="im125">
<mml:mrow>
<mml:msub>
<mml:mi>N</mml:mi>
<mml:mn>0</mml:mn>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> represent the values of the initial stand for the following indicators. <inline-formula>
<mml:math display="inline" id="im126">
<mml:mrow>
<mml:mover accent="true">
<mml:mrow>
<mml:mi>M</mml:mi>
<mml:msub>
<mml:mi>c</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
</mml:mrow>
<mml:mo stretchy="true">&#xaf;</mml:mo>
</mml:mover>
</mml:mrow>
</mml:math>
</inline-formula>, <inline-formula>
<mml:math display="inline" id="im127">
<mml:mrow>
<mml:mover accent="true">
<mml:mrow>
<mml:msub>
<mml:mi>W</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
</mml:mrow>
<mml:mo stretchy="true">&#xaf;</mml:mo>
</mml:mover>
</mml:mrow>
</mml:math>
</inline-formula> represent the values of after complete mingling and uniform angle index after replanting. <inline-formula>
<mml:math display="inline" id="im128">
<mml:mrow>
<mml:mi>P</mml:mi>
<mml:mi>D</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula> represents the stand density after selective redharvesting and replanting optimization.</p>
</sec>
<sec id="s2_8_2">
<label>2.8.2</label>
<title>Model construction</title>
<p>Stand structure optimization is a multi-objective problem that typically involves multiple interrelated goals. Since these objectives are often mutually constraining, it is difficult to achieve their individual optima simultaneously. Therefore, it is necessary to adopt an integrated approach and balance multiple objectives from the perspective of the overall stand. In the optimization process, the complete mingling and stratification index should be increased to enhance stand diversity and stability; the crown competition index and neighborhood comparison should be reduced to alleviate competition among individuals and prevent excessive dominance by a few large trees; and the uniform angle index should be maintained within the range close to random distribution to ensure a reasonable horizontal pattern. Accordingly, in this study, five spatial structure parameters&#x2014;uniform angle index, neighborhood comparison, complete mingling, stratification index, and crown competition index&#x2014;were incorporated into a multi-objective optimization model using a multiplicative&#x2013;divisive approach to construct the objective function (<xref ref-type="disp-formula" rid="eq18">Equation 18</xref>):</p>
<disp-formula id="eq18">
<label>(18)</label>
<mml:math display="block" id="M18">
<mml:mrow>
<mml:mi>m</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>x</mml:mi>
<mml:mi>L</mml:mi>
<mml:mo>=</mml:mo>
<mml:mfrac>
<mml:mn>1</mml:mn>
<mml:mi>n</mml:mi>
</mml:mfrac>
<mml:munderover>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mi>N</mml:mi>
</mml:munderover>
<mml:mfrac>
<mml:mrow>
<mml:mfrac>
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>+</mml:mo>
<mml:mi>M</mml:mi>
<mml:msub>
<mml:mi>c</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mrow>
<mml:msub>
<mml:mi>&#x3b4;</mml:mi>
<mml:mrow>
<mml:mi>M</mml:mi>
<mml:mi>c</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfrac>
<mml:mo>&#xb7;</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>+</mml:mo>
<mml:msub>
<mml:mi>S</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mrow>
<mml:msub>
<mml:mi>&#x3b4;</mml:mi>
<mml:mi>S</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfrac>
</mml:mrow>
<mml:mrow>
<mml:mfrac>
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>+</mml:mo>
<mml:msub>
<mml:mi>U</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mrow>
<mml:msub>
<mml:mi>&#x3b4;</mml:mi>
<mml:mi>U</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfrac>
<mml:mo>&#xb7;</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>+</mml:mo>
<mml:mi>C</mml:mi>
<mml:msub>
<mml:mi>I</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mrow>
<mml:msub>
<mml:mi>&#x3b4;</mml:mi>
<mml:mrow>
<mml:mi>C</mml:mi>
<mml:mi>I</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfrac>
<mml:mo>&#xb7;</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>+</mml:mo>
<mml:mo>|</mml:mo>
<mml:msub>
<mml:mi>W</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>0.496</mml:mn>
<mml:mo>|</mml:mo>
</mml:mrow>
<mml:mrow>
<mml:msub>
<mml:mi>&#x3b4;</mml:mi>
<mml:mrow>
<mml:mo>|</mml:mo>
<mml:msub>
<mml:mi>W</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>0.496</mml:mn>
<mml:mo>|</mml:mo>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfrac>
</mml:mrow>
</mml:mfrac>
</mml:mrow>
</mml:math>
</disp-formula>
<p>
<italic>W<sub>i</sub>
</italic>, <italic>Mc<sub>i</sub>
</italic>, <italic>S<sub>i</sub>
</italic>, <italic>U<sub>i</sub>
</italic> and <italic>CI<sub>i</sub>
</italic> represent the uniform angle index, complete mingling, stratification index, neighborhood comparison, and crown competition index of the reference tree, respectively. <italic>&#x3b4;<sub>W</sub>
</italic>, <italic>&#x3b4;<sub>M</sub>c</italic>, <italic>&#x3b4;<sub>S</sub>
</italic>, <italic>&#x3b4;<sub>W</sub></italic>and <italic>&#x3b4;<sub>CI</sub>
</italic> are the standard deviations of these structural indexes. <italic>N</italic> represents the total number of trees in the forest stand.</p>
</sec>
</sec>
<sec id="s2_9">
<label>2.9</label>
<title>Solution algorithm</title>
<sec id="s2_9_1">
<label>2.9.1</label>
<title>Multi-agent deep reinforcement learning</title>
<p>This study selected multi-agent deep Q-network (MADQN) as the solution algorithm. The MADQN model incorporates deep Q-network (DQN) and multi-agent Q-learning (MAQL). Each agent utilizes a deep neural network to approximate the Q-value function, enabling decision-making in large-scale and complex state spaces. By leveraging experience replay and target networks, the model achieves faster convergence, avoids overfitting, and ensures policy stability and generalization capability.</p>
<p>In the application of MADQN for stand structure optimization, selective harvesting and replanting serve as two key regulatory measures. Two agents, Agent1 and Agent2, were designed to achieve optimization. Each agent has its own tasks and objectives, interacting with the environment while also collaborating with each other. Through continuous learning, they work together to optimize the objective function of stand structure.Agent1 selects trees for selective harvesting based on the random selection method and adjusts its strategy according to the impact of tree removal on the objective function value. After harvesting, if the selected trees result in an increase in the objective function value, Agent1 receives a reward; otherwise, it is penalized. Through this process, Agent1 gradually learns how to select trees for harvesting, aiming to minimize unnecessary losses while maximizing the improvement of the stand&#x2019;s objective function during the harvesting process.</p>
<p>Agent2 determines the number of replanted trees and their distribution based on the stand condition after Agent1 has completed selective harvesting and received its reward. Its goal is to compensate for gaps created by harvesting and introduce appropriate tree species to optimize stand structure, enhancing growth potential and ecological benefits. After harvesting, Agent2 utilizes the RFI to identify suitable planting locations. It then applies a curve trend-based approach (<xref ref-type="bibr" rid="B55">Xuan et&#xa0;al., 2024</xref>) to optimize the number of replanted trees. Specifically, it selects three evenly spaced replanting densities and evaluates their corresponding objective function values to establish a trend curve. Based on this trend, Agent2 adjusts the number of replanted trees by selecting new values with the same spacing before and after the current replanting density. This approach leverages curve monotonicity and extremum detection to assign rewards or penalties, refining the sampling strategy to gradually determine the optimal number of replanted trees. This ensures that under the given harvesting conditions, the replanting effect is maximized for optimal stand structure recovery.</p>
<p>Agent1 and Agent2 are interdependent and interact throughout the optimization process. Agent1&#x2019;s selective harvesting decisions directly influence Agent2&#x2019;s replanting strategy, while Agent2&#x2019;s replanting results, in turn, affect the post-harvesting stand condition and consequently impact the objective function value. Through a reward and penalty mechanism, both agents continuously adjust their strategies, enabling a coordinated optimization process that dynamically balances selective harvesting and replanting to achieve the best possible stand structure.</p>
<p>The process of solving stand structure optimization using multi-agent deep reinforcement learning is illustrated in <xref ref-type="fig" rid="f6">
<bold>Figure&#xa0;6</bold>
</xref> (<xref ref-type="boxed-text" rid="algo1">
<bold>Algorithms 1</bold>
</xref>&#x2013;<xref ref-type="boxed-text" rid="algo3">
<bold>3</bold>
</xref>).</p>
<fig id="f6" position="float">
<label>Figure&#xa0;6</label>
<caption>
<p>MADQN for stand structure optimization.</p>
</caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fpls-16-1610571-g006.tif">
<alt-text content-type="machine-generated">Flowchart illustrating decision-making for cutting and replanting agents. It includes frames for agent actions, state changes, environment constraints, and rewards or punishments. Arrows indicate transitions between frames, highlighting optimizing directions for action. The cutting agent receives different levels of rewards or punishments based on satisfying constraints, while the replanting agent selects replanting quantities, calculating outcomes with rewards and punishments. Both processes feed into a replay buffer connected to neural networks, emphasizing learning from actions to minimize loss.</alt-text>
</graphic>
</fig>
</sec>
<sec id="s2_9_2">
<label>2.9.2</label>
<title>Solution for dynamic stand structure optimization</title>
<p>During the subsequent optimization process, the selective harvesting and replanting agents continuously collaborate and interact, iteratively optimizing the current stand condition to achieve the most optimal stand structure. In each optimization cycle, the agents learn from environmental feedback, gradually approaching the structural characteristics of an ideal stand. However, real-world stand structures are influenced by multiple factors, and relying solely on selective harvesting and replanting may not directly achieve the desired stand structure. Therefore, a stand structure prediction model is incorporated as a crucial step to further enhance the accuracy and effectiveness of the optimization process.</p>
<p>The stand structure prediction model is used to forecast tree growth trends over a future period based on the current stand condition, as well as the potential changes after selective harvesting and replanting. After providing predictions on the current stand status, the agents further optimize the coordination between harvesting and replanting. At this stage, the selective harvesting and replanting agents not only rely on their original decision framework but also adjust the stand structure based on the prediction results. This process operates as a cyclic feedback mechanism, where each optimization generates a new stand condition, which in turn serves as the starting point for the next round of optimization. After each selective harvesting and replanting step, the updated stand condition is fed into the stand structure prediction model, and the model&#x2019;s prediction results influence the next round of harvesting and replanting decisions. Through this approach, harvesting and replanting decisions are dynamically adjusted, ensuring that each step moves closer to an ideal stand structure. This iterative optimization process allows the model to identify the best regulatory strategies in a complex and dynamically changing stand environment. By avoiding a fixed strategy from the outset, the optimization process becomes more flexible and adaptive to stand dynamics.</p>
<p>The solution process for dynamic stand structure optimization is illustrated in <xref ref-type="fig" rid="f7">
<bold>Figure&#xa0;7</bold>
</xref> (<xref ref-type="boxed-text" rid="algo1">
<bold>Algorithm 1</bold>
</xref>).</p>
<fig id="f7" position="float">
<label>Figure&#xa0;7</label>
<caption>
<p>Dynamic optimization process flowchart.</p>
</caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fpls-16-1610571-g007.tif">
<alt-text content-type="machine-generated">Flowchart illustrating a process starting with &#x201c;Begin&#x201d; and &#x201c;Initial Stand&#x201d;. It proceeds to &#x201c;Optimization using MADQN&#x201d; with options for &#x201c;Cutting&#x201d; and &#x201c;Replanting&#x201d;. The decision point &#x201c;Ideal Stand&#x201d; leads to either &#x201c;End&#x201d; if yes, or calculates AGE, DBH, H, CW, CL, Mort if no. This loops back for prediction and optimization until achieving the ideal stand.</alt-text>
</graphic>
</fig>
</sec>
<sec id="s2_9_3">
<label>2.9.3</label>
<title>Parameter settings</title>
<p>The parameter settings for the solution algorithm used in the experiment are shown in <xref ref-type="table" rid="T6">
<bold>Table&#xa0;6</bold>
</xref>. The initial iteration count and maximum iteration count for the solution algorithm were set to 0 and 1000, respectively. During the optimization process, the stand structure at different time periods is abstracted into a sequence. At the beginning of each iteration, the selective harvesting agent starts at the initial state (<inline-formula>
<mml:math display="inline" id="im154">
<mml:mrow>
<mml:mi>s</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi>e</mml:mi>
<mml:mn>1</mml:mn>
<mml:mo>=</mml:mo>
<mml:mn>0</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>), while the replanting agent starts at the final state (<inline-formula>
<mml:math display="inline" id="im155">
<mml:mrow>
<mml:mi>s</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi>e</mml:mi>
<mml:mn>2</mml:mn>
<mml:mo>=</mml:mo>
<mml:mn>100</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>). Both agents interact with the environment and collaborate with each other to decide whether to move forward <inline-formula>
<mml:math display="inline" id="im156">
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>s</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi>e</mml:mi>
<mml:mn>1</mml:mn>
<mml:mo>=</mml:mo>
<mml:mi>s</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi>e</mml:mi>
<mml:mn>1</mml:mn>
<mml:mo>+</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>,</mml:mo>
<mml:mi>s</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi>e</mml:mi>
<mml:mn>2</mml:mn>
<mml:mo>=</mml:mo>
<mml:mi>s</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi>e</mml:mi>
<mml:mn>2</mml:mn>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:math>
</inline-formula> or move backward <inline-formula>
<mml:math display="inline" id="im157">
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>s</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi>e</mml:mi>
<mml:mn>1</mml:mn>
<mml:mo>=</mml:mo>
<mml:mi>s</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi>e</mml:mi>
<mml:mn>1</mml:mn>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>,</mml:mo>
<mml:mi>s</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi>e</mml:mi>
<mml:mn>2</mml:mn>
<mml:mo>=</mml:mo>
<mml:mi>s</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi>e</mml:mi>
<mml:mn>2</mml:mn>
<mml:mo>+</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo stretchy="false">)</mml:mo>
<mml:mo>.</mml:mo>
</mml:mrow>
</mml:math>
</inline-formula> The iteration ends when the selective redharvesting agent and the replanting agent meet (<inline-formula>
<mml:math display="inline" id="im158">
<mml:mrow>
<mml:mi>s</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi>e</mml:mi>
<mml:mn>1</mml:mn>
<mml:mo>=</mml:mo>
<mml:mi>s</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi>e</mml:mi>
<mml:mn>2</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>). To compare the performance of MADQN and MAQL, both algorithms were set with the same hyperparameters (<inline-formula>
<mml:math display="inline" id="im159">
<mml:mrow>
<mml:mi>&#x3b3;</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>0.9</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>, <inline-formula>
<mml:math display="inline" id="im160">
<mml:mrow>
<mml:mi>l</mml:mi>
<mml:mi>r</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>0.01</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>, <inline-formula>
<mml:math display="inline" id="im161">
<mml:mrow>
<mml:mi>&#x3f5;</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>0.9</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>). Additionally, for MADQN, the experience replay buffer size was set to 10000, with a batch size of 32. A three-layer fully connected network was used, with each hidden layer containing 24 neurons. These parameter settings were obtained through multiple experiments and fine-tuning to achieve optimal results.</p>
<table-wrap id="T6" position="float">
<label>Table&#xa0;6</label>
<caption>
<p>Parameter settings of the solution algorithm.</p>
</caption>
<table frame="hsides">
<thead>
<tr>
<th valign="middle" align="center">Algorithms</th>
<th valign="middle" align="center">Settings</th>
<th valign="middle" align="center">Meaning</th>
</tr>
</thead>
<tbody>
<tr>
<td valign="middle" rowspan="13" align="center">MADQN</td>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im129">
<mml:mrow>
<mml:mi>W</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>0</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="middle" align="center">Initial iteration</td>
</tr>
<tr>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im130">
<mml:mrow>
<mml:msub>
<mml:mi>W</mml:mi>
<mml:mrow>
<mml:mi>m</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>x</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>=</mml:mo>
<mml:mn>10000</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="middle" align="center">Upper limit of iterations</td>
</tr>
<tr>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im131">
<mml:mrow>
<mml:mi>s</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi>e</mml:mi>
<mml:mn>1</mml:mn>
<mml:mo>=</mml:mo>
<mml:mn>0</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="middle" align="center">The agent1&#x2019;s initial location</td>
</tr>
<tr>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im132">
<mml:mrow>
<mml:mi>s</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi>e</mml:mi>
<mml:msub>
<mml:mn>1</mml:mn>
<mml:mrow>
<mml:mi>m</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>x</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>=</mml:mo>
<mml:mn>50</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="middle" align="center">The agent1&#x2019;s permitted farthest move distance</td>
</tr>
<tr>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im133">
<mml:mrow>
<mml:mi>s</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi>e</mml:mi>
<mml:mn>2</mml:mn>
<mml:mo>=</mml:mo>
<mml:mn>100</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="middle" align="center">The agent2&#x2019;s initial location</td>
</tr>
<tr>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im134">
<mml:mrow>
<mml:mi>s</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi>e</mml:mi>
<mml:msub>
<mml:mn>2</mml:mn>
<mml:mrow>
<mml:mi>m</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>x</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>=</mml:mo>
<mml:mn>50</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="middle" align="center">The agent2&#x2019;s permitted farthest move distance</td>
</tr>
<tr>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im135">
<mml:mrow>
<mml:mi>l</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>y</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>r</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>3</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="middle" align="center">Neural network depth</td>
</tr>
<tr>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im136">
<mml:mrow>
<mml:mi>b</mml:mi>
<mml:mi>u</mml:mi>
<mml:mi>f</mml:mi>
<mml:mi>f</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>r</mml:mi>
<mml:mo>_</mml:mo>
<mml:mi>s</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>z</mml:mi>
<mml:mi>e</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>10000</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="middle" align="center">Replay buffer capacity</td>
</tr>
<tr>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im137">
<mml:mrow>
<mml:mi>b</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi>c</mml:mi>
<mml:mi>h</mml:mi>
<mml:mo>_</mml:mo>
<mml:mi>s</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>z</mml:mi>
<mml:mi>e</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>32</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="middle" align="center">Batch size for sampling from the replay buffer</td>
</tr>
<tr>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im138">
<mml:mrow>
<mml:mi>&#x3b3;</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>0.9</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="middle" align="center">Discount factor</td>
</tr>
<tr>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im139">
<mml:mrow>
<mml:mi>l</mml:mi>
<mml:mi>r</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>0.01</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="middle" align="center">Learning rate</td>
</tr>
<tr>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im140">
<mml:mrow>
<mml:mi>&#x3f5;</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>0.9</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="middle" align="center">exploration rate for <inline-formula>
<mml:math display="inline" id="im141">
<mml:mi>&#x3f5;</mml:mi>
</mml:math>
</inline-formula>-greedy strategy</td>
</tr>
<tr>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im142">
<mml:mrow>
<mml:mi>a</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>150</mml:mn>
<mml:mo>,</mml:mo>
<mml:mi>b</mml:mi>
<mml:mo>=</mml:mo>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>50</mml:mn>
<mml:mo>,</mml:mo>
<mml:mi>c</mml:mi>
<mml:mn>1</mml:mn>
<mml:mo>=</mml:mo>
<mml:mn>100</mml:mn>
<mml:mo>,</mml:mo>
<mml:mi>c</mml:mi>
<mml:mn>2</mml:mn>
<mml:mo>=</mml:mo>
<mml:mn>50</mml:mn>
<mml:mo>,</mml:mo>
<mml:mi>c</mml:mi>
<mml:mn>3</mml:mn>
<mml:mo>=</mml:mo>
<mml:mn>10</mml:mn>
<mml:mo>,</mml:mo>
<mml:mi>c</mml:mi>
<mml:mn>4</mml:mn>
<mml:mo>=</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>,</mml:mo>
<mml:mi>c</mml:mi>
<mml:mn>5</mml:mn>
<mml:mo>=</mml:mo>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>,</mml:mo>
<mml:mi>c</mml:mi>
<mml:mn>6</mml:mn>
<mml:mo>=</mml:mo>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>50</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="middle" align="center">Reward and punishment values</td>
</tr>
<tr>
<td valign="middle" rowspan="10" align="center">MAQL</td>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im143">
<mml:mrow>
<mml:mi>W</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>0</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="middle" align="center">Initial iteration</td>
</tr>
<tr>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im144">
<mml:mrow>
<mml:msub>
<mml:mi>W</mml:mi>
<mml:mrow>
<mml:mi>m</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>x</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>=</mml:mo>
<mml:mn>10000</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="middle" align="center">Upper limit of iterations</td>
</tr>
<tr>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im145">
<mml:mrow>
<mml:mi>s</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi>e</mml:mi>
<mml:mn>1</mml:mn>
<mml:mo>=</mml:mo>
<mml:mn>0</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="middle" align="center">The agent1&#x2019;s initial location</td>
</tr>
<tr>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im146">
<mml:mrow>
<mml:mi>s</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi>e</mml:mi>
<mml:msub>
<mml:mn>1</mml:mn>
<mml:mrow>
<mml:mi>m</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>x</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>=</mml:mo>
<mml:mn>50</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="middle" align="center">The agent1&#x2019;s permitted farthest move distance</td>
</tr>
<tr>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im147">
<mml:mrow>
<mml:mi>s</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi>e</mml:mi>
<mml:mn>2</mml:mn>
<mml:mo>=</mml:mo>
<mml:mn>100</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="middle" align="center">The agent2&#x2019;s initial location</td>
</tr>
<tr>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im148">
<mml:mrow>
<mml:mi>s</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi>e</mml:mi>
<mml:msub>
<mml:mn>2</mml:mn>
<mml:mrow>
<mml:mi>m</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>x</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>=</mml:mo>
<mml:mn>50</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="middle" align="center">The agent2&#x2019;s permitted farthest move distance</td>
</tr>
<tr>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im149">
<mml:mrow>
<mml:mi>&#x3b3;</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>0.9</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="middle" align="center">Discount factor</td>
</tr>
<tr>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im150">
<mml:mrow>
<mml:mi>l</mml:mi>
<mml:mi>r</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>0.01</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="middle" align="center">Learning rate</td>
</tr>
<tr>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im151">
<mml:mrow>
<mml:mi>&#x3f5;</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>0.9</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="middle" align="center">exploration rate for <inline-formula>
<mml:math display="inline" id="im152">
<mml:mi>&#x3f5;</mml:mi>
</mml:math>
</inline-formula>-greedy strategy</td>
</tr>
<tr>
<td valign="middle" align="center">
<inline-formula>
<mml:math display="inline" id="im153">
<mml:mrow>
<mml:mi>a</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>150</mml:mn>
<mml:mo>,</mml:mo>
<mml:mi>b</mml:mi>
<mml:mo>=</mml:mo>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>50</mml:mn>
<mml:mo>,</mml:mo>
<mml:mi>c</mml:mi>
<mml:mn>1</mml:mn>
<mml:mo>=</mml:mo>
<mml:mn>100</mml:mn>
<mml:mo>,</mml:mo>
<mml:mi>c</mml:mi>
<mml:mn>2</mml:mn>
<mml:mo>=</mml:mo>
<mml:mn>50</mml:mn>
<mml:mo>,</mml:mo>
<mml:mi>c</mml:mi>
<mml:mn>3</mml:mn>
<mml:mo>=</mml:mo>
<mml:mn>10</mml:mn>
<mml:mo>,</mml:mo>
<mml:mi>c</mml:mi>
<mml:mn>4</mml:mn>
<mml:mo>=</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>,</mml:mo>
<mml:mi>c</mml:mi>
<mml:mn>5</mml:mn>
<mml:mo>=</mml:mo>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>,</mml:mo>
<mml:mi>c</mml:mi>
<mml:mn>6</mml:mn>
<mml:mo>=</mml:mo>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>50</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="middle" align="center">Reward and punishment values</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>In structured forest management, neighborhood comparison, representing size differentiation and competition intensity, complete mingling, indicating species segregation, and uniform angle index, describing horizontal distribution patterns, are the three most important spatial structure indexes. Considering the limitations of <italic>Pinus yunnanensis</italic> secondary forest plots, <inline-formula>
<mml:math display="inline" id="im162">
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>U</mml:mi>
<mml:mo>&#x2264;</mml:mo>
<mml:mn>0.5</mml:mn>
<mml:mo>,</mml:mo>
<mml:mi>M</mml:mi>
<mml:mi>c</mml:mi>
<mml:mo>&#x2265;</mml:mo>
<mml:mn>0.75</mml:mn>
<mml:mo>,</mml:mo>
<mml:mn>0.475</mml:mn>
<mml:mo>&#x2264;</mml:mo>
<mml:mi>W</mml:mi>
<mml:mo>&#x2264;</mml:mo>
<mml:mn>0.517</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>) is selected as the ideal stand structure characteristic for dynamic stand structure optimization (<xref ref-type="bibr" rid="B14">Gangying et&#xa0;al., 2005</xref>, <xref ref-type="bibr" rid="B15">2018</xref>).</p>
</sec>
</sec>
</sec>
<sec id="s3" sec-type="results">
<label>3</label>
<title>Results</title>
<p>To verify the effectiveness of the multi-agent deep reinforcement learning solution in stand structure optimization, this study selected five standard plots with different densities and site conditions for simulation experiments. For optimizing the current stand condition, a comparative experiment was conducted between the MADQN and MAQL under the same selective harvesting and replanting methods to evaluate the optimization advantages of MADQN. In the dynamic optimization process, MADQN was integrated with stand structure prediction to enable dynamic adjustments and optimization of the stand structure over time.</p>
<sec id="s3_1">
<label>3.1</label>
<title>Results of simulated harvesting optimization</title>
<sec id="s3_1_1">
<label>3.1.1</label>
<title>Current stand structure optimization</title>
<p>As shown in <xref ref-type="fig" rid="f8">
<bold>Figure&#xa0;8</bold>
</xref>, after implementing the two optimization schemes for coordinated selective harvesting and replanting, the stand structure indexes in each plot improved to varying degrees while meeting the constraint conditions, effectively enhancing stand structure. The average uniform angle index in each plot slightly decreased its deviation from 0.496, indicating that the horizontal distribution pattern of the stands became more randomly distributed. The complete mingling index significantly increased across all plots, particularly because the initial mingling degree in each plot was extremely low, leaving ample room for improvement. Notably, in Plot P4, the increase reached 16602.09%. Additionally, the crown competition index decreased substantially in all plots, indicating that tree competition pressure was alleviated after optimization. The stratification index showed a moderate increase, suggesting an improvement in vertical structural complexity and a more diverse vertical distribution pattern. However, the neighborhood comparison showed minimal changes across all plots. This is likely due to the fact that the initial average neighborhood comparison values were already in a moderate growth state, limiting the potential for significant improvement.</p>
<fig id="f8" position="float">
<label>Figure&#xa0;8</label>
<caption>
<p>Changes in structure indexes after current stand optimization.</p>
</caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fpls-16-1610571-g008.tif">
<alt-text content-type="machine-generated">Six bar charts compare parameter changes for five variables, labeled P1 to P5. Each chart contrasts changes between two methods, MAQL (orange) and MADQN (green). The top row charts show &#x201c;Difference between W and 0.496&#x201d; and &#x201c;CI,&#x201d; highlighting negative changes. The middle row illustrates &#x201c;U&#x201d; with changes slightly negative, and &#x201c;P1-P3&#x201d; over &#x201c;P4-P5&#x201d; depicting increases. The bottom row shows &#x201c;Mc&#x201d; with substantial increases, and &#x201c;S&#x201d; with moderate parameter changes. Each chart presents different scales of percent changes.</alt-text>
</graphic>
</fig>
<p>As shown in <xref ref-type="table" rid="T7">
<bold>Table&#xa0;7</bold>
</xref>, in the current stand structure optimization, both MADQN and MAQL significantly improved the objective function values. However, in terms of overall improvement, MADQN consistently outperformed MAQL. The objective function values for plots P1 to P5 under MADQN optimization increased from 0.3501, 0.3799, 0.3982, 0.3344, and 0.4294 to 0.5378, 0.5861, 0.5860, 0.5130, and 0.6034, respectively&#x2014;higher than the values achieved by MAQL (0.5302, 0.5369, 0.5766, 0.5014, and 0.5906). The improvement rate under MADQN reached 49.40%, exceeding the 44.58% achieved by MAQL. These results indicate that MADQN is more effective in optimizing stand structure, guiding it toward a more optimal target state.</p>
<table-wrap id="T7" position="float">
<label>Table&#xa0;7</label>
<caption>
<p>Current stand structure optimization under different optimization schemes across various plots.</p>
</caption>
<table frame="hsides">
<thead>
<tr>
<th valign="middle" align="center">Stand Condition</th>
<th valign="middle" align="center">P1</th>
<th valign="middle" align="center">P2</th>
<th valign="middle" align="center">P3</th>
<th valign="middle" align="center">P4</th>
<th valign="middle" align="center">P5</th>
<th valign="middle" align="center">Average</th>
<th valign="middle" align="center">Increase</th>
</tr>
</thead>
<tbody>
<tr>
<td valign="middle" align="center">Initial Stand</td>
<td valign="middle" align="center">0.3501</td>
<td valign="middle" align="center">0.3799</td>
<td valign="middle" align="center">0.3982</td>
<td valign="middle" align="center">0.3344</td>
<td valign="middle" align="center">0.4294</td>
<td valign="middle" align="center">0.3784</td>
<td valign="middle" align="center"/>
</tr>
<tr>
<td valign="middle" align="center">MADQN</td>
<td valign="middle" align="center">0.5378</td>
<td valign="middle" align="center">0.5861</td>
<td valign="middle" align="center">0.5860</td>
<td valign="middle" align="center">0.5130</td>
<td valign="middle" align="center">0.6034</td>
<td valign="middle" align="center">0.5653</td>
<td valign="middle" align="center">49.40%</td>
</tr>
<tr>
<td valign="middle" align="center">MAQL</td>
<td valign="middle" align="center">0.5302</td>
<td valign="middle" align="center">0.5369</td>
<td valign="middle" align="center">0.5766</td>
<td valign="middle" align="center">0.5014</td>
<td valign="middle" align="center">0.5906</td>
<td valign="middle" align="center">0.5471</td>
<td valign="middle" align="center">44.58%</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>As shown in <xref ref-type="fig" rid="f9">
<bold>Figure&#xa0;9</bold>
</xref>, MADQN outperformed MAQL in terms of the number of iterations required for optimization. After different numbers of iterations, MADQN exhibited a faster increase in objective function values, especially in Plots P2 and P4. This indicates that MADQN, which utilizes deep neural networks to approximate the Q-function, can find optimal strategies more quickly during the optimization process compared to MAQL, which relies on table-based Q-learning. As a result, MADQN requires less extensive exploration and achieves higher learning efficiency. It is worth noting that in Plots P1 and P3, although MADQN achieved a higher objective function value, MAQL required slightly fewer iterations to converge. This suggests that stand density and site conditions influence convergence performance, and in certain cases, MAQL&#x2019;s convergence efficiency is not necessarily inferior to MADQN. As shown in <xref ref-type="fig" rid="f10">
<bold>Figure&#xa0;10</bold>
</xref>, MADQN also demonstrated better overall performance in terms of computational efficiency. Across different plots, MADQN consistently maintained a lower or comparable runtime curve compared to MAQL, indicating superior time efficiency.</p>
<fig id="f9" position="float">
<label>Figure&#xa0;9</label>
<caption>
<p>Convergence states of different optimised strategies in different plots.</p>
</caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fpls-16-1610571-g009.tif">
<alt-text content-type="machine-generated">Five line graphs labeled P1 to P5 compare the performance of MAQL (black line) and MADQN (red line) over 400 iterations. Each graph shows function values increasing and stabilizing, with MADQN consistently reaching higher values than MAQL across all panels.</alt-text>
</graphic>
</fig>
<fig id="f10" position="float">
<label>Figure&#xa0;10</label>
<caption>
<p>Running time of different optimised strategies in different plots.</p>
</caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fpls-16-1610571-g010.tif">
<alt-text content-type="machine-generated">Five line graphs showing the value of a function over running time for scenarios P1 to P5. Each graph compares two methods: MAQL (black line) and MADQN (red line). The x-axis represents running time in minutes, ranging from zero to twenty thousand, and the y-axis represents function values ranging from zero point three five to zero point six. In each graph, MADQN consistently achieves higher values than MAQL, particularly evident at early time stages.</alt-text>
</graphic>
</fig>
</sec>
<sec id="s3_1_2">
<label>3.1.2</label>
<title>Dynamic stand structure optimization</title>
<p>In the dynamic stand structure optimization of five plots using multi-agent deep reinforcement learning combined with structure prediction, most stand structure indexes showed significant improvements after optimization. The uniform angle index for all plots fell within the ideal range of [0.475, 0.517], indicating that the horizontal distribution pattern had reached a random distribution state. The complete mingling index increased substantially across all plots, shifting from a very low mingling state to a high mingling state. This demonstrates that dynamic optimization not only adjusts the spatial relationships among trees but also enhances stand stability and biodiversity at the species level. Notably, in Plot P4, the mingling index increased from 0.0028 to 0.7505, highlighting the strong adaptability of multi-agent deep reinforcement learning in adjusting tree species composition. Additionally, the crown competition index significantly decreased across all plots, indicating a considerable reduction in competition pressure. The stratification index also improved effectively, enhancing the vertical distribution pattern. In contrast, the neighborhood comparison showed minimal decline across all plots, suggesting that the pre-optimization stand already exhibited a relatively stable size differentiation state. As a result, despite some adjustments during optimization, fluctuations in this index remained small.</p>
<p>As shown in <xref ref-type="table" rid="T8">
<bold>Table&#xa0;8</bold>
</xref>, after incorporating structure prediction for dynamic optimization, the objective function values for all plots experienced significant improvements. Notably, in Plot P4, the objective function value increased from 0.3344 to 0.5863, achieving a remarkable 75.33% increase. Even in Plot P5, where the improvement was relatively smaller, the increase still reached 44.62%. These results indicate that dynamic optimization using multi-agent deep reinforcement learning combined with structure prediction effectively enhances stand structure stability and balance, making it more aligned with an ideal management state.</p>
<table-wrap id="T8" position="float">
<label>Table&#xa0;8</label>
<caption>
<p>Dynamic stand structure optimization under different optimization schemes across various plots.</p>
</caption>
<table frame="hsides">
<thead>
<tr>
<th valign="middle" align="center">Sample Plot</th>
<th valign="middle" align="center">Stand Condition</th>
<th valign="middle" align="center">
<italic>W</italic>
</th>
<th valign="middle" align="center">
<italic>Mc</italic>
</th>
<th valign="middle" align="center">
<italic>CI</italic>
</th>
<th valign="middle" align="center">
<italic>S</italic>
</th>
<th valign="middle" align="center">
<italic>U</italic>
</th>
<th valign="middle" align="center">
<italic>L</italic>
</th>
<th valign="middle" align="center">Years</th>
<th valign="middle" align="center">Increase</th>
</tr>
</thead>
<tbody>
<tr>
<td valign="middle" align="center">P1</td>
<td valign="middle" align="center">Initial Stand <break/>After Optimizing</td>
<td valign="middle" align="center">0.3630<break/>0.4785</td>
<td valign="middle" align="center">0.1459<break/>0.7615</td>
<td valign="middle" align="center">2.713<break/>0.2041</td>
<td valign="middle" align="center">0.2205<break/>0.3126</td>
<td valign="middle" align="center">0.4960<break/>0.4914</td>
<td valign="middle" align="center">0.3501<break/>0.5718</td>
<td valign="middle" align="center">20</td>
<td valign="middle" align="center">63.32%</td>
</tr>
<tr>
<td valign="middle" align="center">P2</td>
<td valign="middle" align="center">Initial Stand <break/>After Optimizing</td>
<td valign="middle" align="center">0.5612<break/>0.4869</td>
<td valign="middle" align="center">0.1693<break/>0.7774</td>
<td valign="middle" align="center">3.4130<break/>0.2226</td>
<td valign="middle" align="center">0.2772<break/>0.3450</td>
<td valign="middle" align="center">0.4906<break/>0.4860</td>
<td valign="middle" align="center">0.3799<break/>0.6101</td>
<td valign="middle" align="center">20</td>
<td valign="middle" align="center">60.59%</td>
</tr>
<tr>
<td valign="middle" align="center">P3</td>
<td valign="middle" align="center">Initial Stand <break/>After Optimizing</td>
<td valign="middle" align="center">0.3867<break/>0.4768</td>
<td valign="middle" align="center">0.1990<break/>0.7786</td>
<td valign="middle" align="center">4.0990<break/>0.2745</td>
<td valign="middle" align="center">0.3286<break/>0.3535</td>
<td valign="middle" align="center">0.4965<break/>0.4852</td>
<td valign="middle" align="center">0.3982<break/>0.6455</td>
<td valign="middle" align="center">35</td>
<td valign="middle" align="center">62.10%</td>
</tr>
<tr>
<td valign="middle" align="center">P4</td>
<td valign="middle" align="center">Initial Stand <break/>After Optimizing</td>
<td valign="middle" align="center">0.2103<break/>0.4826</td>
<td valign="middle" align="center">0.0028<break/>0.7505</td>
<td valign="middle" align="center">3.1363<break/>0.2475</td>
<td valign="middle" align="center">0.2846<break/>0.3512</td>
<td valign="middle" align="center">0.4930<break/>0.4788</td>
<td valign="middle" align="center">0.3344<break/>0.5863</td>
<td valign="middle" align="center">40</td>
<td valign="middle" align="center">75.33%</td>
</tr>
<tr>
<td valign="middle" align="center">P5</td>
<td valign="middle" align="center">Initial Stand <break/>After Optimizing</td>
<td valign="middle" align="center">0.5551<break/>0.5102</td>
<td valign="middle" align="center">0.1443<break/>0.7511</td>
<td valign="middle" align="center">2.8202<break/>0.2468</td>
<td valign="middle" align="center">0.2882<break/>0.3573</td>
<td valign="middle" align="center">0.4950<break/>0.4954</td>
<td valign="middle" align="center">0.4294<break/>0.6210</td>
<td valign="middle" align="center">15</td>
<td valign="middle" align="center">44.62%</td>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
</sec>
</sec>
<sec id="s4" sec-type="discussion">
<label>4</label>
<title>Discussion</title>
<p>To avoid the limitations of relying solely on selective harvesting for optimization, this study proposed a multi-objective stand structure optimization scheme based on multi-agent deep reinforcement learning. A simulation experiment was conducted using sample plot data from Pinus yunnanensis secondary forests in Southwest China, where MADQN was applied for the simulation and compared with a multi-agent reinforcement learning optimization scheme. The results showed that under both optimization algorithms, stand structure indexes improved to varying degrees across all plots. However, compared to MAQL, MADQN consistently achieved higher optimization gains across different stand conditions, demonstrating greater adaptability and stability. These findings indicate that multi-agent deep reinforcement learning can learn more optimal strategies in complex environments and achieve more comprehensive optimization in a shorter time.</p>
<p>Traditional multi-agent reinforcement learning is limited by the dimensionality of the state-action space, especially in complex optimization environments like stand structure optimization. Stand structure features exhibit nonlinearity and continuity, making it difficult for MARL to store Q-values in a tabular format. This leads to high storage overhead and low generalization ability. In contrast, multi-agent deep reinforcement learning stores Q-values in a parametric form using neural networks to extract stand structure features. It also employs strategies such as experience replay and target networks to improve training efficiency and stability (<xref ref-type="bibr" rid="B16">Gronauer and Diepold, 2022</xref>) (<xref ref-type="bibr" rid="B42">Shen et&#xa0;al., 2022</xref>). This allows the same agents, under selective harvesting and replanting measures, to learn more smoothly and approach a globally optimal optimization strategy, with superior convergence capabilities.</p>
<p>Although multi-agent deep reinforcement learning has significant advantages in optimization efficiency and result accuracy for stand structure optimization, the optimal strategy derived from multi-agent deep reinforcement learning is based solely on the current stand structure. However, stand structure is a dynamic system that changes over time due to factors such as tree growth, mortality, and human intervention. Relying solely on optimizing the current stand condition may not meet the long-term management needs of the forest. Currently, stand structure prediction models can utilize tree factors from the current state, such as diameter at breast height, tree height, crown width, crown length, etc., to predict the future trend of these factors, thereby simulating the natural evolution of the stand (<xref ref-type="bibr" rid="B2">Ali, 2019</xref>). In this study, multi-agent deep reinforcement learning was combined with structure prediction, providing dynamic environmental information to the optimization process. This allows the optimization strategy to not only apply to the current stand state but also be dynamically optimized based on the predicted stand evolution trend, enabling the agents to formulate more robust strategies while considering long-term dynamic changes. In the combined optimization process with stand structure prediction, the agents can adjust the spatial configuration of trees in advance, based on the predicted stand evolution information, and allocate growth resources more effectively. This ensures that the optimization effect remains stable over the long term. Since changes in stand structure occur gradually, the optimization strategy can dynamically respond to potential future risks, such as intensified competition or mortality, ensuring that the stand structure remains balanced during the succession process and avoiding structural imbalance issues caused by short-term optimization. This approach is better suited to the developmental needs of the stand over different time scales. On the other hand, integrating stand structure prediction also affects the optimization time and strategy adjustment approach. Without prediction, the agents typically require more iterations to adapt to environmental changes. However, by incorporating the prediction model, the agents can obtain future potential structural changes earlier, reducing unnecessary exploration and improving optimization efficiency. Moreover, the long-term trend information provided by the prediction model allows for more precise optimization strategies, preventing fluctuations in stand structure caused by short-term optimization.</p>
<p>From the optimization results, it can be observed that the key stand structure indicators for all plots significantly improved after optimization, and the stand structure approached the ideal stand condition. This validates the feasibility and effectiveness of the method in long-term forest management, indicating that, when considering dynamic stand changes, the stand structure can maintain a reasonable spatial configuration over extended time scales. Compared to the significant changes in other stand structure indicators, the change in neighborhood comparison was relatively small. On one hand, the degree of size differentiation in the plots was already in a stable growth state before optimization (<xref ref-type="bibr" rid="B54">Xuan et&#xa0;al., 2023</xref>). On the other hand, multi-agent deep reinforcement learning primarily relies on selective harvesting and replanting as the main regulatory measures. Therefore, the focus of the optimization was on adjusting aspects such as mingling degree, competition pressure, and distribution pattern, while the direct impact on neighborhood comparison was relatively small. Additionally, the optimization time varied across plots. Plot P4 required a longer optimization time, while Plot P5 took relatively less time. This may be related to the initial stand conditions and the difficulty of optimization. Plot P5 had a more balanced initial stand, with its horizontal distribution pattern already close to the ideal stand distribution. The competition pressure and mingling degree were also higher than in Plot P4, allowing for a quicker convergence to an optimal adjustment strategy, resulting in a shorter optimization time. In contrast, Plot P4 had poor mingling, relatively high competition pressure, and a less favorable horizontal distribution pattern. As a result, the optimization process required more rounds of exploration and adjustment to ensure an optimal outcome. Furthermore, the length of the optimization time may also be influenced by the multi-agent deep reinforcement learning algorithm itself. Different exploration strategies and parameter settings directly affect the optimization efficiency. This conclusion is consistent with that obtained by using multi-agent reinforcement learning to solve forest stand structure optimization (<xref ref-type="bibr" rid="B55">Xuan et&#xa0;al., 2024</xref>).</p>
<p>Surely, when introducing the deep reinforcement learning algorithm, this research still has the following limitations and aspects that require further refinement: (1) This study only utilized the basic MADQN algorithm within multi-agent deep reinforcement learning. Further research is needed to explore whether other more advanced algorithms and corresponding improvements could be more effective in solving multi-objective stand structure optimization problems. (2) Due to the limited data coverage of the research plots, some of the tree factor predictions still exhibit inaccuracies. Additionally, the current prediction models have certain limitations in addressing the growth variability of individual trees and complex environmental factors. Therefore, more suitable prediction methods should be selected in the future to improve the accuracy of structure prediction. (3) The current dynamic stand structure optimization primarily focuses on adjusting mingling degree, spatial distribution pattern, and competition pressure, with relatively limited optimization of neighborhood comparison. Future optimization strategies will pay more attention to controlling neighborhood comparison to more precisely optimize the diameter structure of the stand, enhancing overall balance and growth stability. (4) In the spatial configuration of replanting trees, the study currently uses a proportional method to select multiple native species. However, due to the limited number of certain species, the basic model is used to determine tree height, crown width, and other tree factors. Future research will further optimize the spatial configuration strategy for replanting trees, making the species composition adjustment more scientific and rational. Additionally, more accurate models will be introduced to improve the prediction accuracy of fundamental tree factors, thus enhancing the adaptability and long-term stability of the optimization scheme.</p>
</sec>
<sec id="s5" sec-type="conclusions">
<label>5</label>
<title>Conclusion</title>
<p>This study applies multi-agent deep reinforcement learning to the field of stand structure optimization. The objective function is established using complete mingling, uniform angle index, neighborhood comparison, stratification index, and crown competition index, with selective harvesting and replanting measures for coordinated optimization. Comparative simulation experiments with multi-agent reinforcement learning across different plots showed that the objective function values of multi-agent deep reinforcement learning in each plot were 0.5378, 0.5861, 0.5860, 0.5130, and 0.6034, all higher than those of multi-agent reinforcement learning, which were 0.5302, 0.5369, 0.5766, 0.5014, and 0.5906. These results demonstrate the superiority of multi-agent deep reinforcement learning in stand structure optimization. Considering the dynamic nature of stand structure, combining structural prediction with multi-agent deep reinforcement learning enabled the stand structure in each plot to approach the ideal stand structure within 15&#x2013;40 years, achieving dynamic optimization of stand structure. This approach provides a scientific basis and decision support for the dynamic optimization of stand structure and has broad application prospects.</p>
</sec>
</body>
<back>
<sec id="s6" sec-type="data-availability">
<title>Data availability statement</title>    <p>The dataset generated and analyzed during this study is not publicly available due to its ongoing use in current research but is available from the corresponding author, Jianming Wang (wangjianming618@163.com), upon reasonable request.</p>
</sec>
<sec id="s7" sec-type="author-contributions">
<title>Author contributions</title>
<p>JZ: Conceptualization, Data curation, Formal Analysis, Investigation, Methodology, Writing &#x2013; original draft. JW: Conceptualization, Data curation, Funding acquisition, Methodology, Project administration, Resources, Supervision, Validation, Visualization, Writing &#x2013; review &amp; editing. JY: Data curation, Visualization, Writing &#x2013; review &amp; editing. YC: Software, Validation, Visualization, Writing &#x2013; review &amp; editing. BW: Validation, Visualization, Writing &#x2013; review &amp; editing.</p>
</sec>
<sec id="s8" sec-type="funding-information">
<title>Funding</title>
<p>The author(s) declare financial support was received for the research and/or publication of this article. This research was funded by the National Natural Science Foundation of China(grant number 32460389), Youth Talent Project of the Revitalization of Yunnan Province Talent Support Program(XDYC-QNRC-2022-0144) and Yunnan Fundamental Research Projects (grant number 202501AT070417).</p>
</sec>
<ack>
<title>Acknowledgments</title>
<p>The author extends heartfelt gratitude to all members of the research team for their invaluable support in data collection. Your commitment and efforts were crucial to the successful completion of this research.</p>
</ack>
<sec id="s9" sec-type="COI-statement">
<title>Conflict of interest</title>
<p>The authors declare that the research was conducted in the absence of any commercial or financial relationships that could be construed as a potential conflict of interest.</p>
</sec>
<sec id="s10" sec-type="ai-statement">
<title>Generative AI statement</title>
<p>The author(s) declare that no Generative AI was used in the creation of this manuscript.</p>
<p>Any alternative text (alt text) provided alongside figures in this article has been generated by Frontiers with the support of artificial intelligence and reasonable efforts have been made to ensure accuracy, including review by the authors wherever possible. If you identify any issues, please contact us.</p>
</sec>
<sec id="s11" sec-type="disclaimer">
<title>Publisher&#x2019;s note</title>
<p>All claims expressed in this article are solely those of the authors and do not necessarily represent those of their affiliated organizations, or those of the publisher, the editors and the reviewers. Any product that may be evaluated in this article, or claim that may be made by its manufacturer, is not guaranteed or endorsed by the publisher.</p>
</sec>
<ref-list>
<title>References</title>
<ref id="B1">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Aguirre</surname> <given-names>O.</given-names>
</name>
<name>
<surname>Hui</surname> <given-names>G.</given-names>
</name>
<name>
<surname>von Gadow</surname> <given-names>K.</given-names>
</name>
<name>
<surname>Jim&#xe9;nez</surname> <given-names>J.</given-names>
</name>
</person-group> (<year>2003</year>). <article-title>An analysis of spatial forest structure using neighbourhood-based variables</article-title>. <source>For. Ecol. Manage.</source> <volume>183</volume>, <fpage>137</fpage>&#x2013;<lpage>145</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1016/S0378-1127(03)00102-6</pub-id>
</citation></ref>
<ref id="B2">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Ali</surname> <given-names>A</given-names>
</name>
</person-group>. (<year>2019</year>). <article-title>Forest stand structure and functioning: Current knowledge and future challenges. <italic>Ecological</italic> 707</article-title>. <source>Indicators</source> <volume>98</volume>, <fpage>665</fpage>&#x2013;<lpage>677</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1016/J.ECOLIND.2018.11.017</pub-id>
</citation></ref>
<ref id="B3">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Bohora</surname> <given-names>S. B.</given-names>
</name>
<name>
<surname>Cao</surname> <given-names>Q. V.</given-names>
</name>
</person-group> (<year>2014</year>). <article-title>Prediction of tree diameter growth using quantile regression and mixed-effects models</article-title>. <source>For. Ecol. Manage.</source> <volume>319</volume>, <fpage>62</fpage>&#x2013;<lpage>66</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1016/j.foreco.2014.02.006</pub-id>
</citation></ref>
<ref id="B4">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Boston</surname> <given-names>K.</given-names>
</name>
<name>
<surname>Bettinger</surname> <given-names>P.</given-names>
</name>
</person-group> (<year>1999</year>). <article-title>An analysis of monte carlo integer programming, simulated annealing, and tabu search heuristics for solving spatial harvest scheduling problems</article-title>. <source>For. Sci.</source> <volume>45</volume>, <fpage>292</fpage>&#x2013;<lpage>301</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1093/forestscience/45.2.292</pub-id>
</citation></ref>
<ref id="B5">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Chang</surname> <given-names>G.</given-names>
</name>
<name>
<surname>Fan</surname> <given-names>W.</given-names>
</name>
</person-group> (<year>2024</year>). <article-title>Model for predicting individual tree crown width of natural secondary <italic>Betula Platyphylla</italic>
</article-title>. <source>J. OF SOUTHWEST FORESTRY Univ.</source> <volume>44</volume>, <fpage>129</fpage>&#x2013;<lpage>135</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.11929/j.swfu.202312031</pub-id>
</citation></ref>
<ref id="B6">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Chen</surname> <given-names>C.</given-names>
</name>
<name>
<surname>Zhou</surname> <given-names>L.</given-names>
</name>
<name>
<surname>Li</surname> <given-names>X.</given-names>
</name>
<name>
<surname>Zhao</surname> <given-names>Y.</given-names>
</name>
<name>
<surname>Yu</surname> <given-names>J.</given-names>
</name>
<name>
<surname>Lv</surname> <given-names>L.</given-names>
</name>
<etal/>
</person-group>. (<year>2023</year>). <article-title>Optimizing the spatial structure of metasequoia plantation forest based on uav-lidar and backpack-lidar</article-title>. <source>Remote Sens.</source> <volume>15</volume>, <fpage>4090</fpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.3390/rs15164090</pub-id>
</citation></ref>
<ref id="B7">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Chi</surname> <given-names>P.</given-names>
</name>
<name>
<surname>Zhu</surname> <given-names>K.</given-names>
</name>
<name>
<surname>Li</surname> <given-names>J.</given-names>
</name>
<name>
<surname>Ai</surname> <given-names>W.</given-names>
</name>
<name>
<surname>Huang</surname> <given-names>J.</given-names>
</name>
<name>
<surname>Qing</surname> <given-names>D.</given-names>
</name>
</person-group> (<year>2019</year>). &#x201c;<article-title>Dynamic multi-objective optimization model for forest spatial structure with environmental detection mechanism</article-title>,&#x201d; in <conf-name>2019 IEEE 21st International 720 Conference on High Performance Computing and Communications; IEEE 17th International Conference on Smart City; IEEE 5th International Conference on Data Science and Systems (HPCC/SmartCity/DSS)</conf-name>. <fpage>1635</fpage>&#x2013;<lpage>1642</lpage> (<publisher-name>IEEE</publisher-name>).</citation></ref>
<ref id="B8">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Chunyan</surname> <given-names>Z.</given-names>
</name>
<name>
<surname>Jiping</surname> <given-names>L.</given-names>
</name>
</person-group> (<year>2017</year>). <article-title>Spatial location and allocation of replanting trees on pure chinese fir plantation based on voronoi diagram and delaunay triangulation</article-title>. <source>J. Cent. South Univ. Forestry Technol.</source> <volume>37</volume>, <fpage>1</fpage>&#x2013;<lpage>8</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.14067/j.cnki.1673-923x.2017.02.001</pub-id>
</citation></ref>
<ref id="B9">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Ding</surname> <given-names>Y.</given-names>
</name>
<name>
<surname>Zang</surname> <given-names>R.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>Effects of thinning on the demography and functional community structure of a secondary tropical lowland rain forest</article-title>. <source>J. Environ. Manage.</source> <volume>279</volume>, <fpage>111805</fpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1016/j.jenvman.2020.111805</pub-id>, PMID: <pub-id pub-id-type="pmid">33316643</pub-id></citation></ref>
<ref id="B10">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Dong</surname> <given-names>L.</given-names>
</name>
<name>
<surname>Bettinger</surname> <given-names>P.</given-names>
</name>
<name>
<surname>Liu</surname> <given-names>Z.</given-names>
</name>
</person-group> (<year>2022</year>). <article-title>Optimizing neighborhood-based stand spatial structure: Four cases of boreal forests</article-title>. <source>For. Ecol. Manage.</source> <volume>506</volume>, <fpage>119965</fpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1016/j.foreco.2021.119965</pub-id>
</citation></ref>
<ref id="B11">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Dong</surname> <given-names>L.</given-names>
</name>
<name>
<surname>Wei</surname> <given-names>H.</given-names>
</name>
<name>
<surname>Liu</surname> <given-names>Z.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>Optimizing forest spatial structure with neighborhood-based indices: Four case studies from northeast China</article-title>. <source>Forests</source> <volume>11</volume>, <fpage>413</fpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.3390/f11040413</pub-id>
</citation></ref>
<ref id="B12">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Dongsheng</surname> <given-names>Q.</given-names>
</name>
<name>
<surname>Xiaofang</surname> <given-names>Z.</given-names>
</name>
<name>
<surname>Jianjun</surname> <given-names>L.</given-names>
</name>
<name>
<surname>Rui</surname> <given-names>G.</given-names>
</name>
<name>
<surname>Qiaoling</surname> <given-names>D.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>Spatial structure optimization of natural forest based on bee colony-particle swarm algorithm</article-title>. <source>J. System Simulation</source> <volume>32</volume>, <fpage>371</fpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.16182/j.issn1004731x.joss.19-0320</pub-id>
</citation></ref>
<ref id="B13">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Fotakis</surname> <given-names>D. G.</given-names>
</name>
<name>
<surname>Sidiropoulos</surname> <given-names>E.</given-names>
</name>
<name>
<surname>Myronidis</surname> <given-names>D.</given-names>
</name>
<name>
<surname>Ioannou</surname> <given-names>K.</given-names>
</name>
</person-group> (<year>2012</year>). <article-title>Spatial genetic algorithm for multi-objective forest planning</article-title>. <source>For. Policy Econ</source> <volume>21</volume>, <fpage>12</fpage>&#x2013;<lpage>19</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1016/j.forpol.2012.04.002</pub-id>
</citation></ref>
<ref id="B14">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Gangying</surname> <given-names>H.</given-names>
</name>
<name>
<surname>Yanbo</surname> <given-names>H.</given-names>
</name>
<name>
<surname>Hai</surname> <given-names>X.</given-names>
</name>
</person-group> (<year>2005</year>). <article-title>Quantitative analysis of forest spatial structure</article-title>. <source>J. Northeast Forestry Univ.</source> <volume>26</volume>, <fpage>45-48, 60</fpage>.</citation></ref>
<ref id="B15">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Gangying</surname> <given-names>H.</given-names>
</name>
<name>
<surname>Yanbo</surname> <given-names>H.</given-names>
</name>
<name>
<surname>Zhonghua</surname> <given-names>Z.</given-names>
</name>
</person-group> (<year>2018</year>). <article-title>Research progress of structure-based forest management</article-title>. <source>Lin Ye Ke Xue Yan Jiu</source> <volume>31</volume>, <fpage>85</fpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.13275/j.cnki.lykxyj.2018.01.011</pub-id>
</citation></ref>
<ref id="B16">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Gronauer</surname> <given-names>S.</given-names>
</name>
<name>
<surname>Diepold</surname> <given-names>K.</given-names>
</name>
</person-group> (<year>2022</year>). <article-title>Multi-agent deep reinforcement learning: a survey</article-title>. <source>Artif. Intell. Rev.</source> <volume>55</volume>, <fpage>895</fpage>&#x2013;<lpage>943</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1007/s10462-021-09996-w</pub-id>
</citation></ref>
<ref id="B17">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Gyawali</surname> <given-names>A.</given-names>
</name>
<name>
<surname>Sharma</surname> <given-names>R.</given-names>
</name>
<name>
<surname>Bhandari</surname> <given-names>S.</given-names>
</name>
</person-group> (<year>2015</year>). <article-title>Individual tree basal area growth models for chir pine (<italic>Pinus roxberghii Sarg.</italic>) in western Nepal</article-title>. <volume>61</volume>, <fpage>535-543</fpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.17221/51/2015-JFS</pub-id>
</citation></ref>
<ref id="B18">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Haight</surname> <given-names>R. G.</given-names>
</name>
<name>
<surname>Travis</surname> <given-names>L. E.</given-names>
</name>
</person-group> (<year>1997</year>). <article-title>Wildlife conservation planning using stochastic optimization and importance sampling</article-title>. <source>For. Sci.</source> <volume>43</volume>, <fpage>129</fpage>&#x2013;<lpage>139</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1093/forestscience/43.1.129</pub-id>
</citation></ref>
<ref id="B19">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Han</surname> <given-names>M.</given-names>
</name>
<name>
<surname>Li</surname> <given-names>L.</given-names>
</name>
<name>
<surname>Zheng</surname> <given-names>W.</given-names>
</name>
<name>
<surname>Su</surname> <given-names>J.</given-names>
</name>
<name>
<surname>Li</surname> <given-names>W.</given-names>
</name>
<name>
<surname>Gong</surname> <given-names>J.</given-names>
</name>
<etal/>
</person-group>. (<year>2011</year>). <article-title>Effects of different intensity of thinning on the improvement of middle-aged yunnan pine stand</article-title>. <source>J. Cent. South Univ. For. Technol.</source> <volume>31</volume>, <fpage>27</fpage>&#x2013;<lpage>33</lpage>.</citation></ref>
<ref id="B20">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Jian</surname> <given-names>L.</given-names>
</name>
<name>
<surname>Jia</surname> <given-names>X.</given-names>
</name>
<name>
<surname>Kun-yong</surname> <given-names>Y.</given-names>
</name>
<name>
<surname>Su-ping</surname> <given-names>Y.</given-names>
</name>
<name>
<surname>Jin-zhao</surname> <given-names>Z.</given-names>
</name>
<name>
<surname>Qiu-yue</surname> <given-names>Z.</given-names>
</name>
</person-group> (<year>2018</year>). <article-title>Simulation of replantation of low-density ecological landscape forest with coupled stand structure</article-title>. <source>Acta Agriculturae Universitatis Jiangxiensis</source> <volume>40</volume>, <fpage>1125</fpage>&#x2013;<lpage>1133</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.13836/j.jjau.2018142</pub-id>
</citation></ref>
<ref id="B21">
<citation citation-type="thesis">
<person-group person-group-type="author">
<name>
<surname>Jianming</surname> <given-names>W.</given-names>
</name>
</person-group> (<year>2017</year>). <source>Study on Decision Technology of Tending Felling for Larix principis-rupprechtii <italic>Plantation Forest</italic>
</source>. <publisher-name>BeiJing Forestry University</publisher-name>, <publisher-loc>Beijing</publisher-loc>. Ph.D. thesis.</citation></ref>
<ref id="B22">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Jianming</surname> <given-names>W.</given-names>
</name>
<name>
<surname>Baoguo</surname> <given-names>W.</given-names>
</name>
<name>
<surname>Qiyang</surname> <given-names>L.</given-names>
</name>
</person-group> (<year>2017</year>). <article-title>Forest thinning subcompartment intelligent selection based on genetic algorithm</article-title>. <source>SCIENTIA Silvae SINICAE</source> <volume>53</volume>, <fpage>63</fpage>&#x2013;<lpage>72</lpage>.</citation></ref>
<ref id="B23">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Jiazheng</surname> <given-names>L.</given-names>
</name>
<name>
<surname>Xiaona</surname> <given-names>X.</given-names>
</name>
<name>
<surname>Huayong</surname> <given-names>Z.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>Study on the growth prediction model of birch species in the mountainous area of northern hebei</article-title>. <source>J. Inner Mongolia Univ. (Natural Sci. Edition)</source>. <volume>52</volume>, <fpage>257-263</fpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.13484/j.nmgdxxbzk.20210306</pub-id>
</citation></ref>
<ref id="B24">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Jiping</surname> <given-names>L.</given-names>
</name>
<name>
<surname>Rui</surname> <given-names>G.</given-names>
</name>
<name>
<surname>Dongsheng</surname> <given-names>Q.</given-names>
</name>
<name>
<surname>Jianjun</surname> <given-names>L.</given-names>
</name>
<name>
<surname>Xiaofang</surname> <given-names>Z.</given-names>
</name>
<name>
<surname>Kaiwen</surname> <given-names>Z.</given-names>
</name>
<etal/>
</person-group>. (<year>2020</year>). <article-title>Prediction of stand spatial structure of natural secondary forest based on gm (1,1)</article-title>. <source>J. Cent. South Univ. Forestry Technol.</source> <volume>40</volume>, <fpage>9</fpage>&#x2013;<lpage>21</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.14067/j.cnki.1673-923x.2020.01.002</pub-id>
</citation></ref> <ref id="B25">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Kim</surname> <given-names>J.-H.</given-names>
</name>
<name>
<surname>Roh</surname> <given-names>M.-I.</given-names>
</name>
<name>
<surname>Yeo</surname> <given-names>I.-C.</given-names>
</name>
</person-group> (<year>2025</year>). <article-title>A method for generating multiple hull forms at once using mlp (multi-layer perceptron)</article-title>. <source>Ocean Eng.</source> <volume>324</volume>, <fpage>120659</fpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1016/j.oceaneng.2025.120659</pub-id>
</citation></ref>
<ref id="B26">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Lee</surname> <given-names>D.</given-names>
</name>
<name>
<surname>Repola</surname> <given-names>J.</given-names>
</name>
<name>
<surname>Bianchi</surname> <given-names>S.</given-names>
</name>
<name>
<surname>Siipilehto</surname> <given-names>J.</given-names>
</name>
<name>
<surname>Lehtonen</surname> <given-names>M.</given-names>
</name>
<name>
<surname>Salminen</surname> <given-names>H.</given-names>
</name>
<etal/>
</person-group>. (<year>2024</year>). <article-title>Calibration models for diameter and height growth of Norway spruce growing in uneven-aged stands in Finland</article-title>. <source>For. Ecol. Manage.</source> <volume>558</volume>, <fpage>121783</fpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1016/j.foreco.2024.121783</pub-id>
</citation></ref>
<ref id="B27">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Lei</surname> <given-names>J.</given-names>
</name>
<name>
<surname>Yuanchang</surname> <given-names>L.</given-names>
</name>
<name>
<surname>Shengxi</surname> <given-names>L.</given-names>
</name>
<name>
<surname>Kun</surname> <given-names>L.</given-names>
</name>
<name>
<surname>Genqian</surname> <given-names>L.</given-names>
</name>
</person-group> (<year>2008</year>). <article-title>A study on d iametra l structure of yunnan pine forestin the pla teaus ofm id-yunnan province</article-title>. <source>For. Res.</source> <volume>21</volume>, <fpage>126</fpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.13275/j.cnki.lykxy.2008.01.025</pub-id>
</citation></ref>
<ref id="B28">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Ling-bo</surname> <given-names>D.</given-names>
</name>
<name>
<surname>Zhao-gang</surname> <given-names>L.</given-names>
</name>
</person-group> (<year>2011</year>). <article-title>Visualization of individual Mongolian scots pines in the plantation conditions based on characteristic parameters of morphological structures</article-title>. <source>J. OF Beijing FORESTRY Univ.</source> <volume>33</volume>, <fpage>20</fpage>&#x2013;<lpage>27</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.13332/j.1000-1522.2011.05.017</pub-id>
</citation></ref>
<ref id="B29">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Liu</surname> <given-names>H.</given-names>
</name>
<name>
<surname>Dong</surname> <given-names>X.</given-names>
</name>
<name>
<surname>Meng</surname> <given-names>Y.</given-names>
</name>
<name>
<surname>Gao</surname> <given-names>T.</given-names>
</name>
<name>
<surname>Mao</surname> <given-names>L.</given-names>
</name>
<name>
<surname>Gao</surname> <given-names>R.</given-names>
</name>
</person-group> (<year>2023</year>). <article-title>A novel model to evaluate spatial structure in thinned conifer-broadleaved mixed natural forests</article-title>. <source>J. Forestry Res.</source> <volume>34</volume>, <fpage>1881</fpage>&#x2013;<lpage>1898</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1007/s11676-023-01647-w</pub-id>
</citation></ref>
<ref id="B30">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Luo</surname> <given-names>D.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>Stand structure characteristics of betula alnoides natural forest in dehong prefecture, yunnan province</article-title>. (Master's thesis). Chinese Academy of Forestry, Beijing.</citation></ref>
<ref id="B31">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Ma</surname> <given-names>Y.</given-names>
</name>
<name>
<surname>Liang</surname> <given-names>F.</given-names>
</name>
<name>
<surname>Zhu</surname> <given-names>M.</given-names>
</name>
<name>
<surname>Chen</surname> <given-names>C.</given-names>
</name>
<name>
<surname>Chen</surname> <given-names>C.</given-names>
</name>
<name>
<surname>Lv</surname> <given-names>X.</given-names>
</name>
</person-group> (<year>2022</year>). <article-title>Ft-ir combined with pso-cnn algorithm for rapid screening of cervical tumors</article-title>. <source>Photodiagnosis Photodyn. Ther.</source> <volume>39</volume>, <fpage>103023</fpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1016/j.pdpdt.2022.103023</pub-id>, PMID: <pub-id pub-id-type="pmid">35868522</pub-id></citation></ref>
<ref id="B32">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Mengying</surname> <given-names>H.</given-names>
</name>
<name>
<surname>Lihu</surname> <given-names>D.</given-names>
</name>
<name>
<surname>Fengri</surname> <given-names>L.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>Tree crown length prediction models for <italic>Larix algensis</italic> and <italic>Fraxinus mandshurica</italic> in mixed plantations with different mixing methods</article-title>. <source>J. Nanjing Forestry Univesity (Natural Sci. Edition)</source> <volume>45</volume>, <fpage>13</fpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.12302/j.issn.1000-2006.202005043</pub-id>
</citation></ref>
<ref id="B33">
<citation citation-type="thesis">
<person-group person-group-type="author">
<name>
<surname>Na</surname> <given-names>L.</given-names>
</name>
</person-group> (<year>2019</year>). <source>
<italic>The Research on Dynamic multi-objective optimization model of forest structure under CMIP5 model</italic>
</source>. (Master&#x2019;s thesis). <publisher-name>Central South University of Forestry &amp; Technology, Changsha</publisher-name>.</citation></ref>
<ref id="B34">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Nhat-Duc</surname> <given-names>H.</given-names>
</name>
<name>
<surname>Van-Duc</surname> <given-names>T.</given-names>
</name>
</person-group> (<year>2023</year>). <article-title>Comparison of histogram-based gradient boosting classification machine, random forest, and deep convolutional neural network for pavement raveling severity classification</article-title>. <source>Automation construction</source> <volume>148</volume>, <fpage>104767</fpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1016/j.autcon.2023.104767</pub-id>
</citation></ref>
<ref id="B35">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Ning</surname> <given-names>Z.</given-names>
</name>
<name>
<surname>Yang</surname> <given-names>Y.</given-names>
</name>
<name>
<surname>Wang</surname> <given-names>X.</given-names>
</name>
<name>
<surname>Song</surname> <given-names>Q.</given-names>
</name>
<name>
<surname>Guo</surname> <given-names>L.</given-names>
</name>
<name>
<surname>Jamalipour</surname> <given-names>A.</given-names>
</name>
</person-group> (<year>2023</year>). <article-title>Multi-agent deep reinforcement learning based uav trajectory optimization for differentiated services</article-title>. <source>IEEE Trans. Mobile Computing</source> <volume>23</volume>, <fpage>5818</fpage>&#x2013;<lpage>5834</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1109/TMC.2023.3312276</pub-id>
</citation></ref>
<ref id="B36">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Okasha</surname> <given-names>N. M.</given-names>
</name>
<name>
<surname>Frangopol</surname> <given-names>D. M.</given-names>
</name>
</person-group> (<year>2009</year>). <article-title>Lifetime-oriented multi-objective optimization of structural maintenance considering system reliability, redundancy and life-cycle cost using ga</article-title>. <source>Struct. Saf.</source> <volume>31</volume>, <fpage>460</fpage>&#x2013;<lpage>474</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1016/j.strusafe.2009.06.005</pub-id>
</citation></ref>
<ref id="B37">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Olsthoorn</surname> <given-names>A.</given-names>
</name>
<name>
<surname>Bartelink</surname> <given-names>H.</given-names>
</name>
<name>
<surname>Gardiner</surname> <given-names>J.</given-names>
</name>
<name>
<surname>Pretzsch</surname> <given-names>H.</given-names>
</name>
<name>
<surname>Hekhuis</surname> <given-names>H.</given-names>
</name>
<name>
<surname>Franc</surname> <given-names>A.</given-names>
</name>
</person-group> (<year>1999</year>). <article-title>Management of mixed-species forest: silviculture and economics</article-title>.</citation></ref>
<ref id="B38">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Packalen</surname> <given-names>P.</given-names>
</name>
<name>
<surname>Strunk</surname> <given-names>J.</given-names>
</name>
<name>
<surname>Maltamo</surname> <given-names>M.</given-names>
</name>
<name>
<surname>Myllym&#xe4;ki</surname> <given-names>M.</given-names>
</name>
</person-group> (<year>2023</year>). <article-title>Circular or square plots in als-based forest inventories&#x2014;does it matter</article-title>? <source>Forestry</source> <volume>96</volume>, <fpage>49</fpage>&#x2013;<lpage>61</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1093/forestry/cpac032</pub-id>
</citation></ref>
<ref id="B39">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Raptis</surname> <given-names>D.</given-names>
</name>
<name>
<surname>Kazana</surname> <given-names>V.</given-names>
</name>
<name>
<surname>Kazaklis</surname> <given-names>A.</given-names>
</name>
<name>
<surname>Stamatiou</surname> <given-names>C.</given-names>
</name>
</person-group> (<year>2018</year>). <article-title>A crown width-diameter model for natural even-aged black pine forest management</article-title>. <source>Forests</source> <volume>9</volume>, <fpage>610</fpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.3390/f9100610</pub-id>
</citation></ref>
<ref id="B40">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>S&#xe1;nchez-Gonz&#xe1;lez</surname> <given-names>M.</given-names>
</name>
<name>
<surname>Ca&#xf1;ellas</surname> <given-names>I.</given-names>
</name>
<name>
<surname>Montero</surname> <given-names>G.</given-names>
</name>
</person-group> (<year>2007</year>). <article-title>Generalized height-diameter and crown diameter prediction models for cork oak forests in Spain</article-title>. <source>For. Syst.</source> <volume>16</volume>, <fpage>76</fpage>&#x2013;<lpage>88</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.5424/srf/2007161-00999</pub-id>
</citation></ref>
<ref id="B41">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Sattler</surname> <given-names>D. F.</given-names>
</name>
<name>
<surname>LeMay</surname> <given-names>V.</given-names>
</name>
</person-group> (<year>2011</year>). <article-title>A system of nonlinear simultaneous equations for crown length and crown radius for the forest dynamics model sortie-nd</article-title>. <source>Can. J. For. Res.</source> <volume>41</volume>, <fpage>1567</fpage>&#x2013;<lpage>1576</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1139/x11-078</pub-id>
</citation></ref>
<ref id="B42">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Shen</surname> <given-names>R.</given-names>
</name>
<name>
<surname>Zhong</surname> <given-names>S.</given-names>
</name>
<name>
<surname>Wen</surname> <given-names>X.</given-names>
</name>
<name>
<surname>An</surname> <given-names>Q.</given-names>
</name>
<name>
<surname>Zheng</surname> <given-names>R.</given-names>
</name>
<name>
<surname>Li</surname> <given-names>Y.</given-names>
</name>
<etal/>
</person-group>. (<year>2022</year>). <article-title>Multi-agent deep reinforcement learning optimization framework for building energy system with renewable energy</article-title>. <source>Appl. Energy</source> <volume>312</volume>, <fpage>118724</fpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1016/j.apenergy.2022.118724</pub-id>
</citation></ref>
<ref id="B43">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Sheng</surname> <given-names>Q.</given-names>
</name>
<name>
<surname>Dong</surname> <given-names>L.</given-names>
</name>
<name>
<surname>Chen</surname> <given-names>Y.</given-names>
</name>
<name>
<surname>Liu</surname> <given-names>Z.</given-names>
</name>
</person-group> (<year>2023</year>). <article-title>Selection of the optimal timber harvest based on optimizing stand spatial structure of broadleaf mixed forests</article-title>. <source>Forests</source> <volume>14</volume>, <fpage>2046</fpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.3390/f14102046</pub-id>
</citation></ref>
<ref id="B44">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Shuai</surname> <given-names>X.</given-names>
</name>
<name>
<surname>Jianming</surname> <given-names>W.</given-names>
</name>
<name>
<surname>Y.</surname> <given-names>J.</given-names>
</name>
<name>
<surname>Yadong</surname> <given-names>G.</given-names>
</name>
</person-group> (<year>2024</year>). <article-title>Characteristics of stand structure of pinus <italic>yunnanensis Secondary</italic> forests on the east slope of cangshan mountain</article-title>. <source>J. West China Forestry Sci.</source> <volume>53</volume>, <fpage>47</fpage>&#x2013;<lpage>54</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.16473/j.cnki.xblykx1972.2024.01.007</pub-id>
</citation></ref>
<ref id="B45">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Siipilehto</surname> <given-names>J.</given-names>
</name>
<name>
<surname>Sarkkola</surname> <given-names>S.</given-names>
</name>
<name>
<surname>Nuutinen</surname> <given-names>Y.</given-names>
</name>
<name>
<surname>Meht&#xe4;talo</surname> <given-names>L.</given-names>
</name>
</person-group> (<year>2023</year>). <article-title>Predicting height-diameter relationship in uneven-aged stands in Finland</article-title>. <source>For. Ecol. Manage.</source> <volume>549</volume>, <fpage>121486</fpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1016/j.foreco.2023.121486</pub-id>
</citation></ref>
<ref id="B46">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Su</surname> <given-names>J.</given-names>
</name>
<name>
<surname>Li</surname> <given-names>L.</given-names>
</name>
<name>
<surname>Zheng</surname> <given-names>W.</given-names>
</name>
<name>
<surname>Yang</surname> <given-names>W.</given-names>
</name>
<name>
<surname>Han</surname> <given-names>M.</given-names>
</name>
<name>
<surname>Huang</surname> <given-names>Z.</given-names>
</name>
<etal/>
</person-group>. (<year>2010</year>). <article-title>Effect of intermediate cutting intensity on growth of <italic>Pinus yunnanensis</italic> plantation</article-title>. <source>J. West China Forestry Sci.</source> <volume>39</volume>, <fpage>27</fpage>&#x2013;<lpage>32</lpage>.</citation></ref>
<ref id="B47">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Tang</surname> <given-names>M.</given-names>
</name>
<name>
<surname>Tang</surname> <given-names>S.</given-names>
</name>
<name>
<surname>Lei</surname> <given-names>X.</given-names>
</name>
<name>
<surname>Li</surname> <given-names>X.</given-names>
</name>
</person-group> (<year>2004</year>). <article-title>Study on spatial structure optimizing model of stand selection cutting</article-title>. <source>Sci. Silvae Sin.</source> <volume>40</volume>, <fpage>25</fpage>&#x2013;<lpage>31</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1016/j.jce.2003.10.003</pub-id>
</citation></ref>
<ref id="B48">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Von Gadow</surname> <given-names>K.</given-names>
</name>
<name>
<surname>Hui</surname> <given-names>G.</given-names>
</name>
<name>
<surname>Chen</surname> <given-names>B.</given-names>
</name>
<name>
<surname>Albert</surname> <given-names>M.</given-names>
</name>
</person-group> (<year>2003</year>). <article-title>Beziehungen zwischen winkelma&#xdf;und baumabst&#xe4;nden: Relationship between the winkelma&#xdf;and nearest neighbor distances</article-title>. <source>Forstwissenschaftliches Centralblatt</source> <volume>122</volume>, <fpage>127</fpage>&#x2013;<lpage>137</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1046/j.1439-0337.2003.00127.x</pub-id>
</citation></ref>
<ref id="B49">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Wang</surname> <given-names>T.</given-names>
</name>
<name>
<surname>Dong</surname> <given-names>L.</given-names>
</name>
<name>
<surname>Liu</surname> <given-names>Z.</given-names>
</name>
<name>
<surname>Zhang</surname> <given-names>L.</given-names>
</name>
<name>
<surname>Chen</surname> <given-names>Y.</given-names>
</name>
</person-group> (<year>2019</year>). <article-title>Optimization of replanting space of natural secondary forest in daxing&#x2019;anling mountains of northeastern China</article-title>. <source>J. OF Beijing FORESTRY Univ.</source> <volume>41</volume>, <fpage>127</fpage>&#x2013;<lpage>136</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.13332/j.1000-1522.20190025</pub-id>
</citation></ref>
<ref id="B50">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Waschneck</surname> <given-names>B.</given-names>
</name>
<name>
<surname>Reichstaller</surname> <given-names>A.</given-names>
</name>
<name>
<surname>Belzner</surname> <given-names>L.</given-names>
</name>
<name>
<surname>Altenm&#xfc;ller</surname> <given-names>T.</given-names>
</name>
<name>
<surname>Bauernhansl</surname> <given-names>T.</given-names>
</name>
<name>
<surname>Knapp</surname> <given-names>A.</given-names>
</name>
<etal/>
</person-group>. (<year>2018</year>). <article-title>Optimization of global production scheduling with deep reinforcement learning</article-title>. <source>Proc. Cirpw</source> <volume>72</volume>, <fpage>1264</fpage>&#x2013;<lpage>1269</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1016/j.procir.2018.03.212</pub-id>
</citation></ref>
<ref id="B51">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Wu</surname> <given-names>Y.</given-names>
</name>
<name>
<surname>Li</surname> <given-names>J.</given-names>
</name>
<name>
<surname>Huang</surname> <given-names>J.</given-names>
</name>
<name>
<surname>Qing</surname> <given-names>D.</given-names>
</name>
<name>
<surname>Ai</surname> <given-names>W.</given-names>
</name>
<name>
<surname>Chi</surname> <given-names>P.</given-names>
</name>
<etal/>
</person-group>. (<year>2022</year>). <article-title>Multi-objective optimization model of forest spatial structure based on dynamic multi-group pso algorithm</article-title>. doi:&#xa0;<pub-id pub-id-type="doi">10.21203/rs.3.rs-1398671/v1</pub-id>
</citation></ref>
<ref id="B52">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Xi</surname> <given-names>Z.</given-names>
</name>
<name>
<surname>Li-ming</surname> <given-names>J.</given-names>
</name>
<name>
<surname>Yu</surname> <given-names>Z.</given-names>
</name>
<name>
<surname>Cong-hui</surname> <given-names>Z.</given-names>
</name>
</person-group> (<year>2015</year>). <article-title>Individual growth simulation for natural secondary forest of <italic>Quercus variabilis</italic> in qinling area based on fvs</article-title>. <source>J. OF Beijing FORESTRY Univ.</source> <volume>37</volume>, <fpage>19</fpage>&#x2013;<lpage>29</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.13332/j.1000-1522.20140356</pub-id>
</citation></ref>
<ref id="B53">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Xiaonan</surname> <given-names>W.</given-names>
</name>
<name>
<surname>Wenhao</surname> <given-names>S.</given-names>
</name>
<name>
<surname>Lingbo</surname> <given-names>D.</given-names>
</name>
</person-group> (<year>2024</year>). <article-title>Age estimation model for individual trees in natural <italic>Larix gmelinii</italic> forest based on random forest model</article-title>. <source>Chin. J. Appl. Ecol.</source> <volume>35</volume>, <fpage>1055</fpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.13287/j.1001-9332.202404.023</pub-id>, PMID: <pub-id pub-id-type="pmid">38884240</pub-id></citation></ref>
<ref id="B54">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Xuan</surname> <given-names>S.</given-names>
</name>
<name>
<surname>Wang</surname> <given-names>J.</given-names>
</name>
<name>
<surname>Chen</surname> <given-names>Y.</given-names>
</name>
</person-group> (<year>2023</year>). <article-title>Reinforcement learning for stand structure optimization of <italic>Pinus yunnanensis</italic> secondary forests in southwest China</article-title>. <source>Forests</source> <volume>14</volume>, <fpage>2456</fpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.3390/f14122456</pub-id>
</citation></ref>
<ref id="B55">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Xuan</surname> <given-names>S.</given-names>
</name>
<name>
<surname>Wang</surname> <given-names>J.</given-names>
</name>
<name>
<surname>Yin</surname> <given-names>J.</given-names>
</name>
<name>
<surname>Chen</surname> <given-names>Y.</given-names>
</name>
<name>
<surname>Wu</surname> <given-names>B.</given-names>
</name>
</person-group> (<year>2024</year>). <article-title>Multi-agent reinforcement learning for stand structure collaborative optimization of <italic>Pinus yunnanensis</italic> secondary forests</article-title>. <source>Forests</source> <volume>15</volume>, <fpage>1143</fpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.3390/f15071143</pub-id>
</citation></ref>
<ref id="B56">
<citation citation-type="thesis">
<person-group person-group-type="author">
<name>
<surname>Yitong</surname> <given-names>Y.</given-names>
</name>
</person-group> (<year>2019</year>). <source>Study on Forest Structure of Different Recovery Stages and Optimization Models of Natural Mixed Spruce-fir Secondary Forests on Selective Cutting</source>. <publisher-name>BeiJing Forestry University</publisher-name>, <publisher-loc>Beijing</publisher-loc>. Ph.D. thesis.</citation></ref>
<ref id="B57">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zaizhi</surname> <given-names>Z.</given-names>
</name>
</person-group> (<year>2001</year>). <article-title>Status and perspectives on secondary forests in tropical China</article-title>. <source>J. Trop. For. Sci.</source> <volume>13,</volume> <fpage>639</fpage>&#x2013;<lpage>651</lpage>.</citation></ref>
<ref id="B58">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zhang</surname> <given-names>G.</given-names>
</name>
<name>
<surname>Hui</surname> <given-names>G.</given-names>
</name>
<name>
<surname>Zhang</surname> <given-names>G.</given-names>
</name>
<name>
<surname>Zhao</surname> <given-names>Z.</given-names>
</name>
<name>
<surname>Hu</surname> <given-names>Y.</given-names>
</name>
</person-group> (<year>2019</year>). <article-title>Telescope method for characterizing the spatial structure of a pine-oak mixed forest in the xiaolong mountains, China</article-title>. <source>Scandinavian J. For. Res.</source> <volume>34</volume>, <fpage>751</fpage>&#x2013;<lpage>762</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1080/02827581.2019.1680729</pub-id>
</citation></ref>
<ref id="B59">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zhang</surname> <given-names>G.</given-names>
</name>
<name>
<surname>Hui</surname> <given-names>G.</given-names>
</name>
<name>
<surname>Zhao</surname> <given-names>Z.</given-names>
</name>
<name>
<surname>Hu</surname> <given-names>Y.</given-names>
</name>
<name>
<surname>Wang</surname> <given-names>H.</given-names>
</name>
<name>
<surname>Liu</surname> <given-names>W.</given-names>
</name>
<etal/>
</person-group>. (<year>2018</year>). <article-title>Composition of basal area in natural forests based on the uniform angle index</article-title>. <source>Ecol. Inf.</source> <volume>45</volume>, <fpage>1</fpage>&#x2013;<lpage>8</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1016/j.ecoinf.2018.01.002</pub-id>
</citation></ref>
<ref id="B60">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zhang</surname> <given-names>Y.</given-names>
</name>
<name>
<surname>Qi</surname> <given-names>S.</given-names>
</name>
<name>
<surname>Zhang</surname> <given-names>L.</given-names>
</name>
<name>
<surname>Guo</surname> <given-names>Y.</given-names>
</name>
<name>
<surname>Zhang</surname> <given-names>D.</given-names>
</name>
<name>
<surname>Liu</surname> <given-names>S.</given-names>
</name>
<etal/>
</person-group>. (<year>2024</year>). <article-title>Optimizing <italic>Pinus tabuliformis</italic> forest spatial structure and function in beijing, China</article-title>. <source>Forests (19994907)</source> <volume>15</volume>, <fpage>1963</fpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.3390/f15111963</pub-id>
</citation></ref>
<ref id="B61">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zhang</surname> <given-names>W.</given-names>
</name>
<name>
<surname>Wu</surname> <given-names>X.</given-names>
</name>
<name>
<surname>Jiang</surname> <given-names>S.</given-names>
</name>
<name>
<surname>Liu</surname> <given-names>Y.</given-names>
</name>
<name>
<surname>Weng</surname> <given-names>G.</given-names>
</name>
<name>
<surname>Shen</surname> <given-names>Y.</given-names>
</name>
<etal/>
</person-group>. (<year>2023</year>). <article-title>Technical regulation for forestation; technical report gb/t 15776-2023, state administration for market regulation</article-title>.</citation></ref>
<ref id="B62">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zhao</surname> <given-names>J.</given-names>
</name>
<name>
<surname>Wang</surname> <given-names>J.</given-names>
</name>
<name>
<surname>Yin</surname> <given-names>J.</given-names>
</name>
<name>
<surname>Chen</surname> <given-names>Y.</given-names>
</name>
<name>
<surname>Wu</surname> <given-names>B.</given-names>
</name>
</person-group> (<year>2024</year>). <article-title>Optimization of the stand structure in secondary forests of <italic>Pinus yunnanensis</italic> based on deep reinforcement learning</article-title>. <source>Forests</source> <volume>15</volume>, <fpage>2181</fpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.3390/f15122181</pub-id>
</citation></ref>
<ref id="B63">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zhou</surname> <given-names>C.</given-names>
</name>
<name>
<surname>Liu</surname> <given-names>D.</given-names>
</name>
<name>
<surname>Chen</surname> <given-names>K.</given-names>
</name>
<name>
<surname>Hu</surname> <given-names>X.</given-names>
</name>
<name>
<surname>Lei</surname> <given-names>X.</given-names>
</name>
<name>
<surname>Feng</surname> <given-names>L.</given-names>
</name>
<etal/>
</person-group>. (<year>2022</year>). <article-title>Spatial structure dynamics and maintenance of a natural mixed forest</article-title>. <source>Forests</source> <volume>13</volume>, <fpage>888</fpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.3390/f13060888</pub-id>
</citation></ref>
</ref-list>
<app-group>
<app id="app1">
<title>Appendix 1</title>
<p>To address stand structure optimization, this study proposes a multi-agent deep reinforcement learning algorithm. The detailed pseudocode is provided below. Due to its length, the decision-making processes of Agent1 and Agent2 in the MADQN framework are presented separately.</p>
<boxed-text id="algo1" position="float">
<label>Algorithm 1</label>
<title>Overall Process of MADQN for Stand Structure Optimization.</title>
<p><graphic mimetype="image" mime-subtype="tiff" xlink:href="fpls-16-1610571-g011.tif"/></p>
</boxed-text>
<boxed-text id="algo2" position="float">
<label>Algorithm 2</label>
<title>Agent 1: Selective harvesting Process.</title>
<p><graphic mimetype="image" mime-subtype="tiff" xlink:href="fpls-16-1610571-g012.tif"/></p>
</boxed-text>
<boxed-text id="algo3" position="float">
<label>Algorithm 3</label>
<title>Agent 2: Replanting Process.</title>
<p><graphic mimetype="image" mime-subtype="tiff" xlink:href="fpls-16-1610571-g013.tif"/></p>
</boxed-text>
<sec id="app2">
<title>APPENDIX.2</title>
<p>Furthermore, to realize dynamic optimization of stand structure, this study integrates multi-agent deep reinforcement learning for stand structure optimization with structure prediction, and presents the corresponding pseudocode.</p>
<boxed-text id="algo4" position="float">
<label>Algorithm 4</label>
<title>Stand Structure Dynamic Optimization.</title>
<p><graphic mimetype="image" mime-subtype="tiff" xlink:href="fpls-16-1610571-g014.tif"/></p>
</boxed-text>
</sec>
</app>
</app-group>
</back>
</article>