Indicative routes for path planning and crowd simulation

Karamouzas, Ioannis; Gerærts, Roland; Overmars, Mark H.

doi:10.1145/1536513.1536540

Cited by 60 publications

(47 citation statements)

References 31 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Here, no global path has been computed yet, and the role of the leader is assigned to an arbitrary member. Note that the global path serves as an indicative route [Karamouzas et al 2009], and the agents are in general not located exactly on that route. It depends on the path-following method what points on the route are used to determine the leader and the last member.…”

Section: Leader and Last Membermentioning

confidence: 99%

Adding sociality to virtual pedestrian groups

Jaklin

Kremyzas

Gerærts

2015

Proceedings of the 21st ACM Symposium on Virtual Reality Software and Technology

Self Cite

View full text Add to dashboard Cite

We present a new method, Social Groups and Navigation (SGN), to simulate the walking behavior of small pedestrian groups in virtual environments. SGN is the first method to simulate group behavior on both global and local levels. We define quantitative metrics to measure the coherence and the sociality of a group based on existing empirical data of real crowds. SGN is designed to let groups stay in coherent and social formations without explicitly modeling such formations. For groups of four, SGN generates between 13% and 53% more socially-friendly behavior than existing methods, measured over the lifetime of a group in the simulation. For groups of three, the gain is between 15% and 31%, and for groups of two, the gain is between 1% and 4%. SGN can be used with any existing global path planner and any existing path following method. Experiments show that SGN enables the simulation of thousands of agents in real time. Due to its flexible design, it can be easily integrated into a larger crowd simulation framework.

show abstract

Section: Leader and Last Membermentioning

confidence: 99%

Adding sociality to virtual pedestrian groups

Jaklin

Kremyzas

Gerærts

2015

Proceedings of the 21st ACM Symposium on Virtual Reality Software and Technology

Self Cite

View full text Add to dashboard Cite

show abstract

“…The work in [20] manages group motion in dynamic environment using a centralized approach for group coherence and formation, but is computationally infeasible for a large number of groups. The explicit corridor map (ECM) [14], [21], [22] produces shortest paths in the medial axis of an environment, ensuring clearance constraints, and can account for crowd density by periodically replanning to avoid congestion. Comparison to prior work.…”

Section: Related Workmentioning

confidence: 99%

Path planning for coherent and persistent groups

Huang

Kapadia

Badler

et al. 2014

2014 IEEE International Conference on Robotics and Automation (ICRA)

View full text Add to dashboard Cite

Abstract-This paper addresses the problem of group path planning while maintaining group coherence and persistence. Group coherence ensures that a group minimizes both longitudinal and lateral dispersion, and is achieved with the introduction of a deformation penalty to the cost formulation. When the deformation penalty is significantly high, a group may split and later merge. Group persistence is modeled by introducing split and merge actions in the action space, and adding a split penalty to the cost measure. We formulate the problem domain (state, action space, and cost formulation), present our path planning approach for coherent and persistent groups, and provide empirical results demonstrating the capabilities of our method on a variety of challenging scenarios.

show abstract

“…Moving Along a Lane: The agent A i j uses the selected lane L s as an indicative route in order to traverse its current arc. More precisely, an attraction point moves along L s and attracts the agent forward as defined in [10]. Given the attraction point and the distance that A i j still has to traverse within the time T θ − t that has at its disposal, the preferred velocity v pref i j of A i j can then be estimated.…”

Section: Choosing a Lanementioning

confidence: 99%

Space-Time Group Motion Planning

Karamouzas

Gerærts

Stappen

2013

Springer Tracts in Advanced Robotics

Self Cite

View full text Add to dashboard Cite

We present a novel approach for planning and directing heterogeneous groups of virtual agents based on techniques from linear programming. Our method efficiently identifies the most promising paths in both time and space and provides an optimal distribution of the groups' members over these paths such that their average traveling time is minimized. The computed space-time plan is combined with an agent-based steering method to handle collisions and generate the final motions of the agents. Our overall solution is applicable to a variety of virtual environment applications, such as computer games and crowd simulators. We highlight its potential on different scenarios and evaluate the results from our simulations using a number of quantitative quality metrics. In practice, our system runs at interactive rates and can solve complex planning problems involving one or multiple groups.

show abstract

Indicative routes for path planning and crowd simulation

Cited by 60 publications

References 31 publications

Adding sociality to virtual pedestrian groups

Adding sociality to virtual pedestrian groups

Path planning for coherent and persistent groups

Space-Time Group Motion Planning

Contact Info

Product

Resources

About