TY - GEN
T1 - Optimizing Computational Efficiency of MPC-Based Motion Cueing Algorithm for Vehicle Driving Simulators
AU - Xue, Hengyu
AU - Sun, Jiaxun
AU - Tang, Kexin
AU - Zhang, Junli
AU - Lin, Qingfeng
N1 - Publisher Copyright:
© 2025 IEEE.
PY - 2025
Y1 - 2025
N2 - Vehicle driving simulators have been widely used in fields including road design, automotive development, and driver training. As a core component of the simulators, motion cueing algorithms (MCAs) aim to reproduce realistic vehicle motion sensations while respecting workspace limitations for a high-fidelity driving experience. Recent advancements have identified model predictive control (MPC) as a promising approach for MCA. However, conventional MPC-based MCA faces computational bottlenecks that limit its performance. Although recent studies have employed swarm intelligence optimization algorithms, such as the genetic algorithm and grey wolf optimizer, to enhance the performance of MPC-based MCA through horizon adjustments, the improvement path from the computational cost perspective is still overlooked. Therefore, this paper proposes a costs-optimization framework for MPC-based MCA (COMPC-based MCA), which integrates two key components: an Operator Splitting Quadratic Program (OSQP) solver and a Snow Ablation Optimizer (SAO) that considers computational costs and motion sensation errors for parameter selection. Experiment results validated the performance of the proposed framework. COMPC-based MCA can achieve fast quadratic programming (QP) solving and select appropriate parameters for performance improvement while considering computational costs.
AB - Vehicle driving simulators have been widely used in fields including road design, automotive development, and driver training. As a core component of the simulators, motion cueing algorithms (MCAs) aim to reproduce realistic vehicle motion sensations while respecting workspace limitations for a high-fidelity driving experience. Recent advancements have identified model predictive control (MPC) as a promising approach for MCA. However, conventional MPC-based MCA faces computational bottlenecks that limit its performance. Although recent studies have employed swarm intelligence optimization algorithms, such as the genetic algorithm and grey wolf optimizer, to enhance the performance of MPC-based MCA through horizon adjustments, the improvement path from the computational cost perspective is still overlooked. Therefore, this paper proposes a costs-optimization framework for MPC-based MCA (COMPC-based MCA), which integrates two key components: an Operator Splitting Quadratic Program (OSQP) solver and a Snow Ablation Optimizer (SAO) that considers computational costs and motion sensation errors for parameter selection. Experiment results validated the performance of the proposed framework. COMPC-based MCA can achieve fast quadratic programming (QP) solving and select appropriate parameters for performance improvement while considering computational costs.
UR - https://www.scopus.com/pages/publications/105033145278
U2 - 10.1109/SMC58881.2025.11342918
DO - 10.1109/SMC58881.2025.11342918
M3 - 会议稿件
AN - SCOPUS:105033145278
T3 - Conference Proceedings - IEEE International Conference on Systems, Man and Cybernetics
SP - 3452
EP - 3459
BT - 2025 IEEE International Conference on Systems, Man, and Cybernetics
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2025 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2025
Y2 - 5 October 2025 through 8 October 2025
ER -