Ioannis Papamichail

AI
h-index74
3papers
103citations
Novelty52%
AI Score37

3 Papers

SYMay 28, 2019
Lane-free Artificial-Fluid Concept for Vehicular Traffic

Markos Papageorgiou, Kyriakos-Simon Mountakis, Iasson Karafyllis et al.

A novel paradigm for vehicular traffic in the era of connected and automated vehicles (CAVs) is proposed, which includes two combined principles: lane-free traffic and vehicle nudging, whereby vehicles are "pushing" (from a distance, using communication or sensors) other vehicles in front of them. This traffic paradigm features several advantages, including: smoother and safer driving; increase of roadway capacity; and no need for the anisotropy restriction. The proposed concept provides, for the first time since the automobile invention, the possibility to actively design (rather than describe) the traffic flow characteristics in an optimal way, i.e. to engineer the future CAV traffic flow as an efficient artificial fluid. Options, features, application domains and required research topics are discussed. Preliminary simulation results illustrate some basic features of the concept.

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

Ioannis Peridis, Dimitrios Troullinos, Georgios Chalkiadakis et al.

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.

MAFeb 18, 2025
Conditional Max-Sum for Asynchronous Multiagent Decision Making

Dimitrios Troullinos, Georgios Chalkiadakis, Ioannis Papamichail et al.

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.