Skip to Content
Applied SciencesApplied Sciences
  • Article
  • Open Access

27 December 2024

42 Pages

Vertical Force Monitoring of Racing Tires: A Novel Deep Neural Network-Based Estimation Method

,
,
and
1
Department of Mechatronics Engineering, Kocaeli University, Kocaeli 41001, Türkiye
2
Pirelli Automobile Tires Corporation, Kocaeli 41250, Türkiye
3
Department of Software Engineering, Kocaeli University, Kocaeli 41001, Türkiye
*
Author to whom correspondence should be addressed.

Abstract

This study aims to accurately estimate vertical tire forces on racing tires of specific stiffness using acceleration, pressure, and speed data measurements from a test rig. A hybrid model, termed Random Forest Assisted Deep Neural Network (RFADNN), is introduced, combining a novel deep learning framework with the Random Forest Algorithm to enhance estimation accuracy. By leveraging the Temporal Convolutional Network (TCN), Minimal Gated Unit (MGU), Long Short-Term Memory (LSTM), and Attention mechanisms, the deep learning framework excels in extracting complex features, which the Random Forest Model subsequently analyzes to improve the accuracy of estimating vertical tire forces. Validated with test data, this approach outperforms standard models, achieving an MAE of 0.773 kgf, demonstrating the advantage of the RFADNN method in required vertical force estimation tasks for race tires. This comparison emphasizes the significant benefits of incorporating advanced deep learning with traditional machine learning to provide a comprehensive and interpretable solution for complex estimation challenges in automotive engineering.

1. Introduction

The estimation of vertical tire forces exerted on racing tires is an important cornerstone in vehicle dynamics and motorsport engineering. This aspect is fundamental, as the enhanced grip significantly influences a racing vehicle’s speed, safety, and cornering abilities, which are essential under the high-speed and often variable conditions encountered in competitive racing.
Real-time monitoring of vertical tire forces is fundamental for ensuring driving safety and handling stability. Several studies propose algorithms to combine intelligent tire technology with neural network theory to estimate vertical forces effectively, such as Gu et al. [1]. The importance of accurately predicting vertical forces for advanced vehicle control systems is a popular technology.
Engineers tailor suspension configurations by accurately assessing vertical loads that offer the optimum balance between responsiveness and stability. This balance is crucial to maintaining high speeds while driving on the complex dynamics of a racetrack. The research by Ding et al. [2] underscores the importance of accurately estimating vertical forces as part of a broader vehicle stability framework. Furthermore, Li et al. [3] explore various vertical load estimation methods. Their findings reveal that accurate vertical load estimation is critical for optimizing tire utilization and enhancing vehicle handling and stability.
According to the internal reports of the Cyber Tire Team of Pirelli Factory, who are the official tire manufacturer for the Formula 1 competition, analyzing vertical forces that act on racing tires allows for teams to better understand and predict tire wear and suspension component durability, aiding in strategic decisions about pit stops and car setups, and ensuring that the vehicle maintains peak performance throughout the race.
The road-holding and braking performance of road vehicles is largely determined by the forces and moments acting on them. Accurately measuring or estimating these tire forces and moments is crucial for analyzing and controlling vehicle behavior [4]. Typically, traditional vehicle control systems estimate vertical tire forces using observer- based methods based on data from onboard sensors. However, these methods often rely on simplified vehicle models to estimate tire-related variables, especially in longitudinal and lateral dynamics. This reliance can lead to unreliable estimates under challenging conditions, such as sudden wheel load fluctuations, and can cause significant uncertainties primarily due to the use of these simplified models. Secondly, certain parameters within these tire models vary as the tire wears, leading to inaccuracies in the tire model. This requires periodic calibration of tire characteristic tests [1].
Despite the importance of vertical force estimation, there are significant problems in the literature. In the literature, parameters that are irrelevant, excessive, or insufficient in relation to those directly affecting vertical force have often been used. This has negatively impacted the accuracy of analyses. Most studies have relied on measurements taken from outside the tire. However, this approach has allowed for external vehicle data to interfere, leading to distorted estimations. Additionally, the datasets commonly used in the literature often fail to include the correct parameters, and the absence of sensors capable of measuring from within the tire has further hindered the ability to achieve accurate results.
In this study, acceleration, speed, and internal pressure were used to achieve better MAE values, which directly affect the vertical force. This study focuses on the parameters that directly affect the vertical force and aimed to address a significant gap in the literature by avoiding common problems such as using the wrong parameters. In this study, a novel hybrid approach called Random Forest-Assisted Deep Neural Network (RFADNN) is proposed to estimate vertical force, and this approach combines the strengths of other models. This approach integrates the feature extraction capability of deep learning methods with the nonlinear relationship processing capability of the Random Forest Algorithm.
The proposed hybrid method uses a mixture of various neural network layers to extract complex features from raw data. These features are then fed into a Random Forest model for tire force estimation. The necessary training and test data were obtained using a test rig equipped with a ‘drive-hard’ (DHF) racing tire rated as Shore A hardness 71 according to ASTM D2240 measurement standards in the established experimental environment.
The contributions of the proposed study to the literature are as follows:
  • A novel combination of the strengths of deep neural networks and Random Forests has been used to estimate vertical tire forces better than existing related studies.
  • A highly reliable dataset of racing tires with a specific hardness level has been obtained. The tests were performed using an original test rig setup in a racing tire manufacturer’s factory to simulate the original behavior of the racing tire.
  • One of the important contributions is the use of inputs directly related to the vertical force for more realistic estimation. Acceleration, speed, and tire internal pressure values were used instead of irrelevant values used in the literature.
  • The labeling of analog data representing the acceleration acting on the tire was automated using deep learning to reduce labeling effort and enhance reliability.
The rest of the paper is organized as follows: Section 2 reviews related works. Section 3 outlines the design steps of the proposed method. Section 4 introduces the data acquisition setup, data preprocessing stage, corresponding datasets, and data labeling. In Section 5, performance metrics are exclusively used to compare the proposed estimation method with others, and the comparative results are presented in a table. Additionally, estimation graphs illustrating the method’s performance are included. Finally, Section 6 offers concluding remarks.

3. Random Forest Assisted Deep Neural Network Model

