# Connection-Based Scheduling for Real-Time Intersection Control

arXiv: https://arxiv.org/abs/2210.08445 · HTML: https://mlsanity.com/paper/2210.08445/

## Key facts

- No citing papers in the map yet (data through 14 Oct 2026).
- Builds on 2 of its 8 references that are in the map.
- First posted on arXiv 16 Oct 2022.

## Builds on (most cited first, 2 of 2)

- [Softpressure: A Schedule-Driven Backpressure Algorithm for Coping with Network Congestion](https://mlsanity.com/paper/1903.02589/) (2019)
- [Coping with Large Traffic Volumes in Schedule-Driven Traffic Signal Control](https://mlsanity.com/paper/1903.04278/) (2019)

## Abstract (arXiv)

We introduce a heuristic scheduling algorithm for real-time adaptive traffic signal control to reduce traffic congestion. This algorithm adopts a lane-based model that estimates the arrival time of all vehicles approaching an intersection through different lanes, and then computes a schedule (i.e., a signal timing plan) that minimizes the cumulative delay incurred by all approaching vehicles. State space, pruning checks and an admissible heuristic for A* search are described and shown to be capable of generating an intersection schedule in real-time (i.e., every second). Due to the effectiveness of the heuristics, the proposed approach outperforms a less expressive Dynamic Programming approach and previous A*-based approaches in run-time performance, both in simulated test environments and actual field tests.