Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 461

The DOI matches its OpenAlex record; 1 of the 1 references it cites were found in a registry or an index.

Multiagent Traffic Management: A Reservation-Based Intersection Control Mechanism

Kurt Dresner, Peter Stone·2004

Abstract

Traffic congestion is one of the leading causes of lost productivity and decreased standard of living in urban set-tings. Recent advances in artificial intelligence suggest ve-hicle navigation by autonomous agents will be possible in the near future. In this paper, we propose a reservation-based system for alleviating traffic congestion, specifically at intersections, and under the assumption that the cars are controlled by agents. First, we describe a custom simulator that we have created to measure the different delays asso-ciated with conducting traffic through an intersection. Sec-ond, we specify a precise metric for evaluating the qual-ity of traffic control at an intersection. Using this simulator and this metric, we show that our reservation-based system can perform two to three hundred times better than traf-fic lights. As a result, it can smoothly handle much heavier traffic conditions. We show that our system very closely ap-proximates an overpass, which is the optimal solution for the problem with which we are dealing. 1.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

OpenAlex · 10.1109/aamas.2004.190

Cites

1 of 1 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 1 references

Cited by

See all 461

Metadata

Authors
Dresner, K., & Stone, P.
Published
2004-07-19
Volume
3
Pages
530-537
OpenAlex
W2099860849
Cited by
461
References
1
FWCI
20.70
Type
journal article
Language
en
Open access
closed

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Multiagent Traffic Management: A Reservation-Based Intersection Control Mechanism. https://app.cochat.ai/papers/10.1109/aamas.2004.190
The paper
Dresner, K., & Stone, P. (2004). Multiagent Traffic Management: A Reservation-Based Intersection Control Mechanism. https://doi.org/10.1109/aamas.2004.190

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.