A Safety Collision Avoidance Algorithm Based on Comprehensive Characteristics

Zhang, Y. J.; Du, F.; Wang, J.; Ke, L. S.; Wang, M.; Hu, Y.; Yu, M.; Li, G. H.; Zhan, A. Y.

doi:https://doi.org/10.1155/2020/1616420

Complexity

On this page

Abstract Introduction Conclusion Data Availability Conflicts of Interest Acknowledgments References Copyright Related Articles

Special Issue

Collaborative Big Data Management and Analytics in Complex Systems with Edge

View this Special Issue

Research Article | Open Access

Volume 2020 | Article ID 1616420 | https://doi.org/10.1155/2020/1616420

A Safety Collision Avoidance Algorithm Based on Comprehensive Characteristics

Y. J. Zhang,¹F. Du,¹J. Wang,¹L. S. Ke,²M. Wang,¹Y. Hu,¹M. Yu,¹G. H. Li,¹and A. Y. Zhan¹

Guest Editor: Xuyun Zhang

Received17 Sept 2019

Revised07 Feb 2020

Accepted18 Feb 2020

Published17 Mar 2020

Abstract

Aiming at the requirements of vehicle safety collision avoidance system, a safety collision avoidance algorithm based on environmental characteristics and driver characteristics is proposed. By analyzing the relationship between collision avoidance time and the environment, a safety time model is established. In the established safety time model, parameters based on driver characteristics are added, which increases the flexibility of the algorithm. The algorithm can adapt to more different driving conditions and give appropriate warning thresholds. After simulation and comparison with other algorithms, the algorithm proposed in this paper can satisfied the requirements of reducing vehicle collision risk. The effectiveness and feasibility of the algorithm are verified, and the safety of vehicle driving can be improved.

1. Introduction

Since entering the 21st century, the number of vehicles has increased exponentially, and the number of vehicles and drivers has further increased [1]. How to reduce the number of traffic accident deaths and economic losses has become an important issue in the context of such a large number of vehicles [2].

In recent years, some research studies have been made on the collision warning algorithm. The existing collision warning algorithms are mainly divided into two categories, namely, the Safety Time Algorithm and the Safety Distance Algorithm [3]. The safety time logic algorithm compares the collision time between the two workshops with the safety time threshold to determine the safety status. The safety time algorithm mainly uses Time to Collision (TTC) as the research object [4]. The safety distance model refers to the minimum distance between the vehicle and the obstacle, which is also the distance the vehicle needs to maintain to avoid the collision with the obstacle under the current conditions of the vehicle [5].

However, neither the TTC model nor the safety distance model is flexible enough to adapt to various situations during driving [6]. Because the traffic environment is very complicated, drivers, pedestrians, roads, and the environment are all factors that cause a complicated traffic environment [7]. For the same driver, different weather conditions, such as rain, snow, and fog [8], will have different requirements for the driver; on the contrary, for the same environment, different drivers differ widely in age, driving habits, driving skills, personality, and other factors [9]. Differences can also be complex, time varying, and unpredictable; therefore, the existing collision avoidance algorithm is not suitable for direct application [10]. It is imperative to design a collision avoidance algorithm that takes into account the environment and driver characteristics to suit the needs of different situations [11].

Based on the collision avoidance algorithm of collision avoidance time TTC, this paper proposes a safety collision avoidance algorithm that adapts to environmental characteristics and driver characteristics. The algorithm proposed in this paper takes driver characteristics and environment characteristics into comprehensive consideration, introduces environmental parameters, age, and other variables, and gives corresponding weights. Compared with previous algorithms, this algorithm has higher adaptability and flexibility under complex conditions, which is of great help to improve traffic safety and efficiency. The algorithm is simulated by MATLAB and VISSIUM, and the effectiveness of the algorithm is verified.

2. Classical Algorithm

2.1. Mazda Algorithm

The algorithm uses an algorithm based on kinematics analysis to determine the critical braking distance. However, the calculated distance is too conservative for braking and must be used as a critical warning distance [12]. There is a critical alarm distance:where d₀ is the head offset distance, is the rear car speed, is the relative speed between the vehicles, t₁ is the system delay, t₂ is the driver reaction time, a₁ is the maximum brake deceleration of the rear car, and a₂ is the front car maximum brake deceleration.

The algorithm assumes that the preceding vehicle starts braking at the maximum deceleration, and after the system delay time and the driver reaction time have elapsed, the tail vehicle begins to brake at the maximum deceleration. In order to make the algorithm more rigorous, the head offset distance is added to equation (1) to perform the calculation together.

2.2. Berkeley Algorithm

The algorithm is based on the Mazda algorithm and has been improved, and the critical alarm distance equation (2) is given:where d₀ is the head offset distance, is the rear vehicle speed, is the relative speed between the vehicles, t₁ is the system delay, t₂ is the driver reaction time, and a is the vehicle maximum brake deceleration.

