Scenario-based approaches have been receiving a huge amount of attention in research and engineering of automated driving systems. Due to the complexity and uncertainty of the driving environment, and the complexity of the driving task itself, the number of possible driving scenarios that an Automated Driving System or Advanced Driving-Assistance System may encounter is virtually infinite. Therefore it is essential to be able to reason about the identification of scenarios and in particular critical ones that may impose unacceptable risk if not considered. Critical scenarios are particularly important to support design, verification and validation efforts, and as a basis for a safety case. In this paper, we present the results of a systematic mapping study in the context of autonomous driving. The main contributions are: (i) introducing a comprehensive taxonomy for critical scenario identification methods; (ii) giving an overview of the state-of-the-art research based on the taxonomy encompassing 86 papers between 2017 and 2020; and (iii) identifying open issues and directions for further research.

Vehicular Edge Computing (VEC) systems exploit resources on both vehicles and Roadside Units (RSUs) to provide services for real-time vehicular applications that cannot be completed in the vehicles alone. Two types of decisions are critical for VEC: one is for task offloading to migrate vehicular tasks to suitable RSUs, and the other is for resource allocation at the RSUs to provide the optimal amount of computational resource to the migrated tasks under constraints on response time and energy consumption. Most of the published optimization-based methods determine the optimal solutions of the two types of decisions jointly within one optimization problem at RSUs, but the complexity of solving the optimization problem is extraordinary, because the problem is not convex and has discrete variables. Meanwhile, the nature of centralized solutions requires extra information exchange between vehicles and RSUs, which is challenged by the additional communication delay and security issues. The contribution of this paper is to decompose the joint optimization problem into two decoupled subproblems: task offloading and resource allocation. Both subproblems are reformulated for efficient solutions. The resource allocation problem is simplified by dual decomposition and can be solved at vehicles in a decentralized way. The task offloading problem is transformed from a discrete problem to a continuous convex one by a probability-based solution. Our new method efficiently achieves a near-optimal solution through decentralized optimizations, and the error bound between the solution and the true optimum is analyzed. Simulation results demonstrate the advantage of the proposed approach.

Edge computing is projected to have profound implications in the coming decades, proposed to provide solutions for applications such as augmented reality, predictive functionalities, and collaborative Cyber-Physical Systems (CPS). For such applications, edge computing addresses the new computational needs, as well as privacy, availability, and real-time constraints, by providing local high-performance computing capabilities to deal with the limitations and constraints of cloud and embedded systems. Edge computing is today driven by strong market forces stemming from IT/cloud, telecom, and networking—with corresponding multiple interpretations of “edge computing” (e.g., device edge, network edge, distributed cloud). Considering the strong drivers for edge computing and the relative novelty of the field, it becomes important to understand the specific requirements and characteristics of edge-based CPS, and to ensure that research is guided adequately, e.g., avoiding specific gaps. Our interests lie in the applications of edge computing as part of CPS, where several properties (or attributes) of trustworthiness, including safety, security, and predictability/availability, are of particular concern, each facing challenges for the introduction of edge-based CPS. We present the results of a systematic mapping study, a kind of systematic literature survey, investigating the use of edge computing for CPS with a special emphasis on trustworthiness. The main contributions of this study are a detailed description of the current research efforts in edge-based CPS and the identification and discussion of trends and research gaps. The results show that the main body of research in edge-based CPS only to a very limited extent consider key attributes of system trustworthiness, despite many efforts referring to critical CPS and applications like intelligent transportation. More research and industrial efforts will be needed on aspects of trustworthiness of future edge-based CPS including their experimental evaluation. Such research needs to consider the multiple interrelated attributes of trustworthiness including safety, security, and predictability, and new methodologies and architectures to address them. It is further important to provide bridges and collaboration between edge computing and CPS disciplines.

Autonomous driving has become an important research area for road traffic, whereas testing of autonomous driving systems to ensure a safe and reliable operation remains an open challenge. Substantial real-world testing or massive driving data collection does not scale since the potential test scenarios in real-world traffic are infinite, and covering large shares of them in the test is impractical. Thus, critical ones have to be prioritized. We have developed an approach for critical test scenario identification and in this study, we implement the approach and validate it on two real autonomous driving systems from industry by integrating it into their tool-chain. Our main contribution in this work is the demonstration and validation of our approach for critical scenario identification for testing real autonomous driving systems.

Hybrid electric vehicles (HEVs) rely on energy management strategies (EMSs) to achieve optimal fuel economy. However, both model- and learning-based EMSs have their respective limitations which negatively affect their performances in online applications. This paper presents a computationally efficient adaptive dynamic programming (ADP) approach that can not only rapidly calculate optimal control actions but also iteratively update the approximated value function (AVF) according to the actual fuel and electricity consumption with limited computation resources. Exploiting the AVF, the engine on/off switch and torque split problems are solved by one-step lookahead approximation and Pontryagin's minimum principle (PMP), respectively. To raise the training speed and reduce the memory space, the tabular value function (VF) is approximated by carefully selected piecewise polynomials via the parametric approximation. The advantages of the proposed EMS are threefold and verified by processor-in-the-loop (PIL) Monte Carlo simulations. First, the fuel efficiency of the proposed EMS is higher than that of an adaptive PMP and close to the theoretical optimum. Second, the new method can adapt to the changed driving conditions after a small number of learning iterations and thus has higher fuel efficiency than a non-adaptive dynamic programming (DP) controller. Third, the computation efficiencies of the proposed AVF and a tabular VF are compared. The concise data structure of the AVF enables faster convergence and saves at least $70\%$ of onboard memory space without obviously increasing the average CPU utilization.

In human-centered intelligent building, real-time measurements of human thermal comfort play critical roles and supply feedback control signals for building heating, ventilation, and air conditioning (HVAC) systems. Due to the challenges of intra- and inter-individual differences and skin subtleness variations, there has not been any satisfactory solution for thermal comfort measurements until now. In this paper, a contactless measuring method based on a skin sensitivity index and deep learning (NISDL) was proposed to measure real-time skin temperature. A new evaluating index, named the skin sensitivity index (SSI), was defined to overcome individual differences and skin subtleness variations. To illustrate the effectiveness of SSI proposed, a two multi-layers deep learning framework (NISDL method I and II) was designed and the DenseNet201 was used for extracting features from skin images. The partly personal saturation temperature (NIPST) algorithm was use for algorithm comparisons. Another deep learning algorithm without SSI (DL) was also generated for algorithm comparisons. Finally, a total of 1.44 million image data was used for algorithm validation. The results show that 55.62% and 52.25% error values (NISDL method I, II) are scattered at (0 °C, 0.25 °C), and the same error intervals distribution of NIPST is 35.39%.