<?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-759-2026</article-id><title-group><article-title>Trajectory-tracking control of the UR10 manipulator based on radial basis function neural network and super-twisting sliding mode</article-title><alt-title>Adaptive Neural Sliding Mode Control for Robot Manipulators</alt-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author" corresp="no" rid="aff1">
          <name><surname>Ma</surname><given-names>Xiaole</given-names></name>
          
        </contrib>
        <contrib contrib-type="author" corresp="yes" rid="aff1">
          <name><surname>Jing</surname><given-names>Chenghu</given-names></name>
          <email>chhjing@haut.edu.cn</email>
        </contrib>
        <contrib contrib-type="author" corresp="no" rid="aff1">
          <name><surname>Zhang</surname><given-names>Kun</given-names></name>
          
        </contrib>
        <contrib contrib-type="author" corresp="no" rid="aff1">
          <name><surname>Chen</surname><given-names>Chen</given-names></name>
          
        </contrib>
        <contrib contrib-type="author" corresp="no" rid="aff1">
          <name><surname>Wang</surname><given-names>Yanfeng</given-names></name>
          
        </contrib>
        <aff id="aff1"><label>1</label><institution>School of Mechanical and Electrical Engineering, Henan University of Technology, Zhengzhou 450001, China</institution>
        </aff>
      </contrib-group>
      <author-notes><corresp id="corr1">Chenghu Jing (chhjing@haut.edu.cn)</corresp></author-notes><pub-date><day>27</day><month>July</month><year>2026</year></pub-date>
      
      <volume>17</volume>
      <issue>2</issue>
      <fpage>759</fpage><lpage>767</lpage>
      <history>
        <date date-type="received"><day>13</day><month>April</month><year>2026</year></date>
           <date date-type="rev-recd"><day>5</day><month>June</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 Xiaole Ma 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/759/2026/ms-17-759-2026.html">This article is available from https://ms.copernicus.org/articles/17/759/2026/ms-17-759-2026.html</self-uri><self-uri xlink:href="https://ms.copernicus.org/articles/17/759/2026/ms-17-759-2026.pdf">The full text article is available as a PDF file from https://ms.copernicus.org/articles/17/759/2026/ms-17-759-2026.pdf</self-uri>
      <abstract><title>Abstract</title>

      <p id="d2e111">This paper proposes a composite control strategy combining a radial basis function (RBF) neural network and super-twisting sliding-mode control for high-precision trajectory tracking of the UR10 manipulator under parameter variations, nonlinear friction, and external disturbances. An RBF network is employed to approximate the lumped unknown nonlinear dynamics online, thereby reducing the equivalent disturbance upper bounds. Simultaneously, a super-twisting robust control term is introduced to compensate for approximation residuals and remaining disturbances, which ensures system robustness while effectively suppressing conventional sliding-mode chattering. Furthermore, a projection-based adaptive law is designed to guarantee the strict boundedness of the network weights. Based on Lyapunov theory, the finite-time convergence of the sliding variable and tracking error is proven. Simulations on a 6-degree-of-freedom UR10 manipulator – incorporating mass/inertia perturbations and Coulomb-viscous friction – demonstrate that the proposed method achieves high-precision tracking with small steady-state errors and smooth, chattering-free control torques, verifying its effectiveness and engineering applicability.</p>
  </abstract>
    
<funding-group>
<award-group id="gs1">
<funding-source>Natural Science Foundation of Henan Province</funding-source>
<award-id>262300421328</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="d2e123">Robotic manipulators are strongly coupled, nonlinear systems widely applied in industrial manufacturing, medical assistance, and special operations (Liu et al., 2023). With the growing demand for human–robot collaboration, collaborative robots have become essential as they share workspaces with humans without physical separation (Matheson et al., 2019; Taesi et al., 2023). However, practical operations often suffer from parameter uncertainties, nonlinear friction, and external disturbances, which can degrade tracking accuracy and compromise system stability (Spong, 2022).</p>
      <p id="d2e126">Sliding-mode control (SMC) is widely used due to its desirable robustness against matched disturbances (Hashimoto et al., 1987). Yet, the discontinuous switching in conventional SMC induces high-frequency chattering, exciting unmodeled dynamics and increasing actuator wear (Uyulan, 2022). Higher-order SMC, particularly the super-twisting algorithm, generates continuous control inputs to suppress chattering while achieving robust finite-time convergence (Al-Dujaili et al., 2020; Goel and Swarup, 2017; Zhai and Li, 2022; Sun et al., 2024). Nevertheless, under strong unknown nonlinearities, relying solely on super-twisting requires large control gains, increasing energy consumption and risking actuator torque saturation (Ai et al., 2026).</p>
      <p id="d2e129">Neural-network approximation effectively compensates for unknown dynamics (Abdallah and Fareh, 2019). Radial basis function (RBF) networks are widely adopted due to their simple structure and linear parameterization (Moosavi et al., 2022; Dinh et al., 2008). Combining an RBF network with SMC forms a “feedforward approximation <inline-formula><mml:math id="M1" display="inline"><mml:mo>+</mml:mo></mml:math></inline-formula> robust compensation” framework: the network approximates dominant nonlinearities to reduce sliding-mode gains, while the SMC handles residual errors and disturbances (Zhao et al., 2025; Wai, 2003; Zhang and Qian, 2025; Lin et al., 2025). Furthermore, since conventional adaptive laws often overcomplicate Lyapunov derivations and easily cause weight drift (Ren et al., 2020), a hard projection operator is introduced to keep weight estimates bounded and improve numerical stability (Agarwal and Parthasarathy, 2016).</p>
      <p id="d2e139">Inspired by super-twisting strategies demonstrating superior anti-disturbance performance in specialized equipment (Liu et al., 2026; Mou and Wu, 2020; Ren et al., 2023; Chen et al., 2025; Dirara et al., 2025), this paper develops a composite control strategy for the UR10 manipulator. The main contributions are summarized as follows: (1) establishing a UR10 dynamics model considering nonlinear friction and parameter uncertainties; (2) proposing a composite RBF and super-twisting SMC law with a projection-based adaptive operator; (3) proving finite-time convergence of the sliding variable via Lyapunov analysis; and (4) demonstrating superiority over standalone RBF and SMC methods in tracking accuracy, chattering suppression, and robustness via simulations.</p>