The algorithm has been improved based on the Mazda algorithm in order to obtain a more conservative warning distance than Mazda. The warning is given by a dimensionless warning value ψ, which is defined as follows:

In equation (3), d is the current two-vehicle distance, D_b is the critical braking distance, and D_b is calculated as follows:

When the value of ψ gradually increases, the risk of collision increases; when the value of ψ decreases, the risk of collision decreases. When ψ > 1, it means there is no risk of collision at present [13, 14].

2.3. Honda Algorithm

The Honda algorithm is a critical alarm distance equation (5) based on experimentally obtained data:

The limit value reminder distance D_j equation is as follows:where t₁ is the time required for the system delay process, t₂ is the time required for the system braking, is the own vehicle speed, is the current vehicle speed of the preceding vehicle, a₁ is the maximum deceleration of the own vehicle, and a₂ is the maximum deceleration of the preceding vehicle. Since the Honda model is divided into critical value and limit value reminder distance, and the parameters are adjusted and improved according to a large number of experimental data; the final result of the model is less affected by the driver factor. However, the model has high requirements on the sample data. It is necessary to repeatedly calculate and experiment with a large amount of sample data to ensure the accuracy of the model and the output results are in line with the actual driving situation. If the sample is not representative or the sample size is small, the output will seriously deviate from the actual driving situation [15–18].

3. Information Collection and Transformation of Coordinate Systems

3.1. Driving Data Information Collection

Through the data acquisition technology based on the Internet of Vehicles, after the vehicle is equipped with Dedicated Short Range Communications (DSRC) and Global Positioning System (GPS) [19], the vehicle sensor device provides the vehicle’s driving speed, GPS latitude and longitude coordinates, heading angle, and the vehicle’s own working condition parameters [20].

DSRC is an efficient wireless communication technology that can quickly identify high-speed moving targets and two-way communication within a short distance [21], enabling wireless communication between vehicles and vehicles and vehicles and roads in intelligent transportation systems [22]. DSRC can provide a high data transmission speed, ensuring the low latency and low interference in the transmission process [23]. Besides, DSRC can transmit a large amount of real-time information in the intelligent transportation system quickly [24]. The surrounding road environment information can be obtained by indirectly querying the database [25]. The traffic information can be divided into static road network information and dynamic road network information by the frequency of data information collected from the information source. In order to meet the requirement of real-time interact of vehicles information, it is necessary to determine the information update frequency by considering the frequency of information changes [26]. The application of DSRC technology in the intelligent transportation system improves people’s travel efficiency. DSRC can establish the connection between vehicle and road, provide the optimized driving route in real time according to the road conditions, and relieve the traffic pressure. It can also establish the connection between vehicles, prompt the safety distance between vehicles, warn the accidents ahead of the traffic in advance, and improve the coefficient of traffic safety.

The relevant data of the vehicle includes not only driving information such as driving speed, GPS coordinates, and heading angle but also information about the working conditions of the vehicle itself, such as tire pressure and fuel remaining [27]. That information can be obtained from the vehicle’s own sensors and Electronic Control Unit (ECU), and the vehicle’s position coordinates and heading are obtained through the GPS navigation and positioning system [28]. In the Controller Area Network (CAN) bus of the automobile, the vehicle parameters can be obtained to determine whether the vehicle is in an emergency state such as the tire pressure of the vehicle and the shortage of oil [29], and the prompt is given in the terminal system. Then, through real-time acquisition of the state information of the car and the adjacent car, including the latitude, longitude, vehicle speed, and heading angle information of the vehicle, these data are entered into a safety collision avoidance algorithm for processing and alert when there is a danger.

3.2. Establishing a Gaussian Plane Coordinate System

The position information normally received by the vehicle equipment is in the latitude and longitude form, typically using World Geodetic System-1984 Coordinate System (WGS-84) coordinates. Since the coordinates of the latitude and longitude form have positive values and negative values in the abscissa of the same projection zone, the calculation of the relative distance between the vehicles on the processing plane and the establishment of the vehicle model are very complicated [30]. The Gaussian plane coordinate system can solve this problem, so we can use the method of converting latitude and longitude coordinates into Gaussian plane coordinates. The x-axis of the Gaussian plane coordinate system is the projection of the central meridian, and the north direction is positive; the y-axis is the projection of the equator, and the east direction is positive. For example, China is located in the northern hemisphere. After the projection, the x-axis coordinates are positive and the y-axis coordinates are positive and negative. To avoid negative abscissa, the abscissa is added with 500 km. The latitude and longitude coordinates (B, L) can be transformed into Gaussian plane coordinates (x, y) by the coordinate transformation equation. Suppose there are two points P₁ and P₂ symmetric to the central meridian. Their geodetic coordinates are (L, B) and (l, B), respectively, where l is the longitude difference between the longitude of point P on the ellipsoid and the central meridian L₀: l = L–L₀, P point is east of the central meridian, l is positive, and negative in the west; the plane coordinates after projection must be and . After the coordinate transformation is completed, all the coordinates are converted into positive values, which is beneficial to simplify the calculation of the relative distance and the establishment of the vehicle model. The coordinate relationship of WGS-84 coordinate transformation Gaussian plane is

