Dijkstrův algoritmus v problému proudění chodců

Petrášová, Tereza

Title: On the Dijkstra's algorithm in the Pedestrian Flow Problem Author: Tereza Petrášová Department: Department of Numerical Mathematics Supervisor: doc. RNDr. Jiří Felcman, CSc., Department of Numerical Mathe- matics Abstract: The pedestrian flow problem is described by a coupled system of the first order hyperbolic partial differential equations with the source term and by the functional minimization problem for the desired direction of motion. The functional minimization is based on the modified Dijkstra's algorithm used to find the minimal path to the exit. The original modification of the Dijkstra's algorithm is proposed to increase its efficiency in the pedestrian flow problem. This approach is compared with the algorithm of Bornemann and Rasch for determination of the desired direction of motion based on the solution of the so- called Eikonal equation. Both approaches are numerically tested in the framework of two splitting algorithms for solution of the coupled problem. The former splitting algorithm is based on the finite volume method yielding for the given time instant the piecewise constant approximation of the solution. The latter one uses the implicit discretization by a space-time discontinuous Galerkin method based on the discontinuous piecewise polynomial approximation. The numerical examples...

guest :: login Digital Repository
		Search		Submit		Help		About