3 research outputs found

    Modeling Family Behaviors in Crowd Simulation

    Get PDF
    Modeling human behavior for a general situation is difficult, if not impossible. Crowd simulation represents one of the approaches most commonly used to model such behavior. It is mainly concerned with modeling the different human structures incorporated in a crowd. These structures could comprise individuals, groups, friends, and families. Various instances of these structures and their corresponding behaviors are modeled to predict crowd responses under certain circumstances and to subsequently improve event management, facility and emergency planning. Most currently existing modeled behaviors are concerned with depicting individuals as autonomous agents or groups of agents in certain environments. This research focuses on providing structural and state-based behavioral models for the concept of a family incorporated in the crowd. The structural model defines parents, teenagers, children, and elderly as members of the family. It also draws on the associated interrelationships and the rules that govern them. The behavioral model of the family encompasses a number of behavioral models associated with the triggering of certain well-known activities that correspond to the family’s situation. For instance, in normal cases, a family member(s) may be hungry, bored, or tired, may need a restroom, etc. In an emergency case, a family may experience the loss of a family member(s), the need to assist in safe evacuation, etc. Activities that such cases trigger include splitting, joining, carrying children, looking for family member(s), or waiting for them. The proposed family model is implemented on top of the RVO2 library that is using agent-based approach in crowd simulation. Simulation case studies are developed to answer research questions related to various family evacuation approaches in emergency situations

    Modeling Human-Like Decision Making for Virtual Agents in Time-Critical Situations

    No full text

    Combining evolutionary algorithms and agent-based simulation for the development of urbanisation policies

    Get PDF
    Urban-planning authorities continually face the problem of optimising the allocation of green space over time in developing urban environments. To help in these decision-making processes, this thesis provides an empirical study of using evolutionary approaches to solve sequential decision making problems under uncertainty in stochastic environments. To achieve this goal, this work is underpinned by developing a theoretical framework based on the economic model of Alonso and the associated methodology for modelling spatial and temporal urban growth, in order to better understand the complexity inherent in this kind of system and to generate and improve relevant knowledge for the urban planning community. The model was hybridised with cellular automata and agent-based model and extended to encompass green space planning based on urban cost and satisfaction. Monte Carlo sampling techniques and the use of the urban model as a surrogate tool were the two main elements investigated and applied to overcome the noise and uncertainty derived from dealing with future trends and expectations. Once the evolutionary algorithms were equipped with these mechanisms, the problem under consideration was defined and characterised as a type of adaptive submodular. Afterwards, the performance of a non-adaptive evolutionary approach with a random search and a very smart greedy algorithm was compared and in which way the complexity that is linked with the configuration of the problem modifies the performance of both algorithms was analysed. Later on, the application of very distinct frameworks incorporating evolutionary algorithm approaches for this problem was explored: (i) an ‘offline’ approach, in which a candidate solution encodes a complete set of decisions, which is then evaluated by full simulation, and (ii) an ‘online’ approach which involves a sequential series of optimizations, each making only a single decision, and starting its simulations from the endpoint of the previous run
    corecore