At present, the positioning accuracy provided by the GPS system is better than 10 meters. To obtain higher positioning accuracy, we usually use differential GPS technology. A GPS receiver is placed on the reference station for observation. Based on the known precise coordinates of the reference station, the distance corrections from the reference station to the satellite are calculated and sent out by the reference station in real time. At the same time of GPS observation, the user’s receiver also receives the correction number sent by the reference station and corrects the positioning result, thus improving the positioning accuracy. When the conversion accuracy is required to be 0.00 l meters, the following equations are used:

4. Model Establishment

4.1. Scene Analysis

For a frontal collision, since the two cars that are relatively driven are generally not in a straight line, when the horizontal distance between the two vehicles is greater than the average of the width of the two vehicles, even if the distance between the two cars is already very close, there is no possibility of collision. Therefore, only when the distance between the two vehicles perpendicular to the traveling direction is less than the average value k of the two vehicle widths (the A vehicle width is W_A and the B vehicle width is W_B), that is, when , a frontal collision will occur. The general vehicle width is about 1.5 meters to 1.8 meters, so here k takes 1.7 meters. The distance d between the two vehicles can be derived from the vehicle coordinates received by the Dedicated Short Range Communication (DSRC) module in meters as follows:

The self-vehicle speed is V_A, the adjacent car speed is V_B, and the unit is km/h. For the frontal collision shown in Figure 1, the time required is as follows:

When and , the calculation of the collision time is performed; if it is and , the processing is not performed. For the rear-end collision model, most of the rear-end collisions occur in the same lane. Therefore, when we study the rear-end collision model, we no longer consider the heading angle problem but only consider the relative motion of the vehicle. In the rear-end model, the variable is the relative speed and relative distance of the two cars.

For the rear-end collision model shown in Figure 2, when the vehicle is actively rear-ended, if V_A > V_B, the time required for collision is as follows:

If V_A < V_B, the collision avoidance algorithm is not processed. When the car is passive rear-end collision, if V_A > V_B, the time required for collision is the time required for collision is as follows:

If V_A < V_B, the anticollision algorithm is not processed.

Through the analysis of the abovementioned scenarios, it can be seen that the calculation method of collision occurrence time is the same whether it is a head-on collision or a rear-end collision, and the unified calculation method is conducive to enhancing the adaptability of the algorithm in the complex scene.

4.2. Design of Safety Collision Avoidance Algorithm

The key of the safety collision avoidance algorithm is to choose a reasonable warning distance threshold. If the warning distance is too long, it will cause great interference to the driver. The safe driving system will frequently alert, which will bring certain adverse effects to the driver’s psychology. If the warning distance is too short, the warning effect is worse and the danger cannot be avoided, which is not conducive to driving safety. Therefore, we need to choose a suitable warning threshold, which will not only interfere with the driver’s driving but also help for the driving safety. Moreover, under different weather conditions, the safety collision avoidance algorithm cannot be used for different drivers. Therefore, this paper proposes a safety warning distance threshold method based on different environments and driver’s characteristics, which can effectively solve the abovementioned problems.

It is very important to add environmental parameters and driver characteristic parameters to the algorithm. For example, for a young driver who is responsive, the warning at a certain time may be too early for him, but it will cause bad interference to him [31]. However, for older drivers who are slower to respond, if the warning time is the same as that of the young driver, then the driving process of older drivers becomes more dangerous. Similarly, under different weather conditions, the time at which the early warning system issues an early warning signal should not be the same.

When the vehicle is being driven, if the driver finds the danger early, the safety warning system is not required to be involved. Once the driver does not find the danger in time, the safety collision time issued by the safety warning system is the minimum time for the driver to take measures against the danger, including driver reaction time and time required to control the vehicle [11]. When the safety collision warning system indicates a danger, the driver then reacts to deceleration or avoidance to avoid collision with the adjacent car. Here, we set the driver’s reaction time to t. At present, many scholars have established three driving modes according to the driver’s driving style when establishing the safety warning algorithm, namely, the camber type, the medium tilt type, and the inward tilt type driving mode [1]. This algorithm essentially means that the driver reaction time in the early warning algorithm is correspondingly different according to the driving style. Table 1 shows the average reaction time corresponding to the drivers of three different driving styles.

