Helical polynomial curves interpolating G1 data with prescribed axes and pitch angles

被引:2
|
作者
Farouki, Rida T. [1 ]
机构
[1] Univ Calif Davis, Dept Mech & Aerosp Engn, Davis, CA 95616 USA
关键词
Path planning; Unmanned aerial vehicles; Climb rate; Hermite interpolation; Helical polynomial curves; Pythagorean-hodograph curves; PYTHAGOREAN-HODOGRAPH CURVES; MULTIPLE UAVS; PATH;
D O I
10.1016/j.cagd.2017.05.004
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
A helical curve, or curve of constant slope, offers a natural flight path for an aerial vehicle with a limited climb rate to achieve an increase in altitude between prescribed initial and final states. Every polynomial helical curve is a spatial Pythagorean-hodograph (PH) curve, and the distinctive features of the PH curves have attracted growing interest in their use for Unmanned Aerial Vehicle (UAV) path planning. This study describes an exact algorithm for constructing helical PH paths, corresponding to a constant climb rate at a given speed, between initial and final positions and motion directions. The algorithm bypasses the more sophisticated algebraic representations of spatial PH curves, and instead employs a simple "lifting" scheme to generate helical PH paths from planar PH curves constructed using the complex representation. In this context, a novel scheme to construct planar quintic PH curves that interpolate given end points and tangents, with exactly prescribed arc lengths, plays a key role. It is also shown that these helical paths admit simple closed-form rotation-minimizing adapted frames. The algorithm is simple, efficient, and robust, and can accommodate helical axes of arbitrary orientation through simple rotation transformations. Its implementation is illustrated by several computed examples. (C) 2017 Elsevier B.V. All rights reserved.
引用
收藏
页码:4 / 15
页数:12
相关论文
共 50 条
  • [1] Shape interpolating geometric G1 Hermite curves
    Zhang, Aiwu
    Zhang, Caiming
    Jisuanji Fuzhu Sheji Yu Tuxingxue Xuebao/Journal of Computer-Aided Design and Computer Graphics, 2007, 19 (04): : 454 - 459
  • [2] G1 hermite interpolating with discrete log-aesthetic curves and surfaces
    Yagi K.
    Suzuki S.
    Usuki S.
    Miura K.T.
    Computer-Aided Design and Applications, 2020, 17 (03): : 607 - 620
  • [3] G1 approximation of conic sections by Bernstein-Jacobi hybrid polynomial curves
    Shi, Mao
    IAENG International Journal of Applied Mathematics, 2019, 49 (02):
  • [4] G1 INTERPOLATION OF MESH CURVES
    LIU, QL
    SUN, TC
    COMPUTER-AIDED DESIGN, 1994, 26 (04) : 259 - 267
  • [5] Local, Polynomial G1 PN Quads
    Papazov, Chavdar
    ADVANCES IN VISUAL COMPUTING (ISVC 2014), PT 1, 2014, 8887 : 63 - 74
  • [6] A two-point G1 Hermite interpolating, family of spirals
    Meek, D. S.
    Walton, D. J.
    JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 2009, 223 (01) : 97 - 113
  • [7] The polynomial degree of the Grassmannian G1,n,2
    Shaw, R
    Gordon, NA
    DESIGNS CODES AND CRYPTOGRAPHY, 2006, 39 (02) : 289 - 306
  • [8] Local method of G1 blending of convex polyhedral angles
    Department of Applied Mathematics, Dalian University of Technology, Dalian 116024, China
    J. Inf. Comput. Sci., 2006, 4 (1055-1062):
  • [9] G1/C1 Matching of Spline Curves
    Liu, Xumin
    Xu, Weixiang
    Xu, Jing
    Guan, Yong
    INFORMATION TECHNOLOGY FOR MANUFACTURING SYSTEMS, PTS 1 AND 2, 2010, : 202 - +
  • [10] G1 are spline approximation of quadratic Bezier curves
    Ahn, YJ
    Kim, HO
    Lee, KY
    COMPUTER-AIDED DESIGN, 1998, 30 (08) : 615 - 620