490 research outputs found
Discrete Geodesics and Cellular Automata
International audienceThis paper proposes a dynamical notion of discrete geodesics, understood as straightest trajectories in discretized curved spacetime. The notion is generic, as it is formulated in terms of a general deviation function, but readily specializes to metric spaces such as discretized pseudo-riemannian manifolds. It is effective: an algorithm for computing these geodesics naturally follows, which allows numerical validation—as shown by computing the perihelion shift of a Mercury-like planet. It is consistent, in the continuum limit, with the standard notion of timelike geodesics in a pseudo-riemannian manifold. Whether the algorithm fits within the framework of cellular automata is discussed at length
Free fall and cellular automata
Three reasonable hypotheses lead to the thesis that physical phenomena can be
described and simulated with cellular automata. In this work, we attempt to
describe the motion of a particle upon which a constant force is applied, with
a cellular automaton, in Newtonian physics, in Special Relativity, and in
General Relativity. The results are very different for these three theories.Comment: In Proceedings DCM 2015, arXiv:1603.0053
The Effect of Integrating Travel Time
This contribution demonstrates the potential gain for the quality of results
in a simulation of pedestrians when estimated remaining travel time is
considered as a determining factor for the movement of simulated pedestrians.
This is done twice: once for a force-based model and once for a cellular
automata-based model. The results show that for the (degree of realism of)
simulation results it is more relevant if estimated remaining travel time is
considered or not than which modeling technique is chosen -- here force-based
vs. cellular automata -- which normally is considered to be the most basic
choice of modeling approach.Comment: preprint of Pedestrian and Evacuation 2012 conference (PED2012)
contributio
p-adic Difference-Difference Lotka-Volterra Equation and Ultra-Discrete Limit
In this article, we have studied the difference-difference Lotka-Volterra
equations in p-adic number space and its p-adic valuation version. We pointed
out that the structure of the space given by taking the ultra-discrete limit is
the same as that of the -adic valuation space.Comment: AMS-Tex Use. Title change
Handling congestion in crowd motion modeling
We address here the issue of congestion in the modeling of crowd motion, in
the non-smooth framework: contacts between people are not anticipated and
avoided, they actually occur, and they are explicitly taken into account in the
model. We limit our approach to very basic principles in terms of behavior, to
focus on the particular problems raised by the non-smooth character of the
models. We consider that individuals tend to move according to a desired, or
spontanous, velocity. We account for congestion by assuming that the evolution
realizes at each time an instantaneous balance between individual tendencies
and global constraints (overlapping is forbidden): the actual velocity is
defined as the closest to the desired velocity among all admissible ones, in a
least square sense. We develop those principles in the microscopic and
macroscopic settings, and we present how the framework of Wasserstein distance
between measures allows to recover the sweeping process nature of the problem
on the macroscopic level, which makes it possible to obtain existence results
in spite of the non-smooth character of the evolution process. Micro and macro
approaches are compared, and we investigate the similarities together with deep
differences of those two levels of description
- …