Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
89
0
2

Year Published

2005
2005
2016
2016

Publication Types

Select...
6
2
1

Relationship

0
9

Authors

Journals

citations
Cited by 172 publications
(91 citation statements)
references
References 19 publications
0
89
0
2
Order By: Relevance
“…A triple of physical processes-particle interaction as flow, forces of attraction and repulsion, and phase change-feature rather ubiquitously in pedestrian models, often as the rules for agent behavior in simulation. For example, the triple is used to produce continuum mechanics for crowd aggregates [84], many-particle interaction within crowd flows [85,86], ebb and flow over vector-fields [87], and the physical or social forces of compression and expansion over repulsive-attractive fields [84,88,89].…”
Section: Physicsmentioning
confidence: 99%
“…A triple of physical processes-particle interaction as flow, forces of attraction and repulsion, and phase change-feature rather ubiquitously in pedestrian models, often as the rules for agent behavior in simulation. For example, the triple is used to produce continuum mechanics for crowd aggregates [84], many-particle interaction within crowd flows [85,86], ebb and flow over vector-fields [87], and the physical or social forces of compression and expansion over repulsive-attractive fields [84,88,89].…”
Section: Physicsmentioning
confidence: 99%
“…3 For global path planning, almost all cases require some sort of high-level representation of the simulation environment to support interactive simulations. Common techniques are portal graphs, 4,5 roadmaps, 6 potential fields, 7 and NavMeshes. 8 Since the NavMesh concept was first introduced by Snook, various researchers have proposed different ways to construct NavMeshes, which range from triangles to a mix of convex polygons.…”
Section: Background and Related Workmentioning
confidence: 99%
“…In our system, a Cellular Automata (CA) [2] is included as a part of the SDB, and each cell has precomputed the k-best paths of length l to achieve the exit cells. To calculate all the paths (k paths per cell; cell = 1m side square), we are using a variation of the A* algorithm.…”
Section: Fig 2 the Proposed Software Architecturementioning
confidence: 99%