Abstract
AbstractWe used de Bruijn diagrams to analyze traffic models based on one-dimensional cellular automata. The first model is the rule 184 which simulates traffic flow with the simplest dynamics. The second model is a rule represented by a cellular automaton of order (4,2), which includes all the configurations that can be presented when the model contemplates two speeds. To this cellular automata we denominated LCATRAFFICFLOWVMAX2 which is completely deterministic and we can predict or analyze its behavior still before to carry out simulations in computer using de Bruijn diagrams. We obtained this model taking as it bases the model proposed by Nagel-Schreckenberg to simulate traffic flow in one dimension and one direction.KeywordsCellular AutomatonTraffic ModelEvolution RuleEmpty SiteSimple DynamicThese 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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