This section introduces the proposed Random Forest-Assisted Deep Learning Model, specifically designed to enhance the regression performance of Random Forest by addressing its limitations in handling sequential data and complex nonlinear relationships.In general, traditional vertical force estimation methods in the literature, particularly those relying on vehicle and tire models, suffer from parametric uncertainties and inadequacies in modeling nonlinear behaviors. These approaches often depend on onboard sensors which are susceptible to noise and vibrations from the vehicle chassis, limiting their accuracy. Our study addresses these shortcomings by employing a hybrid method based on deep neural networks (DNN), which utilizes commonly available vehicle sensors, such as linear velocity and inner tire pressure sensors, as well as a single-channel vertical acceleration sensor embedded in the tire. Unlike [1], which uses acceleration data to calculate peak radial displacement as an intermediate step, our method directly maps vertical acceleration data to vertical force, eliminating the need for additional calculations and reducing complexity. The method integrates Random Forest with deep learning components, including LSTM, MGU, 1D CNN, and Multihead Attention, to achieve improved prediction accuracy for vertical tire force estimation. Utilizing notations F i to represent the vertical force exerted on the tire at any moment t, and P j to denote the internal pressure within the tire, we define the tire’s rotational velocity as S k . Consequently, the ensemble of potential states attainable by the tire at any given instance is articulated as follows:
S = { ( F 1 , P 1 , S 1 ) , … , ( F i , P j , S k ) , … , ( F 10 , P 2 , S 3 ) }
Table 1 presents the indices i, j, and k used in Equation (19), along with their physical meanings and the measured values from the experimental setup. Measurements were limited to 32 specific cases out of the 60 possible F i , P j , S k combinations.
Table 1. Detailed representation of indices F i , P j , S k , their components, and their physical meanings with measured values.
Herein, i spans from 1 to 10, j encompasses values from 1 to 2, and k extends from 1 to 3. The triad ( F i , P j , S k ) represents the tire’s condition within the scope of this study. It is evident that this set comprises 60 distinct elements. Throughout the data acquisition phase for both the experimental and training datasets, we collated data emblematic of a subset of S, denominated as S a , which embodies 32 distinct states/elements. Consequently, we gathered 32 subsets symbolizing different ( F i , P j , S k ) states and combined them to formulate the dataset. The dataset’s unprocessed data was partitioned into segments comprising 251 data points, each subsequently annotated with a label correlating to a feasible tire state ( F i , P j , S k ) . These labels, such as KG 150 _ 50 _ 200 , KG 390 _ 50 _ 220 , and so forth, signify the actual vertical force imposed on the tire in kgf, the tire’s rotational speed in km/h, and the internal pressure of the tire in kPa, respectively. From the raw data procured from the test apparatus, a total of 10859 labeled data segments were produced. In total, 70 % of this dataset was allocated for training, 15 % for validation, and the other 15 % is for testing process.

3.1. Conventional Random Forest Approach

The aim of this study is to estimate vertical tire force, which can indeed be approached using the Random Forest (RF) method. However, it is crucial to acknowledge the specific limitations associated with RF in this context. Random inputs and features yield effective results in classification tasks, yet exhibit less efficacy in regression scenarios [19]. As a result, one of the main challenges in overcoming this performance limitation is the reliance on manual feature engineering. This means that the success of the model depends heavily on how well the features are selected and designed from the dataset. This is especially important for time series data such as acceleration signals, where recognizing time-dependent features such as sequential signal patterns and moving averages is crucial [26].
Another limitation of Random Forest (RF) is its tendency toward static modeling. It struggles to effectively capture the dynamics of systems that evolve over time. In such a case, it becomes problematic when dealing with systems that exhibit temporal changes and long-term dependencies, such as forces derived from acceleration data. Moreover, RF can encounter serious performance issues when handling high-dimensional data. The training and estimation processes can become resource-intensive and time-consuming, especially with larger datasets. This challenge is further compounded by the need for a more comprehensive feature space and the complexity of feature engineering.
In the context of this study, Random Forest encounters several notable challenges:
  • Sequential dependencies: RF treats each data point independently, failing to capture the sequential dependencies inherent in the 251-point voltage signal. These dependencies, both short term and long term, are crucial for accurately estimating the target force value.
  • Aggregate effects of sequential data: The target force value reflects the cumulative effect of all 251 voltage points. RF processes each point in isolation and cannot account for this aggregate relationship.
  • Low variance in the target variable: All 251 points are labeled with the same force value, which reduces the variance in the target variable. This hinders RF’s ability to optimize its decision trees effectively and limits its generalization capability.
  • Complex nonlinear relationships: The voltage signal exhibits nonlinear patterns and trends that RF struggles to model with its decision tree structure, leading to suboptimal regression performance.
  • Identifying critical patterns: Some regions within the sequential data are more influential on the target force value. However, RF fails to prioritize these critical patterns, treating all data points equally.
  • Lack of contextual information: Constant parameters such as pressure and rotational speed significantly influence the voltage signal. RF cannot directly incorporate these contextual factors without explicit feature engineering, which may introduce errors or biases.
  • Time series challenges in RF: While RF can be effective in time series tasks using lag features or sliding windows, such techniques are limited to capturing short-term dependencies. In our problem, the voltage signal requires modeling long-term dependencies and cumulative effects across the entire sequence, which RF is unable to achieve effectively.
Therefore, when considering the estimation of vertical tire force, where the data are characterized by time-sensitive dynamics and the relationships within them are complex, the limitations of RF become apparent. These challenges highlight the need for methodologies that can better manage dynamic systems, temporal changes, and complex dependencies found in time series data.
To address the limitations of Random Forest (RF) in vertical force estimation using sequential data, the proposed methodology integrates advanced techniques to enhance RF’s ability to handle sequential data and complex relationships effectively. The key enhancements are as follows:
  • Incorporation of sequential dependencies: Long-term and short-term dependencies within the 251-point voltage signal are modeled using LSTM and MGU. These components capture the temporal structure of the data and provide RF with enriched features that reflect sequential patterns and dependencies.
  • Optimization with MGU for training and inference speed: Instead of relying solely on LSTM layers, MGU is utilized to optimize training and inference speed. MGU reduces computational complexity while maintaining the ability to model sequential dependencies effectively, making the system more efficient for real-time applications.
  • Extraction of nonlinear relationships: A 1D CNN is employed to extract local patterns and nonlinear relationships from the voltage signal. These patterns, often inaccessible to RF, are passed as high-quality features to improve its regression performance.
  • Prioritization of critical patterns: Multihead Attention highlights the most influential regions within the sequential data, enabling RF to focus on the key segments that are more predictive of the target force value.
  • Mitigation of low target variance: The enriched features derived from deep learning components introduce additional context and variability, allowing for RF to perform better even when the target variable exhibits low variance.
  • Integration of contextual information: The effects of constant parameters such as pressure and rotational speed are implicitly captured by the deep learning layers. These parameters are then incorporated into RF’s feature space, reducing the need for explicit feature engineering.
  • Enhancing interpretability through feature integration: By combining the outputs of CNN, LSTM, MGU, and Multihead Attention, the method produces a comprehensive feature set that bridges the gap between raw sequential data and RF’s decision-making process.
  • Improved efficiency in feature engineering: The reliance on manual feature extraction is significantly reduced by leveraging automated feature generation from deep learning architectures, thus streamlining the process and minimizing errors.

3.2. The Architecture of the Proposed Hybrid RFADNN Model

To mitigate the disadvantages previously outlined for RF and to address the need for modeling long-term dependencies and complex patterns, a hybrid model is proposed that combines the feature extraction ability of deep learning with the high-accuracy estimation capabilities of RF from extracted features, as illustrated in Figure 1. This model introduces the acceleration signal, representing vertical force, as input-to-feature extraction modules derived from time series data. Information regarding tire pressure and rotational speed is integrated with the features extracted from these modules and then fed into the RF module. Utilizing both the extracted features and the pressure and speed information, the RF module outputs the estimated information for vertical force. This approach aims to leverage the strengths of both methodologies to achieve a more accurate and robust estimation model for vertical force estimation.
Figure 1. Load estimation generation using RFADNN.

