跳到正文
arXiv cs.AI· F\'elix Martinez-Jim\'enez (GIPSA-INFINITY), Sander Miller-Murphy (GIPSA-INFINITY), Tobie Ondoa-Essomba (GIPSA-INFINITY), Emmanuel Witrant (GIPSA-INFINITY)·· 11 小时前AI 评分20

基于有偏梯度的迭代反馈调优:无模型控制在节气门上的应用研究

Learning to Tune with Biased Gradients: Iterative Feedback Tuning of Model-Free Control on Throttle Valves

AI 导读

研究在汽车电子节气门(摩擦与静摩擦因阀和运行而异)上,用智能比例无模型控制器进行迭代反馈调优(IFT)时的有偏梯度问题。在十个节气门的数字孪生上,IFT 梯度仅在 69% 的低成本区域为下降方向,摩擦是主因,所有更新规则先进入平台期后漂移。在两个硬件节气门上,最佳更新规则取决于梯度的噪声结构:一个阀门上 Adam 优于 Gauss-Newton,另一个阀门上 Adam 漂移至比初始更差的控制器。

正文 · 原文

View PDF

Abstract:Iterative feedback tuning (IFT) learns the parameters of a fixed-structure controller by stochastic gradient descent. At each iteration, two closed-loop experiments are run on the plant: the first one measures the tracking error, and the second one, driven by this error, provides the sensitivities from which the gradient of the cost is estimated. This estimate is unbiased for linear plants only. We study the biased case on automotive electronic throttle valves, whose friction and stiction vary between valves and runs, controlled by an intelligent proportional (model-free) controller, which is an incremental PI controller. We show that the mismatch of the controller state at the start of the two experiments, which stiction makes unavoidable, adds an error inversely proportional to the amplitude of the second experiment. On digital twins of ten valves, the IFT gradient is a descent direction in only 69\% of the low-cost region, friction being the cause, and all update rules plateau and then drift. On two hardware valves, the best update rule depends on the noise structure of the gradient. On the first valve, where one gradient component is buried in noise, Adam outperforms Gauss--Newton, its normalisation and its momentum each improving one parameter. On the second valve, where both components are consistent, the same normalisation amplifies a direction that Gauss--Newton rightly discounts, and Adam drifts to a controller worse than the initial one. The twins reproduce the mechanism but not this ranking.
Subjects: Machine Learning (cs.LG); Artificial Intelligence (cs.AI)
Cite as: arXiv:2611.06338 [cs.LG]
  (or arXiv:2611.06338v1 [cs.LG] for this version)
  https://doi.org/10.48550/arXiv.2611.06338

arXiv-issued DOI via DataCite (pending registration)

Submission history

From: Emmanuel Witrant [view email] [via CCSD proxy]
[v1] Wed, 4 Nov 2026 11:01:04 UTC (145 KB)

来源:arXiv cs.AI · arxiv.org