Searcharxiv⌕ Search

arXiv subjects

Filippos N. Tzortzoglou

Publications and source records attributed to Filippos N. Tzortzoglou.

11 recordsLinked to original sources

Integrated Routing and Intersection Control for Mixed Traffic

The rapid development of cyber-physical systems is driving a transition toward mixed traffic environments comprising both human-driven and connected and automated vehicles (CAVs). This shift presents a unique opportunity to leverage the efficient operation of CAVs to improve overall network throughput. This paper introduces a hierarchical framework designed to bridge macroscopic routing optimization at the network level with microscopic vicinity control at signalized intersections. The upper layer utilizes aggregated traffic information to provide proactive routing guidance for CAVs, aiming to minimize total travel time. The lower layer leverages local vehicle states to jointly optimize traffic light phases and individual CAV trajectories, aiming to reduce intersection crossing delays and optimize energy consumption, respectively. The effectiveness of the proposed framework is validated through SUMO on the Sioux Falls benchmark network. Results demonstrate that the integration of these macroscopic and microscopic layers yields significantly better performance compared to applying either layer in isolation, significantly improving network throughput and reducing congestion.

eess.SY↗

Closed-Form Characterization of Constrained Double-Integrator Optimal Control

We consider the energy-optimal control problem for double-integrator systems subject to state and control constraints, with fixed terminal time and free terminal speed. When the constraints become active, the optimal trajectory consists of a combination of bang, unconstrained, and coast arcs, whose switching instants must be computed explicitly. In this paper, we derive closed-form expressions for the switching times of all admissible profiles, including both constrained and unconstrained arcs, reducing the computation in each case to explicit algebraic equations. In contrast to prior work, we classify all possible combinations of arcs, including special cases, and provide the specific conditions under which each case arises. Furthermore, we prove that when the initial unconstrained trajectory violates both speed and control constraints, the optimal solution follows a predetermined bang-affine-coast profile, enabling direct identification of the optimal trajectory without intermediate feasibility checks.

eess.SY↗

Teaching Cars to Drive: Spotlight on Connected and Automated Vehicles

In recent decades, society has witnessed significant advancements in emerging mobility systems. These systems refer to transportation solutions that incorporate digital technologies, automation, connectivity, and sustainability to create safer, more efficient, and user-centered mobility. Examples include connected and automated vehicles (CAVs), shared mobility services (car-pooling), electric vehicles, and mobility-as-a-service platforms. These innovations have the potential to greatly impact areas such as safety, pollution, comfort, travel time, and fairness. In this article, we explore the current landscape of CAVs. We discuss their role in daily life and their future potential, while also addressing the challenges they may introduce. Following, we also examine the practical difficulties in research associated with CAVs especially simulating and testing CAV-related algorithms in real-world settings. We present existing solutions that aim to overcome these limitations. Finally, we provide an accessible introduction to modeling CAVs using basic kinematic principles and offer an open-source tutorial to help interested students begin exploring the field.

eess.SY↗

Handling Pedestrian Uncertainty in Coordinating Autonomous Vehicles at Signal-Free Intersections

In this paper, we provide a theoretical framework for the coordination of connected and automated vehicles (CAVs) at signal-free intersections, accounting for the unexpected presence of pedestrians. First, we introduce a general vehicle-to-infrastructure communication protocol and a low-level controller that determines the optimal unconstrained trajectories for CAVs, in terms of fuel efficiency and travel time, to cross the intersection without considering pedestrians. If such an unconstrained trajectory is unattainable, we introduce sufficient certificates for each CAV to cross the intersection while respecting the associated constraints. Next, we consider the case where an unexpected pedestrian enters the road. When the CAV's sensors detect a pedestrian, an emergency mode is activated, which imposes certificates related to an unsafe set in the pedestrian's proximity area. Simultaneously, a re-planning mechanism is implemented for all CAVs to accommodate the trajectories of vehicles operating in emergency mode. Finally, we validate the efficacy of our approach through simulations conducted in MATLAB and RoadRunner softwares, which facilitate the integration of sensor tools and the realization of real-time implementation.

eess.SY↗

Safe and Efficient Coexistence of Autonomous Vehicles with Human-Driven Traffic at Signalized Intersections

The proliferation of connected and automated vehicles (CAVs) has positioned mixed traffic environments, which encompass both CAVs and human driven vehicles (HDVs), as critical components of emerging mobility systems. Signalized intersections are paramount for optimizing transportation efficiency and enhancing energy economy, as they inherently induce stop and go traffic dynamics. In this paper, we present an integrated framework that concurrently optimizes signal timing and CAV trajectories at signalized intersections, with the dual objectives of maximizing traffic throughput and minimizing energy consumption for CAVs. We first formulate an optimal control strategy for CAVs that prioritizes trajectory planning to circumvent state constraints, while incorporating the impact of signal timing and HDV behavior. Furthermore, we introduce a traffic signal control methodology that dynamically adjusts signal phases based on vehicular density per lane, while mitigating disruption for CAVs scheduled to traverse the intersection. Acknowledging the system's inherent dynamism, we also explore event triggered replanning mechanisms that enable CAVs to iteratively refine their planned trajectories in response to the emergence of more efficient routing options. The efficacy of our proposed framework is evaluated through comprehensive simulations in MATLAB.

