Dynamic driving simulators are seeing an increasing interest in the automotive community, both in the research and industrial fields. Different aspects are involved, from virtual prototyping to rehab: racing applications are of particular interest, where simulators are exploited to improve the driver’s capabilities and test different vehicle set-ups avoiding the costs of testing on real tracks. The ability of the platform in reproducing as faithfully as possible the driving feelings is crucial in such context: this is the task of Motion Cueing Algorithms. Recently, innovative MPC-based approaches have been proposed which improve the performance with respect to the classical, filteringbased procedures. The criticality in such approaches is the prediction phase, both for the derivation of reliable reference signals and the computational burden of the optimal problem. In this paper, a first strategy is proposed to derive an affordable reference exploiting the repetitive pattern typical of the racing context, while a move-blocking approach is integrated to assure real-time capabilities.

A real-time implementation of an MPC-based motion cueing strategy with time-varying prediction

BEGHI, ALESSANDRO;BRUSCHETTA, MATTIA;MARAN, FABIO
2013

Abstract

Dynamic driving simulators are seeing an increasing interest in the automotive community, both in the research and industrial fields. Different aspects are involved, from virtual prototyping to rehab: racing applications are of particular interest, where simulators are exploited to improve the driver’s capabilities and test different vehicle set-ups avoiding the costs of testing on real tracks. The ability of the platform in reproducing as faithfully as possible the driving feelings is crucial in such context: this is the task of Motion Cueing Algorithms. Recently, innovative MPC-based approaches have been proposed which improve the performance with respect to the classical, filteringbased procedures. The criticality in such approaches is the prediction phase, both for the derivation of reliable reference signals and the computational burden of the optimal problem. In this paper, a first strategy is proposed to derive an affordable reference exploiting the repetitive pattern typical of the racing context, while a move-blocking approach is integrated to assure real-time capabilities.
2013
Proceedings of the 2013 IEEE Conference on Systems, Man and Cybernetics
9780769551548
File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11577/2795766
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 15
  • ???jsp.display-item.citation.isi??? 11
social impact