According to the abovementioned table, different driving styles of the driver can be expressed by different reaction times. According to [10], the early warning algorithm considering the driver’s driving style can adapt to the driving needs of different drivers to a certain extent, and during the driving process, the driver can perform according to his own physical condition and driving environment.

According to a large number of theoretical and experimental studies on drivers’ driving tendency in [11], the factors that affect drivers’ driving tendency mainly include physiological characteristics (gender, age, physical health, etc.), psychological characteristics (ability, personality, emotion, etc.), and other factors such as drivers’ occupation and education level. Here, we select the driver’s age, driving years, eyesight, physical condition, and mental status of the six factors.

We assign different weights to the abovementioned factors to determine the impact of the driver’s personal factors on the safety warning time. We set the driver’s age X₁ (weight ω₁), driving age X₂ (weight ω₂), health index X₃ (X₃ = 1, 2, 3, 4, 5) (weight ω₃), mental state index X₄ (X₄ = 1, 2, 3, 4, 5) (weight ω₄), and visual acuity X₅ (weight ω₅). The factors and weights were scored by the entropy method [16], suppose the decision matrix of each influencing factor and reaction time is as follows:

P _ij represents the contribution of the ith attribute to factor X_ij. E_j can be used to represent the total contribution of all schemes to attribute X_j:where the constant . Hence, we can guarantee that . It can be seen from the formula that when the contribution of each scheme under a certain attribute tends to be the same, E tends to one. Especially when all are equal, the role of the attribute of the target in the decision can be ignored, that is, the weight of the attribute is zero. We can see that the attribute value is determined by the difference of all schemes. Therefore, d_j can be defined as the consistency degree of contribution of each factor under the jth attribute:

Then, the factor weight is

Then, the reaction time is modified by

Braking system response time includes the reaction time of the brake system, the time of brake coordination, and the time of continuous braking [32]. Here, the reaction time of the brake system is t₁, the brake action time is t₂, and the continuous braking time is set to t₃. In the continuous braking time, we assume that the deceleration is constant, and the calculation equation is as follows:where is the vehicle speed, which is the driving speed of the vehicle; is the gravitational acceleration, the value is 9.8 m/s²; μ is the road surface adhesion coefficient; and a is the environmental coefficient. According to [12], the rainy day a has a value of 0.5, the icy road surface is 0.1, the snow surface is 0.3, and the dry road surface is 1. The continuous braking time varies with the vehicle speed, and is the maximum brake reduction speed. The adhesion coefficient of road surface is negatively correlated with the braking distance:

The definition of TTC is as follows:where D is the distance between two vehicles, is the relative speed of the two vehicles, and the dimension of the TTC parameter is seconds. In the TTC algorithm, the shortest time between the two vehicles is calculated by the ratio of the distance to the relative speed of the two vehicles. When the collision time is greater than the warning time, the early warning system will not alarm, and when the collision time is less than the warning time, the early warning system will alarm [33].

According to the abovementioned analysis, the risk warning from the safety collision avoidance system to the minimum time that the driver takes the reaction to stop the vehicle or avoid the danger, that is, the safety collision avoidance time threshold TTC is calculated as follows:

Substituting t₄ and τ_dr as follows:

The value of X_i is input according to the actual situation of the driver.

Since the data obtained by the vehicle-mounted system are relative speed and relative vehicle distance, equation (22) is used to convert the collision avoidance time into corresponding vehicle distance and standardize the variables, so as to avoid the step of converting the relative vehicle distance variable into corresponding time through calculation again, which can reduce the time and space complexity of the algorithm. The corresponding safety warning/braking algorithm is shown as follows:where is the warning distance; D_b is the brake distance; is the relative speed; t₁ is the brake reaction time; t₂ is the brake action time; t₃ is the continuous braking time; is the gravity acceleration; a is the environmental coefficient; μ is the road surface adhesion coefficient; and X_i and ω_i are the driver characteristics and their weights.

It can be seen from the abovementioned equations that we convert the collision avoidance time into the corresponding warning distance and provide the necessary reminder for the driver during the driving process by inputting the corresponding speed and environmental characteristics and the driver characteristics into the algorithm. During the driving process, we can fix these two values in the braking reaction time and brake action time. The main influencing factors of the continuous braking time are the current speed and deceleration. The influencing factors of the deceleration are the road adhesion coefficient and the environmental coefficient. The road surface adhesion coefficient in different environments is inevitably different, so we have increased the environmental coefficient to change the deceleration in different weather conditions. Different drivers have different reaction times for danger.

The flow chart of the algorithm is shown in Figure 3. Finally, each parameter is input into the algorithm to find the early warning distance D_W. When the distance between the two vehicles is D_W, the early warning system issues an early warning. D_B is the brake distance, which is the shortest braking distance between the two vehicles to avoid collision. It refers to the shortest braking distance that the driver has reacted to take the braking measures and the vehicle brake system has started to brake.

