Pith. sign in

REVIEW

Two-lane traffic rules for cellular automata: A systematic approach

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv cond-mat/9712196 v1 pith:JRBR6CSF submitted 1997-12-18 cond-mat.stat-mech adap-orgnlin.AO

Two-lane traffic rules for cellular automata: A systematic approach

classification cond-mat.stat-mech adap-orgnlin.AO
keywords ruleschanginglaneresultsrealistictrafficapplyingcellular
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Microscopic modeling of multi-lane traffic is usually done by applying heuristic lane changing rules, and often with unsatisfying results. Recently, a cellular automaton model for two-lane traffic was able to overcome some of these problems and to produce a correct density inversion at densities somewhat below the maximum flow density. In this paper, we summarize different approaches to lane changing and their results, and propose a general scheme, according to which realistic lane changing rules can be developed. We test this scheme by applying it to several different lane changing rules, which, in spite of their differences, generate similar and realistic results. We thus conclude that, for producing realistic results, the logical structure of the lane changing rules, as proposed here, is at least as important as the microscopic details of the rules.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.