3.3. Deep Neural Network Model of the Proposed Method

The DNN part of the proposed method consists of TCN, MGU, LSTM, Multihead Attention, and FCNN layers. The Temporal Convolutional Network (TCN) is used to model long-range dependencies, while the Minimal Gated Unit (MGU) serves as a more efficient replacement for traditional gated units. Long Short-Term Memory (LSTM) layers handle long-term dependencies, and Multihead Attention mechanisms focus on the most relevant input features. Fully Connected Neural Networks (FCNNs) perform feature mapping and regression. In this architecture, both the Minimal Gated Unit (MGU) and Long Short-Term Memory (LSTM) layers are utilized to leverage their complementary strengths. MGU is designed for efficiency, providing faster computation with fewer parameters. LSTM excels at capturing more complex long-term dependencies. By integrating both units, the model achieves a balance between computational efficiency and the ability to retain intricate patterns over time. This allows for the DNN to adapt to varying levels of temporal complexity in the data, ensuring both speed and depth in sequence modeling tasks.
The proposed deep neural network N is shown in Figure 2. Initially, the two-dimensional acceleration data ( 251 , 1 ) is preprocessed and converted into a three-dimensional tensor and then fed into the Temporal Convolutional Network (TCN) module. The TCN module consists of three blocks, each with three layers. Through a trial-and-error process, the kernel size in the first and second TCN blocks is set to 20, while it is set to 10 in the third block. The number of filters in the blocks is selected as 64, 36, and 16, respectively. The following equation is used to determine the minimum kernel size required in a TCN:
R F = 1 + 2 × ( kernel_size − 1 ) × ∑ i = 0 n − 1 dilation_rate i
where:
Figure 2. Proposed deep neural network model ( N ) in RFADNN.
  • Receptive field RF is the maximum length of input data that the model can consider at once.
  • kernel_size is the size of the kernel (filter) used in each convolutional layer.
  • dilation_ratei is the dilation rate at the i t h layer, which exponentially increases with the layer level.
  • n is the total number of layers.
The dilation rate for each layer is determined by Dilation rate ( layer ) = 2 ( layer level ) .
The acceleration data, represented by a tensor of dimensions (None, 251, 16), undergoes initial processing in the TCN module before entering the Minimal Gated Unit (MGU) [27] module, as depicted in Figure 2. Structured into three layers with hidden units of 251, 64, and 32 respectively, the MGU module outputs a tensor (None, 251, 32) that encapsulates the dynamics among acceleration data points. This output is then conveyed to the LSTM [28] module for enhanced analysis. The term “None” signifies an undefined or unspecified dimension size in the tensor’s shape. The dimension expressed by “None” entirely stems from the usage procedure of the libraries used for implementation.
These equations in Table 2 describe the different gates and state updates in an LSTM cell. The forget gate ( f t ) controls which information to discard from the cell state, while the input gate ( i t ) decides how much new information to add. The output gate ( o t ) determines how much of the updated cell state is used to compute the hidden state ( h t ). The cell state ( c t ) is updated using a combination of the old state and the new candidate state ( c ˜ t ).
Table 2. LSTM Equations.
In the equations, W f , W i , W o , and W c represent weight matrices that are learned during training. These matrices are used to combine the input vector x t and the previous hidden state h t − 1 for each gate. Each weight matrix corresponds to a specific gate:
  • W f : forget gate weight matrix.
  • W i : input gate weight matrix.
  • W o : output gate weight matrix.
  • W c : cell state candidate weight matrix.
The functions used in MGU equations are as follows:
Similarly, in the MGU equations, W f and W h are weight matrices:
  • W f : forget gate weight matrix in MGU.
  • W h : weight matrix for the hidden state candidate update.
These weights are also learned during training and are used to transform both the input and the hidden states for computing the forget gate and hidden state updates.
MGU reduces the computational cost by combining the functions of LSTM’s three gate mechanisms into a single forget gate. This leads to a model that is computationally more efficient and resource-saving, particularly advantageous when working with large datasets. Below are explanations of the functions used in LSTM and MGU, Table 2 and Table 3, respectively:
Table 3. MGU Equations.
  • Sigmoid function ( σ ): The sigmoid function outputs values between 0 and 1, which determine how much information to pass through the gate.
  • Tanh function (tanh): Used for cell state candidates and hidden states, outputs values between −1 and 1.
  • Element-wise multiplication (⊙): Used for controlling which parts of the cell state are updated.
Comprising two layers with 32 and 251 hidden units, respectively, the LSTM module generates an output tensor (None, 251, 251), which is subsequently analyzed by the multi-head attention module. With an attention mechanism configured to 12 heads and a key dimension of 251, this setup aims to highlight critical segments within the LSTM’s feature tensor, thereby enriching the temporal feature capture from acceleration data. Velocity and pressure data, once integrated in parallel and reshaped to dimensions of (None, 251, 16) and (None, 251, 80), respectively, are then merged with the acceleration data’s feature tensor. This combination results in a unified one-dimensional feature vector with dimensions of (None, 87097). This vector is forwarded to the Fully Connected Neural Network (FCNN) for intermediary estimation processing.
The FCNN, structured in four layers with hidden units numbered at 128, 32, 16, and 4, facilitates a nuanced reduction and abstraction of feature data. Once the neural network N has completed its training, the output of the FCNN, a feature vector with dimensions (None, 4), is used to further refine the training and feature extraction processes. This refinement uses the FCNN’s output to train the RF module, integrating the extracted features from the FCNN. As a result, the dual-part model, combining both DL and RF components, becomes the final model. The FCNN is responsible for intermediate estimations, while the RF module uses the refined feature set for final estimations. The proposed model demonstrates the effective combination of deep learning’s ability to process abstract features and the estimation power of the RF module, forming a solid foundation for improved estimation accuracy.
Loss function: To improve estimation accuracy, the loss function is composed of three key components: the weighted loss ( L w ), the outlier loss ( L s ), and the MSE penalty ( L p ). The weighted loss ( L w ) is particularly designed to adjust the model’s focus on errors based on their magnitude, thereby ensuring a balanced learning approach across both small and large discrepancies.
The weighted loss is defined as follows:
L w = ∑ i = 1 n w i · | F i − F ^ i | ,
where the dynamic weights w i are computed based on the magnitude of the error, expressed as follows:
w i = ( | F i − F ^ i | + ϵ ) α
In this formulation, w i represents the dynamic weights assigned to each error based on its magnitude. The term ϵ = 1 × 10 − 6 is included to ensure numerical stability, preventing division by zero or extremely small values. The parameter α = 0.5 controls the sensitivity of the weighting, allowing for the model to balance the focus on larger errors without over-penalizing smaller ones.
The log-cosh function is used in the outlier loss ( L s ) to reduce the influence of outliers. For small errors, this function behaves similarly to the Mean Squared Error (MSE), but as the error increases, it gradually transitions to a behavior similar to the Mean Absolute Error (MAE). This ensures that the model does not disproportionately react to large deviations, maintaining a balanced response to all errors.
L s = λ · log ( cosh ( F − F ^ ) )
In this formula, λ is a scaling factor, and the log-cosh function [29] effectively smooths the loss for larger errors, preventing the model from overfitting to these extreme values.
Moreover, the MSE penalty L p introduces an additional punitive measure for instances where the model’s mean squared error exceeds a predefined threshold, encouraging the model to prioritize the reduction of large errors more aggressively:
L p = δ · max ( 0 , β · ( M S E − T m s e ) γ )
After detailing the components, the combined loss function, denoted as L c , is given by the following:
L c ( F , F ^ ) = L w + L s + L p
The parameters for these components are determined through trial and error, with the chosen values being λ = 0.1 for modulating the outlier loss, T mse = 50 as the threshold for invoking the MSE penalty, β and γ = 2 for defining the severity and growth rate of the penalty, respectively, and a penalty weight of δ = 0.02 . Setting a relatively low MSE threshold and a comparatively high weight for the MSE penalty in the total loss facilitated a rapid decrease and convergence to near-zero values in the training MSE. However, experiments conducted indicated that this configuration made it challenging to reduce the discrepancy between the MSE of the validation data and the training MSE below a certain level. Consequently, the penalty weight parameter δ was selected to be relatively small. Similarly, choosing a relatively low value for the λ parameter, which adjusts the weight of the log-cosh loss in the total loss, hindered the narrowing of the gap between the training and validation datasets.
It is noteworthy that a minimal disparity between the MSE values of the training and validation sets can serve as an indicator of reduced overfitting effects. This observation underscores the importance of carefully calibrating the MSE penalty and its weight within the overall loss function to maintain a balance between learning efficiency and the generalization capability of the model.
For optimization, the Adam optimizer is employed with β 1 = 0.9 and β 2 = 0.999 . The learning process is initiated with a learning rate of 3 × 10 − 4 , but if a reduction in the validation loss is not observed over every five learning steps, the learning rate is reduced to a quarter of its value. The minimum possible learning rate was set to 0.75 × 10 − 4 . Moreover, a condition is established to terminate the neural network training if no improvement in validation loss is achieved over 600 steps. Additionally, the maximum number of epochs set for training is 20,000, providing an extensive opportunity for the model to learn and converge.