The pseudocode of the algorithm is shown in Algorithm1.

	Algorithm: calculate reaction time, braking time, early warning distance, and braking distance conversion
	input: AGE, HEALTH, MENTAL STATE INDEX, VISUAL ACUITY, DRIVING AGE, RELATIVE SPEED, RELATIVE DISTANCE
	output: Warning distance, braking distance
	function Response Time Based on Driver Characteristics (AGE, HEALTH, MENTAL STATE INDEX, VISUAL ACUITY, DRIVING AGE)
	= The weighted average is integrated to determine the weight of each parameter
	= Modified reaction time
	return
	end function
	function Braking Time Based on Environmental Characteristics (RELATIVE SPEED, RELATIVE DISTANCE)
	= Sum of braking time of each stage
	return
	end function
	function The warning time is converted to the warning distance (, )
	= The product of fixed threshold of TTC warning time and relative speed
	= The product of the minimum braking time and the relative speed
	return,
	end function

5. Simulation Experiment

After understanding the working principle and construction idea of the algorithm, the algorithm is simulated by MATLAB and compared the efforts with three classical safety distance algorithms. Then, VISSUM is used to simulate collision, and the effect is compared with three classical algorithms. The three classical algorithms are Mazda algorithm, Berkeley algorithm, and Honda algorithm. In this paper, the effectiveness of the algorithm is judged by comparing the safe-braking distance determined by the three classical algorithms and this algorithm under different relative speeds.

The simulation of the safe distance model can be divided into three situations: front vehicle emergency braking condition, front vehicle static condition, and front vehicle uniform speed condition.

In order to facilitate the comparison with other safe distance models, the speed and acceleration of the vehicle itself and the speed and acceleration of the vehicle in front are set in the same way, that is, the relative speed between the vehicles is the only variable in this environment, and the braking response time t₁ = 0.1 s, brake action time t₂ = 0.1 s, continuous braking time t₃ = 2 s, and road adhesion coefficient μ = 1. In this simulation environment, the characteristics of the two drivers are shown in Table 2.

5.1. Simulation of Front Vehicle Emergency Braking Condition Model

Figure 4, respectively, show the comparison and analysis diagram of the algorithm with sunny, foggy, rainy, and snowy environmental characteristics under the front vehicle emergency braking condition.

(a)

(b)

(c)

(d)

As can be seen from Figure 4(a), under different vehicle speeds, the warning distance of Driver A calculated by the model established in this paper is conservative when the speed is low and longer when the speed is high, which is more sensitive to the speed change. The warning distance of Driver B determined by this algorithm is longer than that determined by other algorithms due to the age factor. Analysis of Figure 4(b) shows that in foggy environment, the warning distance of Driver B calculated by this algorithm is always greater than the warning distance calculated by other algorithms in the foggy environment. The warning distance of Driver A calculated by this algorithm also has increased more that than in sunny days.

It can be seen from the analysis of Figures 4(c) and 4(d) that both the warning distance of Driver A and the warning distance of Driver B in rainy environmental and snowy environmental are more conservative than that of the sunny day environment in Figure 4(a), which is the result of considering the environmental characteristics.

5.2. Simulation of Front Vehicle Static Condition Model

Figure 5, respectively, show the comparison and analysis diagram of the algorithm with sunny, foggy, rainy, and snowy environmental characteristics under the front vehicle static condition.

(a)

(b)

(c)

(d)

As can be seen from Figure 5(a), in the comparison of warning distance, the warning distance of Driver A calculated by the model established in this paper matches the warning distance height calculated by the Berkeley model, which is slightly more conservative than the Berkeley model in low-speed environment. The warning distance calculated by the model established in this paper is close to that calculated by the Mazda model, both of which provide a relatively conservative warning distance and an early warning time. Compared with Berkeley and Mazda algorithm, the model established in this paper adjusts the warning distance at low speed and high speed, providing a more appropriate warning time.

It can be seen from Figures 5(b)–5(d) that under the same trend of speed change, the warning distance of Driver A calculated by the model established in this paper presents almost the same trend as that calculated by the Berkeley model. The warning distance of Driver B calculated by the model established in this paper and that calculated by the Mazda model also showed almost the same trend, but the difference between them gradually increased with the increase of their own speed, that is, the faster the speed, the greater the difference. Therefore, it can be concluded that in foggy, rainy, and snowy environmental the model established in this paper is more adaptable to the environment and can effectively improve traffic safety.

5.3. Simulation of Front Vehicle Uniform Speed Condition Model

Figure 6, respectively, show the comparison and analysis diagram of the algorithm with sunny, foggy, rainy, and snowy environmental characteristics under the front vehicle uniform speed condition.

(a)

(b)

(c)

(d)

