A cellular automaton (CA) describes traffic dynamics in a completely discrete way: Space is subdivided into cells, time into time steps, and derived quantities such as speed or acceleration are integer multiples of the corresponding basic units. Cellular automata are easy and fast to simulate. However, due to their discrete nature, they reproduce real-life traffic only in a schematic way. This is particularly true for the Nagel-Schreckenberg Model as the simplest and most generic representative of traffic-related CA. Besides this model, two more refined cellular automata are presented.
Cellular Automaton Traffic Flow Congested Traffic Fundamental Diagram Highway Scenario
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in to check access.