<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD Journal Publishing with OASIS Tables v3.0 20080202//EN" "https://jats.nlm.nih.gov/nlm-dtd/publishing/3.0/journalpub-oasis3.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:oasis="http://docs.oasis-open.org/ns/oasis-exchange/table" xml:lang="en" dtd-version="3.0" article-type="research-article">
  <front>
    <journal-meta><journal-id journal-id-type="publisher">MS</journal-id><journal-title-group>
    <journal-title>Mechanical Sciences</journal-title>
    <abbrev-journal-title abbrev-type="publisher">MS</abbrev-journal-title><abbrev-journal-title abbrev-type="nlm-ta">Mech. Sci.</abbrev-journal-title>
  </journal-title-group><issn pub-type="epub">2191-916X</issn><publisher>
    <publisher-name>Copernicus Publications</publisher-name>
    <publisher-loc>Göttingen, Germany</publisher-loc>
  </publisher></journal-meta>
    <article-meta>
      <article-id pub-id-type="doi">10.5194/ms-17-783-2026</article-id><title-group><article-title>Optimal design and validation of a heavy-duty wave compensation parallel platform utilizing the NSGA-III algorithm</article-title><alt-title>The NSGA-III algorithm</alt-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author" corresp="no" rid="aff1">
          <name><surname>Huang</surname><given-names>Tianzhong</given-names></name>
          
        </contrib>
        <contrib contrib-type="author" corresp="no" rid="aff3">
          <name><surname>Luo</surname><given-names>Renjie</given-names></name>
          
        </contrib>
        <contrib contrib-type="author" corresp="no" rid="aff1">
          <name><surname>Mao</surname><given-names>Lifeng</given-names></name>
          
        </contrib>
        <contrib contrib-type="author" corresp="no" rid="aff3">
          <name><surname>Wang</surname><given-names>Jia</given-names></name>
          
        </contrib>
        <contrib contrib-type="author" corresp="yes" rid="aff2">
          <name><surname>Zhou</surname><given-names>Fei</given-names></name>
          <email>494839661@qq.com</email>
        </contrib>
        <contrib contrib-type="author" corresp="yes" rid="aff3">
          <name><surname>Zhang</surname><given-names>Guoxing</given-names></name>
          <email>gxzhang@just.edu.cn</email>
        </contrib>
        <aff id="aff1"><label>1</label><institution>Shanghai Marine Equipment Research Institute, Shanghai 409817, China</institution>
        </aff>
        <aff id="aff2"><label>2</label><institution>Zhejiang College of Security Technology, Wenzhou 325016, China</institution>
        </aff>
        <aff id="aff3"><label>3</label><institution>School of Mechanical Engineering, Jiangsu University of Science and Technology, Zhenjiang 212100, China</institution>
        </aff>
      </contrib-group>
      <author-notes><corresp id="corr1">Fei Zhou (494839661@qq.com) and Guoxing Zhang (gxzhang@just.edu.cn)</corresp></author-notes><pub-date><day>28</day><month>July</month><year>2026</year></pub-date>
      
      <volume>17</volume>
      <issue>2</issue>
      <fpage>783</fpage><lpage>798</lpage>
      <history>
        <date date-type="received"><day>23</day><month>April</month><year>2026</year></date>
           <date date-type="rev-recd"><day>3</day><month>July</month><year>2026</year></date>
           <date date-type="accepted"><day>6</day><month>July</month><year>2026</year></date>
      </history>
      <permissions>
        <copyright-statement>Copyright: © 2026 Tianzhong Huang et al.</copyright-statement>
        <copyright-year>2026</copyright-year>
      <license license-type="open-access"><license-p>This work is licensed under the Creative Commons Attribution 4.0 International License. To view a copy of this licence, visit <ext-link ext-link-type="uri" xlink:href="https://creativecommons.org/licenses/by/4.0/">https://creativecommons.org/licenses/by/4.0/</ext-link></license-p></license></permissions><self-uri xlink:href="https://ms.copernicus.org/articles/17/783/2026/ms-17-783-2026.html">This article is available from https://ms.copernicus.org/articles/17/783/2026/ms-17-783-2026.html</self-uri><self-uri xlink:href="https://ms.copernicus.org/articles/17/783/2026/ms-17-783-2026.pdf">The full text article is available as a PDF file from https://ms.copernicus.org/articles/17/783/2026/ms-17-783-2026.pdf</self-uri>
      <abstract><title>Abstract</title>

      <p id="d2e138">The optimal design indices of heavy-duty wave compensation parallel mechanisms usually involve trade-off relationships, making multi-objective optimization of great significance for practical engineering applications. This study proposes a multi-objective optimization approach tailored for a heavy-duty wave compensation parallel platform, which integrates an artificial neural network (ANN) surrogate model with an enhanced NSGA-III algorithm. Firstly, a decision-making model is constructed, incorporating the topological parameters and performance indices of the mechanism. Secondly, an explicit surrogate model is developed to establish the relationship between structural parameters and the physical responses of the system using an ANN, thereby enhancing the computational efficiency of the pose-space traversal of the parallel platform. Finally, the NSGA-III algorithm, integrated with reference points and an interference penalty mechanism, is utilized for high-dimensional parameter optimization, while the technique for order preference by similarity to ideal solution (TOPSIS) is employed to achieve collaborative optimization across different objectives. Comparative results indicate that NSGA-III outperforms the traditional NSGA-II algorithm in terms of evaluation metrics. Compared to the initial baseline design, the optimal solution achieves an 18.12 % improvement in dexterity, an 11.78 % reduction in peak driving force, and a 6.85 % enhancement in the condition number, all while reducing actuator stroke. This study provides a valuable reference for the optimal design and prototype development of heavy-duty wave compensation parallel platforms.</p>
  </abstract>
    
<funding-group>
<award-group id="gs1">
<funding-source>Major Basic Research Project of the Natural Science Foundation of the Jiangsu Higher Education Institutions</funding-source>
<award-id>23KJB460010</award-id>
</award-group>
<award-group id="gs2">
<funding-source>Science and Technology Plan Project of Wenzhou Municipality</funding-source>
<award-id>G20240076</award-id>
</award-group>
</funding-group>
</article-meta>
  </front>
<body>
      

<sec id="Ch1.S1" sec-type="intro">
  <label>1</label><title>Introduction</title>
      <p id="d2e150">With the continuous advancement of offshore engineering technology and equipment into deep-sea areas, maritime operations such as offshore wind power maintenance, large-scale equipment lifting, and the transfer of personnel and materials have experienced explosive growth (Mu et al., 2026; Niu et al., 2022). As the core passage connecting service operation vessels and offshore fixed platforms, the offshore gangway is a critical piece of equipment for ensuring the safety of personnel and materials. However, the complex and volatile marine environment induces 6-degree-of-freedom motions in the ship, which can easily trigger structural collisions and equipment damage or even threaten the safety of operators. Equipped wave compensation systems at the base of offshore gangways have become a prevailing industry consensus for current deep-sea operations (Liang et al., 2020; Tang et al., 2023).</p>
      <p id="d2e153">In recent years, as maritime operations have trended toward large-scale and heavy-load applications, more stringent performance requirements have been imposed on wave compensation equipment. Among various spatial mechanisms, the 6-degree-of-freedom Stewart (1965) parallel mechanism has been widely adopted as the underlying actuator for heavy-duty wave compensation gangways owing to its high structural stiffness, superior load-bearing capacity, and rapid dynamic response (Briot et al., 2015; Yin et al., 2022). In the design of parallel mechanisms, the selection of parameters – such as the radii of the base and platform joints, the joint distribution angles, and the initial height – directly determines the kinematic and dynamic performance across the entire task space (Dasgupta et al., 2000; Gosselin et al., 1991). Highlighting this dependency, Zhang et al. (2022a, b) conducted dynamic modeling and vibration characteristic analysis on parallel antenna structures, demonstrating the critical impact of geometric configurations on overall dynamic stability. Guo et al. (2022a, b) synthesized a URU-RR-URU module antenna by connecting mechanism configuration, and a mechanical analysis of a deployable antenna based on the 3RR-3URU element was carried out. Furthermore, in the broader field of structural optimization, Wang et al. (2025) and Wang et al. (2026) demonstrated that strategically designing geometric configurations based on load paths is highly effective for enhancing the stiffness of Gyroid functionally graded lattice structures. For heavy-duty offshore gangways, any mismatch in geometric dimensions can lead to redundant actuator strokes and low utilization of the ship's deck space. More critically, it can cause certain legs to endure excessive peak driving forces when encountering extreme wave poses (Wang et al., 2017). Furthermore, if the mechanism approaches a singular pose within the workspace, it may experience violent oscillations, leading to mechanical failure (Hsu et al., 2023). Therefore, optimizing the configuration parameters of the parallel platform is a prerequisite for achieving the efficient and stable operation of high-load wave compensation systems.</p>
      <p id="d2e156">Current research on wave compensation systems for offshore gangway parallel platforms primarily focuses on the development of low-level control algorithms. In exploring the widespread application of these control technologies across diverse robotic domains, Yu et al. (2026) systematically reviewed the evolution from structural design to intelligent control for soft robots. Similarly, Fallahiarezoodar and Zhu (2025) extensively summarized the control strategies of autonomous space robotic manipulators for on-orbit servicing. Wang et al. (2025) adopted a linear active disturbance rejection control strategy, effectively estimating and compensating for nonlinear loads caused by complex sea states. Li et al. (2024) employed a neural-network-based back propagation proportional integral derivative (BP-PID) algorithm, enhancing the robustness and compensation accuracy of shipborne Stewart platforms. Grewal et al. (2012) utilized linear–quadratic–Gaussian control, significantly improving attitude tracking precision by combining a linear quadratic regulator (LQR) with Kalman filtering. Richter et al. (2017) applied model predictive control to active wave compensation systems, handling the physical saturation constraints of actuators through receding horizon optimization. Chen et al. (2023) proposed a modal space strategy for dynamic decoupling, weakening nonlinear interference between multi-axis hydraulic cylinders. Zhang et al. (2025) proposed a novel method for surface division and conducted verification. However, most of the aforementioned studies are predicated on fixed mechanism dimensions, relying on control algorithms to compensate for physical configuration deficiencies. In the evolution of parallel mechanism topological parameter optimization, early strategies predominantly relied on single-objective optimization. Although algorithms like differential evolution and genetic algorithms have played vital roles (Storn et al., 1997; Holland et al., 1992; Qiang et al., 2019), these conventional swarm intelligence methods are prone to premature convergence when facing the complex nonlinear parameters of the Stewart platform, struggling to escape local optima and effectively handle multimodal functions.</p>
      <p id="d2e159">To balance multiple performance indices, Gao et al. (2010) and Abdur et al. (2018) assigned weighting coefficients to different objectives using genetic algorithms to transform multi-objective problems into single-objective evaluations. However, since performance indices are often mutually exclusive, this weight allocation is inherently subjective and difficult to quantify precisely for practical engineering trade-offs (Marler et al., 2010). Additionally, Karaboga and Basturk (2007) and Poli et al. (2007) explored heuristic methods like artificial bee colony and particle swarm optimization to optimize actuator velocity and driving force (Shahbazi et al., 2024). Yet, these methods suffer from low computational efficiency during massive transient force analyses for heavy-duty platforms, yielding incomplete or discontinuous Pareto fronts. To overcome these computational barriers, Jin (2011) and other researchers introduced surrogate-assisted optimization strategies cross-fused with artificial neural networks (ANNs), achieving orders-of-magnitude leaps in optimization efficiency by constructing explicit surrogate models (Bhosekar et al., 2018; Chughet al., 2019; Hornik et al.,1989; Pu et al., 2023; Tao et al., 2025). Furthermore, while the traditional NSGA-II algorithm is widely used, it loses its screening ability in high-dimensional spaces as the number of objectives increases (Deb et al., 2002; Liu et al., 2018; Purshouse et al., 2007). To address this flaw, Deb and Jain (2013) developed the NSGA-III algorithm based on a systematic reference point mechanism, proving its effectiveness in capturing continuous and dense fronts in high-dimensional spaces (Ishibuchi et al., 2016). Simultaneously, Hwang and Yoon (2012) and Shih et al. (2007) established TOPSIS as an effective tool for scientifically selecting the global optimal solution from high-dimensional non-dominated sets. Despite these advances, systematic optimization integrating all of these elements remains scarce. Fundamentally, any advanced control strategy must be built upon a rational physical configuration; otherwise, the system will inevitably be constrained by inherent physical bottlenecks such as actuator output limitations and joint interference. For a 20 t heavy-duty wave compensation platform, achieving a compact, high-capacity, and impact-resistant design urgently requires investigating the multi-objective optimization problem consisting of four core physical indices: maximum actuator stroke, peak driving force, global dexterity, and kinematic isotropy.</p>
      <p id="d2e163">To address the multi-parameter coupling and complex solving issues in heavy-duty wave compensation parallel platforms, this paper proposes a systematic optimization framework. First, a comprehensive decision model encompassing topological parameters and performance indices is constructed. Second, an ANN is introduced to establish an explicit surrogate model for physical responses. Subsequently, an improved NSGA-III algorithm is employed for high-dimensional optimization to obtain the Pareto optimal front. Finally, the TOPSIS decision-making method is applied to select the global optimal configuration. This study provides a reliable design benchmark for the prototype development of heavy-duty wave compensation equipment.</p>
</sec>
<sec id="Ch1.S2">
  <label>2</label><title>Multi-objective optimization design modeling of heavy-duty compensation parallel platforms</title>
<sec id="Ch1.S2.SS1">
  <label>2.1</label><title>Establishment of the optimization model</title>
      <p id="d2e181">First, two coordinate systems – the moving and fixed frames – are established. The origin <inline-formula><mml:math id="M1" display="inline"><mml:mi>O</mml:mi></mml:math></inline-formula> of the fixed coordinate system <inline-formula><mml:math id="M2" display="inline"><mml:mi>O</mml:mi></mml:math></inline-formula>-<italic>xyz</italic> is located at the center of the base platform's joints. The origin <inline-formula><mml:math id="M3" display="inline"><mml:mi>C</mml:mi></mml:math></inline-formula> of the moving-coordinate system <inline-formula><mml:math id="M4" display="inline"><mml:mi>C</mml:mi></mml:math></inline-formula>-<italic>xyz</italic> is located at the center of the moving platform's joints. When the moving platform is at its home position, the directions of the <inline-formula><mml:math id="M5" display="inline"><mml:mi>x</mml:mi></mml:math></inline-formula>, <inline-formula><mml:math id="M6" display="inline"><mml:mi>y</mml:mi></mml:math></inline-formula>, and <inline-formula><mml:math id="M7" display="inline"><mml:mi>z</mml:mi></mml:math></inline-formula> axes for both coordinate systems are identical, and the <inline-formula><mml:math id="M8" display="inline"><mml:mi>z</mml:mi></mml:math></inline-formula> axis of the fixed coordinate system passes through point <inline-formula><mml:math id="M9" display="inline"><mml:mi>C</mml:mi></mml:math></inline-formula>. The orientation of each axis is shown in Fig. 1.</p>

      <fig id="F1"><label>Figure 1</label><caption><p id="d2e256">Schematic diagram of the heavy-duty compensation parallel platform mechanism.</p></caption>
          <graphic xlink:href="https://ms.copernicus.org/articles/17/783/2026/ms-17-783-2026-f01.png"/>

        </fig>

      <p id="d2e265">As shown in Fig. 1, points <inline-formula><mml:math id="M10" display="inline"><mml:mrow><mml:msub><mml:mi>B</mml:mi><mml:mn mathvariant="normal">1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula>–<inline-formula><mml:math id="M11" display="inline"><mml:mrow><mml:msub><mml:mi>B</mml:mi><mml:mn mathvariant="normal">6</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> are the six joints on the upper platform, used for installation and positioning at the upper-platform connections, and <inline-formula><mml:math id="M12" display="inline"><mml:mi>C</mml:mi></mml:math></inline-formula> is the center of the upper joint circle. Points <inline-formula><mml:math id="M13" display="inline"><mml:mrow><mml:msub><mml:mi>A</mml:mi><mml:mn mathvariant="normal">1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula>–<inline-formula><mml:math id="M14" display="inline"><mml:mrow><mml:msub><mml:mi>A</mml:mi><mml:mn mathvariant="normal">6</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> are the six joints used for installation and positioning at the lower-platform connections, and <inline-formula><mml:math id="M15" display="inline"><mml:mi>O</mml:mi></mml:math></inline-formula> is the center of the lower joint circle. <inline-formula><mml:math id="M16" display="inline"><mml:mrow><mml:msub><mml:mi>R</mml:mi><mml:mi>B</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> represents the radius of the upper platform's joint circle, and <inline-formula><mml:math id="M17" display="inline"><mml:mrow><mml:msub><mml:mi>R</mml:mi><mml:mi>A</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> represents the radius of the lower platform's joint circle, while <inline-formula><mml:math id="M18" display="inline"><mml:mi>H</mml:mi></mml:math></inline-formula> represents the initial height of the platform. The angle between a pair of adjacent joints on the upper platform is <inline-formula><mml:math id="M19" display="inline"><mml:mi mathvariant="italic">α</mml:mi></mml:math></inline-formula>, and the angle between a pair of adjacent joints on the lower platform is <inline-formula><mml:math id="M20" display="inline"><mml:mi mathvariant="italic">β</mml:mi></mml:math></inline-formula>.</p>

      <fig id="F2"><label>Figure 2</label><caption><p id="d2e373">Joint distribution on the moving and base platforms. <bold>(a)</bold> Moving platform. <bold>(b)</bold> Base platform.</p></caption>
          <graphic xlink:href="https://ms.copernicus.org/articles/17/783/2026/ms-17-783-2026-f02.png"/>

        </fig>

      <p id="d2e388">For the heavy-duty compensation parallel platform, five key configuration parameters affecting its kinematic characteristics are selected to form a five-dimensional decision vector <inline-formula><mml:math id="M21" display="inline"><mml:mi mathvariant="bold-italic">x</mml:mi></mml:math></inline-formula>:

            <disp-formula id="Ch1.E1" content-type="numbered"><label>1</label><mml:math id="M22" display="block"><mml:mrow><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mo>=</mml:mo><mml:mo>[</mml:mo><mml:msub><mml:mi>R</mml:mi><mml:mi>B</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>R</mml:mi><mml:mi>A</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:mi mathvariant="italic">α</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant="italic">β</mml:mi><mml:mo>,</mml:mo><mml:mi>H</mml:mi><mml:msup><mml:mo>]</mml:mo><mml:mi>T</mml:mi></mml:msup></mml:mrow></mml:math></disp-formula>

          Each element of the vector corresponds to a physical dimension of the mechanism, and the optimization algorithm will search for the optimal solution within a five-dimensional space. Table 1 presents the value ranges of the structural design variables for the heavy-duty wave compensation platform.</p>

