In this paper, we propose a new cooperative driving strategy for connected and automated vehicles (CAVs) at unsignalized intersections. Based on the tree representation of the solution space for the passing order, we combine Monte Carlo tree search (MCTS) and some heuristic rules to find a nearly global-optimal passing order (leaf node) within a very short planning time. Testing results show that this new strategy can keep a good tradeoff between performance and computation flexibility.

In general, there are two kinds of cooperative driving strategies, planning based strategy and ad hoc negotiation based strategy, for connected and automated vehicles (CAVs) merging problems. The planning based strategy aims to find the globally optimal passing order, but it is time-consuming when the number of considered vehicles is large. In contrast, the ad hoc negotiation based strategy runs fast, but it always finds a locally optimal solution. In this paper, we propose a grouping based cooperative driving strategy to make a good tradeoff between computation time and coordination performance. The key idea is to fix the passing orders for some vehicles whose inter-vehicle headways are small enough (e.g., smaller than the pre-selected grouping threshold). From the viewpoint of optimization, this method reduces the size of the solution space. Then, two analyses are given to explain why this kind of strategy is good and how to determine suitable values for the strategy parameters. A series of simulation experiments are carried out to validate that the proposed strategy can yield a satisfied coordination performance with less computation time and is promising to be used in practice.

The properties of cooperative driving strategies for planning and controlling Connected and Automated Vehicles (CAVs) at intersections range from some that achieve highly efficient coordination performance to others whose implementation is computationally fast. This paper comprehensively compares the performance of four representative strategies in terms of travel time, energy consumption, computation time, and fairness under different conditions, including the geometric configuration of intersections, asymmetry in traffic arrival rates, and the relative magnitude of these rates. Our simulation-based study has led to the following conclusions: 1) The Monte Carlo Tree Search (MCTS)-based strategy achieves the best traffic efficiency and has great performance in fuel consumption; 2) MCTS and Dynamic Resequencing (DR) strategies both perform well in all metrics of interest. If the computation budget is adequate, the MCTS strategy is recommended; otherwise, the DR strategy is preferable; 3) An asymmetric intersection has a noticeable impact on the strategies, whereas the influence of the arrival rates can be neglected. When the geometric shape is asymmetrical, the modified First-In-First-Out (FIFO) strategy significantly outperforms the FIFO strategy and works well when the traffic demand is moderate, but their performances are similar in other situations; and 4) Improving traffic efficiency sometimes comes at the cost of fairness, but the DR and MCTS strategies can be adjusted to realize a better trade-off between various performance metrics by appropriately designing their objective functions.

We address the problem of optimally controlling Connected and Automated Vehicles (CAVs) arriving from four multi-lane roads at a signal-free intersection where they conflict in terms of safely crossing (including turns) with no collision. The objective is to jointly minimize the travel time and energy consumption of each CAV while ensuring safety. This problem was solved in prior work for single-lane roads. A direct extension to multiple lanes on each road is limited by the computational complexity required to obtain an explicit optimal control solution. Instead, we propose a general framework that first converts a multi-lane intersection problem into a decentralized optimal control problem for each CAV with less conservative safety constraints than prior work. We then employ a method combining optimal control and control barrier functions, which has been shown to efficiently track tractable unconstrained optimal CAV trajectories while also guaranteeing the satisfaction of all constraints. Simulation examples are included to show the effectiveness of the proposed framework under symmetric and asymmetric intersection geometries and different CAV sequencing policies.

Wearable sensors-based human activity recognition introduces many useful applications and services in health care, rehabilitation training, elderly monitoring and many other areas of human interaction. Existing works in this field mainly focus on recognizing activities by using traditional features extracted from Fourier transform (FT) or wavelet transform (WT). However, these signal processing approaches are suitable for a linear signal but not for a nonlinear signal. In this paper, we investigate the characteristics of the Hilbert-Huang transform (HHT) for dealing with activity data with properties such as nonlinearity and non-stationarity. A multi-features extraction method based on HHT is then proposed to improve the effect of activity recognition. The extracted multi-features include instantaneous amplitude (IA) and instantaneous frequency (IF) by means of empirical mode decomposition (EMD), as well as instantaneous energy density (IE) and marginal spectrum (MS) derived from Hilbert spectral analysis. Experimental studies are performed to verify the proposed approach by using the PAMAP2 dataset from the University of California, Irvine for wearable sensors-based activity recognition. Moreover, the effect of combining multi-features vs. a single-feature are investigated and discussed in the scenario of a dependent subject. The experimental results show that multi-features combination can further improve the performance measures. Finally, we test the effect of multi-features combination in the scenario of an independent subject. Our experimental results show that we achieve four performance indexes: recall, precision, F-measure, and accuracy to 0.9337, 0.9417, 0.9353, and 0.9377 respectively, which are all better than the achievements of related works.

There are generally two kinds of traffic control strategies to relieve traffic congestion in lane-drop bottlenecks: variable speed limits (VSL) control and lane-changing (LC) control. However, VSL has limited or even no effect due to many mandatory LC maneuvers near bottlenecks, while LC fails to reduce traffic congestion when traffic demand is high. Although a few control methods combine VSL and LC, they do not consider the interaction between VSL and LC, which rules out many potentially good alternatives. We instead propose an integrated VSL and LC control method under a connected and automated vehicle (CAV) environment, which can consider the interaction and simultaneously find the values of LC numbers and speed limits to maximize traffic efficiency. Our control is in the framework of the model predictive control (MPC), which consists of prediction, optimization, and implementation. We adopt an improved multi-class cell transmission model (CTM) for traffic state prediction, then use the genetic algorithm (GA) for optimization which optimizes traffic network performance, and implement our control method in the SUMO platform. Simulation results demonstrate that our control method greatly improves the capacity of the road and is robust to different traffic demands and scenarios. Our control outperforms no control and VSL-only control in travel time and exhaust emissions, which reduces total travel time by 23.86% to 44.62% and exhaust emissions by 10.29% to 48.19%.