As can be seen from Figure 6(a), in the comparison of warning distance, the warning distance determined by the Berkeley model changes little with the relative speed. In addition, when the relative speed is high, warning is not timely, and when the relative speed is low, false alarm is easily caused. However, the warning distance of driver A calculated by the model established in this paper is more sensitive to the change of relative speed, which can ensure the safety of vehicles under different relative speeds.

As can be seen from Figures 6(b)–6(d) you can see that in foggy, rainy, and snowy environment, we compared the warning distance of Driver A calculated by the model established in this paper with that calculated by the Berkeley model. When the speed is slow, the warning distance calculated by this algorithm is very close to that calculated by Berkeley algorithm. When the speed increases, the difference between the warning distance of Driver A calculated by the model established in this paper and the warning distance calculated by Berkeley model also increase, and the difference between the warning distance of Driver A and Berkeley model is positively related to the speed.

The Honda model has a relatively late alarm time under three conditions, short warning distance and too aggressive, which has a great disadvantage compared with the model established in this paper.

5.4. Collision Simulation Based on VISSUM

VISSIM can simulate the vehicle, road and signal light changes intuitively and meticulously and can accurately and truly reflect the traffic operation [33]. VISSIM includes road network, vehicle, signal light, and other components, which can meet the simulation requirements of collision avoidance algorithm [34]. In order to verify the efficiency of the algorithm, we will choose Berkeley algorithm, Honda algorithm, and Mazda algorithm to compare with this algorithm.

In the simulation process, the relative speed of the two vehicles is set as the only variable, set the relative speed to 10 km/h, 30 km/h, 50 km/h, and 70 km/h. There are two experimental scenarios, and their settings are shown in Table 3.

The position coordinate of the vehicle is obtained by calling the encapsulated function in VISSUM, and the collision avoidance algorithm is processed. After the simulation run, input the vehicle operation parameters into the collision simulation analysis software SSAM for vehicle crash statistics. Each group of experiments was carried out 100 times, a total of 15 groups. In order to ensure the accuracy of the experimental results, we analyzed the error of the experimental results. The error bars of experimental scenario are shown in Figure 7.

The blue column is the average of each set of experiments, and the red line is the standard deviation of each set of experiments. The equation for calculating the mean and standard deviation is as follows:

It can be seen from Figure 7 that the error range of the experiment is not large and the error is within the acceptable range. After analysis, we selected the data with the smallest experimental error, as shown in Tables 4 and 5.

The performance of the two algorithms is compared according to the data in Tables 4 and 5.

The equation of the false alarm rate is

The equation of the missing alarm rate is

In equation (25), is the number of collisions under the condition of warning display and is the number of warning displays. In equation (26), is the number of collisions without warning display and is the number of collisions without warning display.

Compared with the Berkeley algorithm, Honda algorithm, and Mazda algorithm, the false alarm rate of the method in this paper decreased by 5%, 4%, and 14%. The missing alarm rate of the method in this paper decreased by 3%, 6%, and 1%. So, the method in this paper can better carry out vehicle collision prevention and the algorithm is more accurate. Therefore, the algorithm proposed in this paper is more efficient than Berkeley algorithm and more conducive to driving safety.

6. Conclusion

In this paper, we propose a novel vehicle collision avoidance algorithm. By analyzing the relationship between collision avoidance time and environmental characteristics and driver characteristics, a corresponding early warning algorithm is established. The algorithm not only considers the relative positional relationship between vehicles but also considers the impact on safe driving under different weather conditions. Different weather conditions will have different road adhesion coefficients and visibility, so it is necessary to add the weather factor in the collision avoidance algorithm. Since different drivers have different driving habits and reaction times, the collision avoidance algorithm must consider adapting to different driver characteristics. Therefore, it is necessary to add driver characteristics. Finally, we simulated the algorithm using MATLAB and VISSUM. After MATLAB simulation, we found that the algorithm is more adaptable to different weather conditions and different drivers than the classic collision avoidance algorithm, which can effectively improve the safety of driving. After VISSUM simulation, this algorithm reduces the false alarm rate and missing alarm rate compared with the classic Berkeley algorithm. The algorithm proposed in this paper proves its rationality and feasibility through rigorous design and experiment. Still more experimental data are required to improve and optimize. With the advent of the era of big data and the popularity of the Internet of Vehicles, more weather characteristics and driver characteristics will be counted at the big data level to obtain a more accurate collision avoidance warning threshold, thereby setting a more dynamic safety warning distance for different drivers in different weather conditions.

Data Availability

The data used to support the findings of this study are available from the corresponding author upon request.

Conflicts of Interest

The authors declare that there are no conflicts of interest regarding the publication of this paper.

Acknowledgments

This work was supported in part by the National Natural Science Foundation of China under Grants 11862006 and 61862025, Jiangxi Provincial Natural Science Foundation under Grants 2018ACB21032 and 20181BAB211016, Scientiﬁc and Technological Research Project of Education Department in Jiangxi Province under Grants GJJ170381 and GJJ170383, and Research Project of Transportation Department in Jiangxi Province under Grant 2018X0016. The first author was also financial supported by China Scholarship Council under Grant 201808360320.

