3,906 research outputs found
Data visualization within urban models
Models of urban environments have many uses for town planning, pre-visualization of new building work and utility service planning. Many of these models are three-dimensional, and increasingly there is a move towards real-time presentation of such large models. In this paper we present an algorithm for generating consistent 3D models from a combination of data sources, including Ordnance Survey ground plans, aerial photography and laser height data. Although there have been several demonstrations of automatic generation of building models from 2D vector map data, in this paper we present a very robust solution that generates models that are suitable for real-time presentation. We then demonstrate a novel pollution visualization that uses these models
A Synthetic-Vision Based Steering Approach for Crowd Simulation
International audienceIn the everyday exercise of controlling their locomotion, humans rely on their optic flow of the perceived environment to achieve collision-free navigation. In crowds, in spite of the complexity of the environment made of numerous obstacles, humans demonstrate remarkable capacities in avoiding collisions. Cognitive science work on human locomotion states that relatively succinct information is extracted from the optic flow to achieve safe locomotion. In this paper, we explore a novel vision-based approach of collision avoidance between walkers that fits the requirements of interactive crowd simulation. By simulating humans based on cognitive science results, we detect future collisions as well as the level of danger from visual stimuli. The motor-response is twofold: a reorientation strategy prevents future collision, whereas a deceleration strategy prevents imminent collisions. Several examples of our simulation results show that the emergence of self-organized patterns of walkers is reinforced using our approach. The emergent phenomena are visually appealing. More importantly, they improve the overall efficiency of the walkers' traffic and avoid improbable locking situations
Parallelized Egocentric Fields for Autonomous Navigation
In this paper, we propose a general framework for local path-planning and steering that can be easily extended to perform high-level behaviors. Our framework is based on the concept of affordances: the possible ways an agent can interact with its environment. Each agent perceives the environment through a set of vector and scalar fields that are represented in the agent’s local space. This egocentric property allows us to efficiently compute a local space-time plan and has better parallel scalability than a global fields approach. We then use these perception fields to compute a fitness measure for every possible action, defined as an affordance field. The action that has the optimal value in the affordance field is the agent’s steering decision. We propose an extension to a linear space-time prediction model for dynamic collision avoidance and present our parallelization results on multicore systems. We analyze and evaluate our framework using a comprehensive suite of test cases provided in SteerBench and demonstrate autonomous virtual pedestrians that perform steering and path planning in unknown environments along with the emergence of high-level responses to never seen before situations
Controlling Individual Agents in High-Density Crowd Simulation
Simulating the motion of realistic, large, dense crowds of autonomous agents is still a challenge for the computer graphics community. Typical approaches either resemble particle simulations (where agents lack orientation controls) or are conservative in the range of human motion possible (agents lack psychological state and aren’t allowed to ‘push’ each other). Our HiDAC system (for High-Density Autonomous Crowds) focuses on the problem of simulating the local motion and global wayfinding behaviors of crowds moving in a natural manner within dynamically changing virtual environments. By applying a combination of psychological and geometrical rules with a social and physical forces model, HiDAC exhibits a wide variety of emergent behaviors from agent line formation to pushing behavior and its consequences; relative to the current situation, personalities of the individuals and perceived social density
It Pays to Be Popular: a Study of Civilian Assistance and Guerilla Warfare
This paper presents a study into the benefits imparted by friendly civilian populaces in assisting peacekeepers to conduct operations under the threat of guerrilla warfare. In this study, civilians report observed insurgent activity to peacekeepers with varying levels of enthusiasm depending on the reputation of the peacekeepers with the local populace. A simulation model is developed using an agent-based approach and a statistically significant number of Monte Carlo simulations conducted to measure the success of the peacekeeping operations and the benefits of civilian assistance.Peacekeeping, Insurgency, Agent-Based
Intelligent evacuation management systems: A review
Crowd and evacuation management have been active areas of research and study in the recent past. Various developments continue to take place in the process of efficient evacuation of crowds in mass gatherings. This article is intended to provide a review of intelligent evacuation management systems covering the aspects of crowd monitoring, crowd disaster prediction, evacuation modelling, and evacuation path guidelines. Soft computing approaches play a vital role in the design and deployment of intelligent evacuation applications pertaining to crowd control management. While the review deals with video and nonvideo based aspects of crowd monitoring and crowd disaster prediction, evacuation techniques are reviewed via the theme of soft computing, along with a brief review on the evacuation navigation path. We believe that this review will assist researchers in developing reliable automated evacuation systems that will help in ensuring the safety of the evacuees especially during emergency evacuation scenarios
Hierarchical Path Finding to Speed Up Crowd Simulation
Path finding is a common problem in computer games. Most videogames require to simulate thousands or millions of agents who interact and navigate in a 3D world showing capabilities such as chasing, seeking or intercepting other agents. A new hierarchical path finding solution is proposed for large environments. Thus, a navigation mesh as abstract data structure is used in order to divide the 3D world. Then, a hierarchy of graphs is built to perform faster path finding calculations than a common A*. The benefits of this new approach are demonstrated on large world models
Path planning for complex 3D multilevel environments
The continuous development of graphics hardware is
contributing to the creation of 3D virtual worlds with
high level of detail, from models of large urban areas, to
complete infrastructures, such as residential buildings,
stadiums, industrial settings or archaeological sites, to
name just a few. Adding virtual humans or avatars adds
an extra touch to the visualization providing an enhanced
perception of the spaces, namely adding a sense of scale,
and enabling simulations of crowds. Path planning for
crowds in a meaningful way is still an open research
field, particularly when it involves an unknown polygonal
3D world. Extracting the potential paths for navigation in
a non automated fashion is no longer a feasible option
due to the dimension and complexity of the virtual
environments available nowadays. This implies that we
must be able to automatically extract information from
the geometry of the unknown virtual world to define
potential paths, determine accessibilities, and prepare a
navigation structure for real time path planning and path
finding. A new image based method is proposed that
deals with arbitrarily a priori unknown complex virtual
worlds, namely those consisting of multilevel passages
(e.g. over and below a bridge). The algorithm is capable
of extracting all the information required for the actual
navigation of avatars, creating a hierarchical data
structure to help both high level path planning and low
level path finding decisions. The algorithm is image
based, hence it is tessellation independent, i.e. the
algorithm does not rely on the underlying polygonal
structure of the 3D world. Therefore, the number of
polygons does not have a significant impact on the
performance, and the topology has no weight on the
results.Fundação para a Ciência e a Tecnologi
- …