Dynamic step selection algorithm for piecewise linear approximation of complex control trajectories

被引:0
|
作者
Tan, Liguo [1 ]
Li, Liyi [1 ]
Su, Haoxiang [2 ]
Novikova, S. V. [3 ,4 ]
Zhang, Xinbin [1 ]
Mingaliyev, Z. Z. [3 ]
机构
[1] Harbin Inst Technol, Harbin, Peoples R China
[2] Southwest Univ Sci & Technol, Mianyang, Peoples R China
[3] Kazan Natl Res Tech Univ Named AN Tupolev, Kazan, Russia
[4] Natl Res Mordovia State Univ, Saransk, Russia
基金
中国博士后科学基金;
关键词
Automatic control; Target trajectory; Unmanned vehicle; Piecewise linear approximation; Variable step; Approximation grid step; Numerical methods; OPTIMIZATION;
D O I
10.1016/j.oceaneng.2023.114498
中图分类号
U6 [水路运输]; P75 [海洋工程];
学科分类号
0814 ; 081505 ; 0824 ; 082401 ;
摘要
The paper proposes a method for replacing a complex function used as a target for automatic control of un-manned vehicles with a simplified piecewise linear function, which requires much less computing resources. A numerical method has been developed for adaptive selection of a variable step for approximating a nonlinear one-dimensional function, the analytical expression of which is not given, by a piecewise linear function. The article shows that selection of approximation step (grid) is an important task for minimizing the calculations required number, if the computing device on board the unmanned vehicle must be miniature. The developed algorithm includes the calculation of successive intervals lengths that eventually cover the entire domain of the function with a predetermined approximation accuracy. The determination coefficient is used as a measure of accuracy. Numerical experiments are presented for calculating the linear-piecewise function parameters for the approximating a target trajectory problem with complex configuration for unmanned aerial underwater vehicle automatic control. The proposed method efficiency is compared with methods with a constant step, as well as with methods for calculating the dynamic step in various approaches. The advantage of the developed method from the point of view of computational costs is proved with the same accuracy, the limitations of the appli-cability of the method are determined.
引用
收藏
页数:19
相关论文
共 50 条
  • [31] Optimal Approximation of Linear Systems by an Improved Clonal Selection Algorithm
    Zhang, Lining
    Gong, Maoguo
    Jiao, Licheng
    Yang, Jie
    2008 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-8, 2008, : 527 - 534
  • [32] Using piecewise linear functions in the numerical approximation of semilinear elliptic control problems
    Casas, Eduardo
    ADVANCES IN COMPUTATIONAL MATHEMATICS, 2007, 26 (1-3) : 137 - 153
  • [33] Using piecewise linear functions in the numerical approximation of semilinear elliptic control problems
    Eduardo Casas
    Advances in Computational Mathematics, 2007, 26 : 137 - 153
  • [34] AN ALGORITHM FOR PIECEWISE LINEAR-APPROXIMATION OF IMPLICITLY DEFINED TWO-DIMENSIONAL SURFACES
    ALLGOWER, EL
    GNUTZMANN, S
    SIAM JOURNAL ON NUMERICAL ANALYSIS, 1987, 24 (02) : 452 - 469
  • [35] Dynamic time step control algorithm enhancements
    Bach, JC
    2000 IEEE/ACM INTERNATIONAL WORKSHOP ON BEHAVIORAL MODELING AND SIMULATION, PROCEEDINGS, 2000, : 83 - 88
  • [36] A Recursive Descent Algorithm for Finding the Optimal Minimax Piecewise Linear Approximation of Convex Functions
    Imamoto, Alyson
    Tang, Benjamim
    WCECS 2008: ADVANCES IN ELECTRICAL AND ELECTRONICS ENGINEERING - IAENG SPECIAL EDITION OF THE WORLD CONGRESS ON ENGINEERING AND COMPUTER SCIENCE, PROCEEDINGS, 2009, : 287 - +
  • [37] Control of trajectories set by linear dynamic systems with discrete argument
    Matvienko, Vladimir T.
    Journal of Automation and Information Sciences, 2007, 39 (11) : 4 - 10
  • [38] On the Invariance of Trajectories Under Perturbations in Linear Dynamic Control Systems
    S. P. Zubova
    E. V. Raetskaya
    Le Hay Trung
    Journal of Mathematical Sciences, 2025, 288 (1) : 92 - 105
  • [39] A Dynamic Domain Contraction Algorithm for Nonconvex Piecewise Linear Network Flow Problems*
    Dukwon Kim
    Panos M. Pardalos
    Journal of Global Optimization, 2000, 17 : 225 - 234
  • [40] A dynamic domain contraction algorithm for nonconvex piecewise linear network flow problems
    Kim, DW
    Pardalos, PM
    JOURNAL OF GLOBAL OPTIMIZATION, 2000, 17 (1-4) : 225 - 234