</sec>
<sec id="Ch1.S2">
  <label>2</label><title>Dynamics model and problem formulation</title>
      <p id="d2e150">The UR10 is a widely studied 6-degree-of-freedom collaborative robot (Fig. 1) (Petrone et al., 2025). Its dynamics can be expressed as follows:

          <disp-formula id="Ch1.E1" content-type="numbered"><label>1</label><mml:math id="M2" display="block"><mml:mrow><mml:mi mathvariant="bold">M</mml:mi><mml:mo>(</mml:mo><mml:mi mathvariant="bold-italic">q</mml:mi><mml:mo>)</mml:mo><mml:mover accent="true"><mml:mi mathvariant="bold-italic">q</mml:mi><mml:mo mathvariant="normal">¨</mml:mo></mml:mover><mml:mo>+</mml:mo><mml:mi mathvariant="bold">C</mml:mi><mml:mo>(</mml:mo><mml:mi mathvariant="bold-italic">q</mml:mi><mml:mo>,</mml:mo><mml:mover accent="true"><mml:mi mathvariant="bold-italic">q</mml:mi><mml:mo mathvariant="normal">˙</mml:mo></mml:mover><mml:mo>)</mml:mo><mml:mover accent="true"><mml:mi mathvariant="bold-italic">q</mml:mi><mml:mo mathvariant="normal">˙</mml:mo></mml:mover><mml:mo>+</mml:mo><mml:mi mathvariant="bold">G</mml:mi><mml:mo>(</mml:mo><mml:mi mathvariant="bold-italic">q</mml:mi><mml:mo>)</mml:mo><mml:mo>+</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">τ</mml:mi><mml:mi mathvariant="normal">f</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mover accent="true"><mml:mi mathvariant="bold-italic">q</mml:mi><mml:mo mathvariant="normal">˙</mml:mo></mml:mover><mml:mo>)</mml:mo><mml:mo>=</mml:mo><mml:mi mathvariant="bold-italic">τ</mml:mi><mml:mo>+</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">τ</mml:mi><mml:mi mathvariant="normal">d</mml:mi></mml:msub><mml:mo>,</mml:mo></mml:mrow></mml:math></disp-formula>

        where <inline-formula><mml:math id="M3" display="inline"><mml:mrow><mml:mi mathvariant="bold">M</mml:mi><mml:mo>(</mml:mo><mml:mi mathvariant="bold-italic">q</mml:mi><mml:mo>)</mml:mo><mml:mo>∈</mml:mo><mml:msup><mml:mi mathvariant="double-struck">R</mml:mi><mml:mrow><mml:mi>n</mml:mi><mml:mo>×</mml:mo><mml:mi>n</mml:mi></mml:mrow></mml:msup></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math id="M4" display="inline"><mml:mrow><mml:mi mathvariant="bold">C</mml:mi><mml:mo>(</mml:mo><mml:mi mathvariant="bold-italic">q</mml:mi><mml:mo>,</mml:mo><mml:mover accent="true"><mml:mi mathvariant="bold-italic">q</mml:mi><mml:mo mathvariant="normal">˙</mml:mo></mml:mover><mml:mo>)</mml:mo><mml:mo>∈</mml:mo><mml:msup><mml:mi mathvariant="double-struck">R</mml:mi><mml:mrow><mml:mi>n</mml:mi><mml:mo>×</mml:mo><mml:mi>n</mml:mi></mml:mrow></mml:msup></mml:mrow></mml:math></inline-formula>, and <inline-formula><mml:math id="M5" display="inline"><mml:mrow><mml:mi mathvariant="bold">G</mml:mi><mml:mo>(</mml:mo><mml:mi mathvariant="bold-italic">q</mml:mi><mml:mo>)</mml:mo><mml:mo>∈</mml:mo><mml:msup><mml:mi mathvariant="double-struck">R</mml:mi><mml:mi>n</mml:mi></mml:msup></mml:mrow></mml:math></inline-formula> are the inertia, Coriolis or centrifugal, and gravity matrices, respectively; <inline-formula><mml:math id="M6" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">τ</mml:mi><mml:mi mathvariant="normal">d</mml:mi></mml:msub><mml:mo>∈</mml:mo><mml:msup><mml:mi mathvariant="double-struck">R</mml:mi><mml:mi>n</mml:mi></mml:msup></mml:mrow></mml:math></inline-formula> is the external disturbance; <inline-formula><mml:math id="M7" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">τ</mml:mi><mml:mi mathvariant="normal">f</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mover accent="true"><mml:mi mathvariant="bold-italic">q</mml:mi><mml:mo mathvariant="normal">˙</mml:mo></mml:mover><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> is the nonlinear joint friction; <inline-formula><mml:math id="M8" display="inline"><mml:mrow><mml:mi mathvariant="bold-italic">q</mml:mi><mml:mo>∈</mml:mo><mml:msup><mml:mi mathvariant="double-struck">R</mml:mi><mml:mi>n</mml:mi></mml:msup></mml:mrow></mml:math></inline-formula> is the joint position; and <inline-formula><mml:math id="M9" display="inline"><mml:mrow><mml:mi mathvariant="bold-italic">τ</mml:mi><mml:mo>∈</mml:mo><mml:msup><mml:mi mathvariant="double-struck">R</mml:mi><mml:mi>n</mml:mi></mml:msup></mml:mrow></mml:math></inline-formula> is the control input.</p>

      <fig id="F1"><label>Figure 1</label><caption><p id="d2e386">UR10 kinematic model.</p></caption>
        <graphic xlink:href="https://ms.copernicus.org/articles/17/759/2026/ms-17-759-2026-f01.png"/>

      </fig>

      <p id="d2e395">In practical applications, decomposing actual parameters into nominal values and uncertainties, Eq. (1) can be rewritten as follows:

          <disp-formula id="Ch1.E2" content-type="numbered"><label>2</label><mml:math id="M10" display="block"><mml:mrow><mml:msub><mml:mi mathvariant="bold">M</mml:mi><mml:mn mathvariant="normal">0</mml:mn></mml:msub><mml:mo>(</mml:mo><mml:mi mathvariant="bold-italic">q</mml:mi><mml:mo>)</mml:mo><mml:mover accent="true"><mml:mi mathvariant="bold-italic">q</mml:mi><mml:mo mathvariant="normal">¨</mml:mo></mml:mover><mml:mo>+</mml:mo><mml:msub><mml:mi mathvariant="bold">C</mml:mi><mml:mn mathvariant="normal">0</mml:mn></mml:msub><mml:mo>(</mml:mo><mml:mi mathvariant="bold-italic">q</mml:mi><mml:mo>,</mml:mo><mml:mover accent="true"><mml:mi mathvariant="bold-italic">q</mml:mi><mml:mo mathvariant="normal">˙</mml:mo></mml:mover><mml:mo>)</mml:mo><mml:mover accent="true"><mml:mi mathvariant="bold-italic">q</mml:mi><mml:mo mathvariant="normal">˙</mml:mo></mml:mover><mml:mo>+</mml:mo><mml:msub><mml:mi mathvariant="bold">G</mml:mi><mml:mn mathvariant="normal">0</mml:mn></mml:msub><mml:mo>(</mml:mo><mml:mi mathvariant="bold-italic">q</mml:mi><mml:mo>)</mml:mo><mml:mo>=</mml:mo><mml:mi mathvariant="bold-italic">τ</mml:mi><mml:mo>+</mml:mo><mml:mi mathvariant="bold-italic">f</mml:mi><mml:mo>(</mml:mo><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mo>)</mml:mo><mml:mo>+</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">τ</mml:mi><mml:mi mathvariant="normal">d</mml:mi></mml:msub><mml:mo>,</mml:mo></mml:mrow></mml:math></disp-formula>

        where <inline-formula><mml:math id="M11" display="inline"><mml:mrow><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mo>=</mml:mo><mml:msup><mml:mfenced close="]" open="["><mml:mrow><mml:msup><mml:mi mathvariant="bold-italic">q</mml:mi><mml:mi>T</mml:mi></mml:msup><mml:mo>,</mml:mo><mml:msup><mml:mover accent="true"><mml:mi mathvariant="bold-italic">q</mml:mi><mml:mo mathvariant="normal">˙</mml:mo></mml:mover><mml:mi>T</mml:mi></mml:msup></mml:mrow></mml:mfenced><mml:mi>T</mml:mi></mml:msup></mml:mrow></mml:math></inline-formula> is the system state, and <inline-formula><mml:math id="M12" display="inline"><mml:mrow><mml:mi mathvariant="bold-italic">f</mml:mi><mml:mo>(</mml:mo><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mo>)</mml:mo><mml:mo>=</mml:mo><mml:mo>-</mml:mo><mml:mi mathvariant="normal">Δ</mml:mi><mml:mi mathvariant="bold">M</mml:mi><mml:mo>(</mml:mo><mml:mi mathvariant="bold-italic">q</mml:mi><mml:mo>)</mml:mo><mml:mover accent="true"><mml:mi mathvariant="bold-italic">q</mml:mi><mml:mo mathvariant="normal">¨</mml:mo></mml:mover><mml:mo>-</mml:mo><mml:mi mathvariant="normal">Δ</mml:mi><mml:mi mathvariant="bold">C</mml:mi><mml:mo>(</mml:mo><mml:mi mathvariant="bold-italic">q</mml:mi><mml:mo>,</mml:mo><mml:mover accent="true"><mml:mi mathvariant="bold-italic">q</mml:mi><mml:mo mathvariant="normal">˙</mml:mo></mml:mover><mml:mo>)</mml:mo><mml:mover accent="true"><mml:mi mathvariant="bold-italic">q</mml:mi><mml:mo mathvariant="normal">˙</mml:mo></mml:mover><mml:mo>-</mml:mo><mml:mi mathvariant="normal">Δ</mml:mi><mml:mi mathvariant="bold">G</mml:mi><mml:mo>(</mml:mo><mml:mi mathvariant="bold-italic">q</mml:mi><mml:mo>)</mml:mo><mml:mo>+</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">τ</mml:mi><mml:mi mathvariant="normal">f</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mover accent="true"><mml:mi mathvariant="bold-italic">q</mml:mi><mml:mo mathvariant="normal">˙</mml:mo></mml:mover><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> represents the lumped unknown dynamics, including unmodeled friction and parameter uncertainties; quantities with the subscript “0” denote nominal values, and those with “<inline-formula><mml:math id="M13" display="inline"><mml:mi mathvariant="normal">Δ</mml:mi></mml:math></inline-formula>” represent parametric uncertainties.</p>
      <p id="d2e608"><italic>Property 1. </italic>The inertia matrix <inline-formula><mml:math id="M14" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="bold">M</mml:mi><mml:mn mathvariant="normal">0</mml:mn></mml:msub><mml:mo>(</mml:mo><mml:mi mathvariant="bold-italic">q</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> is symmetric positive definite and satisfies <inline-formula><mml:math id="M15" display="inline"><mml:mrow><mml:msub><mml:mi>m</mml:mi><mml:mo>min⁡</mml:mo></mml:msub><mml:mo>≤</mml:mo><mml:mo>‖</mml:mo><mml:msub><mml:mi mathvariant="bold">M</mml:mi><mml:mn mathvariant="normal">0</mml:mn></mml:msub><mml:mo>(</mml:mo><mml:mi mathvariant="bold-italic">q</mml:mi><mml:mo>)</mml:mo><mml:mo>‖</mml:mo><mml:mo>≤</mml:mo><mml:msub><mml:mi>m</mml:mi><mml:mo>max⁡</mml:mo></mml:msub></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math id="M16" display="inline"><mml:mrow><mml:mo>∀</mml:mo><mml:mi mathvariant="bold-italic">q</mml:mi><mml:mo>∈</mml:mo><mml:msup><mml:mi mathvariant="double-struck">R</mml:mi><mml:mi>n</mml:mi></mml:msup></mml:mrow></mml:math></inline-formula>, where <inline-formula><mml:math id="M17" display="inline"><mml:mrow><mml:msub><mml:mi>m</mml:mi><mml:mo>min⁡</mml:mo></mml:msub></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math id="M18" display="inline"><mml:mrow><mml:msub><mml:mi>m</mml:mi><mml:mo>max⁡</mml:mo></mml:msub></mml:mrow></mml:math></inline-formula> are positive constants.</p>
      <p id="d2e704"><italic>Assumption 1.</italic> The desired trajectory <inline-formula><mml:math id="M19" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">q</mml:mi><mml:mi mathvariant="normal">d</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> and its derivatives <inline-formula><mml:math id="M20" display="inline"><mml:mrow><mml:msub><mml:mover accent="true"><mml:mi mathvariant="bold-italic">q</mml:mi><mml:mo mathvariant="normal">˙</mml:mo></mml:mover><mml:mi mathvariant="normal">d</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math id="M21" display="inline"><mml:mrow><mml:msub><mml:mover accent="true"><mml:mi mathvariant="bold-italic">q</mml:mi><mml:mo mathvariant="normal">¨</mml:mo></mml:mover><mml:mi mathvariant="normal">d</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> are continuous and uniformly bounded. Furthermore, the initial system state <inline-formula><mml:math id="M22" display="inline"><mml:mrow><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mo>(</mml:mo><mml:mn mathvariant="normal">0</mml:mn><mml:mo>)</mml:mo><mml:mo>=</mml:mo><mml:msup><mml:mfenced close="]" open="["><mml:mrow><mml:msup><mml:mi mathvariant="bold-italic">q</mml:mi><mml:mi>T</mml:mi></mml:msup><mml:mo>(</mml:mo><mml:mn mathvariant="normal">0</mml:mn><mml:mo>)</mml:mo><mml:mo>,</mml:mo><mml:msup><mml:mover accent="true"><mml:mi mathvariant="bold-italic">q</mml:mi><mml:mo mathvariant="normal">˙</mml:mo></mml:mover><mml:mi>T</mml:mi></mml:msup><mml:mo>(</mml:mo><mml:mn mathvariant="normal">0</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:mfenced><mml:mi>T</mml:mi></mml:msup></mml:mrow></mml:math></inline-formula> is assumed to belong to a known compact set <inline-formula><mml:math id="M23" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="normal">Ω</mml:mi><mml:mi>x</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>.</p>
      <p id="d2e807"><italic>Remark 1.</italic> This assumption replaces the conventional “<inline-formula><mml:math id="M24" display="inline"><mml:mrow><mml:mi mathvariant="bold-italic">q</mml:mi><mml:mo>,</mml:mo><mml:mover accent="true"><mml:mi mathvariant="bold-italic">q</mml:mi><mml:mo mathvariant="normal">˙</mml:mo></mml:mover></mml:mrow></mml:math></inline-formula> are bounded” assumption, thereby avoiding the circular argument that presupposes boundedness before proving stability. Assuming the initial state lies in a compact set is a rigorous mathematical prerequisite for ensuring the universal approximation property of the subsequent radial basis function neural network within its effective domain.</p>
      <p id="d2e827">To handle the unknown nonlinear function <inline-formula><mml:math id="M25" display="inline"><mml:mrow><mml:mi mathvariant="bold-italic">f</mml:mi><mml:mo>(</mml:mo><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>, an RBF neural network is introduced for approximation. For any continuous function <inline-formula><mml:math id="M26" display="inline"><mml:mrow><mml:mi mathvariant="bold-italic">f</mml:mi><mml:mo>(</mml:mo><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>, within a compact set, it can be modeled by an ideal neural network as follows:

          <disp-formula id="Ch1.E3" content-type="numbered"><label>3</label><mml:math id="M27" display="block"><mml:mrow><mml:mi mathvariant="bold-italic">f</mml:mi><mml:mo>(</mml:mo><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mo>)</mml:mo><mml:mo>=</mml:mo><mml:msup><mml:mi mathvariant="bold">W</mml:mi><mml:mrow><mml:mo>∗</mml:mo><mml:mi>T</mml:mi></mml:mrow></mml:msup><mml:mi mathvariant="bold">Φ</mml:mi><mml:mo>(</mml:mo><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mo>)</mml:mo><mml:mo>+</mml:mo><mml:mi mathvariant="bold-italic">ε</mml:mi><mml:mo>(</mml:mo><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mo>)</mml:mo><mml:mo>,</mml:mo></mml:mrow></mml:math></disp-formula>

        where <inline-formula><mml:math id="M28" display="inline"><mml:mrow><mml:msup><mml:mi mathvariant="bold">W</mml:mi><mml:mo>∗</mml:mo></mml:msup><mml:mo>∈</mml:mo><mml:msup><mml:mi mathvariant="double-struck">R</mml:mi><mml:mrow><mml:mi>N</mml:mi><mml:mo>×</mml:mo><mml:mi>n</mml:mi></mml:mrow></mml:msup></mml:mrow></mml:math></inline-formula> is the ideal weight matrix, <inline-formula><mml:math id="M29" display="inline"><mml:mrow><mml:mi mathvariant="bold">Φ</mml:mi><mml:mo>(</mml:mo><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mo>)</mml:mo><mml:mo>∈</mml:mo><mml:msup><mml:mi mathvariant="double-struck">R</mml:mi><mml:mi>N</mml:mi></mml:msup></mml:mrow></mml:math></inline-formula> is the Gaussian radial basis functions vector, <inline-formula><mml:math id="M30" display="inline"><mml:mi>N</mml:mi></mml:math></inline-formula> is the number of hidden-layer nodes, and <inline-formula><mml:math id="M31" display="inline"><mml:mrow><mml:mi mathvariant="bold-italic">ε</mml:mi><mml:mo>(</mml:mo><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mo>)</mml:mo><mml:mo>∈</mml:mo><mml:msup><mml:mi mathvariant="double-struck">R</mml:mi><mml:mi>n</mml:mi></mml:msup></mml:mrow></mml:math></inline-formula> is the network approximation error.</p>
      <p id="d2e976"><italic>Assumption 2.</italic> The ideal weight matrix <inline-formula><mml:math id="M32" display="inline"><mml:mrow><mml:msup><mml:mi mathvariant="bold">W</mml:mi><mml:mo>∗</mml:mo></mml:msup></mml:mrow></mml:math></inline-formula> and the approximation error <inline-formula><mml:math id="M33" display="inline"><mml:mrow><mml:mi mathvariant="bold-italic">ε</mml:mi><mml:mo>(</mml:mo><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> are bounded, i.e., <inline-formula><mml:math id="M34" display="inline"><mml:mrow><mml:mo>‖</mml:mo><mml:msup><mml:mi mathvariant="bold">W</mml:mi><mml:mo>∗</mml:mo></mml:msup><mml:msub><mml:mo>‖</mml:mo><mml:mi mathvariant="normal">F</mml:mi></mml:msub><mml:mo>≤</mml:mo><mml:msub><mml:mi>W</mml:mi><mml:mi>M</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math id="M35" display="inline"><mml:mrow><mml:mo>‖</mml:mo><mml:mi mathvariant="bold-italic">ε</mml:mi><mml:mo>(</mml:mo><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mo>)</mml:mo><mml:mo>‖</mml:mo><mml:mo>≤</mml:mo><mml:msub><mml:mi mathvariant="italic">ε</mml:mi><mml:mi>M</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>. Moreover, the Gaussian basis functions themselves are bounded, satisfying <inline-formula><mml:math id="M36" display="inline"><mml:mrow><mml:mo>‖</mml:mo><mml:mi mathvariant="bold">Φ</mml:mi><mml:mo>(</mml:mo><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mo>)</mml:mo><mml:mo>‖</mml:mo><mml:mo>≤</mml:mo><mml:msqrt><mml:mi>N</mml:mi></mml:msqrt></mml:mrow></mml:math></inline-formula>. The external disturbance <inline-formula><mml:math id="M37" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">τ</mml:mi><mml:mi mathvariant="normal">d</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> is also bounded.</p>
      <p id="d2e1091"><italic>Remark 2.</italic> In this paper, for a vector <inline-formula><mml:math id="M38" display="inline"><mml:mrow><mml:mi mathvariant="bold-italic">s</mml:mi><mml:mo>=</mml:mo><mml:mo>[</mml:mo><mml:msub><mml:mi>s</mml:mi><mml:mn mathvariant="normal">1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>s</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>s</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:msup><mml:mo>]</mml:mo><mml:mi>T</mml:mi></mml:msup></mml:mrow></mml:math></inline-formula>, the symbol <inline-formula><mml:math id="M39" display="inline"><mml:mrow><mml:mo>|</mml:mo><mml:mi mathvariant="bold-italic">s</mml:mi><mml:msup><mml:mo>|</mml:mo><mml:mrow><mml:mn mathvariant="normal">1</mml:mn><mml:mo>/</mml:mo><mml:mn mathvariant="normal">2</mml:mn></mml:mrow></mml:msup><mml:mi mathvariant="normal">sign</mml:mi><mml:mo>(</mml:mo><mml:mi mathvariant="bold-italic">s</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> denotes element-wise operation, i.e., <inline-formula><mml:math id="M40" display="inline"><mml:mrow><mml:mo>[</mml:mo><mml:mo>|</mml:mo><mml:msub><mml:mi>s</mml:mi><mml:mn mathvariant="normal">1</mml:mn></mml:msub><mml:msup><mml:mo>|</mml:mo><mml:mrow><mml:mn mathvariant="normal">1</mml:mn><mml:mo>/</mml:mo><mml:mn mathvariant="normal">2</mml:mn></mml:mrow></mml:msup><mml:mi mathvariant="normal">sign</mml:mi><mml:mo>(</mml:mo><mml:msub><mml:mi>s</mml:mi><mml:mn mathvariant="normal">1</mml:mn></mml:msub><mml:mo>)</mml:mo><mml:mo>,</mml:mo><mml:mi mathvariant="normal">…</mml:mi><mml:mo>,</mml:mo><mml:mo>|</mml:mo><mml:msub><mml:mi>s</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:msup><mml:mo>|</mml:mo><mml:mrow><mml:mn mathvariant="normal">1</mml:mn><mml:mo>/</mml:mo><mml:mn mathvariant="normal">2</mml:mn></mml:mrow></mml:msup><mml:mi mathvariant="normal">sign</mml:mi><mml:mo>(</mml:mo><mml:msub><mml:mi>s</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:mo>)</mml:mo><mml:msup><mml:mo>]</mml:mo><mml:mi>T</mml:mi></mml:msup></mml:mrow></mml:math></inline-formula>.</p>
</sec>
<sec id="Ch1.S3">
  <label>3</label><title>Adaptive super-twisting decoupled control design and stability analysis</title>
<sec id="Ch1.S3.SS1">
  <label>3.1</label><title>Controller and adaptive law design</title>
      <p id="d2e1255">We define the trajectory-tracking error as <inline-formula><mml:math id="M41" display="inline"><mml:mrow><mml:mi mathvariant="bold-italic">e</mml:mi><mml:mo>=</mml:mo><mml:mi mathvariant="bold-italic">q</mml:mi><mml:mo>-</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">q</mml:mi><mml:mi mathvariant="normal">d</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> and construct a linear sliding surface:

            <disp-formula id="Ch1.E4" content-type="numbered"><label>4</label><mml:math id="M42" display="block"><mml:mrow><mml:mi mathvariant="bold-italic">s</mml:mi><mml:mo>=</mml:mo><mml:mover accent="true"><mml:mi mathvariant="bold-italic">e</mml:mi><mml:mo mathvariant="normal">˙</mml:mo></mml:mover><mml:mo>+</mml:mo><mml:mi mathvariant="bold">Λ</mml:mi><mml:mi mathvariant="bold-italic">e</mml:mi><mml:mo>,</mml:mo></mml:mrow></mml:math></disp-formula>

          where <inline-formula><mml:math id="M43" display="inline"><mml:mrow><mml:mi mathvariant="bold">Λ</mml:mi><mml:mo>=</mml:mo><mml:mi mathvariant="normal">diag</mml:mi><mml:mo mathvariant="italic">{</mml:mo><mml:msub><mml:mi mathvariant="italic">λ</mml:mi><mml:mn mathvariant="normal">1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mi mathvariant="normal">…</mml:mi><mml:mo>,</mml:mo><mml:msub><mml:mi mathvariant="italic">λ</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:mo mathvariant="italic">}</mml:mo></mml:mrow></mml:math></inline-formula> is a positive definite diagonal matrix. Differentiating Eq. (4) and substituting into Eq. (2) yields the sliding-surface dynamics:

            <disp-formula id="Ch1.E5" content-type="numbered"><label>5</label><mml:math id="M44" display="block"><mml:mtable rowspacing="0.2ex" class="split" displaystyle="true" columnalign="right left"><mml:mtr><mml:mtd><mml:mrow><mml:msub><mml:mi mathvariant="bold">M</mml:mi><mml:mn mathvariant="normal">0</mml:mn></mml:msub><mml:mo>(</mml:mo><mml:mi mathvariant="bold-italic">q</mml:mi><mml:mo>)</mml:mo><mml:mover accent="true"><mml:mi mathvariant="bold-italic">s</mml:mi><mml:mo mathvariant="normal">˙</mml:mo></mml:mover><mml:mo>=</mml:mo></mml:mrow></mml:mtd><mml:mtd><mml:mrow><mml:msub><mml:mi mathvariant="bold">M</mml:mi><mml:mn mathvariant="normal">0</mml:mn></mml:msub><mml:mo>(</mml:mo><mml:mi mathvariant="bold-italic">q</mml:mi><mml:mo>)</mml:mo><mml:mo>(</mml:mo><mml:mover accent="true"><mml:mi mathvariant="bold-italic">q</mml:mi><mml:mo mathvariant="normal">¨</mml:mo></mml:mover><mml:mo>-</mml:mo><mml:msub><mml:mover accent="true"><mml:mi mathvariant="bold-italic">q</mml:mi><mml:mo mathvariant="normal">¨</mml:mo></mml:mover><mml:mi mathvariant="normal">d</mml:mi></mml:msub><mml:mo>+</mml:mo><mml:mi mathvariant="bold">Λ</mml:mi><mml:mover accent="true"><mml:mi mathvariant="bold-italic">e</mml:mi><mml:mo mathvariant="normal">˙</mml:mo></mml:mover><mml:mo>)</mml:mo></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:mo>=</mml:mo></mml:mrow></mml:mtd><mml:mtd><mml:mrow><mml:mi mathvariant="bold-italic">τ</mml:mi><mml:mo>+</mml:mo><mml:mi mathvariant="bold-italic">f</mml:mi><mml:mo>(</mml:mo><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mo>)</mml:mo><mml:mo>+</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">τ</mml:mi><mml:mi mathvariant="normal">d</mml:mi></mml:msub><mml:mo>-</mml:mo><mml:msub><mml:mi mathvariant="bold">C</mml:mi><mml:mn mathvariant="normal">0</mml:mn></mml:msub><mml:mover accent="true"><mml:mi mathvariant="bold-italic">q</mml:mi><mml:mo mathvariant="normal">˙</mml:mo></mml:mover><mml:mo>-</mml:mo><mml:msub><mml:mi mathvariant="bold">G</mml:mi><mml:mn mathvariant="normal">0</mml:mn></mml:msub></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd/><mml:mtd><mml:mrow><mml:mo>-</mml:mo><mml:msub><mml:mi mathvariant="bold">M</mml:mi><mml:mn mathvariant="normal">0</mml:mn></mml:msub><mml:mo>(</mml:mo><mml:mi mathvariant="bold-italic">q</mml:mi><mml:mo>)</mml:mo><mml:mo>(</mml:mo><mml:msub><mml:mover accent="true"><mml:mi mathvariant="bold-italic">q</mml:mi><mml:mo mathvariant="normal">¨</mml:mo></mml:mover><mml:mi mathvariant="normal">d</mml:mi></mml:msub><mml:mo>-</mml:mo><mml:mi mathvariant="bold">Λ</mml:mi><mml:mover accent="true"><mml:mi mathvariant="bold-italic">e</mml:mi><mml:mo mathvariant="normal">˙</mml:mo></mml:mover><mml:mo>)</mml:mo><mml:mo>.</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>

          To achieve high-precision tracking and eliminate chattering, an RBF-based super-twisting sliding-mode control (RBF-STSMC) is designed:

            <disp-formula id="Ch1.E6" content-type="numbered"><label>6</label><mml:math id="M45" display="block"><mml:mtable rowspacing="0.2ex" class="split" displaystyle="true" columnalign="right left"><mml:mtr><mml:mtd><mml:mrow><mml:mi mathvariant="bold-italic">τ</mml:mi><mml:mo>=</mml:mo></mml:mrow></mml:mtd><mml:mtd><mml:mrow><mml:msub><mml:mi mathvariant="bold">M</mml:mi><mml:mn mathvariant="normal">0</mml:mn></mml:msub><mml:mo>(</mml:mo><mml:mi mathvariant="bold-italic">q</mml:mi><mml:mo>)</mml:mo><mml:mo>(</mml:mo><mml:msub><mml:mover accent="true"><mml:mi mathvariant="bold-italic">q</mml:mi><mml:mo mathvariant="normal">¨</mml:mo></mml:mover><mml:mi mathvariant="normal">d</mml:mi></mml:msub><mml:mo>-</mml:mo><mml:mi mathvariant="bold">Λ</mml:mi><mml:mover accent="true"><mml:mi mathvariant="bold-italic">e</mml:mi><mml:mo mathvariant="normal">˙</mml:mo></mml:mover><mml:mo>)</mml:mo><mml:mo>+</mml:mo><mml:msub><mml:mi mathvariant="bold">C</mml:mi><mml:mn mathvariant="normal">0</mml:mn></mml:msub><mml:mo>(</mml:mo><mml:mi mathvariant="bold-italic">q</mml:mi><mml:mo>,</mml:mo><mml:mover accent="true"><mml:mi mathvariant="bold-italic">q</mml:mi><mml:mo mathvariant="normal">˙</mml:mo></mml:mover><mml:mo>)</mml:mo><mml:mover accent="true"><mml:mi mathvariant="bold-italic">q</mml:mi><mml:mo mathvariant="normal">˙</mml:mo></mml:mover><mml:mo>+</mml:mo><mml:msub><mml:mi mathvariant="bold">G</mml:mi><mml:mn mathvariant="normal">0</mml:mn></mml:msub><mml:mo>(</mml:mo><mml:mi mathvariant="bold-italic">q</mml:mi><mml:mo>)</mml:mo><mml:mo>-</mml:mo><mml:msup><mml:mover accent="true"><mml:mi mathvariant="bold">W</mml:mi><mml:mo mathvariant="normal" stretchy="true">^</mml:mo></mml:mover><mml:mi>T</mml:mi></mml:msup><mml:mi mathvariant="bold">Φ</mml:mi><mml:mo>(</mml:mo><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd/><mml:mtd><mml:mrow><mml:mo>+</mml:mo><mml:msub><mml:mi mathvariant="bold">M</mml:mi><mml:mn mathvariant="normal">0</mml:mn></mml:msub><mml:mo>(</mml:mo><mml:mi mathvariant="bold-italic">q</mml:mi><mml:mo>)</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">u</mml:mi><mml:mi mathvariant="normal">st</mml:mi></mml:msub><mml:mo>,</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>

          where <inline-formula><mml:math id="M46" display="inline"><mml:mrow><mml:mover accent="true"><mml:mi mathvariant="bold">W</mml:mi><mml:mo stretchy="true" mathvariant="normal">^</mml:mo></mml:mover><mml:mo>∈</mml:mo><mml:msup><mml:mi mathvariant="double-struck">R</mml:mi><mml:mrow><mml:mi>N</mml:mi><mml:mo>×</mml:mo><mml:mi>n</mml:mi></mml:mrow></mml:msup></mml:mrow></mml:math></inline-formula> is the estimated weight matrix of the RBF neural network, used for feedforward compensation of system uncertainties, and <inline-formula><mml:math id="M47" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">u</mml:mi><mml:mi mathvariant="normal">st</mml:mi></mml:msub><mml:mo>∈</mml:mo><mml:msup><mml:mi mathvariant="double-struck">R</mml:mi><mml:mi>n</mml:mi></mml:msup></mml:mrow></mml:math></inline-formula> is the super-twisting robust control term, designed to suppress residual errors and external disturbances. The design of <inline-formula><mml:math id="M48" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">u</mml:mi><mml:mi mathvariant="normal">st</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> is as follows:

            <disp-formula id="Ch1.E7" content-type="numbered"><label>7</label><mml:math id="M49" display="block"><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">u</mml:mi><mml:mi mathvariant="normal">st</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mo>-</mml:mo><mml:mi mathvariant="bold-italic">α</mml:mi><mml:mo>|</mml:mo><mml:mi mathvariant="bold-italic">s</mml:mi><mml:msup><mml:mo>|</mml:mo><mml:mrow><mml:mn mathvariant="normal">1</mml:mn><mml:mo>/</mml:mo><mml:mn mathvariant="normal">2</mml:mn></mml:mrow></mml:msup><mml:mi mathvariant="normal">sign</mml:mi><mml:mo>(</mml:mo><mml:mi mathvariant="bold-italic">s</mml:mi><mml:mo>)</mml:mo><mml:mo>-</mml:mo><mml:mi mathvariant="bold-italic">β</mml:mi><mml:mo movablelimits="false">∫</mml:mo><mml:mi mathvariant="normal">sign</mml:mi><mml:mo>(</mml:mo><mml:mi mathvariant="bold-italic">s</mml:mi><mml:mo>)</mml:mo><mml:mi mathvariant="normal">d</mml:mi><mml:mi>t</mml:mi><mml:mo>,</mml:mo></mml:mrow></mml:math></disp-formula>

          with <inline-formula><mml:math id="M50" display="inline"><mml:mrow><mml:mi mathvariant="bold-italic">α</mml:mi><mml:mo>=</mml:mo><mml:mi mathvariant="normal">diag</mml:mi><mml:mo mathvariant="italic">{</mml:mo><mml:msub><mml:mi mathvariant="italic">α</mml:mi><mml:mn mathvariant="normal">1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mi mathvariant="normal">…</mml:mi><mml:mo>,</mml:mo><mml:msub><mml:mi mathvariant="italic">α</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:mo mathvariant="italic">}</mml:mo></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math id="M51" display="inline"><mml:mrow><mml:mi mathvariant="bold-italic">β</mml:mi><mml:mo>=</mml:mo><mml:mi mathvariant="normal">diag</mml:mi><mml:mo mathvariant="italic">{</mml:mo><mml:msub><mml:mi mathvariant="italic">β</mml:mi><mml:mn mathvariant="normal">1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mi mathvariant="normal">…</mml:mi><mml:mo>,</mml:mo><mml:msub><mml:mi mathvariant="italic">β</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:mo mathvariant="italic">}</mml:mo></mml:mrow></mml:math></inline-formula> being diagonal matrices of positive control gains.</p>
      <p id="d2e1794">To ensure boundedness of the neural network weights and to avoid a stringent cancellation design in the Lyapunov derivative, a hard projection operator is introduced for the weight adaptation law. Let the raw update direction matrix be <inline-formula><mml:math id="M52" display="inline"><mml:mrow><mml:mi mathvariant="bold">Y</mml:mi><mml:mo>=</mml:mo><mml:mi mathvariant="bold">Γ</mml:mi><mml:mi mathvariant="bold">Φ</mml:mi><mml:mo>(</mml:mo><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mo>)</mml:mo><mml:msup><mml:mi mathvariant="bold-italic">s</mml:mi><mml:mi>T</mml:mi></mml:msup></mml:mrow></mml:math></inline-formula>. The adaptive law is as follows:

            <disp-formula id="Ch1.E8" content-type="numbered"><label>8</label><mml:math id="M53" display="block"><mml:mrow><mml:mtable class="split" rowspacing="0.2ex" displaystyle="true" columnalign="right left"><mml:mtr><mml:mtd><mml:mrow><mml:mover accent="true"><mml:mover accent="true"><mml:mi mathvariant="bold">W</mml:mi><mml:mo stretchy="true" mathvariant="normal">^</mml:mo></mml:mover><mml:mo mathvariant="normal">˙</mml:mo></mml:mover></mml:mrow></mml:mtd><mml:mtd><mml:mrow><mml:mo>=</mml:mo><mml:mi mathvariant="normal">Proj</mml:mi><mml:mo>(</mml:mo><mml:mover accent="true"><mml:mi mathvariant="bold">W</mml:mi><mml:mo mathvariant="normal" stretchy="true">^</mml:mo></mml:mover><mml:mo>,</mml:mo><mml:mi mathvariant="bold">Y</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd/><mml:mtd><mml:mrow><mml:mo>=</mml:mo><mml:mfenced open="{" close=""><mml:mtable class="array" columnalign="left left"><mml:mtr><mml:mtd><mml:mrow><mml:mi mathvariant="bold">Y</mml:mi><mml:mo>,</mml:mo></mml:mrow></mml:mtd><mml:mtd><mml:mrow><mml:mo>‖</mml:mo><mml:mover accent="true"><mml:mi mathvariant="bold">W</mml:mi><mml:mo stretchy="true" mathvariant="normal">^</mml:mo></mml:mover><mml:msub><mml:mo>‖</mml:mo><mml:mi mathvariant="normal">F</mml:mi></mml:msub><mml:mo>&lt;</mml:mo><mml:msub><mml:mi>W</mml:mi><mml:mo>max⁡</mml:mo></mml:msub><mml:mspace linebreak="nobreak" width="0.25em"/><mml:mi mathvariant="normal">or</mml:mi><mml:mspace linebreak="nobreak" width="0.25em"/></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd/><mml:mtd><mml:mrow><mml:mfenced close=")" open="("><mml:mrow><mml:mo>‖</mml:mo><mml:mover accent="true"><mml:mi mathvariant="bold">W</mml:mi><mml:mo stretchy="true" mathvariant="normal">^</mml:mo></mml:mover><mml:msub><mml:mo>‖</mml:mo><mml:mi mathvariant="normal">F</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mi>W</mml:mi><mml:mo>max⁡</mml:mo></mml:msub><mml:mspace width="0.25em" linebreak="nobreak"/><mml:mi mathvariant="normal">and</mml:mi><mml:mspace width="0.25em" linebreak="nobreak"/><mml:mi mathvariant="normal">tr</mml:mi><mml:mo>(</mml:mo><mml:msup><mml:mover accent="true"><mml:mi mathvariant="bold">W</mml:mi><mml:mo mathvariant="normal" stretchy="true">^</mml:mo></mml:mover><mml:mi>T</mml:mi></mml:msup><mml:mi mathvariant="bold">Y</mml:mi><mml:mo>)</mml:mo><mml:mo>≤</mml:mo><mml:mn mathvariant="normal">0</mml:mn></mml:mrow></mml:mfenced></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:mi mathvariant="bold">Y</mml:mi><mml:mo>-</mml:mo><mml:mstyle displaystyle="false"><mml:mstyle displaystyle="false"><mml:mfrac style="text"><mml:mrow><mml:mi mathvariant="normal">tr</mml:mi><mml:mo>(</mml:mo><mml:msup><mml:mover accent="true"><mml:mi mathvariant="bold">W</mml:mi><mml:mo stretchy="true" mathvariant="normal">^</mml:mo></mml:mover><mml:mi>T</mml:mi></mml:msup><mml:mi mathvariant="bold">Y</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mo>‖</mml:mo><mml:mover accent="true"><mml:mi mathvariant="bold">W</mml:mi><mml:mo stretchy="true" mathvariant="normal">^</mml:mo></mml:mover><mml:msubsup><mml:mo>‖</mml:mo><mml:mi mathvariant="normal">F</mml:mi><mml:mn mathvariant="normal">2</mml:mn></mml:msubsup></mml:mrow></mml:mfrac></mml:mstyle></mml:mstyle><mml:mover accent="true"><mml:mi mathvariant="bold">W</mml:mi><mml:mo stretchy="true" mathvariant="normal">^</mml:mo></mml:mover><mml:mo>,</mml:mo></mml:mrow></mml:mtd><mml:mtd><mml:mrow><mml:mo>‖</mml:mo><mml:mover accent="true"><mml:mi mathvariant="bold">W</mml:mi><mml:mo stretchy="true" mathvariant="normal">^</mml:mo></mml:mover><mml:msub><mml:mo>‖</mml:mo><mml:mi mathvariant="normal">F</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mi>W</mml:mi><mml:mo>max⁡</mml:mo></mml:msub><mml:mspace width="0.25em" linebreak="nobreak"/><mml:mi mathvariant="normal">and</mml:mi><mml:mspace width="0.25em" linebreak="nobreak"/><mml:mi mathvariant="normal">tr</mml:mi><mml:mo>(</mml:mo><mml:msup><mml:mover accent="true"><mml:mi mathvariant="bold">W</mml:mi><mml:mo stretchy="true" mathvariant="normal">^</mml:mo></mml:mover><mml:mi>T</mml:mi></mml:msup><mml:mi mathvariant="bold">Y</mml:mi><mml:mo>)</mml:mo><mml:mo>&gt;</mml:mo><mml:mn mathvariant="normal">0</mml:mn></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mfenced><mml:mo>,</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow></mml:math></disp-formula>

          where <inline-formula><mml:math id="M54" display="inline"><mml:mi mathvariant="bold">Γ</mml:mi></mml:math></inline-formula> is a positive learning rate matrix, <inline-formula><mml:math id="M55" display="inline"><mml:mrow><mml:mi mathvariant="normal">tr</mml:mi><mml:mo>(</mml:mo><mml:mo>⋅</mml:mo><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> denotes the matrix trace, and <inline-formula><mml:math id="M56" display="inline"><mml:mrow><mml:mo>‖</mml:mo><mml:mo>⋅</mml:mo><mml:msub><mml:mo>‖</mml:mo><mml:mi mathvariant="normal">F</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> is the Frobenius norm.</p>
      <p id="d2e2084"><italic>Remark 3.</italic> When the norm of the estimated weights <inline-formula><mml:math id="M57" display="inline"><mml:mrow><mml:mo>‖</mml:mo><mml:mover accent="true"><mml:mi mathvariant="bold">W</mml:mi><mml:mo stretchy="true" mathvariant="normal">^</mml:mo></mml:mover><mml:msub><mml:mo>‖</mml:mo><mml:mi mathvariant="normal">F</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> reaches the preset safety boundary <inline-formula><mml:math id="M58" display="inline"><mml:mrow><mml:msub><mml:mi>W</mml:mi><mml:mo>max⁡</mml:mo></mml:msub></mml:mrow></mml:math></inline-formula> and the update direction continues to point outward, the outward normal update component is forcibly removed, limiting the update direction to the tangent of the boundary. This mathematically guarantees globally and strictly that <inline-formula><mml:math id="M59" display="inline"><mml:mrow><mml:mo>‖</mml:mo><mml:mover accent="true"><mml:mi mathvariant="bold">W</mml:mi><mml:mo mathvariant="normal" stretchy="true">^</mml:mo></mml:mover><mml:msub><mml:mo>‖</mml:mo><mml:mi mathvariant="normal">F</mml:mi></mml:msub><mml:mo>≤</mml:mo><mml:msub><mml:mi>W</mml:mi><mml:mo>max⁡</mml:mo></mml:msub></mml:mrow></mml:math></inline-formula> holds at all times.</p>

      <fig id="F2" specific-use="star"><label>Figure 2</label><caption><p id="d2e2146">Block diagram of the proposed RBF-STSMC control system.</p></caption>
          <graphic xlink:href="https://ms.copernicus.org/articles/17/759/2026/ms-17-759-2026-f02.png"/>

        </fig>

      <p id="d2e2155">To intuitively illustrate the overall architecture of the proposed RBF-STSMC, the complete system block diagram is depicted in Fig. 2. As shown in the figure, the composite control law is driven by the tracking error and the sliding variable. It consists of three primary modules: the nominal dynamic compensation based on prior knowledge, the RBF neural network feedforward term for online approximation of unknown dynamics, and the super-twisting robust term designed to suppress chattering and reject residual disturbances.</p>
</sec>
<sec id="Ch1.S3.SS2">
  <label>3.2</label><title>Closed-loop system restatement and disturbance boundedness analysis</title>
      <p id="d2e2166">Substituting the control law Eq. (6) into Eq. (5) yields the closed-loop sliding-surface dynamics:

            <disp-formula id="Ch1.E9" content-type="numbered"><label>9</label><mml:math id="M60" display="block"><mml:mrow><mml:mover accent="true"><mml:mi mathvariant="bold-italic">s</mml:mi><mml:mo mathvariant="normal">˙</mml:mo></mml:mover><mml:mo>=</mml:mo><mml:mo>-</mml:mo><mml:msup><mml:mover accent="true"><mml:mi mathvariant="bold">W</mml:mi><mml:mo stretchy="true" mathvariant="normal">̃</mml:mo></mml:mover><mml:mi>T</mml:mi></mml:msup><mml:mi mathvariant="bold">Φ</mml:mi><mml:mo>(</mml:mo><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mo>)</mml:mo><mml:mo>+</mml:mo><mml:mi mathvariant="bold-italic">δ</mml:mi><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo><mml:mo>+</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">u</mml:mi><mml:mi mathvariant="normal">st</mml:mi></mml:msub><mml:mo>,</mml:mo></mml:mrow></mml:math></disp-formula>

          where <inline-formula><mml:math id="M61" display="inline"><mml:mrow><mml:mover accent="true"><mml:mi mathvariant="bold">W</mml:mi><mml:mo stretchy="true" mathvariant="normal">̃</mml:mo></mml:mover><mml:mo>=</mml:mo><mml:mover accent="true"><mml:mi mathvariant="bold">W</mml:mi><mml:mo stretchy="true" mathvariant="normal">^</mml:mo></mml:mover><mml:mo>-</mml:mo><mml:msup><mml:mi mathvariant="bold">W</mml:mi><mml:mo>∗</mml:mo></mml:msup></mml:mrow></mml:math></inline-formula> is the weight estimation error, and <inline-formula><mml:math id="M62" display="inline"><mml:mrow><mml:mi mathvariant="bold-italic">δ</mml:mi><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo><mml:mo>=</mml:mo><mml:msubsup><mml:mi mathvariant="bold">M</mml:mi><mml:mn mathvariant="normal">0</mml:mn><mml:mrow><mml:mo>-</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:msubsup><mml:mo>(</mml:mo><mml:mi mathvariant="bold-italic">q</mml:mi><mml:mo>)</mml:mo><mml:mfenced close=")" open="("><mml:mrow><mml:mi mathvariant="bold-italic">ε</mml:mi><mml:mo>(</mml:mo><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mo>)</mml:mo><mml:mo>+</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">τ</mml:mi><mml:mi mathvariant="normal">d</mml:mi></mml:msub></mml:mrow></mml:mfenced></mml:mrow></mml:math></inline-formula> is a bounded composite term comprising the network approximation error and external disturbance.</p>
      <p id="d2e2294">We define the total lumped disturbance on the sliding surface as <inline-formula><mml:math id="M63" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="bold">Δ</mml:mi><mml:mi mathvariant="normal">total</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo><mml:mo>=</mml:mo><mml:mo>-</mml:mo><mml:msup><mml:mover accent="true"><mml:mi mathvariant="bold">W</mml:mi><mml:mo mathvariant="normal" stretchy="true">̃</mml:mo></mml:mover><mml:mi>T</mml:mi></mml:msup><mml:mi mathvariant="bold">Φ</mml:mi><mml:mo>(</mml:mo><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mo>)</mml:mo><mml:mo>+</mml:mo><mml:mi mathvariant="bold-italic">δ</mml:mi><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>. Given the projection operator (<inline-formula><mml:math id="M64" display="inline"><mml:mrow><mml:mo>‖</mml:mo><mml:mover accent="true"><mml:mi mathvariant="bold">W</mml:mi><mml:mo mathvariant="normal" stretchy="true">^</mml:mo></mml:mover><mml:msub><mml:mo>‖</mml:mo><mml:mi mathvariant="normal">F</mml:mi></mml:msub><mml:mo>≤</mml:mo><mml:msub><mml:mi>W</mml:mi><mml:mo>max⁡</mml:mo></mml:msub></mml:mrow></mml:math></inline-formula>) and assumption 2, the <inline-formula><mml:math id="M65" display="inline"><mml:mi>i</mml:mi></mml:math></inline-formula>th component of <inline-formula><mml:math id="M66" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="bold">Δ</mml:mi><mml:mi mathvariant="normal">total</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> strictly satisfies

            <disp-formula id="Ch1.E10" content-type="numbered"><label>10</label><mml:math id="M67" display="block"><mml:mrow><mml:mo>|</mml:mo><mml:msub><mml:mi mathvariant="normal">Δ</mml:mi><mml:mrow><mml:mi mathvariant="normal">total</mml:mi><mml:mo>,</mml:mo><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo><mml:mo>|</mml:mo><mml:mo>≤</mml:mo><mml:msub><mml:mi>L</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="M68" display="inline"><mml:mrow><mml:msub><mml:mi>L</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>&gt;</mml:mo><mml:mn mathvariant="normal">0</mml:mn></mml:mrow></mml:math></inline-formula> is an existing but unknown constant bound, providing a rigorous prerequisite for robust control.</p>
</sec>
<sec id="Ch1.S3.SS3">
  <label>3.3</label><title>Finite-time convergence proof of the super-twisting algorithm</title>
      <p id="d2e2453"><italic>Theorem 1</italic>. We consider system (2) to satisfy assumptions 1–2. Under the sliding surface (4), control law (6)–(7), and adaptive law (8), if the gains <inline-formula><mml:math id="M69" 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> and <inline-formula><mml:math id="M70" 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> satisfy certain conditions then the sliding variable <inline-formula><mml:math id="M71" display="inline"><mml:mi mathvariant="bold-italic">s</mml:mi></mml:math></inline-formula> converges to the origin in finite time.</p>
      <p id="d2e2487"><italic>Proof.</italic> We write the <inline-formula><mml:math id="M72" display="inline"><mml:mi>i</mml:mi></mml:math></inline-formula> subsystem dynamics in the standard super-twisting form:

            <disp-formula id="Ch1.E11" content-type="numbered"><label>11</label><mml:math id="M73" display="block"><mml:mrow><mml:mfenced open="{" close=""><mml:mtable class="array" columnalign="left"><mml:mtr><mml:mtd><mml:mrow><mml:msub><mml:mover accent="true"><mml:mi>s</mml:mi><mml:mo mathvariant="normal">˙</mml:mo></mml:mover><mml:mi>i</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mo>-</mml:mo><mml:msub><mml:mi mathvariant="italic">α</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>|</mml:mo><mml:msub><mml:mi>s</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:msup><mml:mo>|</mml:mo><mml:mrow><mml:mn mathvariant="normal">1</mml:mn><mml:mo>/</mml:mo><mml:mn mathvariant="normal">2</mml:mn></mml:mrow></mml:msup><mml:mi mathvariant="normal">sign</mml:mi><mml:mo>(</mml:mo><mml:msub><mml:mi>s</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>)</mml:mo><mml:mo>+</mml:mo><mml:msub><mml:mi>v</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi mathvariant="normal">Δ</mml:mi><mml:mrow><mml:mi mathvariant="normal">total</mml:mi><mml:mo>,</mml:mo><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:msub><mml:mover accent="true"><mml:mi>v</mml:mi><mml:mo mathvariant="normal">˙</mml:mo></mml:mover><mml:mi>i</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mo>-</mml:mo><mml:msub><mml:mi mathvariant="italic">β</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mi mathvariant="normal">sign</mml:mi><mml:mo>(</mml:mo><mml:msub><mml:mi>s</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>)</mml:mo></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="M74" display="inline"><mml:mrow><mml:msub><mml:mi>v</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> is the super-twisting integral state. From Eq. (10), the disturbance satisfies <inline-formula><mml:math id="M75" display="inline"><mml:mrow><mml:mo>|</mml:mo><mml:msub><mml:mi mathvariant="normal">Δ</mml:mi><mml:mrow><mml:mi mathvariant="normal">total</mml:mi><mml:mo>,</mml:mo><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo><mml:mo>|</mml:mo><mml:mo>≤</mml:mo><mml:msub><mml:mi>L</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>.</p>
      <p id="d2e2658">We construct the transformed state vector <inline-formula><mml:math id="M76" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">ζ</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mo>[</mml:mo><mml:msub><mml:mi mathvariant="italic">ζ</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:msub><mml:mi mathvariant="italic">ζ</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mn mathvariant="normal">2</mml:mn></mml:mrow></mml:msub><mml:msup><mml:mo>]</mml:mo><mml:mi>T</mml:mi></mml:msup><mml:mo>=</mml:mo><mml:msup><mml:mfenced close="]" open="["><mml:mrow><mml:mo>|</mml:mo><mml:msub><mml:mi>s</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:msup><mml:mo>|</mml:mo><mml:mrow><mml:mn mathvariant="normal">1</mml:mn><mml:mo>/</mml:mo><mml:mn mathvariant="normal">2</mml:mn></mml:mrow></mml:msup><mml:mi mathvariant="normal">sign</mml:mi><mml:mo>(</mml:mo><mml:msub><mml:mi>s</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>)</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mi>v</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:mfenced><mml:mi>T</mml:mi></mml:msup></mml:mrow></mml:math></inline-formula>. Differentiating and writing in a matrix form gives

            <disp-formula id="Ch1.E12" content-type="numbered"><label>12</label><mml:math id="M77" display="block"><mml:mrow><mml:msub><mml:mover accent="true"><mml:mi mathvariant="bold-italic">ζ</mml:mi><mml:mo mathvariant="normal">˙</mml:mo></mml:mover><mml:mi>i</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mstyle displaystyle="true"><mml:mfrac style="display"><mml:mn mathvariant="normal">1</mml:mn><mml:mrow><mml:mn mathvariant="normal">2</mml:mn><mml:mo>|</mml:mo><mml:msub><mml:mi mathvariant="italic">ζ</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:mrow></mml:mfrac></mml:mstyle><mml:mfenced open="(" close=")"><mml:mrow><mml:msub><mml:mi mathvariant="bold">A</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:msub><mml:mi mathvariant="bold-italic">ζ</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>+</mml:mo><mml:mi mathvariant="bold">B</mml:mi><mml:msub><mml:mi mathvariant="normal">Δ</mml:mi><mml:mrow><mml:mi mathvariant="normal">total</mml:mi><mml:mo>,</mml:mo><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mfenced><mml:mo>,</mml:mo></mml:mrow></mml:math></disp-formula>

          where

            <disp-formula id="Ch1.Ex1"><mml:math id="M78" display="block"><mml:mrow><mml:msub><mml:mi mathvariant="bold">A</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mfenced close="]" open="["><mml:mtable class="array" columnalign="center center"><mml:mtr><mml:mtd><mml:mrow><mml:mo>-</mml:mo><mml:msub><mml:mi mathvariant="italic">α</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:mtd><mml:mtd><mml:mn mathvariant="normal">1</mml:mn></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:mo>-</mml:mo><mml:mn mathvariant="normal">2</mml:mn><mml:msub><mml:mi mathvariant="italic">β</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:mtd><mml:mtd><mml:mn mathvariant="normal">0</mml:mn></mml:mtd></mml:mtr></mml:mtable></mml:mfenced><mml:mo>,</mml:mo><mml:mspace width="1em" linebreak="nobreak"/><mml:mi mathvariant="bold">B</mml:mi><mml:mo>=</mml:mo><mml:mfenced close="]" open="["><mml:mtable class="array" columnalign="center"><mml:mtr><mml:mtd><mml:mn mathvariant="normal">1</mml:mn></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>

          We consider the strongly robust Lyapunov function,

            <disp-formula id="Ch1.E13" content-type="numbered"><label>13</label><mml:math id="M79" display="block"><mml:mrow><mml:msub><mml:mi>V</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">ζ</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>)</mml:mo><mml:mo>=</mml:mo><mml:msubsup><mml:mi mathvariant="bold-italic">ζ</mml:mi><mml:mi>i</mml:mi><mml:mi>T</mml:mi></mml:msubsup><mml:msub><mml:mi mathvariant="bold">P</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:msub><mml:mi mathvariant="bold-italic">ζ</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>,</mml:mo></mml:mrow></mml:math></disp-formula>

          with

            <disp-formula id="Ch1.Ex2"><mml:math id="M80" display="block"><mml:mrow><mml:msub><mml:mi mathvariant="bold">P</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mstyle displaystyle="true"><mml:mfrac style="display"><mml:mn mathvariant="normal">1</mml:mn><mml:mn mathvariant="normal">2</mml:mn></mml:mfrac></mml:mstyle><mml:mfenced open="[" close="]"><mml:mtable class="array" columnalign="center center"><mml:mtr><mml:mtd><mml:mrow><mml:mn mathvariant="normal">4</mml:mn><mml:msub><mml:mi mathvariant="italic">β</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>+</mml:mo><mml:msubsup><mml:mi mathvariant="italic">α</mml:mi><mml:mi>i</mml:mi><mml:mn mathvariant="normal">2</mml:mn></mml:msubsup></mml:mrow></mml:mtd><mml:mtd><mml:mrow><mml:mo>-</mml:mo><mml:msub><mml:mi mathvariant="italic">α</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:mo>-</mml:mo><mml:msub><mml:mi mathvariant="italic">α</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:mtd><mml:mtd><mml:mn mathvariant="normal">2</mml:mn></mml:mtd></mml:mtr></mml:mtable></mml:mfenced><mml:mo>,</mml:mo></mml:mrow></mml:math></disp-formula>

          to be strictly symmetric positive definite. Differentiating <inline-formula><mml:math id="M81" display="inline"><mml:mrow><mml:msub><mml:mi>V</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> along the system trajectory yields the following:

            <disp-formula id="Ch1.E14" content-type="numbered"><label>14</label><mml:math id="M82" display="block"><mml:mtable class="split" rowspacing="0.2ex" displaystyle="true" columnalign="right left"><mml:mtr><mml:mtd><mml:mrow><mml:msub><mml:mover accent="true"><mml:mi>V</mml:mi><mml:mo mathvariant="normal">˙</mml:mo></mml:mover><mml:mi>i</mml:mi></mml:msub><mml:mo>=</mml:mo></mml:mrow></mml:mtd><mml:mtd><mml:mrow><mml:mstyle displaystyle="true"><mml:mfrac style="display"><mml:mn mathvariant="normal">1</mml:mn><mml:mrow><mml:mn mathvariant="normal">2</mml:mn><mml:mo>|</mml:mo><mml:msub><mml:mi mathvariant="italic">ζ</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:mrow></mml:mfrac></mml:mstyle><mml:msubsup><mml:mi mathvariant="bold-italic">ζ</mml:mi><mml:mi>i</mml:mi><mml:mi>T</mml:mi></mml:msubsup><mml:mfenced close=")" open="("><mml:mrow><mml:msubsup><mml:mi mathvariant="bold">A</mml:mi><mml:mi>i</mml:mi><mml:mi>T</mml:mi></mml:msubsup><mml:msub><mml:mi mathvariant="bold">P</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi mathvariant="bold">P</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:msub><mml:mi mathvariant="bold">A</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:mfenced><mml:msub><mml:mi mathvariant="bold-italic">ζ</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd/><mml:mtd><mml:mrow><mml:mo>+</mml:mo><mml:mstyle displaystyle="true"><mml:mfrac style="display"><mml:mn mathvariant="normal">1</mml:mn><mml:mrow><mml:mo>|</mml:mo><mml:msub><mml:mi mathvariant="italic">ζ</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:mrow></mml:mfrac></mml:mstyle><mml:msub><mml:mi mathvariant="normal">Δ</mml:mi><mml:mrow><mml:mi mathvariant="normal">total</mml:mi><mml:mo>,</mml:mo><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo><mml:msup><mml:mi mathvariant="bold">B</mml:mi><mml:mi>T</mml:mi></mml:msup><mml:msub><mml:mi mathvariant="bold">P</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:msub><mml:mi mathvariant="bold-italic">ζ</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>.</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>

          Since <inline-formula><mml:math id="M83" display="inline"><mml:mrow><mml:mo>|</mml:mo><mml:msub><mml:mi mathvariant="normal">Δ</mml:mi><mml:mrow><mml:mi mathvariant="normal">total</mml:mi><mml:mo>,</mml:mo><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo><mml:mo>|</mml:mo><mml:mo>≤</mml:mo><mml:msub><mml:mi>L</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>, algebraic bounding arguments show that if the control gains satisfy

            <disp-formula id="Ch1.E15" content-type="numbered"><label>15</label><mml:math id="M84" display="block"><mml:mrow><mml:msub><mml:mi mathvariant="italic">α</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>&gt;</mml:mo><mml:mn mathvariant="normal">1.5</mml:mn><mml:msqrt><mml:mrow><mml:msub><mml:mi>L</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:msqrt><mml:mo>,</mml:mo><mml:mspace linebreak="nobreak" width="1em"/><mml:msub><mml:mi mathvariant="italic">β</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>&gt;</mml:mo><mml:mn mathvariant="normal">1.1</mml:mn><mml:msub><mml:mi>L</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:math></disp-formula>

          then there exists a positive definite matrix<inline-formula><mml:math id="M85" display="inline"><mml:mrow><mml:msub><mml:mover accent="true"><mml:mi mathvariant="bold-italic">Q</mml:mi><mml:mo stretchy="true" mathvariant="normal">̃</mml:mo></mml:mover><mml:mi>i</mml:mi></mml:msub><mml:mo>&gt;</mml:mo><mml:mn mathvariant="normal">0</mml:mn></mml:mrow></mml:math></inline-formula> such that

            <disp-formula id="Ch1.E16" content-type="numbered"><label>16</label><mml:math id="M86" display="block"><mml:mrow><mml:msub><mml:mover accent="true"><mml:mi>V</mml:mi><mml:mo mathvariant="normal">˙</mml:mo></mml:mover><mml:mi>i</mml:mi></mml:msub><mml:mo>≤</mml:mo><mml:mo>-</mml:mo><mml:mstyle displaystyle="true"><mml:mfrac style="display"><mml:mn mathvariant="normal">1</mml:mn><mml:mrow><mml:mn mathvariant="normal">2</mml:mn><mml:mo>|</mml:mo><mml:msub><mml:mi mathvariant="italic">ζ</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:mrow></mml:mfrac></mml:mstyle><mml:msubsup><mml:mi mathvariant="bold-italic">ζ</mml:mi><mml:mi>i</mml:mi><mml:mi>T</mml:mi></mml:msubsup><mml:msub><mml:mover accent="true"><mml:mi mathvariant="bold-italic">Q</mml:mi><mml:mo mathvariant="normal" stretchy="true">̃</mml:mo></mml:mover><mml:mi>i</mml:mi></mml:msub><mml:msub><mml:mi mathvariant="bold-italic">ζ</mml:mi><mml:mi>i</mml:mi></mml:msub><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:mo>min⁡</mml:mo></mml:msub><mml:mo>(</mml:mo><mml:msub><mml:mover accent="true"><mml:mi mathvariant="bold-italic">Q</mml:mi><mml:mo mathvariant="normal" stretchy="true">̃</mml:mo></mml:mover><mml:mi>i</mml:mi></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mn mathvariant="normal">2</mml:mn><mml:mo>|</mml:mo><mml:msub><mml:mi mathvariant="italic">ζ</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:mrow></mml:mfrac></mml:mstyle><mml:mo>‖</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">ζ</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:msup><mml:mo>‖</mml:mo><mml:mn mathvariant="normal">2</mml:mn></mml:msup><mml:mo>.</mml:mo></mml:mrow></mml:math></disp-formula>

          Using Rayleigh quotient inequalities <inline-formula><mml:math id="M87" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="italic">λ</mml:mi><mml:mo>min⁡</mml:mo></mml:msub><mml:mo>(</mml:mo><mml:msub><mml:mi mathvariant="bold">P</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>)</mml:mo><mml:mo>‖</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">ζ</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:msup><mml:mo>‖</mml:mo><mml:mn mathvariant="normal">2</mml:mn></mml:msup><mml:mo>≤</mml:mo><mml:msub><mml:mi>V</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>≤</mml:mo><mml:msub><mml:mi mathvariant="italic">λ</mml:mi><mml:mo>max⁡</mml:mo></mml:msub><mml:mo>(</mml:mo><mml:msub><mml:mi mathvariant="bold">P</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>)</mml:mo><mml:mo>‖</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">ζ</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:msup><mml:mo>‖</mml:mo><mml:mn mathvariant="normal">2</mml:mn></mml:msup></mml:mrow></mml:math></inline-formula> and the fact that <inline-formula><mml:math id="M88" display="inline"><mml:mrow><mml:mo>|</mml:mo><mml:msub><mml:mi mathvariant="italic">ζ</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:mo>≤</mml:mo><mml:mo>‖</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">ζ</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>‖</mml:mo><mml:mo>≤</mml:mo><mml:msqrt><mml:mrow><mml:msub><mml:mi>V</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>/</mml:mo><mml:msub><mml:mi mathvariant="italic">λ</mml:mi><mml:mo>min⁡</mml:mo></mml:msub><mml:mo>(</mml:mo><mml:msub><mml:mi mathvariant="bold">P</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:msqrt></mml:mrow></mml:math></inline-formula>, we obtain

            <disp-formula id="Ch1.E17" content-type="numbered"><label>17</label><mml:math id="M89" display="block"><mml:mrow><mml:msub><mml:mover accent="true"><mml:mi>V</mml:mi><mml:mo mathvariant="normal">˙</mml:mo></mml:mover><mml:mi>i</mml:mi></mml:msub><mml:mo>≤</mml:mo><mml:mo>-</mml:mo><mml:msub><mml:mi mathvariant="italic">γ</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:msubsup><mml:mi>V</mml:mi><mml:mi>i</mml:mi><mml:mrow><mml:mn mathvariant="normal">1</mml:mn><mml:mo>/</mml:mo><mml:mn mathvariant="normal">2</mml:mn></mml:mrow></mml:msubsup><mml:mo>,</mml:mo></mml:mrow></mml:math></disp-formula>

          where

            <disp-formula id="Ch1.Ex3"><mml:math id="M90" display="block"><mml:mrow><mml:msub><mml:mi mathvariant="italic">γ</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mstyle displaystyle="true"><mml:mfrac style="display"><mml:mrow><mml:msub><mml:mi mathvariant="italic">λ</mml:mi><mml:mo>min⁡</mml:mo></mml:msub><mml:mo>(</mml:mo><mml:msub><mml:mover accent="true"><mml:mi mathvariant="bold-italic">Q</mml:mi><mml:mo mathvariant="normal" stretchy="true">̃</mml:mo></mml:mover><mml:mi>i</mml:mi></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:msub><mml:mi mathvariant="italic">λ</mml:mi><mml:mrow><mml:msup><mml:mo>max⁡</mml:mo><mml:mrow><mml:mn mathvariant="normal">1</mml:mn><mml:mo>/</mml:mo><mml:mn mathvariant="normal">2</mml:mn></mml:mrow></mml:msup></mml:mrow></mml:msub><mml:mo>(</mml:mo><mml:msub><mml:mi mathvariant="bold">P</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>)</mml:mo><mml:msqrt><mml:mrow><mml:msub><mml:mi mathvariant="italic">λ</mml:mi><mml:mo>max⁡</mml:mo></mml:msub><mml:mo>(</mml:mo><mml:msub><mml:mi mathvariant="bold">P</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:msqrt></mml:mrow></mml:mfrac></mml:mstyle><mml:mo>&gt;</mml:mo><mml:mn mathvariant="normal">0</mml:mn><mml:mo>.</mml:mo></mml:mrow></mml:math></disp-formula></p>
      <p id="d2e3562">By the Lyapunov finite-time stability comparison lemma, Eq. (17) implies that <inline-formula><mml:math id="M91" display="inline"><mml:mrow><mml:msub><mml:mi>V</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> converges to zero in finite time <inline-formula><mml:math id="M92" display="inline"><mml:mrow><mml:msub><mml:mi>T</mml:mi><mml:mi>r</mml:mi></mml:msub><mml:mo>≤</mml:mo><mml:mstyle displaystyle="false"><mml:mfrac style="text"><mml:mrow><mml:mn mathvariant="normal">2</mml:mn><mml:msubsup><mml:mi>V</mml:mi><mml:mi>i</mml:mi><mml:mrow><mml:mn mathvariant="normal">1</mml:mn><mml:mo>/</mml:mo><mml:mn mathvariant="normal">2</mml:mn></mml:mrow></mml:msubsup><mml:mo>(</mml:mo><mml:mn mathvariant="normal">0</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:msub><mml:mi mathvariant="italic">γ</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:mfrac></mml:mstyle></mml:mrow></mml:math></inline-formula>. Consequently, the transformed state <inline-formula><mml:math id="M93" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">ζ</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> (i.e., <inline-formula><mml:math id="M94" display="inline"><mml:mrow><mml:msub><mml:mi>s</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math id="M95" display="inline"><mml:mrow><mml:msub><mml:mi>v</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>) converges to the origin in finite time. Then, from the linear sliding surface of Eq. (4), the tracking error <inline-formula><mml:math id="M96" display="inline"><mml:mi mathvariant="bold-italic">e</mml:mi></mml:math></inline-formula> converges asymptotically to zero.</p>
      <p id="d2e3660"><italic>Remark 4.</italic> Conventional adaptive SMC often uses the adaptive law to exactly cancel uncertainty terms, easily leading to gain drift. In contrast, the decoupled proof framework adopted here utilizes the RBF network to physically reduce the total disturbance bound <inline-formula><mml:math id="M97" display="inline"><mml:mi mathvariant="bold-italic">L</mml:mi></mml:math></inline-formula>. Consequently, the required super-twisting gains (<inline-formula><mml:math id="M98" display="inline"><mml:mi mathvariant="bold-italic">α</mml:mi></mml:math></inline-formula>, <inline-formula><mml:math id="M99" display="inline"><mml:mi mathvariant="bold-italic">β</mml:mi></mml:math></inline-formula>) can be substantially relaxed, effectively reducing energy consumption and chattering while maintaining finite-time stability guarantees.</p>
</sec>
</sec>
<sec id="Ch1.S4">
  <label>4</label><title>Simulation verification</title>
<sec id="Ch1.S4.SS1">
  <label>4.1</label><title>Simulation object and parameter settings</title>
      <p id="d2e3702">The UR10 6-degree-of-freedom manipulator is taken as the simulation object, and the nominal dynamic parameters are adopted from the experimental identification results reported in Petrone et al. (2025). To simulate parameter uncertainties, the actual model introduces perturbations on the basis of the nominal one: the masses of joints 2 and 3 are increased by 20 %, the centers of mass are shifted, and the inertia is increased by 5 %, while joint 6 remains at its nominal value to reflect asymmetric uncertainty. To accurately capture the nonlinear friction characteristics (e.g., Coulomb and viscous friction) while avoiding the numerical chattering and algebraic loops caused by discontinuous signum functions in simulations, a smooth sigmoidal friction model is introduced. The friction torque <inline-formula><mml:math id="M100" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="italic">τ</mml:mi><mml:mrow><mml:mi mathvariant="normal">f</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant="normal">i</mml:mi></mml:mrow></mml:msub><mml:mo>(</mml:mo><mml:msub><mml:mover accent="true"><mml:mi mathvariant="bold-italic">q</mml:mi><mml:mo mathvariant="normal">˙</mml:mo></mml:mover><mml:mi>i</mml:mi></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> for the <inline-formula><mml:math id="M101" display="inline"><mml:mi>i</mml:mi></mml:math></inline-formula>th joint is formulated as <inline-formula><mml:math id="M102" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="italic">τ</mml:mi><mml:mrow><mml:mi mathvariant="normal">f</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant="normal">i</mml:mi></mml:mrow></mml:msub><mml:mo>(</mml:mo><mml:msub><mml:mover accent="true"><mml:mi mathvariant="bold-italic">q</mml:mi><mml:mo mathvariant="normal">˙</mml:mo></mml:mover><mml:mi>i</mml:mi></mml:msub><mml:mo>)</mml:mo><mml:mo>=</mml:mo><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>i</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>c</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:msub><mml:msub><mml:mover accent="true"><mml:mi mathvariant="bold-italic">q</mml:mi><mml:mo mathvariant="normal">˙</mml:mo></mml:mover><mml:mi>i</mml:mi></mml:msub><mml:mo>+</mml:mo><mml:mstyle displaystyle="false"><mml:mfrac style="text"><mml:mrow><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mn mathvariant="normal">3</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mn mathvariant="normal">1</mml:mn><mml:mo>+</mml:mo><mml:msup><mml:mi>e</mml:mi><mml:mrow><mml:mo>-</mml:mo><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mn mathvariant="normal">4</mml:mn></mml:mrow></mml:msub><mml:mo>(</mml:mo><mml:msub><mml:mover accent="true"><mml:mi mathvariant="bold-italic">q</mml:mi><mml:mo mathvariant="normal">˙</mml:mo></mml:mover><mml:mi>i</mml:mi></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mn mathvariant="normal">5</mml:mn></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:msup></mml:mrow></mml:mfrac></mml:mstyle></mml:mrow></mml:math></inline-formula>, where <inline-formula><mml:math id="M103" display="inline"><mml:mrow><mml:msub><mml:mover accent="true"><mml:mi mathvariant="bold-italic">q</mml:mi><mml:mo mathvariant="normal">˙</mml:mo></mml:mover><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> is the joint velocity, and <inline-formula><mml:math id="M104" display="inline"><mml:mrow><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> to <inline-formula><mml:math id="M105" display="inline"><mml:mrow><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mn mathvariant="normal">5</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> are the identified friction coefficients for each joint. Based on experimental data, the coefficient vectors <inline-formula><mml:math id="M106" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">c</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mo>[</mml:mo><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>i</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>c</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mn mathvariant="normal">2</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mn mathvariant="normal">3</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mn mathvariant="normal">4</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mn mathvariant="normal">5</mml:mn></mml:mrow></mml:msub><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula> for joints 1 to 6 are set as follows: joint 1 – [1.064, <inline-formula><mml:math id="M107" display="inline"><mml:mo>-</mml:mo></mml:math></inline-formula>1.006, 2.050, 7.946, <inline-formula><mml:math id="M108" display="inline"><mml:mo>-</mml:mo></mml:math></inline-formula>0.018]; joint 2 – [0.994, 0.956, <inline-formula><mml:math id="M109" display="inline"><mml:mo>-</mml:mo></mml:math></inline-formula>2.401, <inline-formula><mml:math id="M110" display="inline"><mml:mo>-</mml:mo></mml:math></inline-formula>59.953, <inline-formula><mml:math id="M111" display="inline"><mml:mo>-</mml:mo></mml:math></inline-formula>0.001]; joint 3 – [0.679, <inline-formula><mml:math id="M112" display="inline"><mml:mo>-</mml:mo></mml:math></inline-formula>0.812, 1.647, 19.825, <inline-formula><mml:math id="M113" display="inline"><mml:mo>-</mml:mo></mml:math></inline-formula>0.005]; joint 4 – [0.315, <inline-formula><mml:math id="M114" display="inline"><mml:mo>-</mml:mo></mml:math></inline-formula>0.176, 0.468, 134.898, <inline-formula><mml:math id="M115" display="inline"><mml:mo>-</mml:mo></mml:math></inline-formula>0.018]; joint 5 – [0.224, <inline-formula><mml:math id="M116" display="inline"><mml:mo>-</mml:mo></mml:math></inline-formula>0.192, 0.476, 331.442, <inline-formula><mml:math id="M117" display="inline"><mml:mo>-</mml:mo></mml:math></inline-formula>0.011]; and joint 6 – [0.235, <inline-formula><mml:math id="M118" display="inline"><mml:mo>-</mml:mo></mml:math></inline-formula>0.245, 0.598, 459.193, <inline-formula><mml:math id="M119" display="inline"><mml:mo>-</mml:mo></mml:math></inline-formula>0.013].</p>
      <p id="d2e4076">The external disturbance is defined as <inline-formula><mml:math id="M120" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">τ</mml:mi><mml:mi mathvariant="normal">d</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mn mathvariant="normal">0.5</mml:mn><mml:mi>sin⁡</mml:mi><mml:mo>(</mml:mo><mml:mn mathvariant="normal">2</mml:mn><mml:mi mathvariant="italic">π</mml:mi><mml:mi>t</mml:mi><mml:mo>)</mml:mo><mml:mo>⋅</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">I</mml:mi><mml:mn mathvariant="normal">6</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> N m. The disturbance amplitude of 0.5 N m is selected to represent typical unmodeled torques and load fluctuations. As shown in Fig. 3, a fixed-gain study with disturbance amplitudes of 0.1, 0.5, and 2.0 N m reveals that the method maintains reliable tracking (RMSE <inline-formula><mml:math id="M121" display="inline"><mml:mo>&lt;</mml:mo></mml:math></inline-formula> 0.005 rad) for disturbances up to at least 2.0 N m. For larger disturbances, the gains can be adjusted using Eq. (15) based on the estimated upper bound of the total disturbance <inline-formula><mml:math id="M122" display="inline"><mml:mrow><mml:msub><mml:mi>L</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>.</p>

      <fig id="F3"><label>Figure 3</label><caption><p id="d2e4133">Effect of disturbance amplitude on tracking error.</p></caption>
          <graphic xlink:href="https://ms.copernicus.org/articles/17/759/2026/ms-17-759-2026-f03.png"/>

        </fig>

      <p id="d2e4143">The desired trajectory starts from the initial pose <inline-formula><mml:math id="M123" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">q</mml:mi><mml:mn mathvariant="normal">0</mml:mn></mml:msub><mml:mo>=</mml:mo><mml:mo>[</mml:mo><mml:mn mathvariant="normal">0</mml:mn><mml:mo>,</mml:mo><mml:mo>-</mml:mo><mml:mi mathvariant="italic">π</mml:mi><mml:mo>/</mml:mo><mml:mn mathvariant="normal">2</mml:mn><mml:mo>,</mml:mo><mml:mn mathvariant="normal">0</mml:mn><mml:mo>,</mml:mo><mml:mo>-</mml:mo><mml:mi mathvariant="italic">π</mml:mi><mml:mo>/</mml:mo><mml:mn mathvariant="normal">2</mml:mn><mml:mo>,</mml:mo><mml:mn mathvariant="normal">0</mml:mn><mml:mo>,</mml:mo><mml:mn mathvariant="normal">0</mml:mn><mml:msup><mml:mo>]</mml:mo><mml:mi>T</mml:mi></mml:msup></mml:mrow></mml:math></inline-formula> rad and moves to the target pose <inline-formula><mml:math id="M124" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">q</mml:mi><mml:mi mathvariant="normal">f</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mo>[</mml:mo><mml:mn mathvariant="normal">0.316</mml:mn><mml:mo>,</mml:mo><mml:mn mathvariant="normal">0.672</mml:mn><mml:mo>,</mml:mo><mml:mn mathvariant="normal">0.506</mml:mn><mml:mo>,</mml:mo><mml:mn mathvariant="normal">0.672</mml:mn><mml:mo>,</mml:mo><mml:mn mathvariant="normal">0</mml:mn><mml:mo>,</mml:mo><mml:mn mathvariant="normal">1.255</mml:mn><mml:msup><mml:mo>]</mml:mo><mml:mi>T</mml:mi></mml:msup></mml:mrow></mml:math></inline-formula> rad. A fifth-order polynomial trajectory is adopted, with a motion duration of <inline-formula><mml:math id="M125" display="inline"><mml:mrow><mml:mi>T</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">10</mml:mn></mml:mrow></mml:math></inline-formula> s and a control period of <inline-formula><mml:math id="M126" display="inline"><mml:mrow><mml:mi mathvariant="normal">d</mml:mi><mml:mi>t</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">0.001</mml:mn></mml:mrow></mml:math></inline-formula> s. To prevent numerical overflow of the integral term in the super-twisting control (Eq. 7), saturation limits of <inline-formula><mml:math id="M127" display="inline"><mml:mo>±</mml:mo></mml:math></inline-formula>100 N m are applied to the integral state during the discrete-time simulation using Euler integration with step size <inline-formula><mml:math id="M128" display="inline"><mml:mrow><mml:mi mathvariant="normal">d</mml:mi><mml:mi>t</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">0.001</mml:mn></mml:mrow></mml:math></inline-formula> s. The controller parameters are as follows: <inline-formula><mml:math id="M129" 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: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">30</mml:mn><mml:mo>,</mml:mo><mml:mn mathvariant="normal">25</mml:mn><mml:mo>,</mml:mo><mml:mn mathvariant="normal">25</mml:mn><mml:mo>,</mml:mo><mml:mn mathvariant="normal">40</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>; super-twisting gains <inline-formula><mml:math id="M130" display="inline"><mml:mrow><mml:mi mathvariant="bold-italic">α</mml:mi><mml:mo>=</mml:mo><mml:mi mathvariant="normal">diag</mml:mi><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">10</mml:mn><mml:mo>,</mml:mo><mml:mn mathvariant="normal">25</mml:mn><mml:mo>,</mml:mo><mml:mn mathvariant="normal">25</mml:mn><mml:mo>,</mml:mo><mml:mn mathvariant="normal">80</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math id="M131" display="inline"><mml:mrow><mml:mi mathvariant="bold-italic">β</mml:mi><mml:mo>=</mml:mo><mml:mi mathvariant="normal">diag</mml:mi><mml:mo>(</mml:mo><mml:mn mathvariant="normal">20</mml:mn><mml:mo>,</mml:mo><mml:mn mathvariant="normal">20</mml:mn><mml:mo>,</mml:mo><mml:mn mathvariant="normal">20</mml:mn><mml:mo>,</mml:mo><mml:mn mathvariant="normal">50</mml:mn><mml:mo>,</mml:mo><mml:mn mathvariant="normal">50</mml:mn><mml:mo>,</mml:mo><mml:mn mathvariant="normal">150</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>; RBF network hidden layer nodes <inline-formula><mml:math id="M132" display="inline"><mml:mrow><mml:mi>N</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">120</mml:mn></mml:mrow></mml:math></inline-formula>; centers are obtained by <inline-formula><mml:math id="M133" display="inline"><mml:mi>K</mml:mi></mml:math></inline-formula>-means clustering from trajectory data; widths are set to the average distance between all centers; learning rate <inline-formula><mml:math id="M134" display="inline"><mml:mrow><mml:mi mathvariant="bold">Γ</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">0.5</mml:mn><mml:mi mathvariant="bold-italic">I</mml:mi></mml:mrow></mml:math></inline-formula>; and weight upper bound <inline-formula><mml:math id="M135" display="inline"><mml:mrow><mml:msub><mml:mi>W</mml:mi><mml:mo>max⁡</mml:mo></mml:msub><mml:mo>=</mml:mo><mml:mn mathvariant="normal">200</mml:mn></mml:mrow></mml:math></inline-formula>. The weight upper bound <inline-formula><mml:math id="M136" display="inline"><mml:mrow><mml:msub><mml:mi>W</mml:mi><mml:mo>max⁡</mml:mo></mml:msub><mml:mo>=</mml:mo><mml:mn mathvariant="normal">200</mml:mn></mml:mrow></mml:math></inline-formula> is empirically chosen based on the estimated Frobenius norm of the ideal weight matrix. As shown in Fig. 4, a sensitivity analysis with <inline-formula><mml:math id="M137" display="inline"><mml:mrow><mml:msub><mml:mi>W</mml:mi><mml:mo>max⁡</mml:mo></mml:msub><mml:mo>=</mml:mo><mml:mn mathvariant="normal">50</mml:mn></mml:mrow></mml:math></inline-formula>, 100, 200, and 400 shows that the average tracking RMSE remains 0.00054 rad, indicating that the control performance is largely insensitive to <inline-formula><mml:math id="M138" display="inline"><mml:mrow><mml:msub><mml:mi>W</mml:mi><mml:mo>max⁡</mml:mo></mml:msub></mml:mrow></mml:math></inline-formula> as long as it is set sufficiently large.</p>

      <fig id="F4"><label>Figure 4</label><caption><p id="d2e4501">Sensitivity of tracking error to <inline-formula><mml:math id="M139" display="inline"><mml:mrow><mml:msub><mml:mi>W</mml:mi><mml:mo>max⁡</mml:mo></mml:msub></mml:mrow></mml:math></inline-formula>.</p></caption>
          <graphic xlink:href="https://ms.copernicus.org/articles/17/759/2026/ms-17-759-2026-f04.png"/>

        </fig>

</sec>
<sec id="Ch1.S4.SS2">
  <label>4.2</label><title>Simulation Results and Analysis</title>
      <p id="d2e4529">Figure 5 shows the time evolution of position tracking errors for each joint under three control schemes: pure RBF, SMC, and the proposed composite RBF-STSMC strategy. Under pure RBF control, the lack of a sliding-mode robust term leads to significant deterioration in tracking accuracy when facing parameter perturbations and external disturbances. As shown in Fig. 5a, the steady-state errors of joints 4, 5, and 6 are as high as 0.7108, 0.8159, and 0.4795 rad, respectively, while their maximum tracking errors reach 1.2001, 0.8865, and 1.0151 rad. This indicates that an RBF neural network alone lacks effective disturbance rejection capability without sliding-mode compensation. The SMC strategy achieves significantly better tracking accuracy due to the robust action of its fixed-gain switching term; as shown in Fig. 5b, the steady-state errors of joints 4 and 5 drop to 0.0011 and 0.0077 rad, respectively. In contrast, the proposed RBF-STSMC composite strategy exhibits superior tracking accuracy on all joints. As shown in Fig. 5c, the steady-state errors of joints 4 and 5 are further reduced to 0.0005 and 0.0017 rad, representing improvements of over 50 % and 78 % compared to pure SMC, respectively. Except for joint 5, all other joints achieve steady-state errors better than <inline-formula><mml:math id="M140" display="inline"><mml:mrow><mml:mn mathvariant="normal">1</mml:mn><mml:mo>×</mml:mo><mml:msup><mml:mn mathvariant="normal">10</mml:mn><mml:mrow><mml:mo>-</mml:mo><mml:mn mathvariant="normal">3</mml:mn></mml:mrow></mml:msup></mml:mrow></mml:math></inline-formula> rad, strongly verifying the fast convergence and robust disturbance attenuation capability of the proposed method.</p>

      <fig id="F5" specific-use="star"><label>Figure 5</label><caption><p id="d2e4552">Joint position tracking error analysis.</p></caption>
          <graphic xlink:href="https://ms.copernicus.org/articles/17/759/2026/ms-17-759-2026-f05.png"/>

        </fig>

      <fig id="F6" specific-use="star"><label>Figure 6</label><caption><p id="d2e4563">Analysis of sliding-mode surface convergence process.</p></caption>
          <graphic xlink:href="https://ms.copernicus.org/articles/17/759/2026/ms-17-759-2026-f06.png"/>

        </fig>

      <p id="d2e4573">Figure 6 shows the time histories of the sliding variables <inline-formula><mml:math id="M141" display="inline"><mml:mrow><mml:msub><mml:mi>s</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> for each joint under the SMC and RBF-STSMC strategies. Both methods guarantee boundedness of the sliding variables. For the proposed RBF-STSMC composite strategy, the maximum absolute values <inline-formula><mml:math id="M142" display="inline"><mml:mrow><mml:mo>|</mml:mo><mml:msub><mml:mi>s</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>|</mml:mo></mml:mrow></mml:math></inline-formula> of the sliding variables for joints 4, 5, and 6 are 0.1483, 0.1152, and 0.0592, respectively, whereas corresponding values for pure SMC are 0.2703, 0.9733, and 0.0639. Moreover, the composite method reduces the peak sliding variable of joint 5 by 88 %. The composite controller exhibits excellent transient response performance, with sliding-surface values being quickly constrained within a narrow boundary layer. This advantage stems from the finite-time convergence of the super-twisting control law and the RBF network's fast compensation for unknown nonlinearities. In contrast, although the pure SMC strategy eventually converges, its fixed-gain structure struggles to adapt to time-varying uncertainties, leading to larger transient deviations in the sliding surface.</p>
      <p id="d2e4602">As shown in Fig. 7, the maximum torque among the three methods occurs at joint 2, with values of 63.13 N m (RBF), 62.13 N m (SMC), and 62.24 N m (RBF-STSMC). All peak torques are well below the preset actuator saturation limits. However, the qualitative characteristics of the torque signals differ fundamentally. The proposed RBF-STSMC outputs a continuous and smooth control torque, free of the high-frequency chattering commonly observed in traditional SMC. It achieves significantly better tracking accuracy alongside smooth control signals, indicating strong engineering feasibility.</p>

      <fig id="F7"><label>Figure 7</label><caption><p id="d2e4607">Analysis of control torque curve.</p></caption>
          <graphic xlink:href="https://ms.copernicus.org/articles/17/759/2026/ms-17-759-2026-f07.png"/>

        </fig>

      <p id="d2e4616">Figure 8 compares the evolution of the Frobenius norm of the RBF weight matrix under pure RBF and the proposed RBF-STSMC composite control configurations. Under pure RBF control, the weight norm exhibits a significant growth trend, reaching a final value of 5.72. This reflects the network's attempt to independently learn all unknown system dynamics and disturbance characteristics without the aid of a robust control term. Under the proposed RBF-STSMC strategy, the weight norm stabilizes at 0.12 after an initial 3.7 s transient growth. This low norm value is attributed to effective synergy: the super-twisting sliding-mode term undertakes the main disturbance rejection task, thereby limiting the neural network's role to fine compensation of unmodeled dynamics.</p>

      <fig id="F8"><label>Figure 8</label><caption><p id="d2e4621">Evolution of neural network weight norm.</p></caption>
          <graphic xlink:href="https://ms.copernicus.org/articles/17/759/2026/ms-17-759-2026-f08.png"/>

        </fig>

<table-wrap id="T1" specific-use="star"><label>Table 1</label><caption><p id="d2e4634">ITAE values for each joint under different controllers.</p></caption><oasis:table frame="topbot"><oasis:tgroup cols="8">
     <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:colspec colnum="7" colname="col7" align="right"/>
     <oasis:colspec colnum="8" colname="col8" align="right"/>
     <oasis:thead>
       <oasis:row rowsep="1">
         <oasis:entry colname="col1">Controller</oasis:entry>
         <oasis:entry colname="col2">J1 ITAE</oasis:entry>
         <oasis:entry colname="col3">J2 ITAE</oasis:entry>
         <oasis:entry colname="col4">J3 ITAE</oasis:entry>
         <oasis:entry colname="col5">J4 ITAE</oasis:entry>
         <oasis:entry colname="col6">J5 ITAE</oasis:entry>
         <oasis:entry colname="col7">J6 ITAE</oasis:entry>
         <oasis:entry colname="col8">Sum</oasis:entry>
       </oasis:row>
     </oasis:thead>
     <oasis:tbody>
       <oasis:row>
         <oasis:entry colname="col1">RBF-STSMC</oasis:entry>
         <oasis:entry colname="col2">0.0</oasis:entry>
         <oasis:entry colname="col3">0.0</oasis:entry>
         <oasis:entry colname="col4">0.2</oasis:entry>
         <oasis:entry colname="col5">7.5</oasis:entry>
         <oasis:entry colname="col6">82.6</oasis:entry>
         <oasis:entry colname="col7">2.6</oasis:entry>
         <oasis:entry colname="col8">93.0</oasis:entry>
       </oasis:row>
       <oasis:row>
         <oasis:entry colname="col1">SMC</oasis:entry>
         <oasis:entry colname="col2">0.0</oasis:entry>
         <oasis:entry colname="col3">0.0</oasis:entry>
         <oasis:entry colname="col4">0.9</oasis:entry>
         <oasis:entry colname="col5">25.8</oasis:entry>
         <oasis:entry colname="col6">639.9</oasis:entry>
         <oasis:entry colname="col7">3.5</oasis:entry>
         <oasis:entry colname="col8">670.1</oasis:entry>
       </oasis:row>
       <oasis:row>
         <oasis:entry colname="col1">RBF</oasis:entry>
         <oasis:entry colname="col2">757.4</oasis:entry>
         <oasis:entry colname="col3">425.4</oasis:entry>
         <oasis:entry colname="col4">790.2</oasis:entry>
         <oasis:entry colname="col5">11997.7</oasis:entry>
         <oasis:entry colname="col6">12055.3</oasis:entry>
         <oasis:entry colname="col7">7491.1</oasis:entry>
         <oasis:entry colname="col8">33517.1</oasis:entry>
       </oasis:row>
     </oasis:tbody>
   </oasis:tgroup></oasis:table></table-wrap>

      <p id="d2e4777">Figure 9 shows the three-dimensional Cartesian space trajectory of the end effector. This simulation is a point-to-point joint-space motion, with start and end points marked by a green circle and red triangle. The pure RBF controller yields an unacceptable steady-state Cartesian error of 0.1031 m, with a maximum deviation of 0.1444 m. The pure SMC method reduces the steady-state error to 0.0007 m, while the proposed RBF-STSMC composite method further improves it to 0.0002 m. These results fully confirm that the composite controller's joint-space error attenuation effectively transfers to the operational space, ensuring that the end effector tracks the prescribed path without noticeable overshoot or residual oscillation, ultimately achieving precise control.</p>

      <fig id="F9"><label>Figure 9</label><caption><p id="d2e4782">End effector trajectory.</p></caption>
          <graphic xlink:href="https://ms.copernicus.org/articles/17/759/2026/ms-17-759-2026-f09.png"/>

        </fig>

      <p id="d2e4791">To further quantify control performance, the integral of time-weighted absolute error (ITAE) is adopted as a comprehensive metric, defined as <inline-formula><mml:math id="M143" display="inline"><mml:mrow><mml:mi mathvariant="normal">ITAE</mml:mi><mml:mo>=</mml:mo><mml:msubsup><mml:mo>∫</mml:mo><mml:mn mathvariant="normal">0</mml:mn><mml:mi>T</mml:mi></mml:msubsup><mml:mi>t</mml:mi><mml:mo>|</mml:mo><mml:mi>e</mml:mi><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo><mml:mo>|</mml:mo><mml:mi mathvariant="normal">d</mml:mi><mml:mi>t</mml:mi></mml:mrow></mml:math></inline-formula>. A smaller ITAE value indicates better combined performance in terms of dynamic response speed and steady-state accuracy. The ITAE values for each joint are listed in Table 1.</p>
      <p id="d2e4830">Compared with pure SMC, the total ITAE of the RBF-STSMC controller is reduced by 86.1 %. In particular, the reductions for joints 5 and 4 reach 87.1 % and 70.9 %, respectively, indicating that the introduction of the RBF neural network effectively reduces the burden on the super-twisting gains and improves steady-state accuracy. Compared with pure RBF control, the total ITAE is reduced by as much as 99.7 %, fully demonstrating the necessity of the sliding-mode robust term in suppressing parameter perturbations and external disturbances. These results verify the superior performance of the proposed composite control strategy in terms of tracking speed and steady-state convergence accuracy.</p>
      <p id="d2e4834">To further demonstrate the generality of the proposed method beyond point-to-point motions, its tracking performance was also evaluated under a continuous sinusoidal trajectory. Each joint tracks an independent sinusoidal trajectory with different frequencies and amplitudes to simulate industrial continuous operation conditions.</p>
      <p id="d2e4837">As shown in Fig. 10 and Table 2, the proposed RBF-STSMC controller maintains ultra-high tracking accuracy under periodic trajectories, with all joint RMSE values being less than 0.003 rad. Compared with SMC and pure RBF neural network control, the proposed method achieves significant improvements in tracking precision under continuous industrial motions. These results further verify the superior performance, generality, and robustness of the proposed composite control strategy.</p>

      <fig id="F10"><label>Figure 10</label><caption><p id="d2e4842">Tracking errors under continuous sinusoidal trajectory.</p></caption>
          <graphic xlink:href="https://ms.copernicus.org/articles/17/759/2026/ms-17-759-2026-f10.png"/>

        </fig>

<table-wrap id="T2"><label>Table 2</label><caption><p id="d2e4854">RMSE (rad) per joint under sinusoidal trajectory.</p></caption><oasis:table frame="topbot"><oasis:tgroup cols="7">
     <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:colspec colnum="7" colname="col7" align="right"/>
     <oasis:thead>
       <oasis:row rowsep="1">
         <oasis:entry colname="col1">Method</oasis:entry>
         <oasis:entry colname="col2">J1</oasis:entry>
         <oasis:entry colname="col3">J2</oasis:entry>
         <oasis:entry colname="col4">J3</oasis:entry>
         <oasis:entry colname="col5">J4</oasis:entry>
         <oasis:entry colname="col6">J5</oasis:entry>
         <oasis:entry colname="col7">J6</oasis:entry>
       </oasis:row>
     </oasis:thead>
     <oasis:tbody>
       <oasis:row>
         <oasis:entry colname="col1">RBF</oasis:entry>
         <oasis:entry colname="col2">0.169</oasis:entry>
         <oasis:entry colname="col3">0.191</oasis:entry>
         <oasis:entry colname="col4">0.515</oasis:entry>
         <oasis:entry colname="col5">9.592</oasis:entry>
         <oasis:entry colname="col6">2.454</oasis:entry>
         <oasis:entry colname="col7">12.989</oasis:entry>
       </oasis:row>
       <oasis:row>
         <oasis:entry colname="col1">SMC</oasis:entry>
         <oasis:entry colname="col2">0.000</oasis:entry>
         <oasis:entry colname="col3">0.000</oasis:entry>
         <oasis:entry colname="col4">0.000</oasis:entry>
         <oasis:entry colname="col5">0.004</oasis:entry>
         <oasis:entry colname="col6">0.016</oasis:entry>
         <oasis:entry colname="col7">0.001</oasis:entry>
       </oasis:row>
       <oasis:row>
         <oasis:entry colname="col1">RBF-STSMC</oasis:entry>
         <oasis:entry colname="col2">0.000</oasis:entry>
         <oasis:entry colname="col3">0.000</oasis:entry>
         <oasis:entry colname="col4">0.000</oasis:entry>
         <oasis:entry colname="col5">0.000</oasis:entry>
         <oasis:entry colname="col6">0.003</oasis:entry>
         <oasis:entry colname="col7">0.000</oasis:entry>
       </oasis:row>
     </oasis:tbody>
   </oasis:tgroup></oasis:table></table-wrap>

</sec>
</sec>
<sec id="Ch1.S5" sec-type="conclusions">
  <label>5</label><title>Conclusion</title>
      <p id="d2e4993">This paper proposes a composite control strategy integrating an RBF neural network and super-twisting sliding-mode control for the high-precision trajectory tracking of the UR10 manipulator under parameter perturbations, nonlinear friction, and external disturbances. The RBF network online approximates unknown dynamics to reduce residual disturbance bounds, while the super-twisting term suppresses chattering and guarantees finite-time convergence, as rigorously proven via Lyapunov analysis. Additionally, a projection-based adaptive law strictly ensures weight boundedness. Simulations using realistic UR10 parameters demonstrate that this method significantly outperforms standalone SMC and RBF control regarding steady-state accuracy, convergence speed, and chattering suppression. Future work will focus on experimental validation on a physical UR10 platform, adaptive network structure optimization, and the integration of iterative learning with neural sliding-mode control.</p>
</sec>

      
      </body>
    <back><notes notes-type="codedataavailability"><title>Code and data availability</title>

      <p id="d2e5000">The code and data of this paper are available on request. Please contact the corresponding author.</p>
  </notes><notes notes-type="authorcontribution"><title>Author contributions</title>

      <p id="d2e5006">Chenghu Jing: conceptualization and funding. Xiaole Ma: theoretical analysis and control design. Kun Zhang: simulations and writing of draft. Chen Chen: algorithm and data processing. Yanfeng Wang: conclusion and project coordination. All of the authors reviewed and approved the paper.</p>
  </notes><notes notes-type="competinginterests"><title>Competing interests</title>

      <p id="d2e5012">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="d2e5018">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><ack><title>Acknowledgements</title><p id="d2e5024">We appreciate the editor Dario Richiedei and the reviewers for their valuable suggestions.</p></ack><notes notes-type="financialsupport"><title>Financial support</title>

      <p id="d2e5029">This work was supported in part by the Natural Science Foundation of Henan Province, China (grant no. 262300421328).</p>
  </notes><notes notes-type="reviewstatement"><title>Review statement</title>

      <p id="d2e5035">This paper was edited by Dario Richiedei and reviewed by two anonymous referees.</p>
  </notes><ref-list>
    <title>References</title>

      <ref id="bib1.bib1"><label>1</label><mixed-citation>Abdallah, M. A. Y. and Fareh, R.: Tracking control of serial robot manipulator using active disturbance rejection control, 2019 Advances in Science and Engineering Technology International Conferences (ASET), 1–5, <ext-link xlink:href="https://doi.org/10.1109/icaset.2019.8714470" ext-link-type="DOI">10.1109/icaset.2019.8714470</ext-link>, 2019.</mixed-citation></ref>
      <ref id="bib1.bib2"><label>2</label><mixed-citation>Agarwal, V. and Parthasarathy, H.: Disturbance estimator as a state observer with extended Kalman filter for robotic manipulator, Nonlinear Dynam., 85, 2809–2825, <ext-link xlink:href="https://doi.org/10.1007/s11071-016-2864-4" ext-link-type="DOI">10.1007/s11071-016-2864-4</ext-link>, 2016.</mixed-citation></ref>
      <ref id="bib1.bib3"><label>3</label><mixed-citation>Ai, H.-B., He, X.-R., and Yin, C.-W.: Predefined-time super-twisting sliding mode control for construction robot with arbitrary initial values, Sensors, 26, 1654, <ext-link xlink:href="https://doi.org/10.3390/s26051654" ext-link-type="DOI">10.3390/s26051654</ext-link>, 2026.</mixed-citation></ref>
      <ref id="bib1.bib4"><label>4</label><mixed-citation>Al-Dujaili, A. Q., Falah, A., Humaidi, A. J., Pereira, D. A., and Ibraheem, I. K.: Optimal super-twisting sliding mode control design of robot manipulator: Design and comparison study, Int. J. Adv. Robot. Syst., 17, 1729881420981524, <ext-link xlink:href="https://doi.org/10.1177/1729881420981524" ext-link-type="DOI">10.1177/1729881420981524</ext-link>, 2020.</mixed-citation></ref>
      <ref id="bib1.bib5"><label>5</label><mixed-citation>Chen, J. Q., Zhang, H. Y., Pan, S. T., Zhu, T. T., and Lin, Y. Z.: A time-varying second-order sliding mode control of super-twisting based on radial basis function neural networks, J. Braz. Soc. Mech. Sci., 47, 6, <ext-link xlink:href="https://doi.org/10.1007/s40430-025-05577-y" ext-link-type="DOI">10.1007/s40430-025-05577-y</ext-link>, 2025.</mixed-citation></ref>
      <ref id="bib1.bib6"><label>6</label><mixed-citation> Dinh, B. H., Dunnigan, M. W., and Reay, D. S.: A practical approach for position control of a robotic manipulator using a radial basis function network and a simple vision system, WSEAS Transactions on Systems and Control, 3, 289–298, 2008.</mixed-citation></ref>
      <ref id="bib1.bib7"><label>7</label><mixed-citation>Dirara, H. G., Yareshe, F. T., and Abdissa, C. M.: Design and analysis of adaptive fuzzy super-twisting sliding mode controller for uncertain 2-DOF robotic manipulator, IEEE Access, 13, 110241–110254, <ext-link xlink:href="https://doi.org/10.1109/ACCESS.2025.3581449" ext-link-type="DOI">10.1109/ACCESS.2025.3581449</ext-link>, 2025.</mixed-citation></ref>
      <ref id="bib1.bib8"><label>8</label><mixed-citation>Goel, A. and Swarup, A.: MIMO uncertain nonlinear system control via adaptive high-order super twisting sliding mode and its application to robotic manipulator, Journal of Control, Automation and Electrical Systems, 28, 36–49, <ext-link xlink:href="https://doi.org/10.1007/s40313-016-0286-7" ext-link-type="DOI">10.1007/s40313-016-0286-7</ext-link>, 2017.</mixed-citation></ref>
      <ref id="bib1.bib9"><label>9</label><mixed-citation>Hashimoto, H., Maruyama, K., and Harashima, F.: A microprocessor-based robot manipulator control with sliding mode, IEEE T. Ind. Electron., IE-34, 11–18, <ext-link xlink:href="https://doi.org/10.1109/TIE.1987.350917" ext-link-type="DOI">10.1109/TIE.1987.350917</ext-link>, 1987.</mixed-citation></ref>
      <ref id="bib1.bib10"><label>10</label><mixed-citation>Lin, X., Li, J. Y., Song, Y. K., Liu, C. G., and Yang, T. Y.: Improved fast non-singular adaptive super-twisting sliding mode control based on radial basis function neural network approximation for robot joint module, ISA T., 167, 746–760, <ext-link xlink:href="https://doi.org/10.1016/j.isatra.2025.08.037" ext-link-type="DOI">10.1016/j.isatra.2025.08.037</ext-link>, 2025.</mixed-citation></ref>
      <ref id="bib1.bib11"><label>11</label><mixed-citation>Liu, Y. L., Li, Y. M., Shi, S. Y., Li, C., and Yun, J. T.: Active disturbance rejection control for ladle masonry robotic arm based on fixed-time observer, Concurr. Comp.-Pract. E., 38, e70497, <ext-link xlink:href="https://doi.org/10.1002/cpe.70497" ext-link-type="DOI">10.1002/cpe.70497</ext-link>, 2026.</mixed-citation></ref>
      <ref id="bib1.bib12"><label>12</label><mixed-citation>Liu, Z. B., Peng, K. R., Han, L. P., and Guan, S. C.: Modeling and control of robotic manipulators based on artificial neural networks: A review, IJST-T. Mech. Eng., 47, 1307–1347, <ext-link xlink:href="https://doi.org/10.1007/s40997-023-00596-3" ext-link-type="DOI">10.1007/s40997-023-00596-3</ext-link>, 2023.</mixed-citation></ref>
      <ref id="bib1.bib13"><label>13</label><mixed-citation>Matheson, E., Minto, R., Zampieri, E. G. G., Faccio, M., and Rosati, G.: Human-robot collaboration in manufacturing applications: A review, Robotics, 8, 100, <ext-link xlink:href="https://doi.org/10.3390/robotics8040100" ext-link-type="DOI">10.3390/robotics8040100</ext-link>, 2019.</mixed-citation></ref>
      <ref id="bib1.bib14"><label>14</label><mixed-citation>Moosavi, S. K. R., Zafar, M. H., and Sanfilippo, F.: Forward kinematic modelling with radial basis function neural network tuned with a novel meta-heuristic algorithm for robotic manipulators, Robotics, 11, 43, <ext-link xlink:href="https://doi.org/10.3390/robotics11020043" ext-link-type="DOI">10.3390/robotics11020043</ext-link>, 2022.</mixed-citation></ref>
      <ref id="bib1.bib15"><label>15</label><mixed-citation>Mou, F. L. and Wu, D.: Active disturbance rejection sliding mode control for robot manipulation, Journal of Intelligent Manufacturing and Special Equipment, 1, 67–85, <ext-link xlink:href="https://doi.org/10.1108/JIMSE-06-2020-0004" ext-link-type="DOI">10.1108/JIMSE-06-2020-0004</ext-link>, 2020.</mixed-citation></ref>
      <ref id="bib1.bib16"><label>16</label><mixed-citation>Petrone, V., Ferrentino, E., and Chiacchio, P.: The dynamic model of the UR10 robot and its ROS2 integration, IEEE T. Ind. Inform., <ext-link xlink:href="https://doi.org/10.1109/tii.2025.3534415" ext-link-type="DOI">10.1109/tii.2025.3534415</ext-link>, 2025.</mixed-citation></ref>
      <ref id="bib1.bib17"><label>17</label><mixed-citation>Ren, B., Wang, Y., and Chen, J. Y.: Trajectory-tracking-based adaptive neural network sliding mode controller for robot manipulators, J. Comput. Inf. Sci. Eng., 20, 031009, <ext-link xlink:href="https://doi.org/10.1115/1.4047073" ext-link-type="DOI">10.1115/1.4047073</ext-link>, 2020.</mixed-citation></ref>
      <ref id="bib1.bib18"><label>18</label><mixed-citation>Ren, Z. X., Liu, X. X., and Peng, S. R.: Neural network based active disturbance rejection control for multi-joint robotic arm, 2023 CAA Symposium on Fault Detection, Supervision and Safety for Technical Processes (SAFEPROCESS), <ext-link xlink:href="https://doi.org/10.1109/safeprocess58597.2023.10295853" ext-link-type="DOI">10.1109/safeprocess58597.2023.10295853</ext-link>, 2023.</mixed-citation></ref>
      <ref id="bib1.bib19"><label>19</label><mixed-citation>Spong, M. W.: An historical perspective on the control of robotic manipulators, Annual Review of Control, Robotics, and Autonomous Systems, 5, 1–31, <ext-link xlink:href="https://doi.org/10.1146/annurev-control-042920-094829" ext-link-type="DOI">10.1146/annurev-control-042920-094829</ext-link>, 2022.</mixed-citation></ref>
      <ref id="bib1.bib20"><label>20</label><mixed-citation>Sun, C. C., Huang, Z. M., and Wu, H. T.: Adaptive super-twisting global nonsingular terminal sliding mode control for robotic manipulators, Nonlinear Dynam., 112, 5379–5389, <ext-link xlink:href="https://doi.org/10.1007/s11071-024-09305-4" ext-link-type="DOI">10.1007/s11071-024-09305-4</ext-link>, 2024.</mixed-citation></ref>
      <ref id="bib1.bib21"><label>21</label><mixed-citation>Taesi, C., Aggogeri, F., and Pellegrini, N.: COBOT applications: recent advances and challenges, Robotics, 12, 79, <ext-link xlink:href="https://doi.org/10.3390/robotics12030079" ext-link-type="DOI">10.3390/robotics12030079</ext-link>, 2023. </mixed-citation></ref>
      <ref id="bib1.bib22"><label>22</label><mixed-citation>Uyulan, C.: Design and stability analysis of a robust-adaptive sliding mode control applied on a robot arm with flexible links, Vibration, 5, 1, <ext-link xlink:href="https://doi.org/10.3390/vibration5010001" ext-link-type="DOI">10.3390/vibration5010001</ext-link>, 2022.</mixed-citation></ref>
      <ref id="bib1.bib23"><label>23</label><mixed-citation>Wai, R. J.: Tracking control based on neural network strategy for robot manipulator, Neurocomputing, 51, 425–445, <ext-link xlink:href="https://doi.org/10.1016/S0925-2312(02)00626-4" ext-link-type="DOI">10.1016/S0925-2312(02)00626-4</ext-link>, 2003.</mixed-citation></ref>
      <ref id="bib1.bib24"><label>24</label><mixed-citation>Zhai, J. Y. and Li, Z. Y.: Fast-exponential sliding mode control of robotic manipulator with super-twisting method, IEEE T. Circuits-II, 69, 489–493, <ext-link xlink:href="https://doi.org/10.1109/tcsii.2021.3081147" ext-link-type="DOI">10.1109/tcsii.2021.3081147</ext-link>, 2022.</mixed-citation></ref>
      <ref id="bib1.bib25"><label>25</label><mixed-citation>Zhang, Y. B. and Qian, C.: Super-twisting algorithm sliding mode control of flexible manipulators considering uncertainty, Appl. Sci., 16, 387, <ext-link xlink:href="https://doi.org/10.3390/app16010387" ext-link-type="DOI">10.3390/app16010387</ext-link>, 2025.</mixed-citation></ref>
      <ref id="bib1.bib26"><label>26</label><mixed-citation>Zhao, J., Li, Y., Li, Y., Pei, B., Yu, Z., and Dong, Z.: A predefined-time radial basis function (RBF) neural network tracking control method considering actuator faults for a new type of spraying robot, Mech. Sci., 16, 51–60, <ext-link xlink:href="https://doi.org/10.5194/ms-16-51-2025" ext-link-type="DOI">10.5194/ms-16-51-2025</ext-link>, 2025.</mixed-citation></ref>

  </ref-list></back>
    <!--<article-title-html>Trajectory-tracking control of the UR10 manipulator based on radial basis function neural network and super-twisting sliding mode</article-title-html>
<abstract-html/>
<ref-html id="bib1.bib1"><label>1</label><mixed-citation>
      
Abdallah, M. A. Y. and Fareh, R.: Tracking control of serial robot
manipulator using active disturbance rejection control, 2019 Advances in
Science and Engineering Technology International Conferences (ASET), 1–5,
<a href="https://doi.org/10.1109/icaset.2019.8714470" target="_blank">https://doi.org/10.1109/icaset.2019.8714470</a>, 2019.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib2"><label>2</label><mixed-citation>
      
Agarwal, V. and Parthasarathy, H.: Disturbance estimator as a state observer
with extended Kalman filter for robotic manipulator, Nonlinear Dynam., 85,
2809–2825, <a href="https://doi.org/10.1007/s11071-016-2864-4" target="_blank">https://doi.org/10.1007/s11071-016-2864-4</a>, 2016.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib3"><label>3</label><mixed-citation>
      
Ai, H.-B., He, X.-R., and Yin, C.-W.: Predefined-time super-twisting sliding
mode control for construction robot with arbitrary initial values, Sensors,
26, 1654, <a href="https://doi.org/10.3390/s26051654" target="_blank">https://doi.org/10.3390/s26051654</a>, 2026.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib4"><label>4</label><mixed-citation>
      
Al-Dujaili, A. Q., Falah, A., Humaidi, A. J., Pereira, D. A., and Ibraheem, I. K.: Optimal super-twisting sliding mode control design of robot manipulator: Design and comparison study, Int. J. Adv. Robot. Syst., 17, 1729881420981524, <a href="https://doi.org/10.1177/1729881420981524" target="_blank">https://doi.org/10.1177/1729881420981524</a>, 2020.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib5"><label>5</label><mixed-citation>
      
Chen, J. Q., Zhang, H. Y., Pan, S. T., Zhu, T. T., and Lin, Y. Z.: A time-varying second-order sliding mode control of super-twisting based on radial basis function neural networks, J. Braz. Soc. Mech. Sci., 47, 6, <a href="https://doi.org/10.1007/s40430-025-05577-y" target="_blank">https://doi.org/10.1007/s40430-025-05577-y</a>, 2025.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib6"><label>6</label><mixed-citation>
      
Dinh, B. H., Dunnigan, M. W., and Reay, D. S.: A practical approach for
position control of a robotic manipulator using a radial basis function
network and a simple vision system, WSEAS Transactions on Systems and
Control, 3, 289–298, 2008.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib7"><label>7</label><mixed-citation>
      
Dirara, H. G., Yareshe, F. T., and Abdissa, C. M.: Design and analysis of
adaptive fuzzy super-twisting sliding mode controller for uncertain 2-DOF
robotic manipulator, IEEE Access, 13, 110241–110254,
<a href="https://doi.org/10.1109/ACCESS.2025.3581449" target="_blank">https://doi.org/10.1109/ACCESS.2025.3581449</a>, 2025.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib8"><label>8</label><mixed-citation>
      
Goel, A. and Swarup, A.: MIMO uncertain nonlinear system control via
adaptive high-order super twisting sliding mode and its application to
robotic manipulator, Journal of Control, Automation and Electrical Systems,
28, 36–49, <a href="https://doi.org/10.1007/s40313-016-0286-7" target="_blank">https://doi.org/10.1007/s40313-016-0286-7</a>, 2017.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib9"><label>9</label><mixed-citation>
      
Hashimoto, H., Maruyama, K., and Harashima, F.: A microprocessor-based robot
manipulator control with sliding mode, IEEE T. Ind. Electron., IE-34, 11–18, <a href="https://doi.org/10.1109/TIE.1987.350917" target="_blank">https://doi.org/10.1109/TIE.1987.350917</a>, 1987.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib10"><label>10</label><mixed-citation>
      
Lin, X., Li, J. Y., Song, Y. K., Liu, C. G., and Yang, T. Y.: Improved fast non-singular adaptive
super-twisting sliding mode control based on radial basis function neural
network approximation for robot joint module, ISA T., 167,
746–760, <a href="https://doi.org/10.1016/j.isatra.2025.08.037" target="_blank">https://doi.org/10.1016/j.isatra.2025.08.037</a>, 2025.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib11"><label>11</label><mixed-citation>
      
Liu, Y. L., Li, Y. M., Shi, S. Y., Li, C., and Yun, J. T.: Active disturbance rejection control for ladle masonry robotic arm based on fixed-time observer, Concurr. Comp.-Pract. E., 38, e70497, <a href="https://doi.org/10.1002/cpe.70497" target="_blank">https://doi.org/10.1002/cpe.70497</a>, 2026.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib12"><label>12</label><mixed-citation>
      
Liu, Z. B., Peng, K. R., Han, L. P., and Guan, S. C.: Modeling and control of robotic manipulators based on artificial neural networks: A review, IJST-T. Mech. Eng., 47, 1307–1347, <a href="https://doi.org/10.1007/s40997-023-00596-3" target="_blank">https://doi.org/10.1007/s40997-023-00596-3</a>, 2023.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib13"><label>13</label><mixed-citation>
      
Matheson, E., Minto, R., Zampieri, E. G. G., Faccio, M., and Rosati, G.: Human-robot collaboration in manufacturing applications: A review, Robotics, 8, 100, <a href="https://doi.org/10.3390/robotics8040100" target="_blank">https://doi.org/10.3390/robotics8040100</a>, 2019.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib14"><label>14</label><mixed-citation>
      
Moosavi, S. K. R., Zafar, M. H., and Sanfilippo, F.: Forward kinematic
modelling with radial basis function neural network tuned with a novel
meta-heuristic algorithm for robotic manipulators, Robotics, 11, 43,
<a href="https://doi.org/10.3390/robotics11020043" target="_blank">https://doi.org/10.3390/robotics11020043</a>, 2022.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib15"><label>15</label><mixed-citation>
      
Mou, F. L. and Wu, D.: Active disturbance rejection sliding mode control for
robot manipulation, Journal of Intelligent Manufacturing and Special
Equipment, 1, 67–85, <a href="https://doi.org/10.1108/JIMSE-06-2020-0004" target="_blank">https://doi.org/10.1108/JIMSE-06-2020-0004</a>, 2020.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib16"><label>16</label><mixed-citation>
      
Petrone, V., Ferrentino, E., and Chiacchio, P.: The dynamic model of the
UR10 robot and its ROS2 integration, IEEE T. Ind. Inform., <a href="https://doi.org/10.1109/tii.2025.3534415" target="_blank">https://doi.org/10.1109/tii.2025.3534415</a>, 2025.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib17"><label>17</label><mixed-citation>
      
Ren, B., Wang, Y., and Chen, J. Y.: Trajectory-tracking-based adaptive
neural network sliding mode controller for robot manipulators, J.
Comput. Inf. Sci. Eng., 20, 031009, <a href="https://doi.org/10.1115/1.4047073" target="_blank">https://doi.org/10.1115/1.4047073</a>, 2020.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib18"><label>18</label><mixed-citation>
      
Ren, Z. X., Liu, X. X., and Peng, S. R.: Neural network based active
disturbance rejection control for multi-joint robotic arm, 2023 CAA
Symposium on Fault Detection, Supervision and Safety for Technical Processes
(SAFEPROCESS), <a href="https://doi.org/10.1109/safeprocess58597.2023.10295853" target="_blank">https://doi.org/10.1109/safeprocess58597.2023.10295853</a>, 2023.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib19"><label>19</label><mixed-citation>
      
Spong, M. W.: An historical perspective on the control of robotic
manipulators, Annual Review of Control, Robotics, and Autonomous Systems, 5,
1–31, <a href="https://doi.org/10.1146/annurev-control-042920-094829" target="_blank">https://doi.org/10.1146/annurev-control-042920-094829</a>, 2022.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib20"><label>20</label><mixed-citation>
      
Sun, C. C., Huang, Z. M., and Wu, H. T.: Adaptive super-twisting global
nonsingular terminal sliding mode control for robotic manipulators,
Nonlinear Dynam., 112, 5379–5389, <a href="https://doi.org/10.1007/s11071-024-09305-4" target="_blank">https://doi.org/10.1007/s11071-024-09305-4</a>, 2024.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib21"><label>21</label><mixed-citation>
      
Taesi, C., Aggogeri, F., and Pellegrini, N.: COBOT applications: recent
advances and challenges, Robotics, 12, 79, <a href="https://doi.org/10.3390/robotics12030079" target="_blank">https://doi.org/10.3390/robotics12030079</a>, 2023.


    </mixed-citation></ref-html>
<ref-html id="bib1.bib22"><label>22</label><mixed-citation>
      
Uyulan, C.: Design and stability analysis of a robust-adaptive sliding mode
control applied on a robot arm with flexible links, Vibration, 5, 1, <a href="https://doi.org/10.3390/vibration5010001" target="_blank">https://doi.org/10.3390/vibration5010001</a>, 2022.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib23"><label>23</label><mixed-citation>
      
Wai, R. J.: Tracking control based on neural network strategy for robot
manipulator, Neurocomputing, 51, 425–445, <a href="https://doi.org/10.1016/S0925-2312(02)00626-4" target="_blank">https://doi.org/10.1016/S0925-2312(02)00626-4</a>, 2003.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib24"><label>24</label><mixed-citation>
      
Zhai, J. Y. and Li, Z. Y.: Fast-exponential sliding mode control of robotic
manipulator with super-twisting method, IEEE T. Circuits-II, 69, 489–493, <a href="https://doi.org/10.1109/tcsii.2021.3081147" target="_blank">https://doi.org/10.1109/tcsii.2021.3081147</a>, 2022.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib25"><label>25</label><mixed-citation>
      
Zhang, Y. B. and Qian, C.: Super-twisting algorithm sliding mode control of
flexible manipulators considering uncertainty, Appl. Sci., 16, 387,
<a href="https://doi.org/10.3390/app16010387" target="_blank">https://doi.org/10.3390/app16010387</a>, 2025.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib26"><label>26</label><mixed-citation>
      
Zhao, J., Li, Y., Li, Y., Pei, B., Yu, Z., and Dong, Z.: A predefined-time radial basis function (RBF) neural network tracking control method considering actuator faults for a new type of spraying robot, Mech. Sci., 16, 51–60, <a href="https://doi.org/10.5194/ms-16-51-2025" target="_blank">https://doi.org/10.5194/ms-16-51-2025</a>, 2025.

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