eess.SY↗

On Mobility Equity and the Promise of Emerging Transportation Systems

This paper introduces a mobility equity metric (MEM) for evaluating fairness and accessibility in multi-modal intelligent transportation systems. The MEM simultaneously accounts for service accessibility and transportation costs across different modes of transportation and social demographics. We provide a data-driven validation of the proposed MEM to characterize the impact of various parameters in the metric across cities in the U.S. We subsequently develop a routing framework that aims to optimize MEM within a transportation network containing both public transit and private vehicles. Within this framework, a system planner provides routing suggestions to vehicles across all modes of transportation to maximize MEM. We evaluate our approach through numerical simulations, analyzing the impact of travel demands and compliance of private vehicles. This work provides insights into designing transportation systems that are not only efficient but also equitable, ensuring fair access to essential services across diverse populations.

eess.SY↗

A Mobility Equity Metric for Multi-Modal Intelligent Transportation Systems

In this paper, we introduce a metric to evaluate the equity in mobility and a routing framework to enhance the metric within multi-modal intelligent transportation systems. The mobility equity metric (MEM) simultaneously accounts for service accessibility and transportation costs to quantify the equity and fairness in a transportation network. Finally, we develop a system planner integrated with MEM that aims to distribute travel demand for the transportation network, resulting in a socially optimal mobility system. Our framework results in a transportation network that is efficient in terms of travel time, improves accessibility, and ensures equity in transportation.

eess.SY↗

A Feasibility Analysis at Signal-Free Intersections

In this letter, we address the problem of improving the feasible domain of the solution of a decentralized control framework for coordinating connected and automated vehicles (CAVs) at signal-free intersections as the traffic volume increases. The framework provides the optimal trajectories of CAVs to cross the intersection safely without stop-and-go driving. However, as the traffic volume increases, the domain of the feasible trajectories decreases. We use concepts of numerical interpolation to identify appropriate polynomials that can serve as alternative trajectories of the CAVs, expanding the domain of the feasible CAV trajectories. We provide the conditions under which such polynomials exist. Finally, we demonstrate the efficacy of our approach through numerical simulations.

math.OC↗

Stochastic Time-Optimal Trajectory Planning for Connected and Automated Vehicles in Mixed-Traffic Merging Scenarios

Addressing safe and efficient interaction between connected and automated vehicles (CAVs) and human-driven vehicles in a mixed-traffic environment has attracted considerable attention. In this paper, we develop a framework for stochastic time-optimal trajectory planning for coordinating multiple CAVs in mixed-traffic merging scenarios. We present a data-driven model, combining Newell's car-following model with Bayesian linear regression, for efficiently learning the driving behavior of human drivers online. Using the prediction model and uncertainty quantification, a stochastic time-optimal control problem is formulated to find robust trajectories for CAVs. We also integrate a replanning mechanism that determines when deriving new trajectories for CAVs is needed based on the accuracy of the Bayesian linear regression predictions. Finally, we demonstrate the performance of our proposed framework using a realistic simulation environment.

eess.SY↗

Performance-Sensitive Potential Functions for Efficient Flow of Connected and Automated Vehicles

Connected and automated vehicles (CAVs) provide the most intriguing opportunity for enabling users to monitor transportation network conditions and make better decisions for improving safety and transportation efficiency. In this paper, we address the problem of effectively coordinating CAVs on lane-based roadways. Our approach utilizes potential functions to generate repulsive forces between CAVs that ensure collision avoidance. However, such potential functions can lead to unrealistic acceleration profiles and large inter-vehicle distances. The primary contribution of this work is the introduction of performance-sensitive potential functions to address these challenges. In our approach, the parameters of a potential function are determined through an optimization problem aiming to reduce both acceleration and inter-vehicle distances. To circumvent the computational implications due to the complexity of the resulting optimization problem that prevents the derivation of a real-time solution, we train a neural network model to learn the mapping of initial conditions to optimal parameters derived offline. Then, we prove sufficient criteria for the sampled-data model to ensure that the neural network output does not activate any of the state and safety constraints. Finally, we provide simulation results to demonstrate the effectiveness of the proposed approach.

eess.SY↗

An Approach for Optimizing Acceleration in Connected and Automated Vehicles

Vehicle automation technology has made significant progress, laying the groundwork for a future of fully automated vehicles. This paper delves into the operation of connected and automated vehicles (CAVs). In prior work, we developed a controller that includes a tunable gain whose value significantly influences CAV performance and, in particular, its acceleration. By varying this gain, CAV acceleration is associated with different values depending on some initial conditions. Thus, our goal in this paper is to identify the optimal value of this gain in terms of acceleration for any group of initial conditions. To this end, we formulate an optimization problem where the decision variable is the gain value, and the objective function includes the acceleration of the vehicles. The complexity of this problem prohibits real-time solutions. To address this challenge, we train a neural network to map different initial conditions to the optimal gain values efficiently. We showcase the proposed approach to deriving the optimal gains in a merging scenario with an on-ramp.

eess.SY↗