Abstract
We propose a Euler-Lagrange transformation for cellular automata (CA) by developing new explicit transformation formulas. This transformation is done in the fully discrete level of variables, and corresponds to the well-known continuous version of it which appears in continuous mechanics such as fluid dynamics and plasma physics. Applying this method to the traffic problem, we have obtained the Lagrange representation of a traffic model, and also succeeded in clarifying the relation between different types of traffic models. It is shown that the Burgers CA, which is a corresponding CA of the continuous Burgers equation, plays a central role in considering this relation.
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.
