Spline approximation of multivalued functions in linear structures routing

D. A. Karpov, V. I. Struchenkov
{"title":"Spline approximation of multivalued functions in linear structures routing","authors":"D. A. Karpov, V. I. Struchenkov","doi":"10.32362/2500-316x-2022-10-4-65-74","DOIUrl":null,"url":null,"abstract":"Objectives. The theory and methods of spline approximation of plane curves given by a sequence of points are currently undergoing rapid development. Despite fundamental differences between used splines and those considered in the theory and its applications, results published earlier demonstrate the possibility of using spline approximation when designing routes of linear structures. The main difference here consists in the impossibility of assuming in advance the number of spline elements when designing the routes. Here, in contrast to widely use polynomial splines, the repeating element is the link “segment of a straight line + arc of a circle” or “segment of a straight line + arc of a clothoid + arc of a circle + arc of a clothoid.” Previously, a two-stage scheme consisting of a determination of the number of elements of the desired spline and subsequent optimization of its parameters was proposed. Although an algorithm for solving the problem in relation to the design of a longitudinal profile has been implemented and published, this is not suitable for designing a route plan, since, unlike a profile, a route plan is generally a multivalued function. The present paper aims to generalize the algorithm for the case of spline approximation of multivalued functions making allowance for the design features of the routes of linear structures.Methods. At the first stage, a novel mathematical model is developed to apply the dynamic programming method taking into account the constraints on the desired spline parameters. At the second stage, nonlinear programming is used. In this case, it is possible to analytically calculate the derivatives of the objective function with respect to the spline parameters in the absence of its analytical expression through these parameters.Results. An algorithm developed for approximating multivalued functions given by a discrete series of points using a spline consisting of arcs of circles conjugated by line segments for solving the first stage of the problem is presented. An additional nonlinear programming algorithm was also used to optimize the parameters of the resulting spline as an initial approximation. However, in the present paper, the first stage is considered only, since the complex algorithm of the second stage and its justification require separate consideration.Conclusions. The presented two-stage spline approximation scheme with an unknown number of spline elements is also suitable for approximating multivalued functions given by a sequence of points on a plane, in particular, for designing a route plan for linear structures.","PeriodicalId":282368,"journal":{"name":"Russian Technological Journal","volume":"33 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Russian Technological Journal","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.32362/2500-316x-2022-10-4-65-74","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Objectives. The theory and methods of spline approximation of plane curves given by a sequence of points are currently undergoing rapid development. Despite fundamental differences between used splines and those considered in the theory and its applications, results published earlier demonstrate the possibility of using spline approximation when designing routes of linear structures. The main difference here consists in the impossibility of assuming in advance the number of spline elements when designing the routes. Here, in contrast to widely use polynomial splines, the repeating element is the link “segment of a straight line + arc of a circle” or “segment of a straight line + arc of a clothoid + arc of a circle + arc of a clothoid.” Previously, a two-stage scheme consisting of a determination of the number of elements of the desired spline and subsequent optimization of its parameters was proposed. Although an algorithm for solving the problem in relation to the design of a longitudinal profile has been implemented and published, this is not suitable for designing a route plan, since, unlike a profile, a route plan is generally a multivalued function. The present paper aims to generalize the algorithm for the case of spline approximation of multivalued functions making allowance for the design features of the routes of linear structures.Methods. At the first stage, a novel mathematical model is developed to apply the dynamic programming method taking into account the constraints on the desired spline parameters. At the second stage, nonlinear programming is used. In this case, it is possible to analytically calculate the derivatives of the objective function with respect to the spline parameters in the absence of its analytical expression through these parameters.Results. An algorithm developed for approximating multivalued functions given by a discrete series of points using a spline consisting of arcs of circles conjugated by line segments for solving the first stage of the problem is presented. An additional nonlinear programming algorithm was also used to optimize the parameters of the resulting spline as an initial approximation. However, in the present paper, the first stage is considered only, since the complex algorithm of the second stage and its justification require separate consideration.Conclusions. The presented two-stage spline approximation scheme with an unknown number of spline elements is also suitable for approximating multivalued functions given by a sequence of points on a plane, in particular, for designing a route plan for linear structures.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
线性结构布线中多值函数的样条逼近
目标。由点序列给出的平面曲线的样条逼近理论和方法目前正处于快速发展阶段。尽管使用的样条与理论及其应用中考虑的样条之间存在根本差异,但先前发表的结果表明,在设计线性结构的路线时使用样条近似是可能的。这里的主要区别在于,在设计路线时不可能预先假定样条元素的数目。这里,与广泛使用的多项式样条相反,重复元素是链接“直线段+圆弧”或“直线段+仿线弧+圆弧+圆弧+仿线弧”。在此之前,提出了一种两阶段的方案,包括确定所需样条的元素数量和随后的参数优化。虽然已经实现并发布了解决纵剖面设计问题的算法,但这并不适合设计路线计划,因为与剖面不同,路线计划通常是一个多值函数。考虑到线性结构路线的设计特点,对多值函数的样条逼近算法进行了推广。首先,考虑样条参数的约束条件,建立了应用动态规划方法的数学模型。在第二阶段,采用非线性规划。在这种情况下,可以通过这些参数的结果,在没有解析表达式的情况下,解析地计算目标函数对样条参数的导数。提出了一种用由线段共轭的圆弧组成的样条曲线逼近由离散点序列给出的多值函数的算法,用于求解问题的第一阶段。另外,还使用非线性规划算法对得到的样条参数进行优化,作为初始逼近。然而,在本文中,只考虑第一阶段,因为第二阶段的复杂算法及其理由需要单独考虑。所提出的样条元数目未知的两阶段样条逼近格式也适用于平面上由点序列给出的多值函数的逼近,尤其适用于线性结构的路线规划设计。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Study of the probabilistic and temporal characteristics of wireless networks using the CSMA/CA access method A mathematical model of the gravitational potential of the planet taking into account tidal deformations Mathematical modeling of microwave channels of a semi-active radar homing head Magnetorefractive effect in metallic Co/Pt nanostructures Methods for analyzing the impact of software changes on objective functions and safety functions
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1