References

G. Yu, D. Tan, and F. Ma, “Analysis and research of issue related to automotive anti-collision system warning/collision algorithm,” Journal of Shandong University of Technology (Natural Science Edition), vol. 28, no. 6, pp. 1–5, 2014.
View at: Google Scholar
A. Sharma, Z. Zheng, A. Bhaskar, and M. M. Haque, “Modelling car-following behaviour of connected vehicles with a focus on driver compliance,” Transportation Research Part B: Methodological, vol. 126, no. 12, pp. 256–279, 2019.
View at: Publisher Site | Google Scholar
N. Jiang, F. Tian, J. Li et al., “Man: mutual attention neural networks model for aspect-level sentiment classification in SIot,” IEEE Internet of Things Journal, vol. 15, no. 3, pp. 1054–1065, 2019.
View at: Google Scholar
L. Zhang, F. Teng, Z. Peng et al., “Improved vehicle anti-collision warning algorithm based on Berkeley model,” Mechanical Science and Technology for Aerospace Engineering, vol. 37, no. 7, pp. 1082–1088, 2018.
View at: Google Scholar
S. Sharma and B. Kaushik, “A survey on internet of vehicles: applications, security issues & solutions,” Vehicular Communications, vol. 20, no. 5, pp. 725–729, 2019.
View at: Publisher Site | Google Scholar
H. Peng, L. Le Liang, X. Shen, and G. Y. Li, “Vehicular communications: a network layer perspective,” IEEE Transactions On Vehicular Technology, vol. 68, no. 2, pp. 1064–1078, 2019.
View at: Publisher Site | Google Scholar
R. Molina-Masegosa and J. Gozalvez, “LTE-V for sidelink 5G V2X vehicular communications: a new 5G technology for short-range vehicle-to-everything communications,” Ieee Vehicular Technology Magazine, vol. 12, no. 4, pp. 30–39, 2017.
View at: Publisher Site | Google Scholar
G. Yu, D. Tan, and H. Tian, “Warning/brake algorithm based on time of longitudinal collision avoidance,” Journal of Henan University of Science and Technology (Natural Science Edition), vol. 36, no. 2, pp. 30–35, 2015.
View at: Google Scholar
A. Thakur and R. Malekian, “Internet of vehicles communication technologies for traffic management and road safety applications,” Wireless Personal Communications, vol. 109, no. 1, pp. 31–49, 2019.
View at: Publisher Site | Google Scholar
M. A. Hoque, X. Hong, and M. S. Ahmed, “Parallel closed-loop connected vehicle simulator for large-scale transportation network management: challenges, issues, and solution approaches,” IEEE Intelligent Transportation Systems Magazine, vol. 11, no. 4, pp. 62–77, 2019.
View at: Publisher Site | Google Scholar
X. Pei, “Safe distance model and obstacle detection algorithms for A collision warning and collision avoidance system,” Automotive Safety and Energy, vol. 3, no. 1, pp. 26–33, 2012.
View at: Google Scholar
S. Jeong, O. Simeone, and J. Kang, “Mobile edge computing via a UAV-mounted cloudlet: optimization of bit allocation and path planning,” IEEE Transactions On Vehicular Technology, vol. 67, no. 3, pp. 2049–2063, 2018.
View at: Publisher Site | Google Scholar
X. Wang, Z. Ning, and L. Wang, “Offloading in internet of vehicles: a fog-enabled real-time traffic management system,” IEEE Transactions On Industrial Informatics, vol. 14, no. 10, pp. 4568–4578, 2018.
View at: Publisher Site | Google Scholar
M. Chen, Y. Tian, G. Fortino, J. Zhang, and I. Humar, “Cognitive internet of vehicles,” Computer Communications, vol. 120, pp. 58–70, 2018.
View at: Publisher Site | Google Scholar
Z. Zhou, C. Gao, C. Xu, Y. Zhang, S. Mumtaz, and J. Rodriguez, “Social big-data-based content dissemination in internet of vehicles,” IEEE Transactions On Industrial Informatics, vol. 14, no. 2, pp. 768–777, 2018.
View at: Publisher Site | Google Scholar
E. Awad, S. Dsouza, R. Kim et al., “The moral machine experiment,” Nature, vol. 563, no. 7729, pp. 59–64, 2018.
View at: Publisher Site | Google Scholar
C.-M. Chen, B. Xiang, Y. Liu, and K.-H. Wang, “A secure authentication protocol for internet of vehicles,” IEEE Access, vol. 7, pp. 12047–12057, 2019.
View at: Publisher Site | Google Scholar
A. Dwivedi, G. Srivastava, S. Dhar, and R. Singh, “A decentralized privacy-preserving healthcare blockchain for IoT,” SENSORS, vol. 19, no. 2, p. 326, 2019.
View at: Publisher Site | Google Scholar
N. Jiang, Y. Cheng, J. Zhou, T. Zhou, W. Xu, and D. Xu, “Toward biology-inspired solutions for routing problems of wireless sensor networks with mobile sink,” Soft Computing, vol. 22, no. 23, pp. 7847–7855, 2018.
View at: Publisher Site | Google Scholar
N. Jiang, B. Li, T. Wan, and L. Liu, “C-POEM: comprehensive performance optimization evaluation model for wireless sensor networks,” Soft Computing, vol. 21, no. 12, pp. 3377–3385, 2017.
View at: Publisher Site | Google Scholar
Z. Zhong and J. Lee, “The effectiveness of managed lane strategies for the near-term deployment of cooperative adaptive cruise control,” Transportation Research Part A: Policy and Practice, vol. 129, no. 1, pp. 257–270, 2019.
View at: Publisher Site | Google Scholar
N. Jiang, X. Xiao, and L. Liu, “Localization scheme for wireless sensor networks based on “shortcut” constraint,” Ad Hoc & Sensor Wireless Networks, vol. 26, no. 4, pp. 1–19, 2015.
View at: Google Scholar
X. Zhao, S. Jing, F. Hui, R. Liu, and A. J. Khattak, “DSRC-based rear-end collision warning system–an error-component safety distance model and field test,” Transportation Research Part C: Emerging Technologies, vol. 107, no. 1, pp. 92–104, 2019.
View at: Publisher Site | Google Scholar
P. Hao, L. Hu, J. Jiang, X. Che, T. Li, and K. Zhao, “Framework for replica placement over cooperative edge networks,” Journal of Ambient Intelligence and Humanized Computing, vol. 10, no. 8, pp. 3011–3021, 2018.
View at: Publisher Site | Google Scholar
X. Qu, R. Liu, L. Cao et al., “A 5.8 GHz digitally configurable DSRC RF-SoC transmitter for China ETC systems,” Integration, vol. 68, no. 1, pp. 99–107, 2019.
View at: Publisher Site | Google Scholar
N. Jiang, “WDEM: weighted dynamics and evolution models for energy-constrained wireless sensor networks,” Physica A: Statistical Mechanics and Its Applications, vol. 404, no. 15, pp. 323–331, 2014.
View at: Publisher Site | Google Scholar
K. Riad, R. Hamza, and H. Yan, “Sensitive and energetic IoT access control for managing cloud electronic health records,” IEEE Access, vol. 7, no. 1109, pp. 86384–86393, 2019.
View at: Publisher Site | Google Scholar
L. Yang, J. Wang, C. Gao, and T. Li, “A crisis information propagation model based on a competitive relation,” Journal of Ambient Intelligence and Humanized Computing, vol. 10, no. 8, pp. 2999–3009, 2018.
View at: Publisher Site | Google Scholar
W. Si, H. V. Gupta, W. Bao, P. Jiang, and W. Wang, “Improved dynamic system response curve method for real-time flood forecast updating,” Water Resources Research, vol. 55, no. 9, pp. 7493–7519, 2019.
View at: Publisher Site | Google Scholar
N. Jiang, S. Jin, Y. Guo, and Y. He, “Localization of wireless sensor network based on genetic algorithm,” International Journal of Computers Communications & Control, vol. 8, no. 6, pp. 825–837, 2013.
View at: Publisher Site | Google Scholar
H. Zhou, N. Cheng, J. Wang, J. Chen, Q. Yu, and X. Shen, “Toward dynamic link utilization for efficient vehicular edge content distribution,” IEEE Transactions On Vehicular Technology, vol. 68, no. 9, pp. 8301–8313, 2019.
View at: Publisher Site | Google Scholar
L. Jin, B. Arem, and S. Yang, “Performance analysis and boost for a MAC protocol in vehicular networks,” IEEE Transactions on Vehicular Technology, vol. 68, no. 9, pp. 8721–8728, 2019.
View at: Google Scholar
M. Zhang, P. Chong, and B. Seet, “Anti-collision warning time algorithm based on driving speed of vehicle,” Transactions of the Chinese Society of Agricultural Engineering, vol. 33, no. 12, pp. 99–106, 2017.
View at: Google Scholar
N. Jiang, D. Xu, J. Zhou, H. Yan, T. Wan, and J. Zheng, “Toward optimal participant decisions with voting-based incentive model for crowd sensing,” Information Sciences, vol. 512, pp. 1–17, 2020.
View at: Google Scholar

Copyright

Copyright © 2020 Y. J. Zhang et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

PDF Download Citation

Download other formats

Order printed copies

Views

7321

Downloads

2149

Citations