City-wide control and coordination of traffic flow can improve efficiency, fuel consumption, and safety. We consider the problem of controlling traffic lights under fixed and adaptive routing of vehicles in urban road networks. Multicommodity back-pressure algorithms, originally developed for routing and scheduling in communication networks, are applied to road networks to control traffic lights and adaptively reroute vehicles. The performance of the algorithms is analyzed using a microscopic traffic simulator. The results demonstrate that the proposed multicommodity and adaptive routing algorithms provide significant improvement over a fixed schedule controller and a single-commodity back-pressure controller in terms of various performance metrics, including queue length, trips completed, travel times, and fair traffic distribution.

The aim of the presented research is to elaborate a traffic-responsive optimal signal split algorithm taking uncertainty into account. The traffic control objective is to minimize the weighted link queue lengths within an urban network area. The control problem is formulated in a centralized rolling-horizon fashion in which unknown but bounded demand and queue uncertainty influences the prediction. An efficient constrained minimax optimization is suggested to obtain the green time combination, which minimizes the objective function when worst case uncertainty appears. As an illustrative example, a simulation study is carried out to demonstrate the effectiveness and computational feasibility of the robust predictive approach. By using real-world traffic data and microscopic traffic simulator, the proposed robust signal split algorithm is analyzed and compared with well-tuned fixed-time signal timing and to nominal predictive solutions under different traffic conditions.

The article presents a state-space based Fault Diagnosis (FD) method for discrete-time, affine Linear Parameter Varying (LPV) systems. The goal of the technical note is to develop a robust and dynamic inversion based technique for systems with parameter varying representations when an additive, exogenous disturbance signal perturbs the system. After applying geometric concepts for explicit fault inversion, a robust strategy is proposed to attenuate the effect of the unknown disturbance input signal on the fault estimation error. The proposed robust observer is derived as a solution of off-line Linear Matrix Inequality (LMI) conditions. The technical note demonstrates the viability of the novel methodology through a numerical example.

The placement of electric vehicle charging stations (EVCSs), which encourages the rapid development of electric vehicles (EVs), should be considered from not only operational perspective such as minimizing installation costs, but also user perspective so that their strategic and competitive charging behaviors can be reflected. This paper proposes a methodological framework to consider crowdedness and individual preferences of electric vehicle users (EVUs) in the selection of locations for fast-charging stations. The electric vehicle charging station placement problem (EVCSPP) is solved via a decentralized game theoretical decision-making algorithm and k-means clustering algorithm. The proposed algorithm, referred to as k-GRAPE, determines the locations of charging stations to maximize the sum of utilities of EVUs. In particular, we analytically present that 50% of suboptimality of the solution can be at least guaranteed, which is about 17% better than the existing game theoretical based framework. We show a few variants to describe the utility functions that may capture the difference in preferences of EVUs. Finally, we demonstrate the viability of the decision framework via three real-world data-based experiments. The results of the experiments, including a comparison with a baseline method are then discussed.