This is a Matlab version of implementation of the well-known cellular automata of traffic model - NaSch.
The algorithm is based on the paper A celluar automation model for freeway traffic by Kai Nagel and Michael Schreckenberg in 1992. In the model, four most important steps are raised to be performed parallelly for all vehicles. They are:
-
Acceleration: if velocity v of a vehicle is lower than vmax and if the distance to the next car ahead if larger than v +1, the speed is advanced by one [ v -> v + 1]
-
Slowing down(due to other cars): if a vehicle at site i sees the next the next vehicle at site i + j (with j < v ), it reduces its speed to j - 1 [ v -> j - 1 ]
-
Randomization: with probability p, the velocity of each vehicle (if greater than zero) is decreased by one [ v -> v - 1 ]
-
Car motion: each vehicle is advanced v sites.
The four steps are modelled on the basis of integer valued probabilistic cellular automation rules.
Copyright (c) 2013 Codinfox(codinfox.me)
Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.