3.4. Implementation Details of the Proposed Method

Before training the model, all data were normalized to fall within the [0, 1] range, to accelerate the training process. The proposed method was implemented in the Python 3.8, utilizing the TensorFlow 2.4 library. While the training of the model’s deep neural network portion took between 50–55 h on a Quadro T2000 GPU, the training of the Random Forest component was completed in just a few minutes. The operational schema of the method, including a workflow diagram, is depicted in Figure 3. In the dual-model structure, the neural network component is trained for feature extraction over the pre-determined maximum number of epochs. If no improvement in loss, as calculated by the loss function described in the previous section, is observed during this specified epoch count, the training is halted. Subsequently, feature extractions are conducted using the most optimally weighted model up to that point, and these features are then forwarded to the Random Forest component, which possesses 10,000 estimator units, for its training phase. If the Random Forest training yields a Mean Absolute Error (MAE) lower than 1.0 kgf, then the training and its estimations are considered valid. Otherwise, the training process restarts from the initial step, specifically from the neural network segment. The details of this flow and the mechanism in Figure 3 are explained below.
Figure 3. Flowchart of the proposed load estimation mechanism with the RFADNN model.
  • The flow starts with training the model, N , using the training dataset. The training process continues either until the maximum number of epochs is reached or the loss function shows no significant decrease over a certain number of epochs.
  • After completing one iteration of training, an intermediate model is created by extracting the final layer of the Fully Connected Neural Network, which is the last layer of N .
  • Using this intermediate model, features (intermediate vertical force predictions) are collected from the training dataset, which includes acceleration, pressure, and speed data.
  • These features, along with their corresponding labels, are used to train the Random Forest Regressor.
  • During inference and testing, the intermediate model is again used to collect features from the test dataset (acceleration, pressure, and speed). The Random Forest Regressor then predicts the final vertical force based solely on these collected features.
  • If the Mean Absolute Error (MAE) of the predictions on the test dataset exceeds 1.0 kgf, another iteration of training begins for both N and the Random Forest Regressor.
  • The iterative training process continues until the MAE falls below 1. Once this criterion is met, the training process is considered complete, and the final predictions are utilized.
In the initial stages of model development, the decision was deliberately made not to incorporate the dropout mechanism. This decision was informed by preliminary observations indicating that the inclusion of dropouts adversely influenced the learning process, hindering the achievement of the desired performance metrics. A particularly concerning issue was the model’s tendency to overfit, as evidenced by the Mean Squared Error (MSE) values for the training set approaching near zero while remaining significantly higher for the validation set as the number of training epochs increased. This discrepancy underscored the failure to narrow the gap between the training and validation of MSE values as anticipated.
In light of these challenges, the architecture of the model underwent a comprehensive strategic rework. The first remedy was the removal of three LSTM (Long Short-Term Memory) layers from the architectural design and their replacement with MGU (Minimal Gated Unit) layers. This change was introduced to reduce the complexity of the model’s structure, with the assumption that it would help in minimizing overfitting, as outlined in this paper. The MGU layers, being simpler than LSTMs, indeed showed less overfitting. However, even after these adjustments, the problem persisted; a plateau began to emerge in the loss estimated by MSE and the validation loss.
In our experiments, we identified the cause of this stagnation, which was primarily the fact that all layers were MGU. To overcome this bottleneck in training, a hybrid configuration was proposed, extending the model with two more LSTM layers alongside the existing MGU layers. Since the hypothesized complementary strengths of LSTM and MGU layers could potentially assist with overfitting without diminishing the model’s capacity, a third strategy combined aspects from each tabular data set approach. The LSTMs were integrated to capture long-term dependencies, thus enhancing the estimation power of our model without reverting to the complexities that initially caused overfitting.
This hybrid architecture was a milestone that fundamentally changed how models would be developed going forward. The combination of MGU and LSTM layers not only helped to reduce overfitting, but also achieved the desired MSE and validation loss metrics. The careful balance of adding some complexity to improve performance through optimized execution paths underscored how well this new approach resolved the issues that initially arose.

4. Dataset Construction

This section explains the construction of the dataset for the proposed method. Firstly, the experimental data acquisition system and the test machine, both located at Pirelli’s automotive tire factory in İzmit, were set up and tested. Then, the dataset was constructed and labeled using different approaches.

4.1. Experimental Data Acquisition Setup

