Piecewise Polynomials (PPs) are utilized in several engineering disciplines, like trajectory planning, to approximate position profiles given in the form of a set of points. While the approximation target along with domain-specific requirements, like Ck -continuity, can be formulated as a system of equations and a result can be computed directly, such closed-form solutions posses limited flexibility with respect to polynomial degrees, polynomial bases or adding further domain-specific requirements. Sufficiently complex optimization goals soon call for the use of numerical methods, like gradient descent. Since gradient descent lies at the heart of training Artificial Neural Networks (ANNs), modern Machine Learning (ML) frameworks like TensorFlow come with a set of gradient-based optimizers potentially suitable for a wide range of optimization problems beyond the training task for ANNs. Our approach is to utilize the versatility of PP models and combine it with the potential of modern ML optimizers for the use in function approximation in 1D trajectory planning in the context of electronic cam design. We utilize available optimizers of the ML framework TensorFlow directly, outside of the scope of ANNs, to optimize model parameters of our PP model. In this paper, we show how an orthogonal polynomial basis contributes to improving approximation and continuity optimization performance. Utilizing Chebyshev polynomials of the first kind, we develop a novel regularization approach enabling clearly improved convergence behavior. We show that, using this regularization approach, Chebyshev basis performs better than power basis for all relevant optimizers in the combined approximation and continuity optimization setting and demonstrate usability of the presented approach within the electronic cam domain.

翻译：分段多项式（PP）在多个工程领域（如轨迹规划）中被用于逼近以点集形式给出的位置轮廓。尽管逼近目标及领域特定需求（如Ck连续性）可被建模为方程组并通过封闭解直接计算，但这种闭式解在多项式次数、多项式基函数或添加额外领域特定需求方面缺乏灵活性。当优化目标足够复杂时，需采用数值方法（如梯度下降）求解。由于梯度下降是人工神经网络（ANN）训练的核心，现代机器学习（ML）框架（如TensorFlow）提供了多种基于梯度的优化器，这些优化器可能适用于超越ANN训练任务的广泛优化问题。我们的方法利用PP模型的灵活性，结合现代ML优化器的潜力，应用于电子凸轮设计背景下的一维轨迹规划函数逼近。我们直接使用ML框架TensorFlow中现有优化器（脱离ANN范畴）来优化PP模型的参数。本文展示了正交多项式基如何改善逼近与连续性优化性能。通过采用第一类切比雪夫多项式，我们提出一种新颖的正则化方法，显著提升了收敛行为。研究表明，采用该正则化方法时，在逼近与连续性联合优化场景下，切比雪夫基在所有相关优化器中均优于幂基，并验证了该方法在电子凸轮领域的实用性。