The use of complex structure splines in roadway design

V. I. Struchenkov, D. A. Karpov
{"title":"The use of complex structure splines in roadway design","authors":"V. I. Struchenkov, D. A. Karpov","doi":"10.32362/2500-316x-2024-12-1-111-122","DOIUrl":null,"url":null,"abstract":"Objectives. The aim of the work is to develop the theory of spline-approximation of a sequence of points on a plane for using compound splines with a complex structure. In contrast to a simple spline (e.g., polynomial), a compound spline contains repeating bundles of several elements. Such problems typically arise in the design of traces for railroads and highways. The plan (projection on the horizontal plane) of such a trace is a curve consisting of a repeating bundle of elements “line + clothoid + circle + clothoid ...,” which ensures continuity not only of curve and tangent but also of curvature. The number of spline elements, which is unknown, should be determined in the process of solving the design problem. An algorithm for solving the problem with respect to the spline, which consists of arcs conjugated by straight lines, was implemented and published in an earlier work. The approximating spline in the general case is a multivalued function, whose ordinates may be limited. Another significant factor that complicates the problem is the presence of clothoids that are not expressed analytically (in a formula). The algorithm for determining the number of elements of a spline with clothoids and constructing an initial approximation was also published earlier. The present work considers the next stage of solving the spline approximation problem: optimization using a nonlinear programming spline obtained at the first stage by means of the dynamic programming method.Methods. A new mathematical model in the form of a modified Lagrange function is used together with a special nonlinear programming algorithm to optimize spline parameters. In this case, it is possible to calculate the derivatives of the objective function by the spline parameters in the absence of its analytical expression through these parameters.Results. A mathematical model and algorithm for optimization of compound spline parameters comprising arcs of circles conjugated by clothoids and lines have been developed.Conclusions. The previously proposed two-step scheme for designing paths of linear structures is also suitable for the utilization of compound splines with clothoids.","PeriodicalId":282368,"journal":{"name":"Russian Technological Journal","volume":"35 4","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-02-02","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-2024-12-1-111-122","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Objectives. The aim of the work is to develop the theory of spline-approximation of a sequence of points on a plane for using compound splines with a complex structure. In contrast to a simple spline (e.g., polynomial), a compound spline contains repeating bundles of several elements. Such problems typically arise in the design of traces for railroads and highways. The plan (projection on the horizontal plane) of such a trace is a curve consisting of a repeating bundle of elements “line + clothoid + circle + clothoid ...,” which ensures continuity not only of curve and tangent but also of curvature. The number of spline elements, which is unknown, should be determined in the process of solving the design problem. An algorithm for solving the problem with respect to the spline, which consists of arcs conjugated by straight lines, was implemented and published in an earlier work. The approximating spline in the general case is a multivalued function, whose ordinates may be limited. Another significant factor that complicates the problem is the presence of clothoids that are not expressed analytically (in a formula). The algorithm for determining the number of elements of a spline with clothoids and constructing an initial approximation was also published earlier. The present work considers the next stage of solving the spline approximation problem: optimization using a nonlinear programming spline obtained at the first stage by means of the dynamic programming method.Methods. A new mathematical model in the form of a modified Lagrange function is used together with a special nonlinear programming algorithm to optimize spline parameters. In this case, it is possible to calculate the derivatives of the objective function by the spline parameters in the absence of its analytical expression through these parameters.Results. A mathematical model and algorithm for optimization of compound spline parameters comprising arcs of circles conjugated by clothoids and lines have been developed.Conclusions. The previously proposed two-step scheme for designing paths of linear structures is also suitable for the utilization of compound splines with clothoids.
在道路设计中使用复杂结构样条
工作目标这项工作的目的是发展平面上点序列的样条逼近理论,以使用具有复杂结构的复合样条。与简单样条线(如多项式)不同,复合样条线包含多个元素的重复束。这类问题通常出现在铁路和公路的轨迹设计中。这种轨迹的平面图(在水平面上的投影)是一条曲线,由 "线 + 布状线 + 圆 + 布状线...... "的重复元素束组成,这不仅确保了曲线和切线的连续性,也确保了曲率的连续性。花键元素的数量是未知的,应在解决设计问题的过程中确定。花键是由直线共轭的弧线组成的,早先的一项工作中已经实现并公布了解决该问题的算法。在一般情况下,近似样条曲线是一个多值函数,其序数可能是有限的。另一个使问题复杂化的重要因素是存在无法用分析方法(公式)表示的布线。关于如何确定带凸点的样条曲线的元素个数和构建初始近似值的算法也已在早些时候发表。本研究考虑的是解决样条近似问题的下一阶段:通过动态编程方法使用第一阶段获得的非线性编程样条进行优化。方法:使用修正拉格朗日函数形式的新数学模型和特殊的非线性编程算法来优化样条曲线参数。在这种情况下,可以通过样条参数计算目标函数的导数,而无需通过这些参数进行分析表达。建立了一个数学模型和算法,用于优化由布圆和直线共轭的圆弧组成的复合样条线参数。之前提出的设计线性结构路径的两步方案也适用于利用带布边的复合样条线。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信