To acquire the acceleration signals used for training and testing the proposed DNN and the overall hybrid model, a P ZERO racing tire of size 325/680-18 with a hardness rating of 71 Shore A according to the ASTM D2240 measurement standard was utilized. As depicted in Figure 4, the tire was mounted on a B1008 HST model high-speed testing machine produced by Tianjin Jiurong, facilitating the collection of necessary data. During all experimental data collection operations, the camber and slip angles were set to zero, and the test cabin temperature was maintained between 22 and 25 °C.
Figure 4. Acceleration sensor and test racing tire utilized for data collection.
The test machine is equipped with measurement systems that can assess vertical load, rotational speed, tire internal pressure, cabin temperature, and camber angle values. It is primarily utilized to obtain and test the wear characteristics and durability periods of tires when rotated under various loads, speeds, and camber angles. Additionally, the driving characteristics of racetracks are prescribed to the machine, facilitating the testing of tires under these specific conditions. A MEAS 234M1-2000 tri-axial acceleration sensor, capable of measuring up to 2000 g, was placed inside the tire’s inner layer. The sensor was connected to the external environment through cables for power supply and acceleration data transmission.
The slip ring shown in Figure 4 was used to transfer the vertical acceleration acting on the tire, converted into an analog voltage by the accelerometer, to the data acquisition card shown in Figure 5, and subsequently to the data acquisition PC. The acceleration sensor, as shown in Figure 4, was attached by adhering it to the inner surface of the tire.
Figure 5. Experimental data acquisition setup.
The acceleration sensor is powered through a regulated power supply at a supply voltage of 3.3 volts. The acceleration data, representing vertical force, are then transferred to a PC via the NI USB-6346 data acquisition hardware and NI DAQ Express software 5.0. The sampling frequency used was 10 kHz.
The tire’s internal pressure was adjusted and stabilized according to pressure set values using a calibrated air pump, and the tire’s rotation speed and the force acting on the tire were controlled via the high-speed machine’s monitoring and control screen, shown in Figure 5. The tire’s rotational movement was provided by the wheel, as shown in Figure 5, and the reference loads applied to the tire were delivered by the hydraulic-driven load applicator, also depicted in Figure 5.

4.2. Data Collection and Labeling

After the construction of the experimental setup, the system was initiated, and data collection commenced. This process also marked the beginning of the labeling, as follows. The pre-labeling was performed immediately after the data collection is completed. During this phase, the data recorded over a 60-s period was assigned a single state identifier, ( F i , P j , S k ) , as defined in Equation (19). Each state ( F i , P j , S k ) represents the experimental conditions, including vertical load, pressure, and rotational speed. Importantly, this state is not the label itself, but defines the experimental conditions under which the data were collected. The actual label for each state is the corresponding vertical force value, F i .
In the second labeling phase, following filtering and the application of min–max normalization, the data was manually labeled. During this manual labeling process, each 60-s data block associated with a state ( F i , P j , S k ) was divided into acceleration data segments, each consisting of 251 samples, corresponding to a duration of 0.0251 s. These segments inherit the same label as the vertical force value, F i , associated with the state ( F i , P j , S k ) to which they belong.
Finally, the last labeling step was performed automatically using a specifically designed deep learning model.

4.2.1. Pre-Labeling After Data Collection Phase

The data were collected under varying conditions, including ten distinct load values ranging from 150 kgf to 420 kgf, with pressures set at two distinct values of 200 and 220 kPa, and speeds set at three distinct values of 30, 50, and 70 km/h. For each load value, acceleration data were recorded continuously for a duration of 60 s. The only real-time data acquisition involved the vertical acceleration acting on the tire. Reference values for speed, load, and pressure were measured in real-time and monitored on the high-speed machine’s control and monitoring screen, as shown in Figure 5. The data acquisition for vertical acceleration was initiated only after confirming that the actual values matched the set values and that these real-time values were stable. After the data collection process, pre-labeling was performed, where the acceleration signals were tagged with the corresponding load, speed, and pressure set values. This labeling process was conducted only after it was ensured that the actual values had stabilized and matched the set values throughout the recording period.
Figure 6 illustrates the subset of the pre-labeled acceleration data corresponding to a 60 s state. The acceleration data in voltage form were sampled from the acceleration sensor inside the tire under the conditions of 150 kg vertical force, 200 kPa internal tire pressure, and 30 km/h rotational speed. The pre-labeling acted as a preliminary tagging process to ensure the integrity of the collected signal.
Figure 6. Pre-labeled acceleration signal representing vertical acceleration over a 60 s period for a state ( F i , P j , S k ) labeled as ( F i ) .

4.2.2. Preprocessing and Manual Labeling

After the data collection phase and pre-labeling, the acquired signals were processed using a low-pass filter with a 350 Hz cut-off frequency, and normalization was applied to ensure consistency across all recorded signals. Subsequently, 30% of the data, corresponding to the first 18 s of each 60 s block for each state ( F i , P j , S k ) , was manually labeled as ( F i ) to verify the accuracy of the pre-labeling and ensure the overall quality of the dataset. Each manually labeled data segment consisted of 251 data points. During the manual labeling, it was ensured that these segments matched the stable load, pressure, and speed values while filtering out any unhealthy or erroneous signals. As an example, a portion of the manually labeled acceleration data, corresponding to four rotations of the tire, is shown in Figure 7. This figure demonstrates how labeling was performed on four 251-point acceleration signal segments corresponding to a specific state with a force value ( F i ) .
Figure 7. Labeled acceleration signal segments.

4.2.3. Automatic Data Labeling

The primary objectives of the automatic labeling process mirrored those of the manual labeling phase; in addition, it encompasses the following functions:
  • Filtering out excessively noisy signal blocks that could not be corrected through preprocessing;
  • Automatically segmenting the pre-labeled 60 s data block into 251-point segments and assigning these the corresponding state identifier; ( F i , P j , S k )
  • Reducing the time and manual effort required for labeling.
