EE Seminar: D-CAR: Distributed Cooperative Autonomous Routing
Electrical Engineering Systems Seminar
Speaker: Yoav Pichoto
M.Sc. student under the supervision of Dr. Ilai Bistritz
Wednesday, 12th November 2025, at 15:00
Room 011, Kitot Building, Faculty of Engineering
D-CAR: Distributed Cooperative Autonomous Routing
Abstract
Autonomous vehicles envision a future where congestion games are played between cooperative rather than selfish players. We consider N cooperative players engaged in a congestion game on a graph G, where they all share the same source and destination nodes. The goal of the team of players is to minimize the sum of their trip times (costs). This model captures the interaction between a fleet of autonomous vehicles that constitutes all the traffic in a given area. We propose a communication-free distributed algorithm that enables players to learn the action profile (i.e., routing decisions) that minimizes the sum of their trip times. Our algorithm only requires each player to observe its own trip times for each edge it travels (i.e., bandit feedback). The delay functions of the edges, which map the loads to trip times, are unknown to all players and are assumed to be polynomials. We prove an expected regret bound for our algorithm that shows polynomial dependence on N and the size of G. We conduct numerical experiments that demonstrate the effectiveness of our algorithm.
השתתפות בסמינר תיתן קרדיט שמיעה = עפ"י רישום בדף הנוכחות של שם מלא + מספר ת.ז.
