arXiv subjects

Dimitrios Troullinos

Publications and source records attributed to Dimitrios Troullinos.

4 recordsLinked to original sources

arXiv2026

Monte-Carlo Tree Search with Neural Network Guidance for Lane-Free Autonomous Driving

Lane-free traffic environments allow vehicles to better harness the lateral capacity of the road without being restricted to lane-keeping, thereby increasing the traffic flow rates. As such, we have a distinct and more challenging setting for autonomous driving. In this work, we consider a Monte-Carlo Tree Search (MCTS) planning approach for single-agent autonomous driving in lane-free traffic, where the associated Markov Decision Process we formulate is influenced from existing approaches tied to reinforcement learning frameworks. In addition, MCTS is equipped with a pre-trained neural network (NN) that guides the selection phase. This procedure incorporates the predictive capabilities of NNs for a more informed tree search process under computational constraints. In our experimental evaluation, we consider metrics that address both safety (through collision rates) and efficacy (through measured speed). Then, we examine: (a) the influence of isotropic state information for vehicles in a lane-free environment, resulting in nudging behaviour--vehicles' policy reacts due to the presence of faster tailing ones, (b) the acceleration of performance for the NN-guided variant of MCTS, and (c) the trade-off between computational resources and solution quality.

cs.AI↗

arXiv2025

Conditional Max-Sum for Asynchronous Multiagent Decision Making

In this paper we present a novel approach for multiagent decision making in dynamic environments based on Factor Graphs and the Max-Sum algorithm, considering asynchronous variable reassignments and distributed message-passing among agents. Motivated by the challenging domain of lane-free traffic where automated vehicles can communicate and coordinate as agents, we propose a more realistic communication framework for Factor Graph formulations that satisfies the above-mentioned restrictions, along with Conditional Max-Sum: an extension of Max-Sum with a revised message-passing process that is better suited for asynchronous settings. The overall application in lane-free traffic can be viewed as a hybrid system where the Factor Graph formulation undertakes the strategic decision making of vehicles, that of desired lateral alignment in a coordinated manner; and acts on top of a rule-based method we devise that provides a structured representation of the lane-free environment for the factors, while also handling the underlying control of vehicles regarding core operations and safety. Our experimental evaluation showcases the capabilities of the proposed framework in problems with intense coordination needs when compared to a domain-specific baseline without communication, and an increased adeptness of Conditional Max-Sum with respect to the standard algorithm.

cs.MA↗

arXiv2023

Controlling Automated Vehicles on Large Lane-free Roundabouts (Extended Version)

Controlling automated vehicles on large lane-free roundabouts is challenging because of the geometrical complexity and frequent conflicts among entering, rotating, and exiting vehicles. This paper proposes a comprehensive methodology to control the vehicles within the roundabout and the connected road branches. The developed real-time vehicle movement strategy relies on offline-computed wide overlapping movement corridors, one for each Origin-Destination (OD) movement, which delineate the admissible movement zones of corresponding OD vehicles. Also, space-dependent desired orientations are determined by destination, so as to mitigate potential vehicle conflicts and reduce trip distance. A distributed (per vehicle) movement control strategy, using two nonlinear feedback controllers (NLFC), for circular and straight movements, respectively, is employed to navigate each vehicle within the respective OD corridor toward its destination, accounting for the desired orientation and avoiding collisions with other vehicles; while boundary controllers guarantee that the corridor boundaries will not be violated, and the exit will not be missed. As an overly complicated case study, we consider the famous roundabout of Place Charles de Gaulle in Paris, featuring a width of 38 m and comprising a dozen of bidirectional radial streets, hence a total of 144 ODs. The pertinence and effectiveness of the presented method is verified via microscopic simulation and evaluation of macroscopic data.

eess.SY↗

arXiv2023

Optimal Trajectory Planning for Connected and Automated Vehicles in Lane-free Traffic with Vehicle Nudging

The paper presents a movement strategy for Connected and Automated Vehicles (CAVs) in a lane-free traffic environment with vehicle nudging by use of an optimal control approach. State-dependent constraints on control inputs are considered to ensure that the vehicle moves within the road boundaries and to prevent collisions. An objective function, comprising various weighted sub-objectives, is designed, whose minimization leads to vehicle advancement at the desired speed, when possible, while avoiding obstacles. A nonlinear optimal control problem (OCP) is formulated for the minimization of the objective function subject to constraints for each vehicle. A computationally efficient Feasible Direction Algorithm (FDA) is called, on event-triggered basis, to compute in real-time the numerical solution for finite time-horizons within a Model Predictive Control (MPC) framework. The approach is applied to each vehicle on the road, while running simulations on a lane-free ring-road, for a wide range of vehicle densities and different types of vehicles. From the simulations, which create myriads of driving episodes for each involved vehicle, it is observed that the proposed approach is highly efficient in delivering safe, comfortable and efficient vehicle trajectories, as well as high traffic flow outcomes. The approach is under investigation for further use in various lane-free road infrastructures for CAV traffic.

eess.SY↗