اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدCooperative Vehicle Speed Fault Diagnostics and Correction
87
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Reliable estimation (or measurement) of vehicle states has always been an active topic of research in the automotive industry and academia. Among the vehicle states, vehicle speed has a priority due to its critical importance in traction and stability control. Moreover, the emergence of new generation of communication technologies has brought a new avenue to traditional studies on vehicle estimation and control. To this end, this paper introduces a set of distributed function calculation algorithms for vehicle networks, robust to communication failures. The introduced algorithms enable each vehicle to gather information from other vehicles in the network in a distributed manner. A procedure to use such a bank of information for a single vehicle to diagnose and correct a possible fault in its own speed estimation/measurement is discussed. The functionality and performance of the proposed algorithms are verified via illustrative examples and simulation results.
قيم البحث
اقرأ أيضاً
This paper studies the internal stability and string stability of a vehicle platooning of constant time headway spacing policy with a varying-speed leader using a multiple-predecessor-following strategy via vehicle-to-vehicle communication. Unlike th
e common case in which the leaders speed is constant and different kinds of Proportional-Integral-Derivative controllers are implemented, in this case, the fact that the leader has a time-varying speed necessitates the design of an observer. First, in order to estimate its position, speed and acceleration error with respect to the leader, each follower designs an observer. The observer is designed by means of constructing an observer matrix whose parameters should be determined. We simplifies the design of the matrix of the observer in such a way that the design boils down to choosing a scalar value. The resulting observer turns out to have a third order integrator dynamics, which provides an advantage of simplifying the controller structure and, hence, derive conditions for string stability using a frequency response method. A new heuristic searching algorithm is developed to deduce the controller parameter conditions, given a fixed time headway, for string stability. Additionally, a bisection-like algorithm is incorporated into the above algorithm to obtain the minimum (with some deviation tolerance) available value of the time headway by fixing one controller parameter. The effectiveness of the internal and string stabilities of the proposed observer-based controller is demonstrated via comparison examples.
Persistent Fault Attack (PFA) is a recently proposed Fault Attack (FA) method in CHES 2018. It is able to recover full AES secret key in the Single-Byte-Fault scenario. It is demonstrated that classical FA countermeasures, such as Dual Modular Redund
ancy (DMR) and mask protection, are unable to thwart PFA. In this paper, we propose a fast-detection and faultcorrection algorithm to prevent PFA. We construct a fixed input and output pair to detect faults rapidly. Then we build two extra redundant tables to store the relationship between the adjacent elements in the S-box, by which the algorithm can correct the faulty elements in the S-box. Our experimental results show that our algorithm can effectively prevent PFA in both Single-ByteFault and Multiple-Bytes-Faults scenarios. Compared with the classical FA countermeasures, our algorithm has a much better effect against PFA. Further, the time cost of our algorithm is 40% lower than the classical FA countermeasures.
With the rapid development of autonomous driving, collision avoidance has attracted attention from both academia and industry. Many collision avoidance strategies have emerged in recent years, but the dynamic and complex nature of driving environment
poses a challenge to develop robust collision avoidance algorithms. Therefore, in this paper, we propose a decentralized framework named RACE: Reinforced Cooperative Autonomous Vehicle Collision AvoidancE. Leveraging a hierarchical architecture we develop an algorithm named Co-DDPG to efficiently train autonomous vehicles. Through a security abiding channel, the autonomous vehicles distribute their driving policies. We use the relative distances obtained by the opponent sensors to build the VANET instead of locations, which ensures the vehicles location privacy. With a leader-follower architecture and parameter distribution, RACE accelerates the learning of optimal policies and efficiently utilizes the remaining resources. We implement the RACE framework in the widely used TORCS simulator and conduct various experiments to measure the performance of RACE. Evaluations show that RACE quickly learns optimal driving policies and effectively avoids collisions. Moreover, RACE also scales smoothly with varying number of participating vehicles. We further compared RACE with existing autonomous driving systems and show that RACE outperforms them by experiencing 65% less collisions in the training process and exhibits improved performance under varying vehicle density.
This paper presents a cooperative vehicle sorting strategy that seeks to optimally sort connected and automated vehicles (CAVs) in a multi-lane platoon to reach an ideally organized platoon. In the proposed method, a CAV platoon is firstly discretize
d into a grid system, where a CAV moves from one cell to another in the discrete time-space domain. Then, the cooperative sorting problem is modeled as a path-finding problem in the graphic domain. The problem is solved by the deterministic Astar algorithm with a stepwise strategy, where only one vehicle can move within a movement step. The resultant shortest path is further optimized with an integer linear programming algorithm to minimize the sorting time by allowing multiple movements within a step. To improve the algorithm running time and address multiple shortest paths, a distributed stochastic Astar algorithm (DSA) is developed by introducing random disturbances to the edge costs to break uniform paths (with equal path cost). Numerical experiments are conducted to demonstrate the effectiveness of the proposed DSA method. The results report shorter sorting time and significantly improved algorithm running time due to the use of DSA. In addition, we find that the optimization performance can be further improved by increasing the number of processes in the distributed computing system.
In this paper, we proposed the Interpenetrating Cooperative Localization (ICL) method to enhance the localization accuracy in dynamic connected vehicle networks. This mechanism makes the information from one group of connected vehicles interpenetrate
to other groups without full communication between all nodes, thus improving the utility of information in a low connected vehicle penetration situation. We tested the approach using the dynamic traffic data collected in the Safety Pilot Model Deployment program in Ann Arbor Michigan, USA, with dynamic changing networks due to the traveling of vehicles and packet drops of the Dedicated Short-Range Communication. Results show enhancement of localization accuracy with errors reduced by up to 70 % even in complex dynamic scenarios.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