<table-wrap id="T1"><label>Table 1</label><caption><p id="d2e443">Structural design variables of the wave compensation platform.</p></caption><oasis:table frame="topbot"><oasis:tgroup cols="6">
     <oasis:colspec colnum="1" colname="col1" align="left"/>
     <oasis:colspec colnum="2" colname="col2" align="right"/>
     <oasis:colspec colnum="3" colname="col3" align="right"/>
     <oasis:colspec colnum="4" colname="col4" align="right"/>
     <oasis:colspec colnum="5" colname="col5" align="right"/>
     <oasis:colspec colnum="6" colname="col6" align="right"/>
     <oasis:thead>
       <oasis:row rowsep="1">
         <oasis:entry colname="col1">Variable symbol</oasis:entry>
         <oasis:entry colname="col2"><inline-formula><mml:math id="M23" display="inline"><mml:mrow><mml:msub><mml:mi>R</mml:mi><mml:mi>B</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula></oasis:entry>
         <oasis:entry colname="col3"><inline-formula><mml:math id="M24" display="inline"><mml:mrow><mml:msub><mml:mi>R</mml:mi><mml:mi>A</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula></oasis:entry>
         <oasis:entry colname="col4"><inline-formula><mml:math id="M25" display="inline"><mml:mi mathvariant="italic">α</mml:mi></mml:math></inline-formula></oasis:entry>
         <oasis:entry colname="col5"><inline-formula><mml:math id="M26" display="inline"><mml:mi mathvariant="italic">β</mml:mi></mml:math></inline-formula></oasis:entry>
         <oasis:entry colname="col6"><inline-formula><mml:math id="M27" display="inline"><mml:mi>H</mml:mi></mml:math></inline-formula></oasis:entry>
       </oasis:row>
     </oasis:thead>
     <oasis:tbody>
       <oasis:row>
         <oasis:entry colname="col1">Lower bound (mm)</oasis:entry>
         <oasis:entry colname="col2">2000</oasis:entry>
         <oasis:entry colname="col3">3000</oasis:entry>
         <oasis:entry colname="col4">10</oasis:entry>
         <oasis:entry colname="col5">10</oasis:entry>
         <oasis:entry colname="col6">4000</oasis:entry>
       </oasis:row>
       <oasis:row>
         <oasis:entry colname="col1">Upper bound (mm)</oasis:entry>
         <oasis:entry colname="col2">3000</oasis:entry>
         <oasis:entry colname="col3">4500</oasis:entry>
         <oasis:entry colname="col4">30</oasis:entry>
         <oasis:entry colname="col5">30</oasis:entry>
         <oasis:entry colname="col6">7000</oasis:entry>
       </oasis:row>
     </oasis:tbody>
   </oasis:tgroup></oasis:table></table-wrap>

      <p id="d2e569">The decision space of the optimization algorithm is constrained within a five-dimensional hyper-rectangular region:

            <disp-formula id="Ch1.E2" content-type="numbered"><label>2</label><mml:math id="M28" display="block"><mml:mrow><mml:mi mathvariant="normal">Ω</mml:mi><mml:mo>=</mml:mo><mml:mo mathvariant="italic">{</mml:mo><mml:mi>x</mml:mi><mml:mo>∈</mml:mo><mml:msup><mml:mi>R</mml:mi><mml:mn mathvariant="normal">5</mml:mn></mml:msup><mml:mo>∣</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant="normal">min</mml:mi></mml:mrow></mml:msub><mml:mo>≤</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>≤</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant="normal">max</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo></mml:mrow></mml:math></disp-formula>

            <disp-formula id="Ch1.E3" content-type="numbered"><label>3</label><mml:math id="M29" display="block"><mml:mrow><mml:mfenced close="" open="{"><mml:mrow><mml:mtable class="array" columnalign="left"><mml:mtr><mml:mtd><mml:mrow><mml:msub><mml:mi mathvariant="bold">var</mml:mi><mml:mi mathvariant="normal">min</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mo>[</mml:mo><mml:mn mathvariant="normal">2000</mml:mn><mml:mo>,</mml:mo><mml:mn mathvariant="normal">3.0</mml:mn><mml:mo>,</mml:mo><mml:mn mathvariant="normal">10</mml:mn><mml:mo>,</mml:mo><mml:mn mathvariant="normal">10</mml:mn><mml:mo>,</mml:mo><mml:mn mathvariant="normal">4.0</mml:mn><mml:msup><mml:mo>]</mml:mo><mml:mi>T</mml:mi></mml:msup></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:msub><mml:mi mathvariant="bold">var</mml:mi><mml:mi mathvariant="normal">max</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mo>[</mml:mo><mml:mn mathvariant="normal">3000</mml:mn><mml:mo>,</mml:mo><mml:mn mathvariant="normal">4.5</mml:mn><mml:mo>,</mml:mo><mml:mn mathvariant="normal">30</mml:mn><mml:mo>,</mml:mo><mml:mn mathvariant="normal">30</mml:mn><mml:mo>,</mml:mo><mml:mn mathvariant="normal">7.0</mml:mn><mml:msup><mml:mo>]</mml:mo><mml:mi>T</mml:mi></mml:msup></mml:mrow></mml:mtd></mml:mtr></mml:mtable><mml:mo>,</mml:mo></mml:mrow></mml:mfenced></mml:mrow></mml:math></disp-formula>

          where <inline-formula><mml:math id="M30" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="bold">var</mml:mi><mml:mi mathvariant="normal">min</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math id="M31" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="bold">var</mml:mi><mml:mi mathvariant="normal">max</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> denote the lower and upper bounds of the variables, respectively. These limits are not assigned arbitrarily; rather, they are constrained by practical engineering considerations, such as the available deck space of the main vessel, servo-cylinder selection catalogs, and the anti-interference clearance of the joints. Through the parametric description of the geometric configuration of the heavy-duty compensation parallel platform, a design space encompassing the radial dimensions, angular distributions, and spatial height – which characterize the topological features of the mechanism – is established. By setting reasonable physical boundary constraints and proportional constraints, the search process is ensured to be conducted within a set of configurations that satisfy practical engineering requirements.</p>
</sec>
<sec id="Ch1.S2.SS2">
  <label>2.2</label><title>Formulation of objective functions</title>
      <p id="d2e740">Considering the structural parameters of the heavy-duty compensation parallel platform and practical engineering requirements, the maximum actuator stroke, peak driving force, maximum dexterity, and kinematic isotropy are selected as the four objective functions for the optimization analysis.</p>
<sec id="Ch1.S2.SS2.SSS1">
  <label>2.2.1</label><title>(a) Actuator stroke objective<inline-formula><mml:math id="M32" display="inline"><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mn mathvariant="normal">1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula></title>
      <p id="d2e761">Minimizing the actuator stroke <inline-formula><mml:math id="M33" display="inline"><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mn mathvariant="normal">1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> yields dual benefits in both structural design and dynamic performance. The definition and application of this optimization objective are illustrated in Fig. 3.</p>

      <fig id="F3"><label>Figure 3</label><caption><p id="d2e777">Definition and application of optimization objective <inline-formula><mml:math id="M34" display="inline"><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mn mathvariant="normal">1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula>.</p></caption>
            <graphic xlink:href="https://ms.copernicus.org/articles/17/783/2026/ms-17-783-2026-f03.png"/>

          </fig>

      <p id="d2e797">For a given set of poses <inline-formula><mml:math id="M35" display="inline"><mml:mi>P</mml:mi></mml:math></inline-formula> in the workspace, which includes the 6-DOF extreme poses, the maximum length of the <inline-formula><mml:math id="M36" display="inline"><mml:mi>i</mml:mi></mml:math></inline-formula>th leg, max(<inline-formula><mml:math id="M37" display="inline"><mml:mrow><mml:msub><mml:mi>L</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>), can be determined through inverse kinematics:

              <disp-formula id="Ch1.E4" content-type="numbered"><label>4</label><mml:math id="M38" display="block"><mml:mrow><mml:msub><mml:mi>L</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mo>∥</mml:mo><mml:mi mathvariant="bold-italic">T</mml:mi><mml:mo>+</mml:mo><mml:mi mathvariant="bold">R</mml:mi><mml:msup><mml:mo>⋅</mml:mo><mml:mi mathvariant="normal">P</mml:mi></mml:msup><mml:msub><mml:mi mathvariant="bold-italic">b</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>-</mml:mo><mml:msub><mml:mi>a</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>∥</mml:mo><mml:mo>,</mml:mo><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn><mml:mo>,</mml:mo><mml:mi mathvariant="normal">…</mml:mi><mml:mo>,</mml:mo><mml:mn mathvariant="normal">6</mml:mn><mml:mo>,</mml:mo></mml:mrow></mml:math></disp-formula>

            where <inline-formula><mml:math id="M39" display="inline"><mml:mi mathvariant="bold-italic">T</mml:mi></mml:math></inline-formula> and <inline-formula><mml:math id="M40" display="inline"><mml:mi mathvariant="bold">R</mml:mi></mml:math></inline-formula> are the translation vector and rotation matrix of the pose transformation, respectively; <inline-formula><mml:math id="M41" display="inline"><mml:mrow><mml:msup><mml:mi/><mml:mi mathvariant="normal">P</mml:mi></mml:msup><mml:msub><mml:mi mathvariant="bold-italic">b</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> represents the coordinates of the moving joint in the moving-coordinate system; and <inline-formula><mml:math id="M42" display="inline"><mml:mrow><mml:msub><mml:mi>a</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> represents the coordinates of the fixed joint in the base coordinate system. The actuator stroke objective <inline-formula><mml:math id="M43" display="inline"><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mn mathvariant="normal">1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> is defined as the difference between the maximum and minimum lengths of the legs within the workspace:

              <disp-formula id="Ch1.E5" content-type="numbered"><label>5</label><mml:math id="M44" display="block"><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mn mathvariant="normal">1</mml:mn></mml:msub><mml:mo>(</mml:mo><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mo>)</mml:mo><mml:mo>=</mml:mo><mml:mtable class="substack"><mml:mtr><mml:mtd><mml:mo movablelimits="false">max⁡</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mi mathvariant="bold-italic">P</mml:mi><mml:mo>,</mml:mo><mml:mi>i</mml:mi></mml:mtd></mml:mtr></mml:mtable><mml:mfenced open="(" close=")"><mml:mrow><mml:msub><mml:mi>L</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:mfenced><mml:mo>-</mml:mo><mml:mtable class="substack"><mml:mtr><mml:mtd><mml:mo movablelimits="false">min⁡</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mi mathvariant="bold-italic">P</mml:mi><mml:mo>,</mml:mo><mml:mi>i</mml:mi></mml:mtd></mml:mtr></mml:mtable><mml:mfenced open="(" close=")"><mml:mrow><mml:msub><mml:mi>L</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:mfenced><mml:mo>.</mml:mo></mml:mrow></mml:math></disp-formula></p>
</sec>
<sec id="Ch1.S2.SS2.SSS2">
  <label>2.2.2</label><title>(b) Peak driving-force objective <inline-formula><mml:math id="M45" display="inline"><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mn mathvariant="normal">2</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula></title>
      <p id="d2e1017">The driving-force index is a crucial metric for evaluating the actuation capability of the heavy-duty compensation parallel platform. Its optimization path is illustrated in Fig. 4.</p>

      <fig id="F4" specific-use="star"><label>Figure 4</label><caption><p id="d2e1022">Definition and application of optimization objective <inline-formula><mml:math id="M46" display="inline"><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mn mathvariant="normal">2</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula>.</p></caption>
            <graphic xlink:href="https://ms.copernicus.org/articles/17/783/2026/ms-17-783-2026-f04.png"/>

          </fig>

      <p id="d2e1042">First, the generalized external load vector <inline-formula><mml:math id="M47" display="inline"><mml:mi mathvariant="bold-italic">W</mml:mi></mml:math></inline-formula> is formulated. Considering the total mass <inline-formula><mml:math id="M48" display="inline"><mml:mi>M</mml:mi></mml:math></inline-formula> of the moving platform and its payload, along with the diagonal moment of inertia matrix <inline-formula><mml:math id="M49" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="bold">I</mml:mi><mml:mi mathvariant="normal">b</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mi mathvariant="normal">diag</mml:mi><mml:mo>(</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">I</mml:mi><mml:mi>x</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">I</mml:mi><mml:mi>y</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>I</mml:mi><mml:mi>z</mml:mi></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>, the generalized external load vector <inline-formula><mml:math id="M50" display="inline"><mml:mrow><mml:mi mathvariant="bold-italic">W</mml:mi><mml:mo>=</mml:mo><mml:mo>[</mml:mo><mml:mi mathvariant="bold-italic">F</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant="bold-italic">M</mml:mi><mml:msup><mml:mo>]</mml:mo><mml:mi>T</mml:mi></mml:msup></mml:mrow></mml:math></inline-formula> applied to the system during dynamic tasks consists of the force component <bold><italic>F</italic></bold> and the moment component <bold><italic>M</italic></bold>.</p>
      <p id="d2e1130">Within the force component <bold><italic>F</italic></bold>, the vertical load <inline-formula><mml:math id="M51" display="inline"><mml:mrow><mml:msub><mml:mi>F</mml:mi><mml:mi>z</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> is the most significant. It comprises the gravitational effect of the total mass of the platform and its payload, the inertial force induced by the motion, and the rated external downward force <inline-formula><mml:math id="M52" display="inline"><mml:mrow><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mi mathvariant="normal">ext</mml:mi><mml:mo>,</mml:mo><mml:mi>z</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>, where <inline-formula><mml:math id="M53" display="inline"><mml:mrow><mml:msub><mml:mi>F</mml:mi><mml:mi>z</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> is expressed as follows:

              <disp-formula id="Ch1.E6" content-type="numbered"><label>6</label><mml:math id="M54" display="block"><mml:mrow><mml:msub><mml:mi>F</mml:mi><mml:mi>z</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mi mathvariant="bold-italic">M</mml:mi><mml:mo>(</mml:mo><mml:mi>g</mml:mi><mml:mo>+</mml:mo><mml:msub><mml:mi>a</mml:mi><mml:mi>z</mml:mi></mml:msub><mml:mo>)</mml:mo><mml:mo>+</mml:mo><mml:mfenced open="|" close="|"><mml:mrow><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mi mathvariant="normal">ext</mml:mi><mml:mo>,</mml:mo><mml:mi>z</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mfenced><mml:mo>.</mml:mo></mml:mrow></mml:math></disp-formula>

            For the moment component <bold><italic>M</italic></bold>, the rotational moment of inertia of the moving platform, <inline-formula><mml:math id="M55" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="bold">I</mml:mi><mml:mi mathvariant="normal">b</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mi mathvariant="normal">diag</mml:mi><mml:mo>(</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">I</mml:mi><mml:mi>x</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">I</mml:mi><mml:mi>y</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>I</mml:mi><mml:mi>z</mml:mi></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>, must be taken into account; the inertial moments cannot be neglected during roll or pitch motions. To accurately evaluate the dynamic response of the moving platform during spatial attitude transformations, the generalized moment <bold><italic>M</italic></bold> is decomposed into the pitch moment <bold><italic>M</italic></bold><sub><italic>x</italic></sub> about the <inline-formula><mml:math id="M57" display="inline"><mml:mi>x</mml:mi></mml:math></inline-formula> axis and the roll moment <bold><italic>M</italic></bold><sub><italic>y</italic></sub> about the <inline-formula><mml:math id="M59" display="inline"><mml:mi>y</mml:mi></mml:math></inline-formula> axis. Combined with the external disturbance moment <bold><italic>M</italic></bold><sub>ext</sub>, the resultant moment is expressed as follows:

              <disp-formula id="Ch1.E7" content-type="numbered"><label>7</label><mml:math id="M61" display="block"><mml:mrow><mml:mfenced open="{" close=""><mml:mtable class="array" columnalign="left"><mml:mtr><mml:mtd><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">M</mml:mi><mml:mi>x</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">I</mml:mi><mml:mi>x</mml:mi></mml:msub><mml:mo>⋅</mml:mo><mml:msub><mml:mi mathvariant="italic">ϵ</mml:mi><mml:mi>r</mml:mi></mml:msub><mml:mo>+</mml:mo><mml:mfenced close="|" open="|"><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">M</mml:mi><mml:mrow><mml:mi mathvariant="normal">ext</mml:mi><mml:mo>,</mml:mo><mml:mi>x</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mfenced></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">M</mml:mi><mml:mi>y</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">I</mml:mi><mml:mi>y</mml:mi></mml:msub><mml:mo>⋅</mml:mo><mml:msub><mml:mi mathvariant="italic">ϵ</mml:mi><mml:mi>p</mml:mi></mml:msub><mml:mo>+</mml:mo><mml:mfenced open="|" close="|"><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">M</mml:mi><mml:mrow><mml:mi mathvariant="normal">ext</mml:mi><mml:mo>,</mml:mo><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mfenced></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mfenced></mml:mrow></mml:math></disp-formula>

            where the linear acceleration is <inline-formula><mml:math id="M62" display="inline"><mml:mrow><mml:msub><mml:mi>a</mml:mi><mml:mi>z</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mi>A</mml:mi><mml:mi>z</mml:mi></mml:msub><mml:mo>⋅</mml:mo><mml:msup><mml:mi mathvariant="italic">ω</mml:mi><mml:mn mathvariant="normal">2</mml:mn></mml:msup></mml:mrow></mml:math></inline-formula>, and the angular acceleration is <inline-formula><mml:math id="M63" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="italic">α</mml:mi><mml:mi>r</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mi>A</mml:mi><mml:mi mathvariant="normal">rot</mml:mi></mml:msub><mml:mo>⋅</mml:mo><mml:msup><mml:mi mathvariant="italic">ω</mml:mi><mml:mn mathvariant="normal">2</mml:mn></mml:msup></mml:mrow></mml:math></inline-formula>; <inline-formula><mml:math id="M64" display="inline"><mml:mrow><mml:msub><mml:mi>A</mml:mi><mml:mi>z</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math id="M65" display="inline"><mml:mrow><mml:msub><mml:mi>A</mml:mi><mml:mi mathvariant="normal">rot</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> denote the amplitudes of the vertical displacement and the rotation angle, respectively.</p>
      <p id="d2e1470">Ultimately, the generalized force vector <inline-formula><mml:math id="M66" display="inline"><mml:mi mathvariant="bold-italic">W</mml:mi></mml:math></inline-formula> applied at the center of the moving platform is defined as follows:

              <disp-formula id="Ch1.E8" content-type="numbered"><label>8</label><mml:math id="M67" display="block"><mml:mrow><mml:mi mathvariant="bold-italic">W</mml:mi><mml:mo>=</mml:mo><mml:mfenced open="[" close="]"><mml:mtable class="array" columnalign="center"><mml:mtr><mml:mtd><mml:mrow><mml:msub><mml:mi>F</mml:mi><mml:mi>x</mml:mi></mml:msub></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:msub><mml:mi>F</mml:mi><mml:mi>y</mml:mi></mml:msub></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:msub><mml:mi>F</mml:mi><mml:mi>z</mml:mi></mml:msub></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">M</mml:mi><mml:mi>x</mml:mi></mml:msub></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">M</mml:mi><mml:mi>y</mml:mi></mml:msub></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">M</mml:mi><mml:mi>z</mml:mi></mml:msub></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mfenced><mml:mo>=</mml:mo><mml:mfenced open="[" close="]"><mml:mtable class="array" columnalign="center"><mml:mtr><mml:mtd><mml:mn mathvariant="normal">0</mml:mn></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mn mathvariant="normal">0</mml:mn></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:mo>-</mml:mo><mml:mfenced open="[" close="]"><mml:mrow><mml:mi mathvariant="bold-italic">M</mml:mi><mml:mfenced open="(" close=")"><mml:mrow><mml:mi>g</mml:mi><mml:mo>+</mml:mo><mml:msub><mml:mi>a</mml:mi><mml:mi>z</mml:mi></mml:msub></mml:mrow></mml:mfenced><mml:mo>+</mml:mo><mml:mfenced close="|" open="|"><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">F</mml:mi><mml:mrow><mml:mi mathvariant="normal">ext</mml:mi><mml:mo>,</mml:mo><mml:mi>z</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mfenced></mml:mrow></mml:mfenced></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">I</mml:mi><mml:mi>x</mml:mi></mml:msub><mml:mo>⋅</mml:mo><mml:msub><mml:mi mathvariant="italic">α</mml:mi><mml:mi>x</mml:mi></mml:msub><mml:mo>+</mml:mo><mml:mfenced open="|" close="|"><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">M</mml:mi><mml:mrow><mml:mi mathvariant="normal">ext</mml:mi><mml:mo>,</mml:mo><mml:mi>x</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mfenced></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">I</mml:mi><mml:mi>y</mml:mi></mml:msub><mml:mo>⋅</mml:mo><mml:msub><mml:mi mathvariant="italic">α</mml:mi><mml:mi>y</mml:mi></mml:msub><mml:mo>+</mml:mo><mml:mfenced open="|" close="|"><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">M</mml:mi><mml:mrow><mml:mi mathvariant="normal">ext</mml:mi><mml:mo>,</mml:mo><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mfenced></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mn mathvariant="normal">0</mml:mn></mml:mtd></mml:mtr></mml:mtable></mml:mfenced><mml:mo>.</mml:mo></mml:mrow></mml:math></disp-formula>

            Based on the principle of virtual work, the mapping relationship between the leg driving-force vector <inline-formula><mml:math id="M68" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">F</mml:mi><mml:mi mathvariant="normal">leg</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mo>[</mml:mo><mml:msub><mml:mi>F</mml:mi><mml:mn mathvariant="normal">1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>F</mml:mi><mml:mn mathvariant="normal">2</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>F</mml:mi><mml:mn mathvariant="normal">3</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>F</mml:mi><mml:mn mathvariant="normal">4</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>F</mml:mi><mml:mn mathvariant="normal">5</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>F</mml:mi><mml:mn mathvariant="normal">6</mml:mn></mml:msub><mml:msup><mml:mo>]</mml:mo><mml:mi>T</mml:mi></mml:msup></mml:mrow></mml:math></inline-formula> and the generalized external load <inline-formula><mml:math id="M69" display="inline"><mml:mi mathvariant="bold-italic">W</mml:mi></mml:math></inline-formula> on the moving platform is determined by the force Jacobian matrix <inline-formula><mml:math id="M70" display="inline"><mml:mi mathvariant="bold">H</mml:mi></mml:math></inline-formula> of the mechanism:

              <disp-formula id="Ch1.E9" content-type="numbered"><label>9</label><mml:math id="M71" display="block"><mml:mtable class="array" columnalign="left"><mml:mtr><mml:mtd><mml:mrow><mml:mi mathvariant="bold-italic">W</mml:mi><mml:mo>=</mml:mo><mml:mi mathvariant="bold">H</mml:mi><mml:mo>⋅</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">F</mml:mi><mml:mi mathvariant="normal">leg</mml:mi></mml:msub><mml:mo>,</mml:mo></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">F</mml:mi><mml:mi mathvariant="normal">leg</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:msup><mml:mi mathvariant="bold">H</mml:mi><mml:mrow><mml:mo>-</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:msup><mml:mi mathvariant="bold-italic">W</mml:mi><mml:mo>,</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>

            where each column of <inline-formula><mml:math id="M72" display="inline"><mml:mi mathvariant="bold">H</mml:mi></mml:math></inline-formula> consists of the unit direction vector <bold><italic>n</italic></bold><sub><italic>i</italic></sub> of the leg and its moment about the center of the moving platform.

              <disp-formula id="Ch1.E10" content-type="numbered"><label>10</label><mml:math id="M74" display="block"><mml:mtable class="split" rowspacing="0.2ex" displaystyle="true" columnalign="right"><mml:mtr><mml:mtd><mml:mrow><mml:mi mathvariant="bold">H</mml:mi><mml:mo>=</mml:mo><mml:mfenced open="[" close=""><mml:mtable class="array" columnalign="left"><mml:mtr><mml:mtd><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">n</mml:mi><mml:mn mathvariant="normal">1</mml:mn></mml:msub></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">r</mml:mi><mml:mn mathvariant="normal">1</mml:mn></mml:msub><mml:mo>×</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">n</mml:mi><mml:mn mathvariant="normal">1</mml:mn></mml:msub></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mfenced><mml:mtable class="array" columnalign="left"><mml:mtr><mml:mtd><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">n</mml:mi><mml:mn mathvariant="normal">2</mml:mn></mml:msub></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">r</mml:mi><mml:mn mathvariant="normal">2</mml:mn></mml:msub><mml:mo>×</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">n</mml:mi><mml:mn mathvariant="normal">2</mml:mn></mml:msub></mml:mrow></mml:mtd></mml:mtr></mml:mtable><mml:mtable class="array" columnalign="center"><mml:mtr><mml:mtd><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">n</mml:mi><mml:mn mathvariant="normal">3</mml:mn></mml:msub></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">r</mml:mi><mml:mn mathvariant="normal">3</mml:mn></mml:msub><mml:mo>×</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">n</mml:mi><mml:mn mathvariant="normal">3</mml:mn></mml:msub></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:mfenced close="]" open=""><mml:mrow><mml:mtable class="array" columnalign="left"><mml:mtr><mml:mtd><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">n</mml:mi><mml:mn mathvariant="normal">4</mml:mn></mml:msub></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">r</mml:mi><mml:mn mathvariant="normal">4</mml:mn></mml:msub><mml:mo>×</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">n</mml:mi><mml:mn mathvariant="normal">4</mml:mn></mml:msub></mml:mrow></mml:mtd></mml:mtr></mml:mtable><mml:mtable class="array" columnalign="left"><mml:mtr><mml:mtd><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">n</mml:mi><mml:mn mathvariant="normal">5</mml:mn></mml:msub></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">r</mml:mi><mml:mn mathvariant="normal">5</mml:mn></mml:msub><mml:mo>×</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">n</mml:mi><mml:mn mathvariant="normal">5</mml:mn></mml:msub></mml:mrow></mml:mtd></mml:mtr></mml:mtable><mml:mtable class="array" columnalign="left"><mml:mtr><mml:mtd><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">n</mml:mi><mml:mn mathvariant="normal">6</mml:mn></mml:msub></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">r</mml:mi><mml:mn mathvariant="normal">6</mml:mn></mml:msub><mml:mo>×</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">n</mml:mi><mml:mn mathvariant="normal">6</mml:mn></mml:msub></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow></mml:mfenced></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>

            In the above, <bold><italic>r</italic></bold><sub><italic>i</italic></sub> denotes the position vector of the <inline-formula><mml:math id="M76" display="inline"><mml:mi>i</mml:mi></mml:math></inline-formula>th moving joint with respect to the platform center at the current pose.</p>
      <p id="d2e1974">A single-dimensional extreme pose traversal method is employed. During the evaluation of each optimization individual, the program examines key poses, including the initial neutral pose and the positive and negative extreme points along the 6-DOF directions. The objective function <inline-formula><mml:math id="M77" display="inline"><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mn mathvariant="normal">2</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> extracts the maximum absolute force across all legs under all traversed poses, which is subsequently subjected to magnitude normalization:

              <disp-formula id="Ch1.E11" content-type="numbered"><label>11</label><mml:math id="M78" display="block"><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mn mathvariant="normal">2</mml:mn></mml:msub><mml:mo>(</mml:mo><mml:mi>x</mml:mi><mml:mo>)</mml:mo><mml:mo>=</mml:mo><mml:mtable class="substack"><mml:mtr><mml:mtd><mml:mi mathvariant="normal">max</mml:mi></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mi>j</mml:mi><mml:mo>∈</mml:mo><mml:mi>P</mml:mi></mml:mtd></mml:mtr></mml:mtable><mml:mo>(</mml:mo><mml:mtable class="substack"><mml:mtr><mml:mtd><mml:mi mathvariant="normal">max</mml:mi></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn><mml:mi mathvariant="normal">…</mml:mi><mml:mn mathvariant="normal">6</mml:mn></mml:mtd></mml:mtr></mml:mtable><mml:mfenced close="|" open="|"><mml:mrow><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mfenced><mml:mo>)</mml:mo><mml:mo>,</mml:mo></mml:mrow></mml:math></disp-formula>

            where <inline-formula><mml:math id="M79" display="inline"><mml:mi>j</mml:mi></mml:math></inline-formula> denotes the traversed pose index, and <inline-formula><mml:math id="M80" display="inline"><mml:mi>P</mml:mi></mml:math></inline-formula> represents the set comprising the initial neutral pose and all extreme poses.</p>
</sec>
<sec id="Ch1.S2.SS2.SSS3">
  <label>2.2.3</label><title>(c) Dexterity objective <inline-formula><mml:math id="M81" display="inline"><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mn mathvariant="normal">3</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula></title>
      <p id="d2e2088">Formulated based on spatial screw theory and the differential mapping relationship of mechanism kinematics, the Jacobian matrix <bold>J</bold> evaluates the mechanism's dexterity, which represents the motion transmission efficiency from the joint space to the task space for the heavy-duty compensation parallel platform:

              <disp-formula id="Ch1.E12" content-type="numbered"><label>12</label><mml:math id="M82" display="block"><mml:mrow><mml:mi mathvariant="bold">J</mml:mi><mml:mo>=</mml:mo><mml:mfenced open="[" close="]"><mml:mtable class="array" columnalign="left left"><mml:mtr><mml:mtd><mml:mrow><mml:msubsup><mml:mi mathvariant="bold-italic">n</mml:mi><mml:mn mathvariant="normal">1</mml:mn><mml:mi>T</mml:mi></mml:msubsup></mml:mrow></mml:mtd><mml:mtd><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">r</mml:mi><mml:mn mathvariant="normal">1</mml:mn></mml:msub><mml:mo>×</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">n</mml:mi><mml:mn mathvariant="normal">1</mml:mn></mml:msub><mml:msup><mml:mo>)</mml:mo><mml:mi>T</mml:mi></mml:msup></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:msubsup><mml:mi mathvariant="bold-italic">n</mml:mi><mml:mn mathvariant="normal">2</mml:mn><mml:mi>T</mml:mi></mml:msubsup></mml:mrow></mml:mtd><mml:mtd><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">r</mml:mi><mml:mn mathvariant="normal">2</mml:mn></mml:msub><mml:mo>×</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">n</mml:mi><mml:mn mathvariant="normal">2</mml:mn></mml:msub><mml:msup><mml:mo>)</mml:mo><mml:mi>T</mml:mi></mml:msup></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:msubsup><mml:mi mathvariant="bold-italic">n</mml:mi><mml:mn mathvariant="normal">3</mml:mn><mml:mi>T</mml:mi></mml:msubsup></mml:mrow></mml:mtd><mml:mtd><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">r</mml:mi><mml:mn mathvariant="normal">3</mml:mn></mml:msub><mml:mo>×</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">n</mml:mi><mml:mn mathvariant="normal">3</mml:mn></mml:msub><mml:msup><mml:mo>)</mml:mo><mml:mi>T</mml:mi></mml:msup></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:msubsup><mml:mi mathvariant="bold-italic">n</mml:mi><mml:mn mathvariant="normal">4</mml:mn><mml:mi>T</mml:mi></mml:msubsup></mml:mrow></mml:mtd><mml:mtd><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">r</mml:mi><mml:mn mathvariant="normal">4</mml:mn></mml:msub><mml:mo>×</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">n</mml:mi><mml:mn mathvariant="normal">4</mml:mn></mml:msub><mml:msup><mml:mo>)</mml:mo><mml:mi>T</mml:mi></mml:msup></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:msubsup><mml:mi mathvariant="bold-italic">n</mml:mi><mml:mn mathvariant="normal">5</mml:mn><mml:mi>T</mml:mi></mml:msubsup></mml:mrow></mml:mtd><mml:mtd><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">r</mml:mi><mml:mn mathvariant="normal">5</mml:mn></mml:msub><mml:mo>×</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">n</mml:mi><mml:mn mathvariant="normal">5</mml:mn></mml:msub><mml:msup><mml:mo>)</mml:mo><mml:mi>T</mml:mi></mml:msup></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:msubsup><mml:mi mathvariant="bold-italic">n</mml:mi><mml:mn mathvariant="normal">6</mml:mn><mml:mi>T</mml:mi></mml:msubsup></mml:mrow></mml:mtd><mml:mtd><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">r</mml:mi><mml:mn mathvariant="normal">6</mml:mn></mml:msub><mml:mo>×</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">n</mml:mi><mml:mn mathvariant="normal">6</mml:mn></mml:msub><mml:msup><mml:mo>)</mml:mo><mml:mi>T</mml:mi></mml:msup></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mfenced><mml:mo>,</mml:mo></mml:mrow></mml:math></disp-formula>

            where <inline-formula><mml:math id="M83" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">n</mml:mi><mml:mi mathvariant="bold-italic">i</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> denotes the direction vector of the screw, and <inline-formula><mml:math id="M84" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">r</mml:mi><mml:mi mathvariant="bold-italic">i</mml:mi></mml:msub><mml:mo>×</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">n</mml:mi><mml:mi mathvariant="bold-italic">i</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> represents its moment with respect to the moving platform's center. To quantify the omni-directional kinematic transmission performance of the mechanism, the Jacobian matrix is subjected to singular value decomposition:

              <disp-formula id="Ch1.E13" content-type="numbered"><label>13</label><mml:math id="M85" display="block"><mml:mrow><mml:mi mathvariant="bold">J</mml:mi><mml:mo>=</mml:mo><mml:mi mathvariant="bold">U</mml:mi><mml:mi mathvariant="bold">Σ</mml:mi><mml:msup><mml:mi>V</mml:mi><mml:mi>T</mml:mi></mml:msup><mml:mo>=</mml:mo><mml:munderover><mml:mo movablelimits="false">∑</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow><mml:mn mathvariant="normal">6</mml:mn></mml:munderover><mml:msub><mml:mi mathvariant="italic">σ</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:msub><mml:mi>u</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:msubsup><mml:mi>v</mml:mi><mml:mi>i</mml:mi><mml:mi>T</mml:mi></mml:msubsup><mml:mo>,</mml:mo></mml:mrow></mml:math></disp-formula>

            where <inline-formula><mml:math id="M86" display="inline"><mml:mi mathvariant="bold">V</mml:mi></mml:math></inline-formula> is the orthogonal basis matrix of the joint space (i.e., the leg velocity space); <inline-formula><mml:math id="M87" display="inline"><mml:mi mathvariant="bold">U</mml:mi></mml:math></inline-formula> is the orthogonal basis matrix of the task space (i.e., the generalized velocity space of the moving platform); and <inline-formula><mml:math id="M88" display="inline"><mml:mrow><mml:mi mathvariant="bold">Σ</mml:mi><mml:mo>=</mml:mo><mml:mi mathvariant="normal">diag</mml:mi><mml:mo>(</mml:mo><mml:msub><mml:mi mathvariant="italic">σ</mml:mi><mml:mn mathvariant="normal">1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi mathvariant="italic">σ</mml:mi><mml:mn mathvariant="normal">2</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi mathvariant="italic">σ</mml:mi><mml:mn mathvariant="normal">3</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi mathvariant="italic">σ</mml:mi><mml:mn mathvariant="normal">4</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi mathvariant="italic">σ</mml:mi><mml:mn mathvariant="normal">5</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi mathvariant="italic">σ</mml:mi><mml:mn mathvariant="normal">6</mml:mn></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> is the diagonal matrix of singular values, with its elements satisfying <inline-formula><mml:math id="M89" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="italic">σ</mml:mi><mml:mn mathvariant="normal">1</mml:mn></mml:msub><mml:mo>≥</mml:mo><mml:msub><mml:mi mathvariant="italic">σ</mml:mi><mml:mn mathvariant="normal">2</mml:mn></mml:msub><mml:mo>≥</mml:mo><mml:msub><mml:mi mathvariant="italic">σ</mml:mi><mml:mn mathvariant="normal">3</mml:mn></mml:msub><mml:mo>≥</mml:mo><mml:msub><mml:mi mathvariant="italic">σ</mml:mi><mml:mn mathvariant="normal">4</mml:mn></mml:msub><mml:mo>≥</mml:mo><mml:msub><mml:mi mathvariant="italic">σ</mml:mi><mml:mn mathvariant="normal">5</mml:mn></mml:msub><mml:mo>≥</mml:mo><mml:msub><mml:mi mathvariant="italic">σ</mml:mi><mml:mn mathvariant="normal">6</mml:mn></mml:msub><mml:mo>≥</mml:mo><mml:mn mathvariant="normal">0</mml:mn></mml:mrow></mml:math></inline-formula>.</p>
      <p id="d2e2498">According to the geometric interpretation of singular value decomposition (SVD), if the actuation velocities of the six legs are constrained within a unit hypersphere, this unit sphere is mapped by the Jacobian matrix into a six-dimensional kinematic manipulability ellipsoid in the task space. The value <inline-formula><mml:math id="M90" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="italic">σ</mml:mi><mml:mn mathvariant="normal">6</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula>, namely <inline-formula><mml:math id="M91" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="italic">σ</mml:mi><mml:mi mathvariant="normal">min</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>, defines the length of the shortest semi-axis of this motion transmission ellipsoid. As <inline-formula><mml:math id="M92" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="italic">σ</mml:mi><mml:mi mathvariant="normal">min</mml:mi></mml:msub><mml:mo>→</mml:mo><mml:mn mathvariant="normal">0</mml:mn></mml:mrow></mml:math></inline-formula>, the ellipsoid degenerates into a lower-dimensional geometry, indicating that <inline-formula><mml:math id="M93" display="inline"><mml:mrow><mml:mi mathvariant="normal">det</mml:mi><mml:mo>(</mml:mo><mml:mi>J</mml:mi><mml:mo>)</mml:mo><mml:mo>→</mml:mo><mml:mn mathvariant="normal">0</mml:mn></mml:mrow></mml:math></inline-formula> and the mechanism approaches a singular configuration. A larger <inline-formula><mml:math id="M94" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="italic">σ</mml:mi><mml:mi mathvariant="normal">min</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> implies that the mechanism can still maintain a favorable kinematic response even in the least performant direction.</p>
      <p id="d2e2567">By maximizing this minimum singular value, the shortest semi-axis of the kinematic manipulability ellipsoid can be effectively expanded. The objective function <inline-formula><mml:math id="M95" display="inline"><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mn mathvariant="normal">3</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> is defined as follows:

              <disp-formula id="Ch1.E14" content-type="numbered"><label>14</label><mml:math id="M96" display="block"><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mn mathvariant="normal">3</mml:mn></mml:msub><mml:mo>(</mml:mo><mml:mi>x</mml:mi><mml:mo>)</mml:mo><mml:mo>=</mml:mo><mml:mo>-</mml:mo><mml:mtable class="substack"><mml:mtr><mml:mtd><mml:mi mathvariant="normal">min</mml:mi></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mi>j</mml:mi><mml:mo>∈</mml:mo><mml:mi>p</mml:mi></mml:mtd></mml:mtr></mml:mtable><mml:mfenced close=")" open="("><mml:mrow><mml:msub><mml:mi mathvariant="italic">σ</mml:mi><mml:mn mathvariant="normal">6</mml:mn></mml:msub><mml:mo>(</mml:mo><mml:msub><mml:mi mathvariant="bold">J</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:mfenced><mml:mo>.</mml:mo></mml:mrow></mml:math></disp-formula></p>
</sec>
<sec id="Ch1.S2.SS2.SSS4">
  <label>2.2.4</label><title>(d) Isotropy objective <inline-formula><mml:math id="M97" display="inline"><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mn mathvariant="normal">4</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula></title>
      <p id="d2e2652">Isotropy reflects the uniformity of the kinematic performance of the heavy-duty compensation parallel platform within the 6-DOF space. Based on the aforementioned singular SVD of the Jacobian matrix <inline-formula><mml:math id="M98" display="inline"><mml:mi mathvariant="bold">J</mml:mi></mml:math></inline-formula>, the condition number <inline-formula><mml:math id="M99" display="inline"><mml:mi mathvariant="italic">κ</mml:mi></mml:math></inline-formula> of the mechanism at a specific pose is defined as the ratio of its maximum singular value to its minimum singular value:

              <disp-formula id="Ch1.E15" content-type="numbered"><label>15</label><mml:math id="M100" display="block"><mml:mrow><mml:mi mathvariant="italic">κ</mml:mi><mml:mo>(</mml:mo><mml:mi mathvariant="bold">J</mml:mi><mml:mo>)</mml:mo><mml:mo>=</mml:mo><mml:mstyle displaystyle="true"><mml:mfrac style="display"><mml:mrow><mml:msub><mml:mi mathvariant="italic">σ</mml:mi><mml:mi mathvariant="normal">max</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi mathvariant="bold">J</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:msub><mml:mi mathvariant="italic">σ</mml:mi><mml:mi mathvariant="normal">min</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi mathvariant="bold">J</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mfrac></mml:mstyle><mml:mo>=</mml:mo><mml:mstyle displaystyle="true"><mml:mfrac style="display"><mml:mrow><mml:msub><mml:mi mathvariant="italic">σ</mml:mi><mml:mn mathvariant="normal">1</mml:mn></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi mathvariant="italic">σ</mml:mi><mml:mn mathvariant="normal">6</mml:mn></mml:msub></mml:mrow></mml:mfrac></mml:mstyle><mml:mo>,</mml:mo></mml:mrow></mml:math></disp-formula>

            where <inline-formula><mml:math id="M101" display="inline"><mml:mrow><mml:mi mathvariant="bold-italic">κ</mml:mi><mml:mo>∈</mml:mo><mml:mo>[</mml:mo><mml:mn mathvariant="normal">1</mml:mn><mml:mo>,</mml:mo><mml:mo>+</mml:mo><mml:mi mathvariant="normal">∞</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>. The condition number <inline-formula><mml:math id="M102" display="inline"><mml:mi mathvariant="italic">κ</mml:mi></mml:math></inline-formula> serves as an index measuring the degree of disparity of the matrix. When <inline-formula><mml:math id="M103" display="inline"><mml:mrow><mml:mi mathvariant="italic">κ</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:math></inline-formula>, the kinematic manipulability ellipsoid transforms into a perfect hypersphere, implying that a unit velocity input in the leg joint space generates a completely consistent response in all directions within the task space. At this point, the mechanism achieves an ideal state of velocity isotropy.</p>
      <p id="d2e2771">The maximum condition number within the traversed pose set <inline-formula><mml:math id="M104" display="inline"><mml:mi>P</mml:mi></mml:math></inline-formula> is selected as the optimization objective. By minimizing this index, the performance fluctuations of the mechanism at extreme poses can be effectively suppressed. The objective function <inline-formula><mml:math id="M105" display="inline"><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mn mathvariant="normal">4</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> is defined as follows:

              <disp-formula id="Ch1.E16" content-type="numbered"><label>16</label><mml:math id="M106" display="block"><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mn mathvariant="normal">4</mml:mn></mml:msub><mml:mo>(</mml:mo><mml:mi>x</mml:mi><mml:mo>)</mml:mo><mml:mo>=</mml:mo><mml:mtable class="substack"><mml:mtr><mml:mtd><mml:mi mathvariant="normal">max</mml:mi></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mi>j</mml:mi><mml:mo>∈</mml:mo><mml:mi>P</mml:mi></mml:mtd></mml:mtr></mml:mtable><mml:mfenced close=")" open="("><mml:mrow><mml:mi mathvariant="bold-italic">κ</mml:mi><mml:mo>(</mml:mo><mml:msub><mml:mi mathvariant="bold">J</mml:mi><mml:mi mathvariant="bold-italic">j</mml:mi></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:mfenced><mml:mo>.</mml:mo></mml:mrow></mml:math></disp-formula></p>
</sec>
</sec>
</sec>
<sec id="Ch1.S3">
  <label>3</label><title>Construction of ANN-based performance surrogate model</title>
      <p id="d2e2848">To balance the computational accuracy and search efficiency during the optimization of the heavy-duty compensation parallel platform, an ANN is introduced to construct a physical performance surrogate model.</p>
<sec id="Ch1.S3.SS1">
  <label>3.1</label><title>Sample space sampling and objective value normalization</title>
      <p id="d2e2858">The accuracy of the surrogate model is highly dependent on the distribution quality of the training samples within the design space. In this study, all 2500 datasets were numerically generated using a customized physical simulation program developed in MATLAB. Specifically, the input parameters were generated via a random sampling function within the structural design boundaries. The corresponding multi-physics output responses were subsequently calculated using MATLAB's mathematical solvers: the actuator stroke was solved via spatial inverse kinematics, the peak driving force was derived using the virtual work principle via the force Jacobian matrix, and the dexterity and isotropy indices were quantified using SVD. To address the issue of magnitude disparity among different performance objectives of the heavy-duty compensation parallel platform – for instance, the actuation stroke objective <inline-formula><mml:math id="M107" display="inline"><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mn mathvariant="normal">1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> is at the 10<sup>0</sup> order of magnitude, whereas the peak driving-force objective <inline-formula><mml:math id="M109" display="inline"><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mn mathvariant="normal">2</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> is at the 10<sup>5</sup> order of magnitude – <inline-formula><mml:math id="M111" display="inline"><mml:mi>Z</mml:mi></mml:math></inline-formula>-score standardization is applied to the output objective vectors. This ensures that the neural network can evenly capture the features of various physical domains during the training process:

            <disp-formula id="Ch1.E17" content-type="numbered"><label>17</label><mml:math id="M112" display="block"><mml:mrow><mml:msub><mml:mover accent="true"><mml:mi>y</mml:mi><mml:mo mathvariant="normal" stretchy="false">^</mml:mo></mml:mover><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mstyle displaystyle="true"><mml:mfrac style="display"><mml:mrow><mml:msub><mml:mi>y</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>-</mml:mo><mml:msub><mml:mi mathvariant="italic">μ</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi mathvariant="italic">σ</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow></mml:mfrac></mml:mstyle><mml:mo>,</mml:mo></mml:mrow></mml:math></disp-formula>

          where <inline-formula><mml:math id="M113" display="inline"><mml:mrow><mml:msub><mml:mi>y</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> is the true value of the <inline-formula><mml:math id="M114" display="inline"><mml:mi>j</mml:mi></mml:math></inline-formula>th objective for the <inline-formula><mml:math id="M115" display="inline"><mml:mi>i</mml:mi></mml:math></inline-formula>th sample, and <inline-formula><mml:math id="M116" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="italic">μ</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> and are <inline-formula><mml:math id="M117" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="italic">σ</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> the sample mean and standard deviation of this objective, respectively.</p>
</sec>
<sec id="Ch1.S3.SS2">
  <label>3.2</label><title>Neural network topology and training</title>
      <p id="d2e3018">A deep neural network model with a four-layer structure is established, with its overall architecture defined as 5-20-15-4. The input layer corresponds to five structural decision variables, and the two hidden layers contain 20 and 15 neurons, respectively, employing sigmoid activation functions to capture highly nonlinear mapping relationships; the output layer corresponds to four standardized performance metrics. Through the nonlinear transformation of the dual hidden layers, high-speed prediction of four performance objectives – actuator stroke, driving force, dexterity, and isotropy – is ultimately achieved at the output layer.</p>
      <p id="d2e3021">The number of hidden layers and neurons in the artificial neural network was determined through a systematic grid search and trial-and-error approach, aiming to balance predictive accuracy and computational efficiency. Initially, empirical formulas were utilized to define the approximate range of the number of neurons. Subsequently, various network models containing one to three hidden layers with different neuron combinations were trained and evaluated. The evaluation results indicated that a single hidden layer lacked the capacity to accurately map the highly nonlinear multi-physics responses of the 6-DOF platform, whereas a three-hidden-layer architecture was highly prone to overfitting and consumed excessive training time. Through performance comparison on the validation set, the dual-hidden-layer architecture containing 20 and 15 neurons, respectively, demonstrated the most robust generalization capability. Consequently, a deep neural network model with an overall architecture defined as 5-20-15-4 was ultimately established.</p>

      <fig id="F5"><label>Figure 5</label><caption><p id="d2e3026">ANN surrogate model architecture.</p></caption>
          <graphic xlink:href="https://ms.copernicus.org/articles/17/783/2026/ms-17-783-2026-f05.png"/>

        </fig>

      <p id="d2e3036">The training process employs the Levenberg–Marquardt algorithm, which features a second-order convergence rate. Its weight update formula is given by the following:

            <disp-formula id="Ch1.E18" content-type="numbered"><label>18</label><mml:math id="M118" display="block"><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mrow><mml:mi>k</mml:mi><mml:mo>+</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mi>w</mml:mi><mml:mi>k</mml:mi></mml:msub><mml:mo>-</mml:mo><mml:mo>[</mml:mo><mml:msubsup><mml:mi mathvariant="bold">J</mml:mi><mml:mi>t</mml:mi><mml:mi>T</mml:mi></mml:msubsup><mml:msub><mml:mi mathvariant="bold">J</mml:mi><mml:mi>t</mml:mi></mml:msub><mml:mo>+</mml:mo><mml:mi mathvariant="italic">μ</mml:mi><mml:mi>I</mml:mi><mml:msup><mml:mo>]</mml:mo><mml:mrow><mml:mo>-</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:msup><mml:msubsup><mml:mi mathvariant="bold">J</mml:mi><mml:mi>t</mml:mi><mml:mi>T</mml:mi></mml:msubsup><mml:mi>e</mml:mi><mml:mo>,</mml:mo></mml:mrow></mml:math></disp-formula>

          where <inline-formula><mml:math id="M119" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="bold">J</mml:mi><mml:mi>t</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> is the Jacobian matrix of the error with respect to the weights, <inline-formula><mml:math id="M120" display="inline"><mml:mi mathvariant="italic">μ</mml:mi></mml:math></inline-formula> is the damping factor, and <inline-formula><mml:math id="M121" display="inline"><mml:mi>e</mml:mi></mml:math></inline-formula> is the training error.</p>
</sec>
<sec id="Ch1.S3.SS3">
  <label>3.3</label><title>Accuracy assessment of the surrogate model</title>
      <p id="d2e3137">The goodness of fit is employed to independently evaluate the four performance objectives. The calculation formula is as follows:

            <disp-formula id="Ch1.E19" content-type="numbered"><label>19</label><mml:math id="M122" display="block"><mml:mrow><mml:msup><mml:mi>R</mml:mi><mml:mn mathvariant="normal">2</mml:mn></mml:msup><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn><mml:mo>-</mml:mo><mml:mstyle displaystyle="true"><mml:mfrac style="display"><mml:mrow><mml:msubsup><mml:mo>∑</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow><mml:mrow class="chem"><mml:mi mathvariant="normal">n</mml:mi></mml:mrow></mml:msubsup><mml:msup><mml:mfenced close=")" open="("><mml:mrow><mml:msub><mml:mi>y</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>-</mml:mo><mml:msub><mml:mover accent="true"><mml:mi>y</mml:mi><mml:mo mathvariant="normal" stretchy="false">^</mml:mo></mml:mover><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:mfenced><mml:mn mathvariant="normal">2</mml:mn></mml:msup></mml:mrow><mml:mrow><mml:msubsup><mml:mo>∑</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow><mml:mrow class="chem"><mml:mi mathvariant="normal">n</mml:mi></mml:mrow></mml:msubsup><mml:msup><mml:mfenced close=")" open="("><mml:mrow><mml:msub><mml:mi>y</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>-</mml:mo><mml:msub><mml:mover accent="true"><mml:mi>y</mml:mi><mml:mo mathvariant="normal">¯</mml:mo></mml:mover><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:mfenced><mml:mn mathvariant="normal">2</mml:mn></mml:msup></mml:mrow></mml:mfrac></mml:mstyle><mml:mo>,</mml:mo></mml:mrow></mml:math></disp-formula>

          where <inline-formula><mml:math id="M123" display="inline"><mml:mrow><mml:msub><mml:mi>y</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> is the true value from the physical simulation, and <inline-formula><mml:math id="M124" display="inline"><mml:mrow><mml:msub><mml:mover accent="true"><mml:mi>y</mml:mi><mml:mo stretchy="false" mathvariant="normal">^</mml:mo></mml:mover><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> is the predicted value from the neural network.</p>
      <p id="d2e3254">The 2500 sets of sampled data are divided into a training set and a testing set at a ratio of <inline-formula><mml:math id="M125" display="inline"><mml:mrow><mml:mn mathvariant="normal">8</mml:mn><mml:mo>:</mml:mo><mml:mn mathvariant="normal">2</mml:mn></mml:mrow></mml:math></inline-formula>. To eliminate potential data error risks and ensure the training reliability of the ANN, it is necessary to clarify that these 2500 datasets are not empirical measurements susceptible to observation noise but exact numerical solutions strictly generated from closed-form analytical equations such as spatial inverse kinematics and the virtual work principle. Furthermore, the numerical solver was systematically pre-verified under typical boundary conditions prior to the bulk generation to guarantee the physical credibility of the datasets. The regression analysis results of the surrogate model on the independent testing set are shown in Fig. 6, where the horizontal axis represents the true values from the physical simulation, and the vertical axis represents the predicted outputs of the neural network surrogate model. The average <inline-formula><mml:math id="M126" display="inline"><mml:mrow><mml:msup><mml:mi>R</mml:mi><mml:mn mathvariant="normal">2</mml:mn></mml:msup></mml:mrow></mml:math></inline-formula> values of all objectives reach over 0.98, demonstrating that the constructed ANN surrogate model possesses high fitting accuracy across the entire variable space, thereby satisfying the performance evaluation requirements for the subsequent NSGA-III optimization.</p>

      <fig id="F6"><label>Figure 6</label><caption><p id="d2e3282">Average <inline-formula><mml:math id="M127" display="inline"><mml:mrow><mml:msup><mml:mi>R</mml:mi><mml:mn mathvariant="normal">2</mml:mn></mml:msup></mml:mrow></mml:math></inline-formula> values for each objective. <bold>(a)</bold> Objective function <inline-formula><mml:math id="M128" display="inline"><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mn mathvariant="normal">1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula>. <bold>(b)</bold> Objective function <inline-formula><mml:math id="M129" display="inline"><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mn mathvariant="normal">2</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula>. <bold>(c)</bold> Objective function <inline-formula><mml:math id="M130" display="inline"><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mn mathvariant="normal">3</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula>. <bold>(d)</bold> Objective function <inline-formula><mml:math id="M131" display="inline"><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mn mathvariant="normal">4</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula>.</p></caption>
          <graphic xlink:href="https://ms.copernicus.org/articles/17/783/2026/ms-17-783-2026-f06.png"/>

        </fig>

      <p id="d2e3360">Furthermore, a 0.5 % level of Gaussian white noise was introduced into the training data. This operation is designed to simulate the stochastic response of the heavy-duty compensation parallel platform under uncertainties such as manufacturing errors, joint clearances, and sensor measurement noise. The experimental results demonstrate that the <inline-formula><mml:math id="M132" display="inline"><mml:mrow><mml:msup><mml:mi>R</mml:mi><mml:mn mathvariant="normal">2</mml:mn></mml:msup></mml:mrow></mml:math></inline-formula> values of the noise-injected surrogate model on the independent testing set remain between 0.987 and 0.999.</p>
</sec>
</sec>
<sec id="Ch1.S4">
  <label>4</label><title>Design of the improved NSGA-III optimization algorithm</title>
      <p id="d2e3383">To address the conflicting multi-objective optimization problem of the heavy-duty compensation parallel platform, an improved NSGA-III algorithm is introduced. While the standard NSGA-III is inherently well-suited for high-dimensional spaces via its reference-point mechanism, specific algorithmic improvements were implemented to adapt to the physical complexities of the platform. These improvements primarily include (1) integrating a dynamic objective space normalization strategy to eliminate extreme order-of-magnitude biases among different physical domains and (2) embedding a feasibility-rule-based constraint violation degree, CV(<inline-formula><mml:math id="M133" display="inline"><mml:mi>x</mml:mi></mml:math></inline-formula>), into the evolutionary selection phase to strictly penalize geometric interferences and singularities. By guiding the population evolution through predefined uniform reference points on a hyperplane, it accurately captures the high-dimensional Pareto front while guaranteeing convergence. </p>
<sec id="Ch1.S4.SS1">
  <label>4.1</label><title>Reference point construction and objective space normalization</title>
      <p id="d2e3401">The diversity maintenance mechanism of NSGA-III is based on a reference point network. A systematic projection method is employed to construct hyperplane reference points within the objective space. For a task with <inline-formula><mml:math id="M134" display="inline"><mml:mi>M</mml:mi></mml:math></inline-formula> objectives and <inline-formula><mml:math id="M135" display="inline"><mml:mi>p</mml:mi></mml:math></inline-formula> divisions, the total number of reference points <bold><italic>N</italic></bold><sub>ref</sub> follows the combinatorial relationship below:

            <disp-formula id="Ch1.E20" content-type="numbered"><label>20</label><mml:math id="M137" display="block"><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">N</mml:mi><mml:mi mathvariant="normal">ref</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mfenced open="(" close=")"><mml:mtable class="array" columnalign="left"><mml:mtr><mml:mtd><mml:mrow><mml:mi>M</mml:mi><mml:mo>+</mml:mo><mml:mi>p</mml:mi><mml:mo>-</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mi>p</mml:mi></mml:mtd></mml:mtr></mml:mtable></mml:mfenced><mml:mo>.</mml:mo></mml:mrow></mml:math></disp-formula>

          With the number of divisions set to <inline-formula><mml:math id="M138" display="inline"><mml:mrow><mml:mi>p</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">12</mml:mn></mml:mrow></mml:math></inline-formula>, a total of 455 uniformly distributed reference vectors are generated within the four-dimensional objective space. Given the significant order-of-magnitude disparities among the physical metrics of the heavy-duty compensation parallel platform – for instance, the actuation stroke metric <inline-formula><mml:math id="M139" display="inline"><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mn mathvariant="normal">1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> is at the 10<sup>0</sup> scale, whereas the peak driving-force metric <inline-formula><mml:math id="M141" display="inline"><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mn mathvariant="normal">2</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> is at the 10<sup>5</sup> scale – the algorithm performs a normalization process in each evolutionary generation to eliminate scale bias. First, the ideal point <inline-formula><mml:math id="M143" display="inline"><mml:mrow><mml:msup><mml:mi mathvariant="bold">z</mml:mi><mml:mo>∗</mml:mo></mml:msup><mml:mo>=</mml:mo><mml:mo>(</mml:mo><mml:msubsup><mml:mi>z</mml:mi><mml:mn mathvariant="normal">1</mml:mn><mml:mo>∗</mml:mo></mml:msubsup><mml:mo>,</mml:mo><mml:msubsup><mml:mi>z</mml:mi><mml:mn mathvariant="normal">2</mml:mn><mml:mo>∗</mml:mo></mml:msubsup><mml:mo>,</mml:mo><mml:mi mathvariant="normal">…</mml:mi><mml:mo>,</mml:mo><mml:msubsup><mml:mi>z</mml:mi><mml:mi>M</mml:mi><mml:mo>∗</mml:mo></mml:msubsup><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> is determined based on the minimum values of the population. Subsequently, the extreme points are identified by minimizing a scalarizing function to construct a hyperplane. The <inline-formula><mml:math id="M144" display="inline"><mml:mi>j</mml:mi></mml:math></inline-formula>-th objective function value <inline-formula><mml:math id="M145" display="inline"><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> of individual <inline-formula><mml:math id="M146" display="inline"><mml:mi>i</mml:mi></mml:math></inline-formula> is then mapped into the normalized interval:

            <disp-formula id="Ch1.E21" content-type="numbered"><label>21</label><mml:math id="M147" display="block"><mml:mrow><mml:msubsup><mml:mi>f</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow><mml:mo>′</mml:mo></mml:msubsup><mml:mo>=</mml:mo><mml:mstyle displaystyle="true"><mml:mfrac style="display"><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>-</mml:mo><mml:msubsup><mml:mi>z</mml:mi><mml:mi>j</mml:mi><mml:mo>∗</mml:mo></mml:msubsup></mml:mrow><mml:mrow><mml:msub><mml:mi>a</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo>-</mml:mo><mml:msubsup><mml:mi>z</mml:mi><mml:mi>j</mml:mi><mml:mo>∗</mml:mo></mml:msubsup></mml:mrow></mml:mfrac></mml:mstyle><mml:mo>,</mml:mo></mml:mrow></mml:math></disp-formula>

          where <inline-formula><mml:math id="M148" display="inline"><mml:mrow><mml:msub><mml:mi>a</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> is the intercept of the hyperplane with the <inline-formula><mml:math id="M149" display="inline"><mml:mi>j</mml:mi></mml:math></inline-formula>th objective axis. This process ensures that the search process takes place within a unit simplex, thereby assigning equal evolutionary weights to all performance metrics.</p>
</sec>
<sec id="Ch1.S4.SS2">
  <label>4.2</label><title>Genetic operator design and constraint violation handling</title>
      <p id="d2e3679">The algorithm employs real-coded simulated binary crossover and polynomial mutation to generate superior offspring configurations. Before calculating the overall violation degree, two specific geometric interference criteria are explicitly defined: the dynamic actuator length <inline-formula><mml:math id="M150" display="inline"><mml:mrow><mml:msub><mml:mi>l</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> must satisfy the physical stroke limits, i.e., <inline-formula><mml:math id="M151" display="inline"><mml:mrow><mml:msub><mml:mi>l</mml:mi><mml:mi mathvariant="normal">min</mml:mi></mml:msub><mml:mo>≤</mml:mo><mml:msub><mml:mi>l</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>≤</mml:mo><mml:msub><mml:mi>l</mml:mi><mml:mi mathvariant="normal">max</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>, and the spatial deflection angle <inline-formula><mml:math id="M152" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="italic">θ</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> must not exceed the maximum allowable cone angle of the Hooke's joints, i.e., <inline-formula><mml:math id="M153" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="italic">θ</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>≤</mml:mo></mml:mrow></mml:math></inline-formula>
<inline-formula><mml:math id="M154" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="italic">θ</mml:mi><mml:mi mathvariant="normal">max</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>. Exceedances of these physical boundaries are directly transformed into specific interference constraint functions <inline-formula><mml:math id="M155" display="inline"><mml:mrow><mml:msub><mml:mi>g</mml:mi><mml:mi>k</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi>x</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>. Furthermore, to address the complex interference and singularity constraints of the platform, a handling logic based on feasibility rules is introduced. The overall constraint violation degree  CV(<inline-formula><mml:math id="M156" display="inline"><mml:mi>x</mml:mi></mml:math></inline-formula>) of individual <inline-formula><mml:math id="M157" display="inline"><mml:mi>x</mml:mi></mml:math></inline-formula> is defined as the weighted sum of individual constraint violations:

            <disp-formula id="Ch1.E22" content-type="numbered"><label>22</label><mml:math id="M158" display="block"><mml:mrow><mml:mi mathvariant="normal">CV</mml:mi><mml:mo>(</mml:mo><mml:mi>x</mml:mi><mml:mo>)</mml:mo><mml:mo>=</mml:mo><mml:munderover><mml:mo movablelimits="false">∑</mml:mo><mml:mrow><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow><mml:mi>m</mml:mi></mml:munderover><mml:mi mathvariant="normal">max</mml:mi><mml:mo>(</mml:mo><mml:mn mathvariant="normal">0</mml:mn><mml:mo>,</mml:mo><mml:msub><mml:mi>g</mml:mi><mml:mi>k</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi>x</mml:mi><mml:mo>)</mml:mo><mml:mo>)</mml:mo><mml:mo>.</mml:mo></mml:mrow></mml:math></disp-formula>

          During the parent selection phase, the algorithm adheres to the following rules: if both individuals are feasible, they are selected based on their non-domination ranks; if infeasible individuals are involved, the one with the smaller  CV value is preferentially retained.</p>
</sec>
<sec id="Ch1.S4.SS3">
  <label>4.3</label><title>Niche preservation and environmental selection mechanism</title>
      <p id="d2e3845">During the environmental selection phase, NSGA-III maintains the population distribution by calculating the perpendicular distance between individuals and reference lines, which replaces the crowding distance used in traditional algorithms. For an individual <inline-formula><mml:math id="M159" display="inline"><mml:mi>s</mml:mi></mml:math></inline-formula> and a reference line <inline-formula><mml:math id="M160" display="inline"><mml:mi>w</mml:mi></mml:math></inline-formula> in the normalized space, their perpendicular distance <inline-formula><mml:math id="M161" display="inline"><mml:mrow><mml:mi>d</mml:mi><mml:mo>(</mml:mo><mml:mi>s</mml:mi><mml:mo>,</mml:mo><mml:mi>w</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> is expressed as follows:

            <disp-formula id="Ch1.E23" content-type="numbered"><label>23</label><mml:math id="M162" display="block"><mml:mrow><mml:mi>d</mml:mi><mml:mo>(</mml:mo><mml:mi>s</mml:mi><mml:mo>,</mml:mo><mml:mi>w</mml:mi><mml:mo>)</mml:mo><mml:mo>=</mml:mo><mml:mfenced close="∥" open="∥"><mml:mrow><mml:mo>(</mml:mo><mml:msup><mml:mi>f</mml:mi><mml:mo>′</mml:mo></mml:msup><mml:mo>(</mml:mo><mml:mi>s</mml:mi><mml:mo>)</mml:mo><mml:mo>-</mml:mo><mml:msup><mml:mi>z</mml:mi><mml:mo>∗</mml:mo></mml:msup><mml:mo>)</mml:mo><mml:mo>-</mml:mo><mml:mstyle displaystyle="true"><mml:mfrac style="display"><mml:mrow><mml:mo>(</mml:mo><mml:msup><mml:mi>f</mml:mi><mml:mo>′</mml:mo></mml:msup><mml:mo>(</mml:mo><mml:mi>s</mml:mi><mml:mo>)</mml:mo><mml:mo>-</mml:mo><mml:msup><mml:mi>z</mml:mi><mml:mo>∗</mml:mo></mml:msup><mml:msup><mml:mo>)</mml:mo><mml:mi>T</mml:mi></mml:msup><mml:mi>w</mml:mi></mml:mrow><mml:mrow><mml:mfenced close="∥" open="∥"><mml:mi>w</mml:mi></mml:mfenced></mml:mrow></mml:mfrac></mml:mstyle><mml:mi>w</mml:mi></mml:mrow></mml:mfenced><mml:mo>.</mml:mo></mml:mrow></mml:math></disp-formula>

          Based on a niche counting mechanism, the algorithm preferentially retains solutions around the reference points that have the fewest associated individuals. This dynamic screening strategy forces the population to be uniformly distributed across the four-dimensional Pareto front, thereby excavating potential optimal configurations.</p>
</sec>
</sec>
<sec id="Ch1.S5">
  <label>5</label><title>Comparative analysis of optimization results</title>
      <p id="d2e3974">By setting the number of reference point divisions <inline-formula><mml:math id="M163" display="inline"><mml:mrow><mml:msub><mml:mi>H</mml:mi><mml:mi mathvariant="normal">div</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> to 12, a total of 455 uniformly distributed reference point directions are generated. The population size <inline-formula><mml:math id="M164" display="inline"><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mi mathvariant="normal">pop</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> is set to 455 to match the number of reference points, thereby enhancing the algorithm's niche preservation capability in the multi-dimensional objective space. The maximum number of evolutionary iterations is set to 120 to ensure sufficient convergence of the solution set. Furthermore, the crossover probability <inline-formula><mml:math id="M165" display="inline"><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mi mathvariant="normal">c</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> is set to 0.9 to maintain the recombination rate of superior genes, and the mutation probability <inline-formula><mml:math id="M166" display="inline"><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mi mathvariant="normal">m</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> is set to 0.15 to guarantee that the algorithm possesses adequate random perturbation capability.</p>
      <p id="d2e4021">By integrating 3D scatter coordinate mapping with a 4D color map, four complementary sets of 4D performance space distribution plots are constructed, as shown in Fig. 7.</p>

      <fig id="F7"><label>Figure 7</label><caption><p id="d2e4026">Visualization of the 3D Pareto front. <bold>(a)</bold> Optimization objective combination 1. <bold>(b)</bold> Optimization objective combination 2. <bold>(c)</bold> Optimization objective combination 3. <bold>(d)</bold> Optimization objective combination 4.</p></caption>
        <graphic xlink:href="https://ms.copernicus.org/articles/17/783/2026/ms-17-783-2026-f07.png"/>

      </fig>

      <p id="d2e4048">The 455 sets of Pareto optimal solutions ultimately obtained exhibit the competitive trade-off relationships among different objectives. Accordingly, three typical design domains are summarized: (1) a compact scheme suitable for limited deck space, with an actuation stroke of less than 3500 mm and a height of less than 4700 mm; (2) a robust scheme suitable for heavy loads, featuring a base platform radius of approximately 4000 mm and a height of around 6150 mm; and (3) a dexterous scheme prioritizing kinematic performance, with a dexterity greater than 0.44 and a condition number of less than 14.3.</p>
<sec id="Ch1.S5.SS1">
  <label>5.1</label><title>Comprehensive evaluation and comparative analysis of multi-objective optimization results</title>
      <p id="d2e4058">Figure 8 illustrates the sensitivity correlation characteristics between the structural parameters and the objective functions.</p>

      <fig id="F8" specific-use="star"><label>Figure 8</label><caption><p id="d2e4063">Sensitivity relationship between structural parameters and objective functions. <bold>(a)</bold> Linear correlation heatmap. <bold>(b)</bold> Influence ranking of structural parameters on performance.</p></caption>
          <graphic xlink:href="https://ms.copernicus.org/articles/17/783/2026/ms-17-783-2026-f08.png"/>

        </fig>

      <p id="d2e4078">Figure 8 reveals the sensitivity patterns of each structural parameter on the system performance. The global sensitivity indices follow the order of <inline-formula><mml:math id="M167" display="inline"><mml:mrow><mml:msub><mml:mi>R</mml:mi><mml:mi>B</mml:mi></mml:msub><mml:mo>&gt;</mml:mo><mml:mi>H</mml:mi><mml:mo>&gt;</mml:mo><mml:msub><mml:mi>R</mml:mi><mml:mi>A</mml:mi></mml:msub><mml:mo>&gt;</mml:mo><mml:mi mathvariant="italic">β</mml:mi><mml:mo>&gt;</mml:mo><mml:mi mathvariant="italic">α</mml:mi></mml:mrow></mml:math></inline-formula>. Among them, the upper-platform radius <inline-formula><mml:math id="M168" display="inline"><mml:mrow><mml:msub><mml:mi>R</mml:mi><mml:mi>B</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> is the most critical variable; increasing <inline-formula><mml:math id="M169" display="inline"><mml:mrow><mml:msub><mml:mi>R</mml:mi><mml:mi>B</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> can reduce the peak load and improve kinematic dexterity. The initial height <inline-formula><mml:math id="M170" display="inline"><mml:mi>H</mml:mi></mml:math></inline-formula> dominates the actuation stroke; an excessive height will lead to a sharp increase in the telescoping span and deteriorate the isotropy. Appropriately increasing the base platform radius <inline-formula><mml:math id="M171" display="inline"><mml:mrow><mml:msub><mml:mi>R</mml:mi><mml:mi>A</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> helps mitigate stroke redundancy.</p>
      <p id="d2e4152">Taking the structural parameter <inline-formula><mml:math id="M172" display="inline"><mml:mrow><mml:msub><mml:mi>R</mml:mi><mml:mi>B</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> as a vital characteristic parameter for further analysis, variations in the value of <inline-formula><mml:math id="M173" display="inline"><mml:mrow><mml:msub><mml:mi>R</mml:mi><mml:mi>B</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> can simultaneously influence three optimization objectives. Within different parameter intervals, the interactive relationships among these optimization objectives may vary, as illustrated in Fig. 9.</p>

      <fig id="F9" specific-use="star"><label>Figure 9</label><caption><p id="d2e4179">Sensitivity relationship between structural parameters and objective functions. <bold>(a)</bold> RB vs. peak driving force. <bold>(b)</bold> RB vs. dexterity. <bold>(c)</bold> RB vs. Isotropy.</p></caption>
          <graphic xlink:href="https://ms.copernicus.org/articles/17/783/2026/ms-17-783-2026-f09.png"/>

        </fig>

      <p id="d2e4197">As shown in Fig. 9, increasing <inline-formula><mml:math id="M174" display="inline"><mml:mrow><mml:msub><mml:mi>R</mml:mi><mml:mi>B</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> can significantly optimize the force mapping to evenly distribute the load; as it increases from 2140 to 3110 mm, the peak driving force decreases from 117.47 to 87.44 kN. In terms of kinematics, <inline-formula><mml:math id="M175" display="inline"><mml:mrow><mml:msub><mml:mi>R</mml:mi><mml:mi>B</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> enhances the mechanism dexterity with a correlation coefficient of <inline-formula><mml:math id="M176" display="inline"><mml:mrow><mml:mi>r</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">0.843</mml:mn></mml:mrow></mml:math></inline-formula>. Meanwhile, it exhibits a strong negative correlation with the condition number (<inline-formula><mml:math id="M177" display="inline"><mml:mrow><mml:mi>r</mml:mi><mml:mo>=</mml:mo><mml:mo>-</mml:mo><mml:mn mathvariant="normal">0.774</mml:mn></mml:mrow></mml:math></inline-formula>), which drops substantially from approximately 22 to 14.28.</p>
</sec>
<sec id="Ch1.S5.SS2">
  <label>5.2</label><title>Result screening and comprehensive evaluation</title>
      <p id="d2e4256">Based on the sensitivity correlations between the design variables and the performance objectives, the 455 non-dominated solutions obtained via optimization are compared against the baseline of initial structural parameters. This comparison aims to screen out the optimized solutions that exhibit improvements across three to four optimization objectives. Figure 10 illustrates the performance enhancements of the 91 selected optimal solutions relative to the initial structural baseline.</p>

      <fig id="F10"><label>Figure 10</label><caption><p id="d2e4261">Line chart of performance improvement percentages.</p></caption>
          <graphic xlink:href="https://ms.copernicus.org/articles/17/783/2026/ms-17-783-2026-f10.png"/>

        </fig>

      <p id="d2e4270">The analysis indicates that the improvements in dexterity and peak driving force are the most prominent. Across the entire solution set, dexterity increases by 1 % to 20 %, with solution 1 reaching 18.88 %. The peak driving force decreases by 8 % to 14 %, and, notably, solution 3 drops from 103.11  to 90.97 kN. Constrained by the relatively optimal initial baseline, the stroke reduction rate remains stable between 1 % and 5 %.</p>
<sec id="Ch1.S5.SS2.SSS1">
  <label>5.2.1</label><title>Construction and positivation of the decision evaluation matrix</title>
      <p id="d2e4281">The decision matrix serves as the quantitative foundation for multi-criteria decision analysis. After non-dominated sorting and preliminary screening, 91 representative Pareto optimal solutions are obtained to form a candidate scheme set <inline-formula><mml:math id="M178" display="inline"><mml:mrow><mml:mi>S</mml:mi><mml:mo>=</mml:mo></mml:mrow></mml:math></inline-formula>  <inline-formula><mml:math id="M179" display="inline"><mml:mrow><mml:msub><mml:mi>S</mml:mi><mml:mn mathvariant="normal">1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math id="M180" display="inline"><mml:mrow><mml:msub><mml:mi>S</mml:mi><mml:mn mathvariant="normal">2</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math id="M181" display="inline"><mml:mrow><mml:msub><mml:mi>S</mml:mi><mml:mn mathvariant="normal">3</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula>,..,<inline-formula><mml:math id="M182" display="inline"><mml:mrow><mml:msub><mml:mi>S</mml:mi><mml:mn mathvariant="normal">91</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula>. Each scheme is characterized by four performance objective metrics. The original decision matrix <inline-formula><mml:math id="M183" display="inline"><mml:mi mathvariant="bold">X</mml:mi></mml:math></inline-formula> is constructed as follows:

              <disp-formula id="Ch1.E24" content-type="numbered"><label>24</label><mml:math id="M184" display="block"><mml:mrow><mml:mi mathvariant="bold">X</mml:mi><mml:mo>=</mml:mo><mml:mfenced open="[" close="]"><mml:mtable class="array" columnalign="center center center center"><mml:mtr><mml:mtd><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mn mathvariant="normal">11</mml:mn></mml:msub></mml:mrow></mml:mtd><mml:mtd><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mn mathvariant="normal">12</mml:mn></mml:msub></mml:mrow></mml:mtd><mml:mtd><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mn mathvariant="normal">13</mml:mn></mml:msub></mml:mrow></mml:mtd><mml:mtd><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mn mathvariant="normal">14</mml:mn></mml:msub></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mn mathvariant="normal">21</mml:mn></mml:msub></mml:mrow></mml:mtd><mml:mtd><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mn mathvariant="normal">22</mml:mn></mml:msub></mml:mrow></mml:mtd><mml:mtd><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mn mathvariant="normal">23</mml:mn></mml:msub></mml:mrow></mml:mtd><mml:mtd><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mn mathvariant="normal">24</mml:mn></mml:msub></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mi mathvariant="normal">⋮</mml:mi></mml:mtd><mml:mtd><mml:mi mathvariant="normal">⋮</mml:mi></mml:mtd><mml:mtd><mml:mi mathvariant="normal">⋮</mml:mi></mml:mtd><mml:mtd><mml:mi mathvariant="normal">⋮</mml:mi></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>n</mml:mi><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:mtd><mml:mtd><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>n</mml:mi><mml:mn mathvariant="normal">2</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:mtd><mml:mtd><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>n</mml:mi><mml:mn mathvariant="normal">3</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:mtd><mml:mtd><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>n</mml:mi><mml:mn mathvariant="normal">4</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mfenced><mml:mo>,</mml:mo></mml:mrow></mml:math></disp-formula>

            where the rows of the matrix represent different configuration schemes, and the columns represent the four performance metrics. The first column (<inline-formula><mml:math id="M185" display="inline"><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:math></inline-formula>) denotes the actuation stroke <inline-formula><mml:math id="M186" display="inline"><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mn mathvariant="normal">1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula>, the second column (<inline-formula><mml:math id="M187" display="inline"><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">2</mml:mn></mml:mrow></mml:math></inline-formula>) denotes the peak driving force <inline-formula><mml:math id="M188" display="inline"><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mn mathvariant="normal">2</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula>, the third column (<inline-formula><mml:math id="M189" display="inline"><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">3</mml:mn></mml:mrow></mml:math></inline-formula>) denotes the mechanism dexterity <inline-formula><mml:math id="M190" display="inline"><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mn mathvariant="normal">3</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula>, and the fourth column (<inline-formula><mml:math id="M191" display="inline"><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">4</mml:mn></mml:mrow></mml:math></inline-formula>) denotes the isotropy <inline-formula><mml:math id="M192" display="inline"><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mn mathvariant="normal">4</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula>.</p>
      <p id="d2e4565">In the comprehensive system performance evaluation, the optimization directions of the evaluation metrics vary. To facilitate a unified weighted calculation, the metrics must undergo a positivation classification process. Specifically, the actuation stroke <inline-formula><mml:math id="M193" display="inline"><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mn mathvariant="normal">1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula>, peak driving force<inline-formula><mml:math id="M194" display="inline"><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mn mathvariant="normal">2</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula>, and condition number <inline-formula><mml:math id="M195" display="inline"><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mn mathvariant="normal">4</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> are cost-type metrics that are considered optimal when minimized. Conversely, the mechanism dexterity <inline-formula><mml:math id="M196" display="inline"><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mn mathvariant="normal">3</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> is a benefit-type metric that is considered optimal when maximized. For the cost-type metrics, the positivation transformation formula is

              <disp-formula id="Ch1.E25" content-type="numbered"><label>25</label><mml:math id="M197" display="block"><mml:mrow><mml:msubsup><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow><mml:mo>′</mml:mo></mml:msubsup><mml:mo>=</mml:mo><mml:mi mathvariant="normal">max</mml:mi><mml:mo>(</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo><mml:mo>-</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo></mml:mrow></mml:math></disp-formula>

            where  max(<inline-formula><mml:math id="M198" display="inline"><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>) is the maximum value of the <inline-formula><mml:math id="M199" display="inline"><mml:mi>j</mml:mi></mml:math></inline-formula>th metric across all candidate schemes. For the benefit-type metrics, their original values remain unchanged:

              <disp-formula id="Ch1.E26" content-type="numbered"><label>26</label><mml:math id="M200" display="block"><mml:mrow><mml:msubsup><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow><mml:mo>′</mml:mo></mml:msubsup><mml:mo>=</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>.</mml:mo></mml:mrow></mml:math></disp-formula>

            After executing the above procedure, the original matrix <bold>X</bold> is transformed into the positivated decision matrix <bold>X'</bold>. At this point, all numerical values within the columns of the matrix exhibit the property where larger values indicate better performance.

              <disp-formula id="Ch1.E27" content-type="numbered"><label>27</label><mml:math id="M201" display="block"><mml:mrow><mml:msub><mml:mi>r</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mstyle displaystyle="true"><mml:mfrac style="display"><mml:mrow><mml:msubsup><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow><mml:mo>′</mml:mo></mml:msubsup></mml:mrow><mml:msqrt><mml:mrow><mml:msubsup><mml:mo>∑</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow><mml:mrow class="chem"><mml:mi mathvariant="normal">n</mml:mi></mml:mrow></mml:msubsup><mml:msup><mml:mfenced open="(" close=")"><mml:mrow><mml:msubsup><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow><mml:mo>′</mml:mo></mml:msubsup></mml:mrow></mml:mfenced><mml:mn mathvariant="normal">2</mml:mn></mml:msup></mml:mrow></mml:msqrt></mml:mfrac></mml:mstyle><mml:mo>.</mml:mo></mml:mrow></mml:math></disp-formula>

            In the configuration selection of the heavy-load compensation parallel mechanism, the contributions of different performance metrics to mission success are not equal. Based on the previous sensitivity analysis results of the structural parameters and combined with practical requirements, a weighted scoring mechanism is adopted. The weight vector is defined as follows:

              <disp-formula id="Ch1.E28" content-type="numbered"><label>28</label><mml:math id="M202" display="block"><mml:mrow><mml:mi mathvariant="bold-italic">w</mml:mi><mml:mo>=</mml:mo><mml:msup><mml:mfenced close="]" open="["><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mn mathvariant="normal">1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>w</mml:mi><mml:mn mathvariant="normal">2</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>w</mml:mi><mml:mn mathvariant="normal">3</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>w</mml:mi><mml:mn mathvariant="normal">4</mml:mn></mml:msub></mml:mrow></mml:mfenced><mml:mi>T</mml:mi></mml:msup><mml:mo>.</mml:mo></mml:mrow></mml:math></disp-formula>

            According to practical engineering needs, different weight coefficients are assigned to various optimization objectives. Emphasizing the constraints of installation space and extension length, the weight of the actuation stroke is set to <inline-formula><mml:math id="M203" display="inline"><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mn mathvariant="normal">1</mml:mn></mml:msub><mml:mo>=</mml:mo><mml:mn mathvariant="normal">0.25</mml:mn></mml:mrow></mml:math></inline-formula>. Since the wave compensation mechanism involves heavy-load operations, the peak driving force directly determines the safety of the drive system and is therefore assigned the highest weight of <inline-formula><mml:math id="M204" display="inline"><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mn mathvariant="normal">2</mml:mn></mml:msub><mml:mo>=</mml:mo><mml:mn mathvariant="normal">0.30</mml:mn></mml:mrow></mml:math></inline-formula>. Meanwhile, the weight of the mechanism dexterity is set to <inline-formula><mml:math id="M205" display="inline"><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mn mathvariant="normal">3</mml:mn></mml:msub><mml:mo>=</mml:mo><mml:mn mathvariant="normal">0.25</mml:mn></mml:mrow></mml:math></inline-formula>, and the weight of the condition number is set to <inline-formula><mml:math id="M206" display="inline"><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mn mathvariant="normal">4</mml:mn></mml:msub><mml:mo>=</mml:mo><mml:mn mathvariant="normal">0.20</mml:mn></mml:mrow></mml:math></inline-formula>.</p>
      <p id="d2e4877">Applying the aforementioned weight vector to the normalized matrix <bold>R</bold> yields the weighted normalized decision matrix <bold>V</bold><inline-formula><mml:math id="M207" display="inline"><mml:mrow><mml:mo>=</mml:mo><mml:mo>(</mml:mo><mml:msub><mml:mi>v</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:msub><mml:mo>)</mml:mo><mml:mrow><mml:mi>n</mml:mi><mml:mo>×</mml:mo><mml:mi>m</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>. Each element in this matrix represents the contribution score of the scheme for a specific metric:

              <disp-formula id="Ch1.E29" content-type="numbered"><label>29</label><mml:math id="M208" display="block"><mml:mrow><mml:msub><mml:mi>v</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>w</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo>⋅</mml:mo><mml:msub><mml:mi>r</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>.</mml:mo></mml:mrow></mml:math></disp-formula>

            By introducing the weight coefficients, the weighted matrix <bold>V</bold> modifies the geometric morphology of the performance space. In the subsequent calculation of distances to the ideal solutions, the coordinate axes corresponding to metrics with larger weights are proportionally stretched in the Euclidean space. Consequently, schemes that excel in the core metrics are more likely to stand out in the final ranking.</p>
</sec>
<sec id="Ch1.S5.SS2.SSS2">
  <label>5.2.2</label><title>Determination of positive and negative ideal solutions and calculation of Euclidean distances</title>
      <p id="d2e4957">Within the weighted performance space, the positive ideal solution is a virtual optimal scheme where each metric takes the maximum value from the corresponding metrics in the candidate solution set. The negative ideal solution is a virtual scheme composed of the minimum values of each metric. Since the metrics have undergone the positivation process in the previous section, all metric columns now exhibit the larger-the-better characteristic. Therefore, the coordinates of the positive and negative ideal solutions are determined by the following formulas:

              <disp-formula id="Ch1.E30" content-type="numbered"><label>30</label><mml:math id="M209" display="block"><mml:mrow><mml:mfenced close="" open="{"><mml:mrow><mml:mtable class="array" columnalign="left left"><mml:mtr><mml:mtd><mml:mrow><mml:msup><mml:mi>A</mml:mi><mml:mo>+</mml:mo></mml:msup></mml:mrow></mml:mtd><mml:mtd><mml:mrow><mml:mo>=</mml:mo><mml:mfenced close=")" open="("><mml:mrow><mml:msubsup><mml:mi>v</mml:mi><mml:mn mathvariant="normal">1</mml:mn><mml:mo>+</mml:mo></mml:msubsup><mml:mo>,</mml:mo><mml:msubsup><mml:mi>v</mml:mi><mml:mn mathvariant="normal">2</mml:mn><mml:mo>+</mml:mo></mml:msubsup><mml:mo>,</mml:mo><mml:msubsup><mml:mi>v</mml:mi><mml:mn mathvariant="normal">3</mml:mn><mml:mo>+</mml:mo></mml:msubsup><mml:mo>,</mml:mo><mml:msubsup><mml:mi>v</mml:mi><mml:mn mathvariant="normal">4</mml:mn><mml:mo>+</mml:mo></mml:msubsup></mml:mrow></mml:mfenced></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd/><mml:mtd><mml:mrow><mml:mo>=</mml:mo><mml:mfenced open="(" close=")"><mml:mrow><mml:mtable class="substack"><mml:mtr><mml:mtd><mml:mi mathvariant="normal">max</mml:mi></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mi>i</mml:mi></mml:mtd></mml:mtr></mml:mtable><mml:msub><mml:mi>v</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:msub><mml:mtable class="substack"><mml:mtr><mml:mtd><mml:mi mathvariant="normal">max</mml:mi></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mi>i</mml:mi></mml:mtd></mml:mtr></mml:mtable><mml:msub><mml:mi>v</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mn mathvariant="normal">2</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mtable class="substack"><mml:mtr><mml:mtd><mml:mi mathvariant="normal">max</mml:mi></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mi>i</mml:mi></mml:mtd></mml:mtr></mml:mtable><mml:msub><mml:mi>v</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mn mathvariant="normal">3</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mtable class="substack"><mml:mtr><mml:mtd><mml:mi mathvariant="normal">max</mml:mi></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mi>i</mml:mi></mml:mtd></mml:mtr></mml:mtable><mml:msub><mml:mi>v</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mn mathvariant="normal">4</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:mfenced></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:msup><mml:mi>A</mml:mi><mml:mo>-</mml:mo></mml:msup></mml:mrow></mml:mtd><mml:mtd><mml:mrow><mml:mo>=</mml:mo><mml:mfenced close=")" open="("><mml:mrow><mml:msubsup><mml:mi>v</mml:mi><mml:mn mathvariant="normal">1</mml:mn><mml:mo>-</mml:mo></mml:msubsup><mml:mo>,</mml:mo><mml:msubsup><mml:mi>v</mml:mi><mml:mn mathvariant="normal">2</mml:mn><mml:mo>-</mml:mo></mml:msubsup><mml:mo>,</mml:mo><mml:msubsup><mml:mi>v</mml:mi><mml:mn mathvariant="normal">3</mml:mn><mml:mo>-</mml:mo></mml:msubsup><mml:mo>,</mml:mo><mml:msubsup><mml:mi>v</mml:mi><mml:mn mathvariant="normal">4</mml:mn><mml:mo>-</mml:mo></mml:msubsup></mml:mrow></mml:mfenced></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd/><mml:mtd><mml:mrow><mml:mo>=</mml:mo><mml:mfenced close=")" open="("><mml:mrow><mml:mtable class="substack"><mml:mtr><mml:mtd><mml:mi mathvariant="normal">min</mml:mi></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mi>i</mml:mi></mml:mtd></mml:mtr></mml:mtable><mml:msub><mml:mi>v</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mtable class="substack"><mml:mtr><mml:mtd><mml:mi mathvariant="normal">min</mml:mi></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mi>i</mml:mi></mml:mtd></mml:mtr></mml:mtable><mml:msub><mml:mi>v</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mn mathvariant="normal">2</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mtable class="substack"><mml:mtr><mml:mtd><mml:mi mathvariant="normal">min</mml:mi></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mi>i</mml:mi></mml:mtd></mml:mtr></mml:mtable><mml:msub><mml:mi>v</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mn mathvariant="normal">3</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mtable class="substack"><mml:mtr><mml:mtd><mml:mi mathvariant="normal">min</mml:mi></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mi>i</mml:mi></mml:mtd></mml:mtr></mml:mtable><mml:msub><mml:mi>v</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mn mathvariant="normal">4</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:mfenced></mml:mrow></mml:mtd></mml:mtr></mml:mtable><mml:mo>,</mml:mo></mml:mrow></mml:mfenced></mml:mrow></mml:math></disp-formula>

            where <inline-formula><mml:math id="M210" display="inline"><mml:mrow><mml:mi>i</mml:mi><mml:mo>∈</mml:mo><mml:mo mathvariant="italic">{</mml:mo><mml:mn mathvariant="normal">1</mml:mn><mml:mo>,</mml:mo><mml:mn mathvariant="normal">2</mml:mn><mml:mo>,</mml:mo><mml:mn mathvariant="normal">3</mml:mn><mml:mo>,</mml:mo><mml:mi mathvariant="normal">…</mml:mi><mml:mo>,</mml:mo><mml:mn mathvariant="normal">91</mml:mn><mml:mo mathvariant="italic">}</mml:mo></mml:mrow></mml:math></inline-formula> denotes the index of the 91 schemes, and <inline-formula><mml:math id="M211" display="inline"><mml:mrow><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> is the weighted normalized value of the <inline-formula><mml:math id="M212" display="inline"><mml:mi>i</mml:mi></mml:math></inline-formula>th scheme on the <inline-formula><mml:math id="M213" display="inline"><mml:mi>j</mml:mi></mml:math></inline-formula>th metric. The positive ideal solution component <inline-formula><mml:math id="M214" display="inline"><mml:mrow><mml:msubsup><mml:mi>v</mml:mi><mml:mi>j</mml:mi><mml:mo>+</mml:mo></mml:msubsup></mml:mrow></mml:math></inline-formula> represents the weighted upper bound of the <inline-formula><mml:math id="M215" display="inline"><mml:mi>j</mml:mi></mml:math></inline-formula>th metric among all schemes, indicating the optimal performance. The negative ideal solution component <inline-formula><mml:math id="M216" display="inline"><mml:mrow><mml:msubsup><mml:mi>v</mml:mi><mml:mi>j</mml:mi><mml:mo>-</mml:mo></mml:msubsup></mml:mrow></mml:math></inline-formula> represents the lower bound of the performance bottleneck allowed for the <inline-formula><mml:math id="M217" display="inline"><mml:mi>j</mml:mi></mml:math></inline-formula>th metric. After executing this step, the originally abstract 91 sets of solutions are successfully placed within a hyper-rectangular performance interval defined by <inline-formula><mml:math id="M218" display="inline"><mml:mrow><mml:msup><mml:mi>A</mml:mi><mml:mo>+</mml:mo></mml:msup></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math id="M219" display="inline"><mml:mrow><mml:msup><mml:mi>A</mml:mi><mml:mo>-</mml:mo></mml:msup></mml:mrow></mml:math></inline-formula>, providing a reasonable reference for the final comprehensive scoring.</p>
</sec>
<sec id="Ch1.S5.SS2.SSS3">
  <label>5.2.3</label><title>Calculation of relative closeness and final scheme selection</title>
      <p id="d2e5361">The relative closeness coefficient <inline-formula><mml:math id="M220" display="inline"><mml:mrow><mml:msub><mml:mi>C</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> is defined as the final evaluation metric to measure the superiority of the 6-DOF wave compensation platform configurations. Its calculation formula is as follows:

              <disp-formula id="Ch1.E31" content-type="numbered"><label>31</label><mml:math id="M221" display="block"><mml:mrow><mml:msub><mml:mi>C</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mstyle displaystyle="true"><mml:mfrac style="display"><mml:mrow><mml:msubsup><mml:mi>D</mml:mi><mml:mi>i</mml:mi><mml:mo>-</mml:mo></mml:msubsup></mml:mrow><mml:mrow><mml:msubsup><mml:mi>D</mml:mi><mml:mi>i</mml:mi><mml:mo>+</mml:mo></mml:msubsup><mml:mo>+</mml:mo><mml:msubsup><mml:mi>D</mml:mi><mml:mi>i</mml:mi><mml:mo>-</mml:mo></mml:msubsup></mml:mrow></mml:mfrac></mml:mstyle><mml:mo>,</mml:mo></mml:mrow></mml:math></disp-formula>

            where<inline-formula><mml:math id="M222" display="inline"><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo></mml:mrow></mml:math></inline-formula>1,2,3,...,91; <inline-formula><mml:math id="M223" display="inline"><mml:mrow><mml:msubsup><mml:mi>D</mml:mi><mml:mi>i</mml:mi><mml:mo>+</mml:mo></mml:msubsup></mml:mrow></mml:math></inline-formula> is the Euclidean distance from the <inline-formula><mml:math id="M224" display="inline"><mml:mi>i</mml:mi></mml:math></inline-formula>th scheme to the positive ideal solution, and <inline-formula><mml:math id="M225" display="inline"><mml:mrow><mml:msubsup><mml:mi>D</mml:mi><mml:mi>i</mml:mi><mml:mo>-</mml:mo></mml:msubsup></mml:mrow></mml:math></inline-formula> is the Euclidean distance from the <inline-formula><mml:math id="M226" display="inline"><mml:mi>i</mml:mi></mml:math></inline-formula>th scheme to the negative ideal solution. The value of the relative closeness <inline-formula><mml:math id="M227" display="inline"><mml:mrow><mml:msub><mml:mi>C</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> is strictly bounded within the interval [0,1], and its magnitude reflects the comprehensive competitiveness of the scheme represented by the optimized solution. When it approaches 1, it indicates that the scheme is closer to the positive ideal solution and further from the negative ideal solution. If <inline-formula><mml:math id="M228" display="inline"><mml:mrow><mml:msub><mml:mi>C</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:math></inline-formula>, it implies that the scheme has reached the extreme level of the Pareto front across all performance dimensions. When it approaches 0, it signifies that the scheme has almost hit the lower bounds of all performance metrics, classifying it as the worst configuration.</p>
      <p id="d2e5494">Based on the <inline-formula><mml:math id="M229" display="inline"><mml:mrow><mml:msub><mml:mi>C</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> index, the 91 optimized solutions are sorted in descending order to construct an optimal decision sequence. The top-ranked scheme is thus locked in as the global optimal configuration. This closeness-based screening logic possesses a decision-making advantage: it evaluates the excellence of a scheme not only by determining its proximity to <inline-formula><mml:math id="M230" display="inline"><mml:mrow><mml:msup><mml:mi>A</mml:mi><mml:mo>+</mml:mo></mml:msup></mml:mrow></mml:math></inline-formula> but by simultaneously assessing the stability of the scheme by determining its distance from <inline-formula><mml:math id="M231" display="inline"><mml:mrow><mml:msup><mml:mi>A</mml:mi><mml:mo>-</mml:mo></mml:msup></mml:mrow></mml:math></inline-formula>.</p>

      <fig id="F11"><label>Figure 11</label><caption><p id="d2e5532">Bar chart of the comprehensive performance ranking of the solution set.</p></caption>
            <graphic xlink:href="https://ms.copernicus.org/articles/17/783/2026/ms-17-783-2026-f11.png"/>

          </fig>

      <p id="d2e5542">As shown in Fig. 11, [Sol 3] is identified as the final recommended scheme through comprehensive scoring, and it occupies a central and balanced position on the Pareto front.</p>

      <fig id="F12"><label>Figure 12</label><caption><p id="d2e5547">Comprehensive performance gains of the optimal solution.</p></caption>
            <graphic xlink:href="https://ms.copernicus.org/articles/17/783/2026/ms-17-783-2026-f12.png"/>

          </fig>

      <p id="d2e5556">Figure 12 demonstrates that the mechanism dexterity of the optimal solution surges by 18.12 %, the isotropy improves by 6.85 %, the peak driving force decreases by 11.78 %, and the actuation stroke is reduced by 0.92 %. In summary, while ensuring structural compactness, this optimal configuration significantly enhances motion transmission efficiency and alleviates the actuator load.</p>
</sec>
</sec>
<sec id="Ch1.S5.SS3">
  <label>5.3</label><title>Multi-objective performance comparison between the improved and traditional algorithms</title>
      <p id="d2e5568">In this section, the traditional NSGA-II algorithm is selected as the classical baseline for comparison. Rather than treating it as a competing meta-optimizer, NSGA-II is strictly employed as a control group to demonstrate the exact limitations of the traditional crowding-distance mechanism in a four-objective space, thereby highlighting the necessity and performance leap brought by the reference-point mechanism of NSGA-III. Three core evaluation metrics in the multi-objective optimization field are introduced to conduct a quantitative comparative analysis of the optimized solution sets from the traditional NSGA-II algorithm and the enhanced multi-objective genetic algorithm NSGA-III. The spacing metric SP is utilized to measure the distribution uniformity of the non-dominated solution set. Its calculation formula is as follows:

            <disp-formula id="Ch1.E32" content-type="numbered"><label>32</label><mml:math id="M232" display="block"><mml:mrow><mml:mi mathvariant="normal">SP</mml:mi><mml:mo>=</mml:mo><mml:msqrt><mml:mrow><mml:mstyle displaystyle="true"><mml:mfrac style="display"><mml:mn mathvariant="normal">1</mml:mn><mml:mrow><mml:mi>n</mml:mi><mml:mo>-</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:mfrac></mml:mstyle><mml:munderover><mml:mo movablelimits="false">∑</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow><mml:mi>n</mml:mi></mml:munderover><mml:msup><mml:mfenced close=")" open="("><mml:mrow><mml:mover accent="true"><mml:mi>d</mml:mi><mml:mo mathvariant="normal">‾</mml:mo></mml:mover><mml:mo>-</mml:mo><mml:msub><mml:mi>d</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:mfenced><mml:mn mathvariant="normal">2</mml:mn></mml:msup></mml:mrow></mml:msqrt><mml:mo>,</mml:mo></mml:mrow></mml:math></disp-formula>

          where <inline-formula><mml:math id="M233" display="inline"><mml:mi>n</mml:mi></mml:math></inline-formula> is the total number of obtained non-dominated solutions, and <inline-formula><mml:math id="M234" display="inline"><mml:mrow><mml:msub><mml:mi>d</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> is the minimum Euclidean distance from the <inline-formula><mml:math id="M235" display="inline"><mml:mi>i</mml:mi></mml:math></inline-formula>th solution to the other solutions in the set, expressed as

            <disp-formula id="Ch1.E33" content-type="numbered"><label>33</label><mml:math id="M236" display="block"><mml:mrow><mml:msub><mml:mi>d</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mtable class="substack"><mml:mtr><mml:mtd><mml:mi mathvariant="normal">min</mml:mi></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mi>j</mml:mi><mml:mo>∈</mml:mo><mml:mo mathvariant="italic">{</mml:mo><mml:mn mathvariant="normal">1</mml:mn><mml:mo>,</mml:mo><mml:mn mathvariant="normal">2</mml:mn><mml:mo>,</mml:mo><mml:mi mathvariant="normal">…</mml:mi><mml:mo>,</mml:mo><mml:mi>n</mml:mi><mml:mo mathvariant="italic">}</mml:mo><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>≠</mml:mo><mml:mi>i</mml:mi></mml:mtd></mml:mtr></mml:mtable><mml:mfenced close=")" open="("><mml:mrow><mml:munderover><mml:mo movablelimits="false">∑</mml:mo><mml:mrow><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow><mml:mi>M</mml:mi></mml:munderover><mml:mo>∥</mml:mo><mml:msubsup><mml:mi>f</mml:mi><mml:mi>k</mml:mi><mml:mi>i</mml:mi></mml:msubsup><mml:mo>-</mml:mo><mml:msubsup><mml:mi>f</mml:mi><mml:mi>k</mml:mi><mml:mi>j</mml:mi></mml:msubsup><mml:msub><mml:mo>∥</mml:mo><mml:mn mathvariant="normal">2</mml:mn></mml:msub></mml:mrow></mml:mfenced><mml:mo>,</mml:mo></mml:mrow></mml:math></disp-formula>

            <disp-formula id="Ch1.E34" content-type="numbered"><label>34</label><mml:math id="M237" display="block"><mml:mrow><mml:mover accent="true"><mml:mi>d</mml:mi><mml:mo mathvariant="normal">‾</mml:mo></mml:mover><mml:mo>=</mml:mo><mml:mstyle displaystyle="true"><mml:mfrac style="display"><mml:mn mathvariant="normal">1</mml:mn><mml:mi>n</mml:mi></mml:mfrac></mml:mstyle><mml:msubsup><mml:mo>∑</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow><mml:mi>n</mml:mi></mml:msubsup><mml:msub><mml:mi>d</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>,</mml:mo></mml:mrow></mml:math></disp-formula>

          where <inline-formula><mml:math id="M238" display="inline"><mml:mi>M</mml:mi></mml:math></inline-formula> is the number of objective functions, and <inline-formula><mml:math id="M239" display="inline"><mml:mover accent="true"><mml:mi>d</mml:mi><mml:mo mathvariant="normal">‾</mml:mo></mml:mover></mml:math></inline-formula> is the average of all minimum distances <inline-formula><mml:math id="M240" display="inline"><mml:mrow><mml:msub><mml:mi>d</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>. Numerically, the SP metric reflects the standard deviation of individual spacing on the Pareto front. When SP <inline-formula><mml:math id="M241" display="inline"><mml:mo>=</mml:mo></mml:math></inline-formula> 0, it indicates that all non-dominated solutions are arranged at completely equal intervals in the objective space, reaching an ideal uniform state. A smaller SP value signifies that the distribution of the solution set tends to be more uniform, and the algorithm's ability to capture the performance front is more stable, without obvious performance gaps or individual crowding phenomena.</p>
      <p id="d2e5814">The maximum spread metric MS is used to evaluate the algorithm's exploration capability regarding the extreme boundaries of the objective space. Its formula is defined as the Euclidean distance between the two furthest solutions in the normalized objective space:

            <disp-formula id="Ch1.E35" content-type="numbered"><label>35</label><mml:math id="M242" display="block"><mml:mrow><mml:mi mathvariant="normal">MS</mml:mi><mml:mo>=</mml:mo><mml:mtable class="substack"><mml:mtr><mml:mtd><mml:mo movablelimits="false">max⁡</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>∈</mml:mo><mml:mo mathvariant="italic">{</mml:mo><mml:mn mathvariant="normal">1</mml:mn><mml:mo>,</mml:mo><mml:mn mathvariant="normal">2</mml:mn><mml:mo>,</mml:mo><mml:mi mathvariant="normal">…</mml:mi><mml:mo>,</mml:mo><mml:mi>N</mml:mi><mml:mo mathvariant="italic">}</mml:mo></mml:mtd></mml:mtr></mml:mtable><mml:msqrt><mml:mrow><mml:munderover><mml:mo movablelimits="false">∑</mml:mo><mml:mrow><mml:mi>m</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow><mml:mi>M</mml:mi></mml:munderover><mml:msup><mml:mfenced close=")" open="("><mml:mrow><mml:msubsup><mml:mi>f</mml:mi><mml:mi>m</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:msubsup><mml:mo>-</mml:mo><mml:msubsup><mml:mi>f</mml:mi><mml:mi>m</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>j</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:msubsup></mml:mrow></mml:mfenced><mml:mn mathvariant="normal">2</mml:mn></mml:msup></mml:mrow></mml:msqrt><mml:mo>,</mml:mo></mml:mrow></mml:math></disp-formula>

          where <inline-formula><mml:math id="M243" display="inline"><mml:mi>M</mml:mi></mml:math></inline-formula> is the objective dimension, and <inline-formula><mml:math id="M244" display="inline"><mml:mrow><mml:msubsup><mml:mi>f</mml:mi><mml:mi>m</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:msubsup></mml:mrow></mml:math></inline-formula> is the normalized value of the <inline-formula><mml:math id="M245" display="inline"><mml:mi>i</mml:mi></mml:math></inline-formula>th solution on the <inline-formula><mml:math id="M246" display="inline"><mml:mi>m</mml:mi></mml:math></inline-formula>th objective. A larger  MS value indicates that the algorithm has a wider coverage range over the extreme parameter boundaries.</p>
      <p id="d2e5947">The comprehensive hypervolume indicator  HV is an important metric for evaluating the comprehensive performance of multi-objective optimization algorithms, taking into account both convergence and diversity. Let the reference point be <inline-formula><mml:math id="M247" display="inline"><mml:mrow><mml:mi mathvariant="bold-italic">r</mml:mi><mml:mo>=</mml:mo><mml:mo>[</mml:mo><mml:msub><mml:mi>r</mml:mi><mml:mn mathvariant="normal">1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>r</mml:mi><mml:mn mathvariant="normal">2</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mi mathvariant="normal">…</mml:mi><mml:mo>,</mml:mo><mml:msub><mml:mi>r</mml:mi><mml:mi>M</mml:mi></mml:msub><mml:msup><mml:mo>]</mml:mo><mml:mi>T</mml:mi></mml:msup></mml:mrow></mml:math></inline-formula>. HV is defined as the hyper-geometric volume enclosed by the Pareto solution set and the reference point in the objective space:

            <disp-formula id="Ch1.E36" content-type="numbered"><label>36</label><mml:math id="M248" display="block"><mml:mrow><mml:mi mathvariant="normal">HV</mml:mi><mml:mo>=</mml:mo><mml:mi mathvariant="normal">Volume</mml:mi><mml:mfenced close=")" open="("><mml:mrow><mml:munderover><mml:mo movablelimits="false">⋃</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow><mml:mi>N</mml:mi></mml:munderover><mml:mfenced close="]" open="["><mml:mrow><mml:msubsup><mml:mi>f</mml:mi><mml:mn mathvariant="normal">1</mml:mn><mml:mrow><mml:mfenced close=")" open="("><mml:mi>i</mml:mi></mml:mfenced></mml:mrow></mml:msubsup><mml:mo>,</mml:mo><mml:msub><mml:mi>r</mml:mi><mml:mn mathvariant="normal">1</mml:mn></mml:msub></mml:mrow></mml:mfenced><mml:mo>×</mml:mo><mml:mi mathvariant="normal">…</mml:mi><mml:mo>×</mml:mo><mml:mfenced open="[" close="]"><mml:mrow><mml:msubsup><mml:mi>f</mml:mi><mml:mi>m</mml:mi><mml:mrow><mml:mfenced open="(" close=")"><mml:mi>i</mml:mi></mml:mfenced></mml:mrow></mml:msubsup><mml:mo>,</mml:mo><mml:msub><mml:mi>r</mml:mi><mml:mi>m</mml:mi></mml:msub></mml:mrow></mml:mfenced></mml:mrow></mml:mfenced><mml:mo>.</mml:mo></mml:mrow></mml:math></disp-formula>

          A larger  HV value indicates that the solution set generated by the algorithm is closer to the true perfect front and covers a broader trade-off space, reflecting superior overall multi-objective performance. After applying range normalization to the optimization results of NSGA-II and NSGA-III, the statistical results of the above three metrics are calculated, and these are presented in Table 2:</p>

<table-wrap id="T2"><label>Table 2</label><caption><p id="d2e6064">Comparison of evaluation metrics.</p></caption><oasis:table frame="topbot"><oasis:tgroup cols="3">
     <oasis:colspec colnum="1" colname="col1" align="left"/>
     <oasis:colspec colnum="2" colname="col2" align="right"/>
     <oasis:colspec colnum="3" colname="col3" align="right"/>
     <oasis:thead>
       <oasis:row>
         <oasis:entry colname="col1">Evaluation</oasis:entry>
         <oasis:entry colname="col2"/>
         <oasis:entry colname="col3"/>
       </oasis:row>
       <oasis:row rowsep="1">
         <oasis:entry colname="col1">metric</oasis:entry>
         <oasis:entry colname="col2">NSGA-II</oasis:entry>
         <oasis:entry colname="col3">NSGA-III</oasis:entry>
       </oasis:row>
     </oasis:thead>
     <oasis:tbody>
       <oasis:row>
         <oasis:entry colname="col1">SP</oasis:entry>
         <oasis:entry colname="col2">0.0794</oasis:entry>
         <oasis:entry colname="col3">0.0497</oasis:entry>
       </oasis:row>
       <oasis:row>
         <oasis:entry colname="col1">MS</oasis:entry>
         <oasis:entry colname="col2">1.8616</oasis:entry>
         <oasis:entry colname="col3">1.6211</oasis:entry>
       </oasis:row>
       <oasis:row>
         <oasis:entry colname="col1">HV</oasis:entry>
         <oasis:entry colname="col2">0.8721</oasis:entry>
         <oasis:entry colname="col3">1.1010</oasis:entry>
       </oasis:row>
     </oasis:tbody>
   </oasis:tgroup></oasis:table></table-wrap>

      <p id="d2e6142">The analysis shows that its SP value drops to 0.0497, representing a decrease of 37.4 %, and the HV value increases by 26.2 %. Although the MS value of NSGA-III is slightly lower than that of NSGA-II, it eliminates the artificial inflation of MS caused by isolated extreme solutions in the traditional algorithm. NSGA-III generates an internally highly continuous solution set, which holds greater significance for engineering guidance. The comparison of structural parameters before and after optimization is shown in Table 3.</p>

<table-wrap id="T3"><label>Table 3</label><caption><p id="d2e6148">Comparison of structural parameters and performance metrics before and after optimization.</p></caption><oasis:table frame="topbot"><oasis:tgroup cols="4">
     <oasis:colspec colnum="1" colname="col1" align="left"/>
     <oasis:colspec colnum="2" colname="col2" align="right"/>
     <oasis:colspec colnum="3" colname="col3" align="right"/>
     <oasis:colspec colnum="4" colname="col4" align="right"/>
     <oasis:thead>
       <oasis:row>
         <oasis:entry colname="col1">Structural</oasis:entry>
         <oasis:entry colname="col2">Initial</oasis:entry>
         <oasis:entry colname="col3"/>
         <oasis:entry colname="col4"/>
       </oasis:row>
       <oasis:row rowsep="1">
         <oasis:entry colname="col1">parameter</oasis:entry>
         <oasis:entry colname="col2">baseline</oasis:entry>
         <oasis:entry colname="col3">NSGA-II</oasis:entry>
         <oasis:entry colname="col4">NSGA-III</oasis:entry>
       </oasis:row>
     </oasis:thead>
     <oasis:tbody>
       <oasis:row>
         <oasis:entry colname="col1"><inline-formula><mml:math id="M249" display="inline"><mml:mrow><mml:msub><mml:mi>R</mml:mi><mml:mi>B</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> (mm)</oasis:entry>
         <oasis:entry colname="col2">2500</oasis:entry>
         <oasis:entry colname="col3">2083</oasis:entry>
         <oasis:entry colname="col4">3060</oasis:entry>
       </oasis:row>
       <oasis:row>
         <oasis:entry colname="col1"><inline-formula><mml:math id="M250" display="inline"><mml:mrow><mml:msub><mml:mi>R</mml:mi><mml:mi>A</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> (mm)</oasis:entry>
         <oasis:entry colname="col2">3500</oasis:entry>
         <oasis:entry colname="col3">3011</oasis:entry>
         <oasis:entry colname="col4">3881</oasis:entry>
       </oasis:row>
       <oasis:row>
         <oasis:entry colname="col1"><inline-formula><mml:math id="M251" display="inline"><mml:mi mathvariant="italic">α</mml:mi></mml:math></inline-formula> (°)</oasis:entry>
         <oasis:entry colname="col2">20</oasis:entry>
         <oasis:entry colname="col3">10.65</oasis:entry>
         <oasis:entry colname="col4">19.82</oasis:entry>
       </oasis:row>
       <oasis:row>
         <oasis:entry colname="col1"><inline-formula><mml:math id="M252" display="inline"><mml:mi mathvariant="italic">β</mml:mi></mml:math></inline-formula> (°)</oasis:entry>
         <oasis:entry colname="col2">20</oasis:entry>
         <oasis:entry colname="col3">10.99</oasis:entry>
         <oasis:entry colname="col4">19.04</oasis:entry>
       </oasis:row>
       <oasis:row>
         <oasis:entry colname="col1"><inline-formula><mml:math id="M253" display="inline"><mml:mi>H</mml:mi></mml:math></inline-formula> (mm)</oasis:entry>
         <oasis:entry colname="col2">5000</oasis:entry>
         <oasis:entry colname="col3">5781</oasis:entry>
         <oasis:entry colname="col4">5291</oasis:entry>
       </oasis:row>
     </oasis:tbody>
   </oasis:tgroup></oasis:table></table-wrap>

      <p id="d2e6312">Through comparison, it is evident that the improved NSGA-III algorithm benefits from the introduction of a dynamic penalty mechanism for physical interference. Its optimal scheme not only reasonably expands the base support span of the platform – with <inline-formula><mml:math id="M254" display="inline"><mml:mrow><mml:msub><mml:mi>R</mml:mi><mml:mi>A</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> increasing to 3881 mm and <inline-formula><mml:math id="M255" display="inline"><mml:mrow><mml:msub><mml:mi>R</mml:mi><mml:mi>B</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> increasing to 3060 mm, coupled with a height of 5291 mm to enhance overall stiffness and force performance – but also stably maintains <inline-formula><mml:math id="M256" display="inline"><mml:mi mathvariant="italic">α</mml:mi></mml:math></inline-formula> and <inline-formula><mml:math id="M257" display="inline"><mml:mi mathvariant="italic">β</mml:mi></mml:math></inline-formula> at 19.82 and 19.04°. This result closely aligns with the initial design of 20°, ensuring a safe installation clearance for the hinges. The comparison of the four optimization metrics between NSGA-II and NSGA-III is presented in Table 4.</p>

<table-wrap id="T4"><label>Table 4</label><caption><p id="d2e6354">Comparison of optimization metrics before and after optimization.</p></caption><oasis:table frame="topbot"><oasis:tgroup cols="4">
     <oasis:colspec colnum="1" colname="col1" align="left"/>
     <oasis:colspec colnum="2" colname="col2" align="right"/>
     <oasis:colspec colnum="3" colname="col3" align="right"/>
     <oasis:colspec colnum="4" colname="col4" align="right"/>
     <oasis:thead>
       <oasis:row>
         <oasis:entry colname="col1">Optimization</oasis:entry>
         <oasis:entry colname="col2">Initial</oasis:entry>
         <oasis:entry colname="col3"/>
         <oasis:entry colname="col4"/>
       </oasis:row>
       <oasis:row rowsep="1">
         <oasis:entry colname="col1">metric</oasis:entry>
         <oasis:entry colname="col2">baseline</oasis:entry>
         <oasis:entry colname="col3">NSGA-II</oasis:entry>
         <oasis:entry colname="col4">NSGA-III</oasis:entry>
       </oasis:row>
     </oasis:thead>
     <oasis:tbody>
       <oasis:row>
         <oasis:entry colname="col1"><inline-formula><mml:math id="M258" display="inline"><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mn mathvariant="normal">1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> (mm)</oasis:entry>
         <oasis:entry colname="col2">3601</oasis:entry>
         <oasis:entry colname="col3">3692</oasis:entry>
         <oasis:entry colname="col4">3567</oasis:entry>
       </oasis:row>
       <oasis:row>
         <oasis:entry colname="col1"><inline-formula><mml:math id="M259" display="inline"><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mn mathvariant="normal">2</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> (kN)</oasis:entry>
         <oasis:entry colname="col2">103.11</oasis:entry>
         <oasis:entry colname="col3">98.24</oasis:entry>
         <oasis:entry colname="col4">90.97</oasis:entry>
       </oasis:row>
       <oasis:row>
         <oasis:entry colname="col1"><inline-formula><mml:math id="M260" display="inline"><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mn mathvariant="normal">3</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula></oasis:entry>
         <oasis:entry colname="col2">0.3776</oasis:entry>
         <oasis:entry colname="col3">0.4372</oasis:entry>
         <oasis:entry colname="col4">0.4460</oasis:entry>
       </oasis:row>
       <oasis:row>
         <oasis:entry colname="col1"><inline-formula><mml:math id="M261" display="inline"><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mn mathvariant="normal">4</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula></oasis:entry>
         <oasis:entry colname="col2">15.31</oasis:entry>
         <oasis:entry colname="col3">11.14</oasis:entry>
         <oasis:entry colname="col4">14.26</oasis:entry>
       </oasis:row>
     </oasis:tbody>
   </oasis:tgroup></oasis:table></table-wrap>

      <p id="d2e6504">Table 4 indicates that the comprehensive performance of the improved NSGA-III is superior to that of NSGA-II. By relying on mechanisms such as dynamic normalization to escape local optima, it successfully reduces the peak driving force to 90.97 kN, increases the dexterity to 0.4460, and optimizes the actuation stroke to 3567 mm. Although its condition number of 14.26 superficially appears to be inferior to the 11.14 of the latter, this is actually the optimal solution derived from a multi-dimensional trade-off after strictly avoiding the boundaries of mechanical interference and introducing the penalty mechanism, rather than a degradation in performance.</p>
</sec>
<sec id="Ch1.S5.SS4">
  <label>5.4</label><title>Prototype development and physical validation</title>
      <p id="d2e6515">A proof-of-concept prototype of the wave compensation parallel platform was developed. This prototype employs DC linear actuators as the underlying actuation units, and its core geometric parameters are designed as follows: the radius of the upper platform hinge point circle <inline-formula><mml:math id="M262" display="inline"><mml:mrow><mml:msub><mml:mi>R</mml:mi><mml:mi>B</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> is 180 mm, the radius of the lower platform hinge point circle <inline-formula><mml:math id="M263" display="inline"><mml:mrow><mml:msub><mml:mi>R</mml:mi><mml:mi>A</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> is 260 mm, and the initial neutral posture height <inline-formula><mml:math id="M264" display="inline"><mml:mi>H</mml:mi></mml:math></inline-formula> is 370 mm. According to the optimization results, the angles between the hinge points of the upper and lower platforms, <inline-formula><mml:math id="M265" display="inline"><mml:mi mathvariant="italic">α</mml:mi></mml:math></inline-formula>and <inline-formula><mml:math id="M266" display="inline"><mml:mi mathvariant="italic">β</mml:mi></mml:math></inline-formula>, are 19.82 and 19.04°, respectively. Based on this prototype, dynamic tests of extreme postures were conducted. The upper platform executed roll-and-pitch extreme posture commands with an amplitude of <inline-formula><mml:math id="M267" display="inline"><mml:mrow><mml:mo>±</mml:mo><mml:mn mathvariant="normal">15</mml:mn></mml:mrow></mml:math></inline-formula>°, respectively, as shown in Fig. 13.</p>

      <fig id="F13"><label>Figure 13</label><caption><p id="d2e6574">Motion experiment of the prototype. <bold>(a)</bold> Roll 15°. <bold>(b)</bold> Roll <inline-formula><mml:math id="M268" display="inline"><mml:mrow><mml:mo>-</mml:mo><mml:mn mathvariant="normal">15</mml:mn></mml:mrow></mml:math></inline-formula>°. <bold>(c) </bold>Pitch 15°. <bold>(d)</bold> Pitch <inline-formula><mml:math id="M269" display="inline"><mml:mrow><mml:mo>-</mml:mo><mml:mn mathvariant="normal">15</mml:mn></mml:mrow></mml:math></inline-formula>°.</p></caption>
          <graphic xlink:href="https://ms.copernicus.org/articles/17/783/2026/ms-17-783-2026-f13.jpg"/>

        </fig>

      <p id="d2e6616">To comprehensively evaluate the reliability of the optimized configuration, the extreme posture experiment was consecutively repeated 50 times. Furthermore, a quantitative comparison between the optimized theoretical results and the physical experimental data was performed. The measurement results indicated that the relative error between the theoretical target angles and the actual executed angles of the prototype remained strictly within 1 % across all test cycles. The experimental results demonstrate that the six straight legs of the platform operate smoothly throughout the 50 consecutive cycles, with no physical collisions or interference occurring between the kinematic pairs and the connecting links.</p>
</sec>
</sec>
<sec id="Ch1.S6" sec-type="conclusions">
  <label>6</label><title>Conclusions</title>
      <p id="d2e6628">This paper employs an ANN surrogate model to characterize the complex mapping relationships between topological parameters and physical performance metrics. A multi-objective optimization mathematical model linking structural dimensions to the kinematic and dynamic performance of a heavy-duty parallel platform is established. The optimal structural configuration is determined using an improved NSGA-III algorithm combined with the TOPSIS method, thereby providing an efficient and feasible engineering solution for the prototype development of wave compensation equipment. Key conclusions are as follows: <list list-type="order"><list-item>
      <p id="d2e6633">To address the multi-parameter coupling and complex solving issues in the optimal design of the heavy-load compensation parallel platform, an artificial neural network is introduced to construct an explicit surrogate model, achieving an order-of-magnitude leap in computational efficiency. By employing an improved NSGA-III algorithm enhanced with a reference point mechanism and an interference penalty strategy, the drawbacks of solution set crowding and pseudo-optimal solutions involving mechanical interference are successfully overcome. Quantitative comparisons reveal that the SP and HV metrics of the improved algorithm are enhanced by 37.4 % and 26.2 %, respectively, compared to those of NSGA-II.</p></list-item><list-item>
      <p id="d2e6637">The analysis indicates that the upper platform radius <inline-formula><mml:math id="M270" display="inline"><mml:mrow><mml:msub><mml:mi>R</mml:mi><mml:mi>B</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> and the initial height <inline-formula><mml:math id="M271" display="inline"><mml:mi>H</mml:mi></mml:math></inline-formula> are the core characteristic parameters dictating the comprehensive performance of the system. Specifically, <inline-formula><mml:math id="M272" display="inline"><mml:mi>H</mml:mi></mml:math></inline-formula> directly dominates the actuation stroke and the static spatial envelope. Meanwhile, appropriately increasing <inline-formula><mml:math id="M273" display="inline"><mml:mrow><mml:msub><mml:mi>R</mml:mi><mml:mi>B</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> can significantly optimize the force mapping to reduce peak loads and substantially boost motion transmission efficiency. Prioritizing the regulation of these two parameters serves as a key strategy for achieving an optimal trade-off among structural compactness, low actuation power consumption, and high dexterity in the heavy-load compensation parallel platform.</p></list-item><list-item>
      <p id="d2e6677">Utilizing the TOPSIS method, the global optimal configuration is successfully identified. Compared to the initial baseline, the optimal scheme achieves an 18.12 % increase in dexterity, an 11.78 % reduction in peak driving force, and a 6.85 % optimization in the condition number, all while reducing the actuation stroke by 0.92 %. This result effectively reconciles the conflicts among multiple physical metrics of the heavy-load compensation parallel platform, realizing Pareto improvements and global synergy in the comprehensive system performance. This research provides a reliable design benchmark for the prototype development of wave compensation equipment.</p></list-item></list></p>
</sec>
<sec id="Ch1.S7">
  <label>7</label><title>Limitations and future works</title>
      <p id="d2e6688">Although the proposed multi-objective optimization method successfully improves the topological parameters of the heavy-duty parallel platform, this study still has certain limitations. The current dynamic evaluation primarily relies on rigid-body assumptions. For a 20 t class wave compensation system, the structural flexibility and elastic deformation of the mechanism under extreme dynamic loads have not been fully captured, which may affect the ultimate compensation precision slightly. Furthermore, this optimization focuses on the structural configuration independent of the control strategy. Therefore, future research will focus on developing a multibody dynamics model to investigate the impact of structural deformation and further exploring control structure co-design to evaluate the platform's real-time dynamic tracking performance under actual stochastic wave spectrum disturbances.</p>
</sec>

      
      </body>
    <back><notes notes-type="dataavailability"><title>Data availability</title>

      <p id="d2e6695">No data sets were used in this article.</p>
  </notes><notes notes-type="authorcontribution"><title>Author contributions</title>

      <p id="d2e6701">Methodology: T. Z. H.; software: R. J. L.; investigation: L. F. M. and J. W.; writing (original draft preparation): G. X. Z.; writing (review and editing): F. Z. All of the authors have read and agreed to the published version of the paper.</p>
  </notes><notes notes-type="competinginterests"><title>Competing interests</title>

      <p id="d2e6707">The contact author has declared that none of the authors has any competing interests.</p>
  </notes><notes notes-type="disclaimer"><title>Disclaimer</title>

      <p id="d2e6713">Publisher's note: Copernicus Publications remains neutral with regard to jurisdictional claims made in the text, published maps, institutional affiliations, or any other geographical representation in this paper. The authors bear the ultimate responsibility for providing appropriate place names. Views expressed in the text are those of the authors and do not necessarily reflect the views of the publisher.</p>
  </notes><notes notes-type="financialsupport"><title>Financial support</title>

      <p id="d2e6719">This research was funded by the Special Innovation Fund Project for University Cooperation of Shanghai Marine Equipment Research Institute (GX-Self-funded-Research-Institute-25Z008), the Natural Science Foundation of the Jiangsu Higher Education Institutions of China (grant no. 23KJB460010), the Science and Technology Plan Project of Wenzhou Municipality (grant no. G20240076), and the Zhejiang College of Security Technology School-Level Key Project (grant no. AF2025Z05).</p>
  </notes><notes notes-type="reviewstatement"><title>Review statement</title>

      <p id="d2e6726">This paper was edited by Pengyuan Zhao and reviewed by Thanh-Phong Dao and one anonymous referee.</p>
  </notes><ref-list>
    <title>References</title>

      <ref id="bib1.bib1"><label>1</label><mixed-citation>Abdur, R., Bashar, E., and Anas, A.: Genetic and hybrid algorithms for optimization of non-singular 3PRR planar parallel kinematics mechanism for machining application, Robotica, 36, 839–864, <ext-link xlink:href="https://doi.org/10.1017/S0263574718000152" ext-link-type="DOI">10.1017/S0263574718000152</ext-link>, 2018.</mixed-citation></ref>
      <ref id="bib1.bib2"><label>2</label><mixed-citation>Bhosekar, A. and Ierapetritou, M.: Advances in surrogate based modeling, feasibility analysis, and optimization: A review, Comput. Chem. Eng., 108, 250–267, <ext-link xlink:href="https://doi.org/10.1016/j.compchemeng.2017.09.017" ext-link-type="DOI">10.1016/j.compchemeng.2017.09.017</ext-link>, 2018.</mixed-citation></ref>
      <ref id="bib1.bib3"><label>3</label><mixed-citation>Briot, S.  and Khalil, W.: Dynamics of parallel robots: From rigid bodies to flexible elements, Springer, <ext-link xlink:href="https://doi.org/10.1007/978-3-319-19788-3" ext-link-type="DOI">10.1007/978-3-319-19788-3</ext-link>, 2015.</mixed-citation></ref>
      <ref id="bib1.bib4"><label>4</label><mixed-citation>Chen, W., Wen, Y., Tong, X., Lin, C., Li, Jiang., Wang, S., Xie, W., Mao, L., Zhao, X., Zhang, W., and Gao, F.: Dynamics modeling and modal space control strategy of ship-borne Stewart platform for wave compensation, J. Mech. Robot., 15,  041015, <ext-link xlink:href="https://doi.org/10.1115/1.4062177" ext-link-type="DOI">10.1115/1.4062177</ext-link>, 2023.</mixed-citation></ref>
      <ref id="bib1.bib5"><label>5</label><mixed-citation>Chugh, T., Sindhya, K., Hakanen, J., and Miettinen, K.: A survey on handling computationally expensive multiobjective optimization problems with evolutionary algorithms, Soft Comput., 23, 3137–3166, <ext-link xlink:href="https://doi.org/10.1007/s00500-017-2965-0" ext-link-type="DOI">10.1007/s00500-017-2965-0</ext-link>, 2017.</mixed-citation></ref>
      <ref id="bib1.bib6"><label>6</label><mixed-citation>Dasgupta, B.  and Mruthyunjaya, T.: The Stewart platform manipulator: A review, Mech. Mach. Theory, 35, 15–40, <ext-link xlink:href="https://doi.org/10.1016/S0094-114X(99)00006-3" ext-link-type="DOI">10.1016/S0094-114X(99)00006-3</ext-link>, 2000.</mixed-citation></ref>
      <ref id="bib1.bib7"><label>7</label><mixed-citation>Deb, K.  and Jain, H.: An evolutionary many-objective optimization algorithm using reference-point-based nondominated sorting approach, part I: Solving problems with box constraints, IEEE Trans. Evol. Comput., 18, 577–601, <ext-link xlink:href="https://doi.org/10.1109/TEVC.2013.2281535" ext-link-type="DOI">10.1109/TEVC.2013.2281535</ext-link>, 2013.</mixed-citation></ref>
      <ref id="bib1.bib8"><label>8</label><mixed-citation>Deb, K., Pratap, A., Agarwal, S., and Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: NSGA-II, IEEE Trans. Evol. Comput., 6, 182–197, <ext-link xlink:href="https://doi.org/10.1109/4235.996017" ext-link-type="DOI">10.1109/4235.996017</ext-link>, 2002.</mixed-citation></ref>
      <ref id="bib1.bib9"><label>9</label><mixed-citation>Fallahiarezoodar, N.  and Zhu, Z. H.: Review of autonomous space robotic manipulators for on-orbit servicing and active debris removal, Space Sci. Technol., 5, 0291, <ext-link xlink:href="https://doi.org/10.34133/space.0291" ext-link-type="DOI">10.34133/space.0291</ext-link>, 2025.</mixed-citation></ref>
      <ref id="bib1.bib10"><label>10</label><mixed-citation>Gao, Z., Zhang, D., and Ge, Y.: Design optimization of a spatial six degree-of-freedom parallel manipulator based on artificial intelligence approaches, Rob. Comput.-Integr. Manuf., 26, 180–189, <ext-link xlink:href="https://doi.org/10.1016/j.rcim.2009.07.002" ext-link-type="DOI">10.1016/j.rcim.2009.07.002</ext-link>, 2010.</mixed-citation></ref>
      <ref id="bib1.bib11"><label>11</label><mixed-citation>Gosselin, C. and Angeles, J.: A global performance index for the kinematic optimization of robotic manipulators, J. Mech. Des., 113, 220–226, <ext-link xlink:href="https://doi.org/10.1115/1.2912772" ext-link-type="DOI">10.1115/1.2912772</ext-link>, 1991.</mixed-citation></ref>
      <ref id="bib1.bib12"><label>12</label><mixed-citation>Grewal, K. S., Dixon, R., and Pearson, J.: LQG controller design applied to a pneumatic Stewart-Gough platform, Int. J. Autom. Comput., 9, 45–53, <ext-link xlink:href="https://doi.org/10.1007/s11633-012-0615-7" ext-link-type="DOI">10.1007/s11633-012-0615-7</ext-link>, 2012.</mixed-citation></ref>
      <ref id="bib1.bib13"><label>13</label><mixed-citation>Guo, J., Zhao, Y., Zhang, G., Liu, E., Liu, B., and Xu, Y.: Configuration synthesis and unfolding stiffness characteristics analysis of a truss antenna connecting mechanism based on URU-RR-URU hexagonal deployable unit, Mech. Mach. Theory., 177, 105047, <ext-link xlink:href="https://doi.org/10.1016/j.mechmachtheory.2022.105047" ext-link-type="DOI">10.1016/j.mechmachtheory.2022.105047</ext-link>, 2022a.</mixed-citation></ref>
      <ref id="bib1.bib14"><label>14</label><mixed-citation>Guo, J., Zhao, Y., Xu, Y., Zhang, G.: Mechanics analysis and structural design of a truss deployable antenna mechanism based on 3RR-3URU tetrahedral unit, Mech. Mach. Theory., 171, 104749, <ext-link xlink:href="https://doi.org/10.1016/j.mechmachtheory.2022.104749" ext-link-type="DOI">10.1016/j.mechmachtheory.2022.104749</ext-link>, 2022b.</mixed-citation></ref>
      <ref id="bib1.bib15"><label>15</label><mixed-citation>Holland, J.: Genetic algorithms, Sci. Am., 267, 66–73, <ext-link xlink:href="https://doi.org/10.1038/scientificamerican0792-66" ext-link-type="DOI">10.1038/scientificamerican0792-66</ext-link>, 1992.</mixed-citation></ref>
      <ref id="bib1.bib16"><label>16</label><mixed-citation>Hornik, K., Stinchcombe, M., and White, H.: Multilayer feedforward networks are universal approximators, Neural Netw., 2, 359–366, <ext-link xlink:href="https://doi.org/10.1016/0893-6080(89)90020-8" ext-link-type="DOI">10.1016/0893-6080(89)90020-8</ext-link>, 1989.</mixed-citation></ref>
      <ref id="bib1.bib17"><label>17</label><mixed-citation>Hsu, K.  and Chung, C.: Singularity analysis and modular synthesis of over-constrained spatial mechanisms-A case study on Bennett and RPRP linkage, Mech. Mach. Theory, 189, 105424, <ext-link xlink:href="https://doi.org/10.1016/j.mechmachtheory.2023.105424" ext-link-type="DOI">10.1016/j.mechmachtheory.2023.105424</ext-link>, 2023.</mixed-citation></ref>
      <ref id="bib1.bib18"><label>18</label><mixed-citation>Hwang, C. L.  and Yoon, K.: Multiple attribute decision making: Methods and applications a state-of-the-art survey, Springer, <ext-link xlink:href="https://doi.org/10.1007/978-3-642-48318-9" ext-link-type="DOI">10.1007/978-3-642-48318-9</ext-link>, 2012.</mixed-citation></ref>
      <ref id="bib1.bib19"><label>19</label><mixed-citation>Ishibuchi, H., Setoguchi, Y., Masuda, H., and Nojima, Y.: Performance of decomposition-based many-objective algorithms strongly depends on Pareto front shapes, IEEE Trans. Evol. Comput., 21, 169–190, <ext-link xlink:href="https://doi.org/10.1109/TEVC.2016.2587749" ext-link-type="DOI">10.1109/TEVC.2016.2587749</ext-link>, 2016.</mixed-citation></ref>
      <ref id="bib1.bib20"><label>20</label><mixed-citation>Jin, Y.: Surrogate-assisted evolutionary computation: Recent advances and future challenges, Swarm Evol. Comput., 1, 61–70, <ext-link xlink:href="https://doi.org/10.1016/j.swevo.2011.05.001" ext-link-type="DOI">10.1016/j.swevo.2011.05.001</ext-link>, 2011.</mixed-citation></ref>
      <ref id="bib1.bib21"><label>21</label><mixed-citation>Karaboga, D. and Basturk, B.: A powerful and efficient algorithm for numerical function optimization: Artificial bee colony (ABC) algorithm, J. Glob. Optim., 39, 459–471, <ext-link xlink:href="https://doi.org/10.1007/s10898-007-9149-x" ext-link-type="DOI">10.1007/s10898-007-9149-x</ext-link>, 2007.</mixed-citation></ref>
      <ref id="bib1.bib22"><label>22</label><mixed-citation>Li, D., Wang, S., Song, X., Zheng, Z., Tao, W., and Che, J.: A bp-neural-network-based pid control algorithm of shipborne Stewart platform for wave compensation, J. Mar. Sci. Eng., 12, 2160, <ext-link xlink:href="https://doi.org/10.3390/jmse12122160" ext-link-type="DOI">10.3390/jmse12122160</ext-link>, 2024.</mixed-citation></ref>
      <ref id="bib1.bib23"><label>23</label><mixed-citation>Liang, L., Le, Z., Zhang, S., and Li, J.: Modeling and controller design of an active motion compensated gangway based on inverse dynamics in joint space, Ocean Eng., 197, 106864, <ext-link xlink:href="https://doi.org/10.1016/j.oceaneng.2019.106864" ext-link-type="DOI">10.1016/j.oceaneng.2019.106864</ext-link>, 2020.</mixed-citation></ref>
      <ref id="bib1.bib24"><label>24</label><mixed-citation>Liu, G.: Optimal kinematic design of a 6-UCU kind Gough-Stewart platform with a guaranteed given accuracy, Robotics, 7, 30, <ext-link xlink:href="https://doi.org/10.3390/robotics7020030" ext-link-type="DOI">10.3390/robotics7020030</ext-link>, 2018.</mixed-citation></ref>
      <ref id="bib1.bib25"><label>25</label><mixed-citation>Marler, R.  and Arora, J.: The weighted sum method for multi-objective optimization: new insights, Struct. Multidiscip. Optim., 41, 853–862, <ext-link xlink:href="https://doi.org/10.1007/s00158-009-0460-7" ext-link-type="DOI">10.1007/s00158-009-0460-7</ext-link>, 2010.</mixed-citation></ref>
      <ref id="bib1.bib26"><label>26</label><mixed-citation>Mu, H., Zhou, T., Li, B., and Liu, K.: Simulation and experimental study of vessel-borne active motion compensated gangway for offshore wind operation and maintenance, J. Mar. Sci. Eng., 14, 187, <ext-link xlink:href="https://doi.org/10.3390/jmse14020187" ext-link-type="DOI">10.3390/jmse14020187</ext-link>, 2026.</mixed-citation></ref>
      <ref id="bib1.bib27"><label>27</label><mixed-citation>Niu, A., Wang, S., Sun, Y., Qiu, J., Qiu, W., and Chen, H.: Dynamic modeling and analysis of a novel offshore gangway with 3UPU/UP-RRP series-parallel hybrid structure, Ocean Eng., 266, 113122, <ext-link xlink:href="https://doi.org/10.1016/j.oceaneng.2022.113122" ext-link-type="DOI">10.1016/j.oceaneng.2022.113122</ext-link>, 2022.</mixed-citation></ref>
      <ref id="bib1.bib28"><label>28</label><mixed-citation>Poli, R., Kennedy, J., and Blackwell, T.: Particle swarm optimization: An overview,  Swarm Intell., 1, 33–57, <ext-link xlink:href="https://doi.org/10.1007/s11721-007-0002-0" ext-link-type="DOI">10.1007/s11721-007-0002-0</ext-link>, 2007.</mixed-citation></ref>
      <ref id="bib1.bib29"><label>29</label><mixed-citation>Pu, H., Cheng, H., Wang, G., Ma, J., Zhao, J., Bai, R., Luo, J., and Yi, J.: Dexterous workspace optimization for a six degree-of-freedom parallel manipulator based on surrogate-assisted constrained differential evolution, Appl. Soft Comput., 139, 110228, <ext-link xlink:href="https://doi.org/10.1016/j.asoc.2023.110228" ext-link-type="DOI">10.1016/j.asoc.2023.110228</ext-link>, 2023.</mixed-citation></ref>
      <ref id="bib1.bib30"><label>30</label><mixed-citation>Purshouse, R.  and Fleming, P.: On the evolutionary optimization of many conflicting objectives, IEEE Trans. Evol. Comput., 11, 770–784, <ext-link xlink:href="https://doi.org/10.1109/TEVC.2007.910138" ext-link-type="DOI">10.1109/TEVC.2007.910138</ext-link>, 2007.</mixed-citation></ref>
      <ref id="bib1.bib31"><label>31</label><mixed-citation>Qiang, H., Wang, L., Ding, J., and Zhang, L.: Multiobjective optimization of 6-DOF parallel manipulator for desired total orientation workspace, Math. Probl. Eng., 2019, 5353825, <ext-link xlink:href="https://doi.org/10.1155/2019/5353825" ext-link-type="DOI">10.1155/2019/5353825</ext-link>, 2019.</mixed-citation></ref>
      <ref id="bib1.bib32"><label>32</label><mixed-citation>Richter, M., Schaut, S., Walser, D., Schneider, K., and Sawodny, O.: Experimental validation of an active heave compensation system: Estimation, prediction and control, Control Eng. Pract., 66, 1–12, <ext-link xlink:href="https://doi.org/10.1016/j.conengprac.2017.06.005" ext-link-type="DOI">10.1016/j.conengprac.2017.06.005</ext-link>, 2017.</mixed-citation></ref>
      <ref id="bib1.bib33"><label>33</label><mixed-citation>Shahbazi, M., Heidari, M., and Ahmadzadeh, M.: Optimization of dynamic parameter design of Stewart platform with Particle Swarm Optimization (PSO) algorithm, Adv. Mech. Eng., 16, 16878132241263940, <ext-link xlink:href="https://doi.org/10.1177/16878132241263940" ext-link-type="DOI">10.1177/16878132241263940</ext-link>, 2024.</mixed-citation></ref>
      <ref id="bib1.bib34"><label>34</label><mixed-citation>Shih, H., Shyur, H., and Lee, E.: An extension of TOPSIS for group decision making, Math. Comput. Model., 45, 801–813, <ext-link xlink:href="https://doi.org/10.1016/j.mcm.2006.03.023" ext-link-type="DOI">10.1016/j.mcm.2006.03.023</ext-link>, 2007.</mixed-citation></ref>
      <ref id="bib1.bib35"><label>35</label><mixed-citation>Stewart, D.: A platform with six degrees of freedom, Proc. Inst. Mech. Eng., 180, 371–386, <ext-link xlink:href="https://doi.org/10.1243/PIME_PROC_1965_180_029_02" ext-link-type="DOI">10.1243/PIME_PROC_1965_180_029_02</ext-link>, 1965.</mixed-citation></ref>
      <ref id="bib1.bib36"><label>36</label><mixed-citation>Storn, R.  and Price, K.: Differential evolution–a simple and efficient heuristic for global optimization over continuous spaces, J. Glob. Optim., 11, 341–359, <ext-link xlink:href="https://doi.org/10.1023/A:1008202821328" ext-link-type="DOI">10.1023/A:1008202821328</ext-link>, 1997.</mixed-citation></ref>
      <ref id="bib1.bib37"><label>37</label><mixed-citation>Tang, G., Lei, J., Li, F., Zhu, W., Xu, X., Yao, B., Claramunt, C., and Hu, X.: A modified 6-DOF hybrid serial–parallel platform for ship wave compensation, Ocean Eng., 280, 114336, <ext-link xlink:href="https://doi.org/10.1016/j.oceaneng.2023.114336" ext-link-type="DOI">10.1016/j.oceaneng.2023.114336</ext-link>, 2023.</mixed-citation></ref>
      <ref id="bib1.bib38"><label>38</label><mixed-citation>Tao, J., Xu, Y., Chen, Y., Cheng, P., Zhang, H., Wang, J., and Zhou, H.: Multi-objective structural parameter optimization for Stewart platform via NSGA-III and Kolmogorov-Arnold network, Machines, 1, 887, <ext-link xlink:href="https://doi.org/10.3390/machines13100887" ext-link-type="DOI">10.3390/machines13100887</ext-link>, 2025.</mixed-citation></ref>
      <ref id="bib1.bib39"><label>39</label><mixed-citation>Wang, D., Wang, Z., Zhao, S., Wu, N., Feng, R., and Wu, Z.: Stiffness design method of Gyroid functionally graded lattice structures based on variable porosity controlled by load path, Compos. Struct., 377, 119794, <ext-link xlink:href="https://doi.org/10.1016/j.compstruct.2025.119794" ext-link-type="DOI">10.1016/j.compstruct.2025.119794</ext-link>, 2026.</mixed-citation></ref>
      <ref id="bib1.bib40"><label>40</label><mixed-citation>Wang, H., Zhang, L., Chen, G., and Huang, S.: Parameter optimization of heavy-load parallel manipulator by introducing stiffness distribution evaluation index, Mech. Mach. Theory, 108, 244–259, <ext-link xlink:href="https://doi.org/10.1016/j.mechmachtheory.2016.10.011" ext-link-type="DOI">10.1016/j.mechmachtheory.2016.10.011</ext-link>, 2017.</mixed-citation></ref>
      <ref id="bib1.bib41"><label>41</label><mixed-citation>Wang, W., Ning, Y., Zhang, Y., Xu, P., and Li, B.: Linear active disturbance rejection control with linear quadratic regulator for Stewart platform in active wave compensation system, Appl. Ocean. Res., <ext-link xlink:href="https://doi.org/10.1016/j.apor.2025.104469" ext-link-type="DOI">10.1016/j.apor.2025.104469</ext-link>, 2025. </mixed-citation></ref>
      <ref id="bib1.bib42"><label>42</label><mixed-citation>Wang, Z., Wang, C., Wu, F., Liu, Z., Liu, L., and Wang, D.: Design method of Gyroid lattice structure based on the load paths direction and capacity, Addit. Manuf., 97, 104586, <ext-link xlink:href="https://doi.org/10.1016/j.addma.2024.104586" ext-link-type="DOI">10.1016/j.addma.2024.104586</ext-link>, 2025.</mixed-citation></ref>
      <ref id="bib1.bib43"><label>43</label><mixed-citation>Yin, L., Qiao, D., Li, B., Liang, H., Yan, J., Tang, G., and Qu, J.: Modeling and controller design of an offshore wind service operation vessel with parallel active motion compensated gangway, Ocean Eng., 266, 112999, <ext-link xlink:href="https://doi.org/10.1016/j.oceaneng.2022.112999" ext-link-type="DOI">10.1016/j.oceaneng.2022.112999</ext-link>, 2022.</mixed-citation></ref>
      <ref id="bib1.bib44"><label>44</label><mixed-citation>Yu, H., Lv, M., Hu, B., Zhang, Y., and Zhao, P.: A review of control technologies for soft robots: From structural design to intelligent control, Mech. Sci., 17, 313–332, <ext-link xlink:href="https://doi.org/10.5194/ms-17-313-2026" ext-link-type="DOI">10.5194/ms-17-313-2026</ext-link>, 2026.</mixed-citation></ref>
      <ref id="bib1.bib45"><label>45</label><mixed-citation>Zhang, L., Chen, J., Xiong, F., Ren, C., and Li, C.: Meta-learning based multi-fidelity deep neural networks metamodel method, J. Mech. Eng., 58, 190–200, <ext-link xlink:href="https://doi.org/10.3901/JME.2022.01.190" ext-link-type="DOI">10.3901/JME.2022.01.190</ext-link>, 2022a.</mixed-citation></ref>
      <ref id="bib1.bib46"><label>46</label><mixed-citation>Zhang, G., He, J., Guo, J., and Xia, X.: Dynamic modeling and vibration characteristics analysis of parallel antenna, Mech. Sci., 13, 1019–1029, <ext-link xlink:href="https://doi.org/10.5194/ms-13-1019-2022" ext-link-type="DOI">10.5194/ms-13-1019-2022</ext-link>, 2022b.</mixed-citation></ref>
      <ref id="bib1.bib47"><label>47</label><mixed-citation>Zhang, G., Wang, J., Guo, J., Wang, J., Xu, Y., and Hu, F.: A novel surface division method and surface accuracy measurement for parabolic truss-type deployable antenna mechanism, Mech. Mach. Theory, 212, 106071, <ext-link xlink:href="https://doi.org/10.1016/j.mechmachtheory.2025.106071" ext-link-type="DOI">10.1016/j.mechmachtheory.2025.106071</ext-link>, 2025.</mixed-citation></ref>

  </ref-list></back>
    <!--<article-title-html>Optimal design and validation of a heavy-duty wave compensation parallel platform utilizing the NSGA-III algorithm</article-title-html>
<abstract-html/>
<ref-html id="bib1.bib1"><label>1</label><mixed-citation>
      
Abdur, R., Bashar, E., and Anas, A.: Genetic and hybrid algorithms for
optimization of non-singular 3PRR planar parallel kinematics mechanism for
machining application, Robotica, 36, 839–864,
<a href="https://doi.org/10.1017/S0263574718000152" target="_blank">https://doi.org/10.1017/S0263574718000152</a>, 2018.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib2"><label>2</label><mixed-citation>
      
Bhosekar, A. and Ierapetritou, M.: Advances in surrogate based modeling,
feasibility analysis, and optimization: A review, Comput. Chem. Eng., 108,
250–267, <a href="https://doi.org/10.1016/j.compchemeng.2017.09.017" target="_blank">https://doi.org/10.1016/j.compchemeng.2017.09.017</a>, 2018.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib3"><label>3</label><mixed-citation>
      
Briot, S.  and Khalil, W.: Dynamics of parallel robots: From rigid bodies to
flexible elements, Springer, <a href="https://doi.org/10.1007/978-3-319-19788-3" target="_blank">https://doi.org/10.1007/978-3-319-19788-3</a>,
2015.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib4"><label>4</label><mixed-citation>
      
Chen, W., Wen, Y., Tong, X., Lin, C., Li, Jiang., Wang, S., Xie, W., Mao,
L., Zhao, X., Zhang, W., and Gao, F.: Dynamics modeling and modal space
control strategy of ship-borne Stewart platform for wave compensation, J.
Mech. Robot., 15,  041015, <a href="https://doi.org/10.1115/1.4062177" target="_blank">https://doi.org/10.1115/1.4062177</a>, 2023.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib5"><label>5</label><mixed-citation>
      
Chugh, T., Sindhya, K., Hakanen, J., and Miettinen, K.: A survey on handling
computationally expensive multiobjective optimization problems with
evolutionary algorithms, Soft Comput., 23, 3137–3166,
<a href="https://doi.org/10.1007/s00500-017-2965-0" target="_blank">https://doi.org/10.1007/s00500-017-2965-0</a>, 2017.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib6"><label>6</label><mixed-citation>
      
Dasgupta, B.  and Mruthyunjaya, T.: The Stewart platform manipulator: A
review, Mech. Mach. Theory, 35, 15–40,
<a href="https://doi.org/10.1016/S0094-114X(99)00006-3" target="_blank">https://doi.org/10.1016/S0094-114X(99)00006-3</a>, 2000.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib7"><label>7</label><mixed-citation>
      
Deb, K.  and Jain, H.: An evolutionary many-objective optimization algorithm
using reference-point-based nondominated sorting approach, part I: Solving
problems with box constraints, IEEE Trans. Evol. Comput., 18, 577–601,
<a href="https://doi.org/10.1109/TEVC.2013.2281535" target="_blank">https://doi.org/10.1109/TEVC.2013.2281535</a>, 2013.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib8"><label>8</label><mixed-citation>
      
Deb, K., Pratap, A., Agarwal, S., and Meyarivan, T.: A fast and elitist
multiobjective genetic algorithm: NSGA-II, IEEE Trans. Evol. Comput., 6,
182–197, <a href="https://doi.org/10.1109/4235.996017" target="_blank">https://doi.org/10.1109/4235.996017</a>, 2002.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib9"><label>9</label><mixed-citation>
      
Fallahiarezoodar, N.  and Zhu, Z. H.: Review of autonomous space robotic
manipulators for on-orbit servicing and active debris removal, Space Sci.
Technol., 5, 0291, <a href="https://doi.org/10.34133/space.0291" target="_blank">https://doi.org/10.34133/space.0291</a>, 2025.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib10"><label>10</label><mixed-citation>
      
Gao, Z., Zhang, D., and Ge, Y.: Design optimization of a spatial six
degree-of-freedom parallel manipulator based on artificial intelligence
approaches, Rob. Comput.-Integr. Manuf., 26, 180–189,
<a href="https://doi.org/10.1016/j.rcim.2009.07.002" target="_blank">https://doi.org/10.1016/j.rcim.2009.07.002</a>, 2010.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib11"><label>11</label><mixed-citation>
      
Gosselin, C. and Angeles, J.: A global performance index for the kinematic
optimization of robotic manipulators, J. Mech. Des., 113, 220–226,
<a href="https://doi.org/10.1115/1.2912772" target="_blank">https://doi.org/10.1115/1.2912772</a>, 1991.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib12"><label>12</label><mixed-citation>
      
Grewal, K. S., Dixon, R., and Pearson, J.: LQG controller design applied to
a pneumatic Stewart-Gough platform, Int. J. Autom. Comput., 9, 45–53,
<a href="https://doi.org/10.1007/s11633-012-0615-7" target="_blank">https://doi.org/10.1007/s11633-012-0615-7</a>, 2012.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib13"><label>13</label><mixed-citation>
      
Guo, J., Zhao, Y., Zhang, G., Liu, E., Liu, B., and Xu, Y.: Configuration
synthesis and unfolding stiffness characteristics analysis of a truss
antenna connecting mechanism based on URU-RR-URU hexagonal deployable unit,
Mech. Mach. Theory., 177, 105047,
<a href="https://doi.org/10.1016/j.mechmachtheory.2022.105047" target="_blank">https://doi.org/10.1016/j.mechmachtheory.2022.105047</a>, 2022a.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib14"><label>14</label><mixed-citation>
      
Guo, J., Zhao, Y., Xu, Y., Zhang, G.: Mechanics analysis and structural
design of a truss deployable antenna mechanism based on 3RR-3URU tetrahedral
unit, Mech. Mach. Theory., 171, 104749,
<a href="https://doi.org/10.1016/j.mechmachtheory.2022.104749" target="_blank">https://doi.org/10.1016/j.mechmachtheory.2022.104749</a>, 2022b.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib15"><label>15</label><mixed-citation>
      
Holland, J.: Genetic algorithms, Sci. Am., 267, 66–73,
<a href="https://doi.org/10.1038/scientificamerican0792-66" target="_blank">https://doi.org/10.1038/scientificamerican0792-66</a>, 1992.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib16"><label>16</label><mixed-citation>
      
Hornik, K., Stinchcombe, M., and White, H.: Multilayer feedforward networks
are universal approximators, Neural Netw., 2, 359–366,
<a href="https://doi.org/10.1016/0893-6080(89)90020-8" target="_blank">https://doi.org/10.1016/0893-6080(89)90020-8</a>, 1989.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib17"><label>17</label><mixed-citation>
      
Hsu, K.  and Chung, C.: Singularity analysis and modular synthesis of
over-constrained spatial mechanisms-A case study on Bennett and RPRP
linkage, Mech. Mach. Theory, 189, 105424,
<a href="https://doi.org/10.1016/j.mechmachtheory.2023.105424" target="_blank">https://doi.org/10.1016/j.mechmachtheory.2023.105424</a>, 2023.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib18"><label>18</label><mixed-citation>
      
Hwang, C. L.  and Yoon, K.: Multiple attribute decision making: Methods and
applications a state-of-the-art survey, Springer,
<a href="https://doi.org/10.1007/978-3-642-48318-9" target="_blank">https://doi.org/10.1007/978-3-642-48318-9</a>, 2012.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib19"><label>19</label><mixed-citation>
      
Ishibuchi, H., Setoguchi, Y., Masuda, H., and Nojima, Y.: Performance of
decomposition-based many-objective algorithms strongly depends on Pareto
front shapes, IEEE Trans. Evol. Comput., 21, 169–190,
<a href="https://doi.org/10.1109/TEVC.2016.2587749" target="_blank">https://doi.org/10.1109/TEVC.2016.2587749</a>, 2016.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib20"><label>20</label><mixed-citation>
      
Jin, Y.: Surrogate-assisted evolutionary computation: Recent advances and
future challenges, Swarm Evol. Comput., 1, 61–70,
<a href="https://doi.org/10.1016/j.swevo.2011.05.001" target="_blank">https://doi.org/10.1016/j.swevo.2011.05.001</a>, 2011.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib21"><label>21</label><mixed-citation>
      
Karaboga, D. and Basturk, B.: A powerful and efficient algorithm for
numerical function optimization: Artificial bee colony (ABC) algorithm, J.
Glob. Optim., 39, 459–471, <a href="https://doi.org/10.1007/s10898-007-9149-x" target="_blank">https://doi.org/10.1007/s10898-007-9149-x</a>,
2007.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib22"><label>22</label><mixed-citation>
      
Li, D., Wang, S., Song, X., Zheng, Z., Tao, W., and Che, J.: A
bp-neural-network-based pid control algorithm of shipborne Stewart platform
for wave compensation, J. Mar. Sci. Eng., 12, 2160,
<a href="https://doi.org/10.3390/jmse12122160" target="_blank">https://doi.org/10.3390/jmse12122160</a>, 2024.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib23"><label>23</label><mixed-citation>
      
Liang, L., Le, Z., Zhang, S., and Li, J.: Modeling and controller design of
an active motion compensated gangway based on inverse dynamics in joint
space, Ocean Eng., 197, 106864,
<a href="https://doi.org/10.1016/j.oceaneng.2019.106864" target="_blank">https://doi.org/10.1016/j.oceaneng.2019.106864</a>, 2020.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib24"><label>24</label><mixed-citation>
      
Liu, G.: Optimal kinematic design of a 6-UCU kind Gough-Stewart platform
with a guaranteed given accuracy, Robotics, 7, 30,
<a href="https://doi.org/10.3390/robotics7020030" target="_blank">https://doi.org/10.3390/robotics7020030</a>, 2018.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib25"><label>25</label><mixed-citation>
      
Marler, R.  and Arora, J.: The weighted sum method for multi-objective
optimization: new insights, Struct. Multidiscip. Optim., 41, 853–862,
<a href="https://doi.org/10.1007/s00158-009-0460-7" target="_blank">https://doi.org/10.1007/s00158-009-0460-7</a>, 2010.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib26"><label>26</label><mixed-citation>
      
Mu, H., Zhou, T., Li, B., and Liu, K.: Simulation and experimental study of
vessel-borne active motion compensated gangway for offshore wind operation
and maintenance, J. Mar. Sci. Eng., 14, 187,
<a href="https://doi.org/10.3390/jmse14020187" target="_blank">https://doi.org/10.3390/jmse14020187</a>, 2026.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib27"><label>27</label><mixed-citation>
      
Niu, A., Wang, S., Sun, Y., Qiu, J., Qiu, W., and Chen, H.: Dynamic modeling
and analysis of a novel offshore gangway with 3UPU/UP-RRP series-parallel
hybrid structure, Ocean Eng., 266, 113122,
<a href="https://doi.org/10.1016/j.oceaneng.2022.113122" target="_blank">https://doi.org/10.1016/j.oceaneng.2022.113122</a>, 2022.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib28"><label>28</label><mixed-citation>
      
Poli, R., Kennedy, J., and Blackwell, T.: Particle swarm optimization: An
overview,  Swarm Intell., 1, 33–57,
<a href="https://doi.org/10.1007/s11721-007-0002-0" target="_blank">https://doi.org/10.1007/s11721-007-0002-0</a>, 2007.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib29"><label>29</label><mixed-citation>
      
Pu, H., Cheng, H., Wang, G., Ma, J., Zhao, J., Bai, R., Luo, J., and Yi, J.:
Dexterous workspace optimization for a six degree-of-freedom parallel
manipulator based on surrogate-assisted constrained differential evolution,
Appl. Soft Comput., 139, 110228, <a href="https://doi.org/10.1016/j.asoc.2023.110228" target="_blank">https://doi.org/10.1016/j.asoc.2023.110228</a>,
2023.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib30"><label>30</label><mixed-citation>
      
Purshouse, R.  and Fleming, P.: On the evolutionary optimization of many
conflicting objectives, IEEE Trans. Evol. Comput., 11, 770–784,
<a href="https://doi.org/10.1109/TEVC.2007.910138" target="_blank">https://doi.org/10.1109/TEVC.2007.910138</a>, 2007.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib31"><label>31</label><mixed-citation>
      
Qiang, H., Wang, L., Ding, J., and Zhang, L.: Multiobjective optimization of
6-DOF parallel manipulator for desired total orientation workspace, Math.
Probl. Eng., 2019, 5353825, <a href="https://doi.org/10.1155/2019/5353825" target="_blank">https://doi.org/10.1155/2019/5353825</a>, 2019.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib32"><label>32</label><mixed-citation>
      
Richter, M., Schaut, S., Walser, D., Schneider, K., and Sawodny, O.:
Experimental validation of an active heave compensation system: Estimation,
prediction and control, Control Eng. Pract., 66, 1–12,
<a href="https://doi.org/10.1016/j.conengprac.2017.06.005" target="_blank">https://doi.org/10.1016/j.conengprac.2017.06.005</a>, 2017.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib33"><label>33</label><mixed-citation>
      
Shahbazi, M., Heidari, M., and Ahmadzadeh, M.: Optimization of dynamic
parameter design of Stewart platform with Particle Swarm Optimization (PSO)
algorithm, Adv. Mech. Eng., 16, 16878132241263940,
<a href="https://doi.org/10.1177/16878132241263940" target="_blank">https://doi.org/10.1177/16878132241263940</a>, 2024.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib34"><label>34</label><mixed-citation>
      
Shih, H., Shyur, H., and Lee, E.: An extension of TOPSIS for group decision
making, Math. Comput. Model., 45, 801–813,
<a href="https://doi.org/10.1016/j.mcm.2006.03.023" target="_blank">https://doi.org/10.1016/j.mcm.2006.03.023</a>, 2007.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib35"><label>35</label><mixed-citation>
      
Stewart, D.: A platform with six degrees of freedom, Proc. Inst. Mech. Eng.,
180, 371–386, <a href="https://doi.org/10.1243/PIME_PROC_1965_180_029_02" target="_blank">https://doi.org/10.1243/PIME_PROC_1965_180_029_02</a>, 1965.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib36"><label>36</label><mixed-citation>
      
Storn, R.  and Price, K.: Differential evolution–a simple and efficient
heuristic for global optimization over continuous spaces, J. Glob. Optim.,
11, 341–359, <a href="https://doi.org/10.1023/A:1008202821328" target="_blank">https://doi.org/10.1023/A:1008202821328</a>, 1997.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib37"><label>37</label><mixed-citation>
      
Tang, G., Lei, J., Li, F., Zhu, W., Xu, X., Yao, B., Claramunt, C., and Hu,
X.: A modified 6-DOF hybrid serial–parallel platform for ship wave
compensation, Ocean Eng., 280, 114336,
<a href="https://doi.org/10.1016/j.oceaneng.2023.114336" target="_blank">https://doi.org/10.1016/j.oceaneng.2023.114336</a>, 2023.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib38"><label>38</label><mixed-citation>
      
Tao, J., Xu, Y., Chen, Y., Cheng, P., Zhang, H., Wang, J., and Zhou, H.:
Multi-objective structural parameter optimization for Stewart platform via
NSGA-III and Kolmogorov-Arnold network, Machines, 1, 887,
<a href="https://doi.org/10.3390/machines13100887" target="_blank">https://doi.org/10.3390/machines13100887</a>, 2025.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib39"><label>39</label><mixed-citation>
      
Wang, D., Wang, Z., Zhao, S., Wu, N., Feng, R., and Wu, Z.: Stiffness design
method of Gyroid functionally graded lattice structures based on variable
porosity controlled by load path, Compos. Struct., 377, 119794,
<a href="https://doi.org/10.1016/j.compstruct.2025.119794" target="_blank">https://doi.org/10.1016/j.compstruct.2025.119794</a>, 2026.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib40"><label>40</label><mixed-citation>
      
Wang, H., Zhang, L., Chen, G., and Huang, S.: Parameter optimization of
heavy-load parallel manipulator by introducing stiffness distribution
evaluation index, Mech. Mach. Theory, 108, 244–259,
<a href="https://doi.org/10.1016/j.mechmachtheory.2016.10.011" target="_blank">https://doi.org/10.1016/j.mechmachtheory.2016.10.011</a>, 2017.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib41"><label>41</label><mixed-citation>
      
Wang, W., Ning, Y., Zhang, Y., Xu, P., and Li, B.: Linear active disturbance rejection
control with linear quadratic regulator for Stewart platform in active wave
compensation system, Appl. Ocean. Res.,
<a href="https://doi.org/10.1016/j.apor.2025.104469" target="_blank">https://doi.org/10.1016/j.apor.2025.104469</a>, 2025.


    </mixed-citation></ref-html>
<ref-html id="bib1.bib42"><label>42</label><mixed-citation>
      
Wang, Z., Wang, C., Wu, F., Liu, Z., Liu, L., and Wang, D.: Design method of
Gyroid lattice structure based on the load paths direction and capacity,
Addit. Manuf., 97, 104586, <a href="https://doi.org/10.1016/j.addma.2024.104586" target="_blank">https://doi.org/10.1016/j.addma.2024.104586</a>,
2025.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib43"><label>43</label><mixed-citation>
      
Yin, L., Qiao, D., Li, B., Liang, H., Yan, J., Tang, G., and Qu, J.:
Modeling and controller design of an offshore wind service operation vessel
with parallel active motion compensated gangway, Ocean Eng., 266, 112999,
<a href="https://doi.org/10.1016/j.oceaneng.2022.112999" target="_blank">https://doi.org/10.1016/j.oceaneng.2022.112999</a>, 2022.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib44"><label>44</label><mixed-citation>
      
Yu, H., Lv, M., Hu, B., Zhang, Y., and Zhao, P.: A review of control
technologies for soft robots: From structural design to intelligent control,
Mech. Sci., 17, 313–332, <a href="https://doi.org/10.5194/ms-17-313-2026" target="_blank">https://doi.org/10.5194/ms-17-313-2026</a>, 2026.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib45"><label>45</label><mixed-citation>
      
Zhang, L., Chen, J., Xiong, F., Ren, C., and Li, C.: Meta-learning based
multi-fidelity deep neural networks metamodel method, J. Mech. Eng., 58,
190–200, <a href="https://doi.org/10.3901/JME.2022.01.190" target="_blank">https://doi.org/10.3901/JME.2022.01.190</a>, 2022a.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib46"><label>46</label><mixed-citation>
      
Zhang, G., He, J., Guo, J., and Xia, X.: Dynamic modeling and vibration
characteristics analysis of parallel antenna, Mech. Sci., 13, 1019–1029,
<a href="https://doi.org/10.5194/ms-13-1019-2022" target="_blank">https://doi.org/10.5194/ms-13-1019-2022</a>, 2022b.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib47"><label>47</label><mixed-citation>
      
Zhang, G., Wang, J., Guo, J., Wang, J., Xu, Y., and Hu, F.: A novel surface
division method and surface accuracy measurement for parabolic truss-type
deployable antenna mechanism, Mech. Mach. Theory, 212, 106071,
<a href="https://doi.org/10.1016/j.mechmachtheory.2025.106071" target="_blank">https://doi.org/10.1016/j.mechmachtheory.2025.106071</a>, 2025.

    </mixed-citation></ref-html>--></article>
