3 May 2022 in IEEE Transactions on Intelligent Transportation Systems
Road accidents wreck lives. Could technology stop them from happening? Driving better road safety with technology and artificial intelligence are the key elements considered by several carmakers. The key aspect of transportation in the future is to build an ecosystem comprising autonomous, connected, electric and shared mobility. The evolution of autonomous vehicles (AVs) can potentially aid transportation to people and be deployed to resolve mobility-related pain for drivers and safety on roads while changing lanes. Thus, the intelligent assistance system should be smart enough to track such vehicles while deviating into another lane. In this paper, we propose a lane change prediction framework for feature learning, with the aim to have a deep and comprehensive understanding of lane change behaviors, meanwhile, reach a high performance based on the selected features. A time-step dataset with more than 1000 features is constructed from vehicle trajectory data. To identify the key features involved in the original feature set, an XGBoost-based three-step feature learning algorithm is proposed, which integrates the feature importance ranking, metric selection and recursive feature elimination. After analyzing the accuracy of test data from different time segment positions, the sliding window method is applied on a time-step dataset with filtered features to properly select time segments, which are flattened into corresponding time-series dataset for model prediction. In our case studies, a publicly available dataset, Next Generation SIMulation (NGSIM), is adopted to conduct experiments of feature learning and lane change prediction, where we achieved a new state-of-art accuracy with 97.6% under the time-series data of 75 selected features and 1-second window size with predictor XGBoost after adopting proposed three-step method, which is superior to the other state-of-the-art feature selection methods.
2 August 2018 in IEEE Transactions on Intelligent Transportation Systems
This paper presents a macroscopic model for pedestrian-vehicle mixed-flow network and a traffic signal scheduling strategy for both pedestrians and vehicles. We first propose a novel mathematical model of pedestrians crossing a junction. By combining a link-based vehicle network model, a traffic light scheduling problem is formulated with the aim to strike a good balance between pedestrians' needs and vehicle drivers' needs. The problem is first converted into a mixed-integer linear programming (MILP) problem via a novel transformation procedure, which is solvable by several existing solvers, e.g., GUROBI. Then a meta-heuristic method called discrete harmony search (DHS) algorithm is also adopted to reduce the computational complexity in MILP. Numerical simulation results are provided to illustrate the effectiveness of our real-time traffic light scheduling strategy for pedestrians and vehicles, and the potential impact of the pedestrian movement to the vehicle traffic flows.
27 September 2018 in IEEE Transactions on Intelligent Transportation Systems
This paper addresses a bi-objective urban traffic light scheduling problem (UTLSP), which requires minimizing both the total network-wise delay time of all vehicles and total delay time of all pedestrians within a given finite-time window. First, a centralized model is employed to describe the UTLSP, where the cost functions and constraints of the two objectives are presented. A non-domination strategy-based metric is used to compare and rank solutions based on the two objectives. Second, metaheuristics, such as harmony search (HS) and artificial bee colony (ABC), are implemented to solve the UTLSP. Based on the characteristics of the UTLSP, a local search operator is utilized to improve the search performance of the developed optimization algorithms. Finally, experiments are carried out based on the real traffic data in Jurong area of Singapore. The HS, ABC, and their variants with the local search operator are evaluated in 19 case studies with different scales and time windows. To the best of our knowledge, this paper is the first of its kind to solve bi-objective traffic light scheduling problems in the literature. To demonstrate the effectiveness of the proposed algorithms in dealing with bi-objective optimization in traffic light scheduling, they are compared to the classical non-dominated sorting genetic algorithm II (NSGAII) with and without the local search operation. The comparisons indicate that our algorithms outperform the NSGAII algorithm with and without the local search operator for solving the UTLSP.
1 September 2016 in Journal of Asian Architecture and Building Engineering
25 October 2018 in IEEE Transactions on Intelligent Transportation Systems
Efficient flight routing and scheduling play an important role in air traffic flow management, which aims to maximize the utilization of airport and enroute capacities to ensure safety and efficiency of air transportation. In this paper, we first propose a novel discrete-time flow dynamic model for an air traffic network, consisting of airports, waypoints, and air links, upon which we formulate an air flow routing and scheduling problem as an integer linear programming problem. Considering the NP-hard nature of the problem, we present a novel hierarchical flow routing and scheduling approach, where the hierarchical architecture is derived naturally from the network containment relationship, and computation is carried out in a bottom-up manner, which relies on an incremental strategy. On the resulting flow routes and schedules, a heuristic algorithm is carried out to determine flight plans for individual aircrafts. The effectiveness of the proposed hierarchical approach is illustrated by air traffic data in four flight information regions in the association of Southeast Asian nations.
6 July 2020 in IEEE Transactions on Intelligent Transportation Systems
In order to efficiently balance the current and future air traffic demands with the system capacity, a proper Air Traffic Flow Management (ATFM) approach is required. The current focus of ATFM is generally on optimally utilizing the available airspace and airport capacities, while maintaining the required safety separation between aircraft. Yet, only a minor focus is given to the inherent uncertainty in the Air Transportation System (ATS), especially to its adverse effect on safety and day-to-day operations. To this end, we propose an ATFM framework scrutinizing the stochastic nature of ATS through a chance-constraint-based probabilistic approach. Moreover, anticipating the high volumes in air traffic in the future, we propose to split the model into two stages, in which the first stage scrutinizes the behavior of a set of flights as a flow, while the second stage transforms them into individual flight plans, enhancing scalability. The two models are formulated as an Integer Linear Programming (ILP) problem, and a Mixed Integer Linear Programming (MILP) problem at stages I and II, respectively. The NP-hard nature of the overall problem is minimized by transforming the problem into a Maximum Weighted Independent Set (MWIS) finding problem.