Bayesian Optimization Parameter Tuning Framework for a Lyapunov Based Path Following Controller
Zhewen Zheng, Wenjing Cao, Hongkang Yu, Mo Chen, Takashi Suzuki

TL;DR
This paper presents a Bayesian optimization framework for tuning nonlinear path-following controllers on real robots, significantly reducing the number of trials needed to achieve optimal performance.
Contribution
The paper introduces a model-free Bayesian optimization approach for tuning complex nonlinear controllers on real hardware, addressing evaluation constraints.
Findings
BO improves controller performance within 32 trials
Efficiently locates high-performing parameter regions
Applicable to real-world robotic systems
Abstract
Parameter tuning in real-world experiments is constrained by the limited evaluation budget available on hardware. The path-following controller studied in this paper reflects a typical situation in nonlinear geometric controller, where multiple gains influence the dynamics through coupled nonlinear terms. Such interdependence makes manual tuning inefficient and unlikely to yield satisfactory performance within a practical number of trials. To address this challenge, we propose a Bayesian optimization (BO) framework that treats the closed-loop system as a black box and selects controller gains using a Gaussian-process surrogate. BO offers model-free exploration, quantified uncertainty, and data-efficient search, making it well suited for tuning tasks where each evaluation is costly. The framework is implemented on Honda's AI-Formula three-wheeled robot and assessed through repeated…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAutonomous Vehicle Technology and Safety · Advanced Multi-Objective Optimization Algorithms · Gaussian Processes and Bayesian Inference