To achieve these objectives, the 60 s pre-labeled acceleration data, as discussed in the previous section, were divided into atomic blocks of 251 sampled data points using a sliding window technique. This approach ensured that the signal blocks were efficiently processed and labeled according to their corresponding states. Figure 8 illustrates the deep learning model designed for automatic labeling, which was specifically trained to recognize patterns within the acceleration signals and accurately apply the pre-defined state labels. Figure 8 incorporate 1D convolutional layers and a transformer encoder with an attention mechanism. The left part of the figure illustrates the model architecture during the training phase, while the right part depicts the model’s operation during the automatic labeling phase. The model was trained using binary cross-entropy loss.
Figure 8. Deep learning model for automatic labeling.
To train the model shown in Figure 8, 50% of the manually labeled 251-point acceleration signal data segments were used in training, while the remaining 50% of the manually labeled data were used in the validation dataset. This division ensured that the model was not only able to learn from the labeled data, but also evaluated unseen data to ensure its generalization performance.
Furthermore, the dataset was augmented by adding Gaussian noise to 35% of the manually labeled data. This noisy data was split into 15% for training, 15% for validation, and the remaining 70% was used as the test dataset. This augmentation process helped to increase the robustness of the model by exposing it to variations in the acceleration signals. In Figure 9, 251-point acceleration data segments and corresponding noisy augmented data are illustrated.
Figure 9. The 251-point data segments and corresponding noisy augmented segments for ( F i , P j , S k ) .
The segmented 251-point atomic data was processed through 1D convolutional layers, which were designed to detect local patterns in the acceleration signals. This was followed by a transformer encoder block, which employed the attention mechanism to capture long-term dependencies in the sequential 1D data and identify broader patterns within the dataset. The model was trained using the binary cross-entropy loss function, and classification and automatic labeling were subsequently performed based on the learned patterns from the training phase.
After the model was trained for a specific state ( F i , P j , S k ) , it was employed to automatically label the remaining data corresponding to that same state. For each subsequent state, the model’s weights were reset, and the training and labeling process was repeated for the new state.
Figure 10 presents the confusion matrix, illustrating the performance of the 1D CNN and transformer encoder-based deep learning model on the test data for automatic acceleration data labeling, specifically for the state (150 kg, 70 km/h, 200 kPa). The model was trained using the Adam optimization algorithm with a learning rate of 1 × 10−4. Since the labeling task is inherently a classification problem, binary cross-entropy was employed as the loss function. The model was trained for a total of 500 epochs. True Positive (TP) and True Negative (TN) signal examples, along with their respective heatmaps, are shown in Figure 11 and Figure 12, respectively, which are generated by the model’s attention mechanism, highlighting the key areas contributing to the correct classification. The heatmaps reflect the attention weight scores assigned by the model, highlighting which regions of the input data contributed most to the classification decision. Higher attention weights indicate areas of greater importance in determining whether the signal is classified as TP or TN.
Figure 10. Automatic labeling: confusion matrix on a subset of test dataset.
Figure 11. Automatic labeling: True Positive (TP) data segment and corresponding attention heatmap.
Figure 12. Automatic labeling: True Negative (TN) data segment and corresponding attention heatmap.
Upon completing the pre-processing steps, the dataset was shuffled to generate distinct subsets for training, validation, and testing, with 70% of the data allocated for training, 15% for validation, and 15% for testing. This configuration was employed in the deep learning model designed for hybrid load estimation to assess its performance in estimating load values based on acceleration signals.
The model and data splits used for automatic labeling were intentionally separated from those applied in the hybrid load estimation model. The automatic labeling phase employed a different model architecture, along with data augmentation techniques and evaluation strategies, to accurately label the acceleration data. In contrast, the hybrid load estimation model utilized 70% of the dataset for training, 15% for validation, and 15% for testing to estimate load conditions. These two models served distinct purposes, each relying on separate data processing pipelines.

5. Performance Evaluations

The mean absolute error (MAE), Percentage Normalized Root Mean Square Wrror (NRMS%), coefficient of determination (R squared), and Root Mean Square Error (RMSE) were used to evaluate the performance of the proposed method compared to other methods. The formulas are as follows:
MAE = 1 n ∑ i = 1 n | F i − F ^ i |
NRMS% = 1 n ∑ i = 1 n ( F i − F ^ i ) 2 F ¯ × 100 %
R 2 = 1 − ∑ i = 1 n ( F i − F ^ i ) 2 ∑ i = 1 n ( F i − F ¯ ) 2
RMSE = 1 n ∑ i = 1 n ( F i − F ^ i ) 2
where,
  • F i : actual measured force;
  • F ^ i : values estimated by the model;
  • F ¯ : the average of the actual values;
  • n: the number of samples.
The proposed method is compared with traditional LSTrefM and dilated convolution methods, as well as with the study presented in [18], based on the performance criteria stated above. The results of the comparison are given in Table 4, Table 5 and Table 6 for several metrics. Figure 13, Figure 14, Figure 15, Figure 16, Figure 17, Figure 18, Figure 19, Figure 20, Figure 21, Figure 22, Figure 23, Figure 24, Figure 25, Figure 26, Figure 27, Figure 28, Figure 29, Figure 30, Figure 31 and Figure 32 illustrate the regions of the data that the model attends to and their impact on estimation accuracy. In Figure 13, Figure 14, Figure 15, Figure 16, Figure 17, Figure 18, Figure 19, Figure 20, Figure 21 and Figure 22, the attention heatmaps generated after 250 epochs of training are shown, while Figure 23, Figure 24, Figure 25, Figure 26, Figure 27, Figure 28, Figure 29, Figure 30, Figure 31 and Figure 32 presents the attention maps after 1000 epochs of training. It can be observed that the attention weights in the heatmaps after 1000 epochs are concentrated on fewer points compared to the results after 250 epochs. In the heatmaps, the regions highlighted in yellow represent areas where the attention is highly focused, indicating high attention scores, while regions in blue represent areas with minimal attention scores. This shift towards more concentrated attention with increased training likely enables the model to focus on the most relevant features, leading to improved estimation accuracy. This more concentrated focus likely contributes to more accurate estimations, as the model learns to prioritize the most relevant parts of the sequence as the number of epochs increases. In each graph, the original data obtained under different vertical loads (150 kg, 180 kg, 210 kg, … 420 kg) are presented alongside the attention heatmaps generated by the attention mechanism.
Table 4. Performance comparison of the proposed methods for MAE, RMSE, and NRMS (Part 1).
Table 5. Performance comparison of the proposed methods for R 2 and hidden layers/units (Part 2).
Table 6. Performance comparison of the proposed methods for model size and estimation time (Part 3).
Figure 13. Visualization of original data (left) and the corresponding attention heatmaps (right) for load class 150 kgf after 250 training epochs.
Figure 14. Visualization of original data (left) and the corresponding attention heatmaps (right) for load class 180 kgf after 250 training epochs.
Figure 15. Visualization of original data (left) and the corresponding attention heatmaps (right) for load class 210 kgf after 250 training epochs.
Figure 16. Visualization of original data (left) and the corresponding attention heatmaps (right) for load class 240 kgf after 250 training epochs.
Figure 17. Visualization of original data (left) and the corresponding attention heatmaps (right) for load class 270 kgf after 250 training epochs.
Figure 18. Visualization of original data (left) and the corresponding attention heatmaps (right) for load class 300 kgf after 250 training epochs.
Figure 19. Visualization of original data (left) and the corresponding attention heatmaps (right) for load class 330 kgf after 250 training epochs.
Figure 20. Visualization of original data (left) and the corresponding attention heatmaps (right) for load class 360 kgf after 250 training epochs.
Figure 21. Visualization of original data (left) and the corresponding attention heatmaps (right) for load class 390 kgf after 250 training epochs.
Figure 22. Visualization of original data (left) and the corresponding attention heatmaps (right) for load class 420 kgf after 250 training epochs.
Figure 23. Visualization of original data (left) and the corresponding attention heatmaps (right) for load class 150 kgf after 1000 training epochs.
Figure 24. Visualization of original data (left) and the corresponding attention heatmaps (right) for load class 180 kgf after 1000 training epochs.
Figure 25. Visualization of original data (left) and the corresponding attention heatmaps (right) for load class 210 kgf after 1000 training epochs.
Figure 26. Visualization of original data (left) and the corresponding attention heatmaps (right) for load class 240 kgf after 1000 training epochs.
Figure 27. Visualization of original data (left) and the corresponding attention heatmaps (right) for load class 270 kgf after 1000 training epochs.
Figure 28. Visualization of original data (left) and the corresponding attention heatmaps (right) for load class 300 kgf after 1000 training epochs.
Figure 29. Visualization of original data (left) and the corresponding attention heatmaps (right) for load class 330 kgf after 1000 training epochs.
Figure 30. Visualization of original data (left) and the corresponding attention heatmaps (right) for load class 360 kgf after 1000 training epochs.
Figure 31. Visualization of original data (left) and the corresponding attention heatmaps (right) for load class 390 kgf after 1000 training epochs.
Figure 32. Visualization of original data (left) and the corresponding attention heatmaps (right) for load class 420 kgf after 1000 training epochs.
In the comparative analysis conducted, the proposed technique demonstrated superior performance across all evaluated performance metrics, including MAE, RMSE, R2, and NRMS%, consistently outperforming all other methods compared in the study. This establishes the proposed technique as the most effective approach among the methods analyzed. In terms of memory footprint, it ranked second after the 1D Convolution-BiGRU [20] method. However, with an average estimation time of 3.44 ms, it exhibited inferior performance compared to other methods. Nonetheless, the critical importance placed on achieving high accuracy in performance metrics outweighs concerns regarding estimation speed. The baseline LSTM model shows an estimation error with an MAE of 1.816 kgf on the dataset. Notably, the proposed RFADNN method reduced the error to an MAE of about 0.77 kgf, as detailed in the same table.
Figure 33 illustrates the performance of the proposed method in estimating the load exerted on the test tire, as shown in Figure 4, under various internal inflation pressures and at different rotational speeds. The graphs indicate instances of sudden divergence between the estimated errors and the actual values. This discrepancy is attributed to mechanical vibrations in the section of the tire testing machine that applies force to the tire.
Figure 33. Performance of the proposed technique (RFADNN) at different speeds and under different pressure values: (top): 30 km/h and 200 kPa, (second): 50 km/h and 200 kPa, (middle): 70 km/h and 200 kPa, (fourth): 50 km/h and 220 kPa, (bottom): 70 km/h and 220 kPa.

