Home > Search Results: keywords:"eikonalová rovnice"
Search:
Search Tips :: Advanced Search
Search collections:
Sort by: Display results: Output format:
National Repository of Grey Literature 2 records found  Search took 0.01 seconds. 
On the fastest path in the pedestrian flow problem
 Zeman, Jiří ; Felcman, Jiří (advisor) ; Dolejší, Vít (referee)
The work treats a macroscopic pedestrian flow model. It shows the link of two possible definitions of the pedestrians' preferred direction of movement, one based on minimization of a functional, the other using the eikonal equation. The eikonal equation is derived in two dimensions, taking into account that the distant endpoint of the fastest path to the exit depends on the location of the pedestrian under consideration. Also, necessary condi- tions for a piecewise regular curve to be the minimizer of a certain functional in a related two-dimensional variational problem with non-standard Dirichlet boundary condition are formulated. 1
Detailed record
Application of the Dijkstra's Algorithm in the Pedestrian Flow Problem
 Petrášová, Tereza ; Felcman, Jiří (advisor) ; Dolejší, Vít (referee)
The purpose of this work is to study the pedestrian flow equations as the coupled system formed by the eikonal equation and the first order hyperbolic system with the source term. The hyperbolic system consists of the continuity equation and the equations of motion of a compressible inviscid fluid. To specify the outer volume forces in the latter equation it is assumed that the pedestrians try to move in a desired direction with a desired velocity, which are dependent on the density in their surroundings. The desired direction is obtained as the gradient of the solution of the eikonal equation. We show that the solution of the eikonal equation has the meaning of the time needed to pass the fastest path to the exit. We suggest avoiding solving the eikonal equation by using the graph theory, where as the graph we use the underlying triangulation. The norm of each edge in the graph is density-dependent and has the dimension of time. This is together with the use of the modified Dijkstra's algorithm the novelty of the work. Numerical results of the two approaches are presented. Powered by TCPDF (www.tcpdf.org)
Detailed record

Interested in being notified about new results for this query?
Subscribe to the RSS feed.
Digital Repository :: Search :: Submit :: Personalize :: Help
Powered by Invenio v1.1.2
Maintained by admin.invenio@techlib.cz
This site is also available in the following languages:
Česky  English