6. Conclusions

In this paper, a novel hybrid methodology is proposed to address serious problems in vertical tire force estimation, particularly in cases involving dynamic and noisy conditions. The proposed approach improves the resilience and adaptability of tire force estimation tasks by combining advanced deep learning architectures with classic machine learning methods. The proposed method significantly enhanced Random Forest’s performance by integrating deep learning-derived features.
The proposed method was specifically designed to address the methodological constraints identified in the literature while leveraging existing network structures. These constraints include deformation frequency filtering limitations, reliance on tire geometric parameters, computational challenges in vehicle model-based methods, and the inability to model sequential dependencies in Random Forest approaches. Our study successfully overcomes these challenges, achieving notable improvements in performance and robustness.
Conventional filters that handle deformation frequency signals using cutoff frequencies frequently malfunction in a variety of pressure and speed scenarios. This problem was immediately solved by the Multihead Attention mechanism, which dynamically recognized and prioritized important patterns in the sequential data while adding pressure and speed as inputs to provide robustness against variation.
Approaches reliant on geometric parameters such as tire radius or contact patch dimensions often encounter issues due to wear and pressure fluctuations. Our method addresses this limitation by utilizing raw sensor data and extracting features through deep learning layers, which enhances adaptability to dynamic conditions without the reliance on predefined geometric parameters.
Some traditional methods rely on the double integration of acceleration signals to calculate peak radial displacement and relate it to vertical force, which can result in misleading estimations due to accumulated noise and drift. Instead of focusing solely on area- or volume-based calculations, the proposed method emphasizes sequential dependencies and the intrinsic shape of the signal. The model captures temporal patterns and prioritizes critical features in the acceleration signal, enabling more accurate and reliable vertical force estimations with the help of speed and pressure measurement data.
For real-time applications, such as motorsport races, traditional models often require substantial computational resources and rely on indirect measurements. While the variable height of the center of gravity is typically assumed to be constant, the mass of the vehicle is required to be calculated in real-time to accurately estimate the vertical force on the tires. The proposed method is applicable for real-time estimations, as it directly utilizes acceleration measurements from the tire and eliminates the need for vehicle parameter assumptions or calculations. Additionally, the incorporation of the Minimal Gated Unit reduced the number of LSTM units, thereby decreasing the computational load without compromising the model’s ability to capture sequential dependencies.
Because Random Forest methods are static, they have historically struggled to handle sequential data. The proposed method enhanced the feature space with sequential and contextual information by extracting learned features of acceleration data from the last layer of the model’s Fully Connected Layer and training the Regressive Random Forest with these features, combined with speed and pressure data. This approach enabled the Random Forest component to efficiently manage intricate temporal interactions with the support of the front deep neural network elements.
Experimental results validate the effectiveness of the proposed methodology, demonstrating substantial improvements in MAE and RMSE. The RFADNN achieved an MAE of 0.773 kgf and an RMSE of 3.930 kgf on a dataset of 10,859 data segments, outperforming existing methods in comparative analyzes.

Author Contributions

S.Ö.: Conceptualization, Methodology, Software, Validation, Investigation, Data Curation. E.C.K.: Software, Writing—Original Draft, Visualization. M.Z.K.: Conceptualization, Methodology, Writing—Original Draft, Review and Editing, Resources. H.M.E.: Conceptualization, Methodology, Review and Editing, Supervision. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Institutional Review Board Statement

Not applicable.

Data Availability Statement

The data presented in this study are available on request from the corresponding author (privacy).

Acknowledgments

The authors would like to acknowledge the support provided by Pirelli Automobile Tires İzmit factory. This research study was conducted within the R&D Center of Pirelli Automobile Tires Corporation, Kocaeli, Türkiye.

Conflicts of Interest

Author Egemen Cumhur Kaleli was employed by the company Pirelli Automobile Tires Corporation. The remaining authors declare that the research was conducted in the absence of any commercial or financial relationships that could be construed as a potential conflict of interest.

References

  1. Gu, T.; Li, B.; Quan, Z.; Bei, S.; Yin, G.; Guo, J.; Zhou, X.; Han, X. The vertical force estimation algorithm based on smart tire technology. World Electr. Veh. J. 2022, 13, 104. [Google Scholar] [CrossRef] [Scilit]
  2. Ding, X.; Wang, Z.; Zhang, L.; Liu, J. A comprehensive vehicle stability assessment system based on enabling tire force estimation. IEEE Trans. Veh. Technol. 2022, 71, 11571–11588. [Google Scholar] [CrossRef] [Scilit]
  3. Li, R.; Sun, Y.; Lu, Z.; Tian, G. Tire Force Allocation with Different Vertical Load Estimation Methods for 4WID-4WIS Vehicles. In Proceedings of the 2022 IEEE Vehicle Power and Propulsion Conference (VPPC), Merced, CA, USA, 1–4 November 2022; pp. 1–6. [Google Scholar]
  4. Lee, H.; Taheri, S. Intelligent tires? A review of tire characterization literature. IEEE Intell. Transp. Syst. Mag. 2017, 9, 114–135. [Google Scholar] [CrossRef] [Scilit]
  5. Rezaeian, A.; Zarringhalam, R.; Fallah, S.; Melek, W.; Khajepour, A.; Chen, S.-K.; Moshchuck, N.; Litkouhi, B. Novel tire force estimation strategy for real-time implementation on vehicle applications. IEEE Trans. Veh. Technol. 2015, 64, 2231–2241. [Google Scholar] [CrossRef] [Scilit]
  6. Liang, G.; Wang, Y.; Garcia, A.; Liu, Z.; Kaliske, M.; Wei, Y. A Universal Approach to Tire Forces Estimation by Accelerometer-Based Intelligent Tire: Analytical Model and Experimental Validation. Tire Sci. Technol. 2022, 50, 2–26. [Google Scholar] [CrossRef] [Scilit]
  7. Zhang, B.; Xu, T.; Wang, H.; Huang, Y.; Chen, G. Vertical tire forces estimation of multi-axle trucks based on an adaptive treble extend Kalman filter. Chin. J. Mech. Eng. 2021, 34, 55. [Google Scholar] [CrossRef] [Scilit]
  8. Wilson, G.; Ramirez-Serrano, A.; Sun, Q. Geometric-based tyre vertical force estimation and stiffness parameterisation for automotive and unmanned vehicle applications. Veh. Syst. Dyn. 2017, 55, 168–190. [Google Scholar] [CrossRef] [Scilit]
  9. Harth, V.; Fayet, M.; Renou, L.M.C. A modelling approach to tire-obstacle interaction. Multibody Syst. Dyn. 2004, 11, 23–39. [Google Scholar] [CrossRef] [Scilit]
  10. Kim, S.; Jeong, Y.; Kim, J.; Lee, S.; Chung, C. Vehicular vertical tire forces estimation using unscented Kalman filter. In Proceedings of the 12th Asian Control Conference (ASCC), Kitakyushu, Japan, 9–12 June 2019; pp. 325–330. [Google Scholar]
  11. Wang, H.; Nagayama, T.; Su, D. Estimation of Dynamic Tire Force by Measurement of Vehicle Body Responses with Numerical and Experimental Validation. Mech. Syst. Signal Process. 2019, 123, 369–385. [Google Scholar] [CrossRef] [Scilit]
  12. Jiang, K.; Yang, D.; Xie, S.; Xiao, Z.; Victorino, A.; Charara, A. Real-time estimation and estimation of tire forces using digital map for driving risk assessment. Transp. Res. Part C 2019, 107, 463–489. [Google Scholar] [CrossRef] [Scilit]
  13. Acosta, M.; Kanarachos and, S.; Fitzpatrick, M. A Virtual Sensor for Integral Tire Force Estimation using Tire Model-Less Approaches and Adaptive Unscented Kalman Filter. In Proceedings of the 14th International Conference on Informatics in Control, Automation and Robotics (ICINCO), Madrid, Spain, 26–28 July 2017; pp. 386–397. [Google Scholar]
  14. Jeong, D.; Kim, S.; Lee, J.; Choi, S.B.; Kim, M.; Lee, H. Estimation of tire load and vehicle parameters using intelligent tires combined with vehicle dynamics. IEEE Trans. Instrum. Meas. 2020, 70, 9502712. [Google Scholar] [CrossRef] [Scilit]
  15. Singh, K.; Taheri, S. Accelerometer based method for tire load and slip angle estimation. Vibration 2019, 2, 174–186. [Google Scholar] [CrossRef] [Scilit]
  16. Doumiati, M.; Victorino, A.; Lechner, D.; Baffet, G.; Charara, A. Observers for vehicle tyre/road forces estimation: Experimental validation. Veh. Syst. Dyn. 2010, 48, 1345–1378. [Google Scholar] [CrossRef] [Scilit]
  17. Schmeitz, A.J.; Teerhuis, A.P. Robustness and applicability of a model-based tire state estimator for an intelligent tire. Tire Sci. Technol. 2018, 46, 105–126. [Google Scholar] [CrossRef] [Scilit]
  18. Xu, N.; Askari, H.; Huang, Y.; Zhou, J.; Khajepour, A. Tire force estimation in intelligent tires using machine learning. IEEE Trans. Intell. Transp. Syst. 2020, 23, 3565–3574. [Google Scholar] [CrossRef] [Scilit]
  19. Breiman, L. Random Forests. Mach. Learn. 2001, 45, 5–32. [Google Scholar] [CrossRef] [Scilit]
  20. Ji, Y.; Zeng, J.; Ren, L. Research on the estimation of Tire Radial Load Based on 1D CNN and BiGRU. Int. J. Comput. Intell. Syst. 2023, 16, 185. [Google Scholar] [CrossRef] [Scilit]
  21. Im, S.J.; Oh, J.S.; Kim, G.W. Simultaneous Estimation of Unknown Road Roughness Input and Tire Normal Forces Based on a Long Short-Term Memory Model. IEEE Access 2022, 10, 16655–16669. [Google Scholar] [CrossRef] [Scilit]
  22. Wang, G.; Li, S.; Feng, G. Online Estimation of Three-Directional Tire Forces Based on a Self-Organizing Neural Network. Machines 2023, 11, 344. [Google Scholar] [CrossRef] [Scilit]
  23. Viehweger, M.; Vaseur, C.; van Aalst, S.; Acosta, M.; Regolin, E.; Alatorre, A.; Desmet, W.; Naets, F.; Ivanov, V.; Ferrara, A.; et al. Vehicle state and tyre force estimation: Demonstrations and guidelines. Veh. Syst. Dyn. 2021, 59, 675–702. [Google Scholar] [CrossRef] [Scilit]
  24. Cheon, D.; Choi, W.; Nam, K.; Oh, S. Tire vertical force estimation method using suspension deformation and stochastic road model in vehicle suspension system. In Proceedings of the IEEE Vehicle Power and Propulsion Conference (VPPC), Merced, CA, USA, 1–4 November 2022; pp. 1–5. [Google Scholar]
  25. Suyabodha, A. A relationship between tyre pressure and rolling resistance force under different vehicle speed. In Proceedings of the 2017 International Conference on Mechanical, Aeronautical and Automotive Engineering (ICMAA 2017), MATEC Web of Conferences, Malacca, Malaysia, 25–27 February 2017; Volume 108, p. 12004. [Google Scholar]
  26. Bernard, S.; Adam, S.; Heutte, L. Dynamic random forests. Pattern Recognit. Lett. 2012, 33, 1580–1586. [Google Scholar] [CrossRef] [Scilit]
  27. Zhou, G.B.; Wu, J.; Zhang, C.L.; Zhou, Z.H. Minimal gated unit for recurrent neural networks. Int. J. Autom. Comput. 2016, 13, 226–234. [Google Scholar] [CrossRef] [Scilit]
  28. Hochreiter, S.; Schmidhuber, J. Long Short-term Memory. Neural Comput. 1997, 9, 1735–1780. [Google Scholar] [CrossRef] [Scilit] [PubMed]
  29. Jiawei, L.; Wu, W.; Feng, X. Improved Physics-Informed Neural Networks Combined with Small Sample Learning to Solve Two-Dimensional Stefan Problem. Entropy 2023, 25, 675. [Google Scholar] [CrossRef] [Scilit]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Article Metrics

Citations

Article Access Statistics

Multiple requests from the same IP address are counted as one view.