Adrian Treuille, Seth Cooper, Zoran Popović 2006 Walter Kerrebijn 0458376 07-06-2011.

Slides:



Advertisements
Similar presentations
A predictive Collision Avoidance Model for Pedestrian Simulation Author: Ioannis Karamouzas et al. Presented by: Jessica Siewert.
Advertisements

Controlling Individual Agents in High Density Crowd Simulation N. Pelechano, J.M. Allbeck and N.I. Badler (2007)
Better Group Behaviors in Complex Environments using Global Roadmaps O. Burchan Bayazit, Jyh-Ming Lien and Nancy M. Amato Presented by Mohammad Irfan Rafiq.
University of Texas at Austin CS 378 – Game Technology Don Fussell CS 378: Computer Game Technology Dynamic Path Planning, Flocking Spring 2012.
 Mankyu Sung Scalable, Controllable, Efficient and convincing crowd simulation (2005)  Michael Gleicher “I have a bad case of Academic Attention Deficit.
The UNIVERSITY of NORTH CAROLINA at CHAPEL HILL Reciprocal Velocity Obstacles for Real-Time Multi-Agent Navigation Jur van den Berg Ming Lin Dinesh Manocha.
Game Design Serious Games Miikka Junnila.
Artificial Intelligence in Game Design Introduction to Learning.
Crowd Simulation Sai-Keung Wong. Crowd Simulation A process of simulating the movement of a large number of entities or characters. While simulating these.
1 Reactive Pedestrian Path Following from Examples Ronald A. Metoyer Jessica K. Hodgins Presented by Stephen Allen.
John S Gero Agents – Agent Simulations AGENT-BASED SIMULATIONS.
C ROWD P ATCHES : P OPULATING L ARGE - S CALE V IRTUAL E NVIRONMENTS FOR R EAL -T IME A PPLICATIONS Barbara Yersin, Jonathan Maïm, Julien Pettré, Daniel.
Presenter: Robin van Olst. Avneesh SudRussell Gayle Erik Andersen Stephen GuyMing Lin Dinesh Manocha.
Multi Agent Simulation and its optimization over parallel architecture using CUDA™ Abdur Rahman and Bilal Khan NEDUET(Department Of Computer and Information.
Real-time crowd motion planning: Scalable Avoidance and Group Behavior (2008) Authors: Yersin, Maïm, Morini, Thalman Presented by: Jessica Siewert.
Reinforcement Learning Rafy Michaeli Assaf Naor Supervisor: Yaakov Engel Visit project’s home page at: FOR.
Crowds Andrew Kaufman Michael Welsman-Dinelle. What is a crowd? A group of agents performing actions. Agents can affect each other. Agent actions may.
Continuum Crowds Adrien Treuille, Siggraph 王上文.
Crowd Simulation Seminar ”Steering Behaviors For Autonomous Characters” By Craig W. Reynolds Rudi Bonfiglioli ( )
Chapter 5: Path Planning Hadi Moradi. Motivation Need to choose a path for the end effector that avoids collisions and singularities Collisions are easy.
Real-time Crowd Movement On Large Scale Terrains Speaker: Alvin Date:4/26/2004From:TPCG03.
Steering Behaviors For Autonomous Characters
A Crowd Simulation Using Individual- Knowledge-Merge based Path Construction and Smoothed Particle Hydrodynamics Weerawat Tantisiriwat, Arisara Sumleeon.
DAMN : A Distributed Architecture for Mobile Navigation Julio K. Rosenblatt Presented By: Chris Miles.
Chapter 5.4 Artificial Intelligence: Pathfinding.
Tal Mor  Create an automatic system that given an image of a room and a color, will color the room walls  Maintaining the original texture.
Multi-Layered Navigation Meshes Wouter G. van Toll, Atlas F. Cook IV, Roland Geraerts ICT.OPEN 2011.
Self-Organizing Agents for Grid Load Balancing Junwei Cao Fifth IEEE/ACM International Workshop on Grid Computing (GRID'04)
Ioannis Karamouzas, Roland Geraerts, Mark Overmars Indicative Routes for Path Planning and Crowd Simulation.
Chapter 5.4 Artificial Intelligence: Pathfinding.
Artificial Intelligence in Game Design Problems and Goals.
Zhiyong Wang In cooperation with Sisi Zlatanova
Robot Crowd Navigation using Predictive Position Fields in the Potential Function Framework Ninad Pradhan, Timothy Burg, and Stan Birchfield Electrical.
報告者:郭茂源 授課老師 : 童曉儒.  Introduction  Dissemination Strategies Overcoming fragmentation Updating the wait time dynamically  Message form and algorithm.
Flow Fields Hao Li and Howard Hamilton. Motivation for Flow Fields Multiple AI algorithms in a computer game can produce conflicting results. The AI must.
Using the Corridor Map Method for Path Planning for a Large Number of Characters Roland Geraerts, Arno Kamphuis, Ioannis Karamouzas, Mark Overmars MIG’08.
Ioannis Karamouzas, Roland Geraerts and A. Frank van der Stappen Space-time Group Motion Planning.
Motion Planning in Games Mark Overmars Utrecht University.
Artificial Intelligence in Game Design Dynamic Path Planning Algorithms.
Presentation of Wireless sensor network A New Energy Aware Routing Protocol for Wireless Multimedia Sensor Networks Supporting QoS 王 文 毅
Detail-Preserving Fluid Control N. Th ű rey R. Keiser M. Pauly U. R ű de SCA 2006.
Artificial Intelligence in Game Design Complex Steering Behaviors and Combining Behaviors.
From Path Planning to Crowd Simulation
Crowds (and research in animation and games) CSE 3541 Matt Boggus.
Learning to Navigate Through Crowded Environments Peter Henry 1, Christian Vollmer 2, Brian Ferris 1, Dieter Fox 1 Tuesday, May 4, University of.
1 Real-Time Parking Information on Parking-Related Travel Cost TRIP Internship Presentation 2014 Kory Harb July 24, 2014 Advisor: Dr. Yafeng Yin Coordinator:
Hengchin Yeh, Sean Curtis, Sachin Patil, Jur van den Berg, Dinesh Manocha, Ming Lin University of North Carolina at Chapel Hill ACM 2008 Walter Kerrebijn.
Behavior-based Multirobot Architectures. Why Behavior Based Control for Multi-Robot Teams? Multi-Robot control naturally grew out of single robot control.
Learning Momentum: Integration and Experimentation Brian Lee and Ronald C. Arkin Mobile Robot Laboratory Georgia Tech Atlanta, GA.
Crowd Self-Organization, Streaming and Short Path Smoothing 學號: 姓名:邱欣怡 日期: 2007/1/2 Stylianou Soteris & Chrysanthou Yiorgos.
Artificial Intelligence in Game Design Lecture 8: Complex Steering Behaviors and Combining Behaviors.
Traffic Light Simulation Lynn Jepsen. Introduction and Background Try and find the most efficient way to move cars through an intersection at different.
Simulating Crowds Simulating Dynamical Features of Escape Panic & Self-Organization Phenomena in Pedestrian Crowds Papers by Helbing.
Using Ant Agents to Combine Reactive and Proactive strategies for Routing in Mobile Ad Hoc Networks Fredrick Ducatelle, Gianni di caro, and Luca Maria.
School of Systems, Engineering, University of Reading rkala.99k.org April, 2013 Motion Planning for Multiple Autonomous Vehicles Rahul Kala Congestion.
Artificial Intelligence in Game Design Lecture 20: Hill Climbing and N-Grams.
11/13/03CS679 - Fall Copyright Univ. of Wisconsin Last Time A* Improvements Hierarchical planning Pre-Planning.
1 Algoritmos Genéticos aplicados em Machine Learning Controle de um Robo (em inglês)
Crowds (and research in computer animation and games)
Computer Animation Algorithms and Techniques
Indicative Routes for Path Planning and Crowd Simulation
Motion Planning for Multiple Autonomous Vehicles
Crowd Simulation (INFOMCRWS) - Introduction to Crowd Simulation
Crowds (and research in computer animation and games)
Roland Geraerts and Mark Overmars CASA’08
Navigation In Dynamic Environment
Workshop II UU Crowd Simulation Framework
CIS 488/588 Bruce R. Maxim UM-Dearborn
Robot Motion Planning Project
Synthesis of Motion from Simple Animations
Presentation transcript:

Adrian Treuille, Seth Cooper, Zoran Popović 2006 Walter Kerrebijn

Introduction Crowd Motion: large groups common goals collision avoidance real-time natural

Introduction Agent-based approach pros: independent decisions different simulation parameters Agent-based approach contras: emergent realism from behavioral rules hard to ensure computationally expensive distinction between global and local path-planning

Introduction Proposal: “Real-time motion synthesis model for large crowds without agent-based dynamics”

Introduction Motion: per-particle energy minimization dynamic potential and velocity fields merge of local and global path-planning

Related Work Methods in Game Development: Grid-based Navigation Meshes Waypoint Graph Combined with reactive steering approach

Continuum Crowd Approach Each person in a crowd: 1. is trying to reach a goal 2. moves at the maximum speed possible 3. tries to avoid discomfortable areas 4. picks the path minimizing the weighted sum of 1. and 2. and 3. Hypotheses

Continuum Crowd Approach Static goals can for example be: go to specific address go to ‘west side’ of town Dynamic goals can for example be: follow specific person find (non-)empty theater seat explore unseen parts of environment Hypotheses

Continuum Crowd Approach Hypotheses Maximum speed depends on: environment other people

Continuum Crowd Approach Hypotheses Avoiding discomfort fields encourages people to take certain paths

Continuum Crowd Approach Hypotheses

Continuum Crowd Approach Hypotheses

Continuum Crowd Approach Optimal Path

Continuum Crowd Approach Optimal Path

Continuum Crowd Approach Optimal Path Calculating a potential field may be done simultaneously for a group of characters

Continuum Crowd Approach Speed Speed is depending on: 1. crowd density 2. terrain

Continuum Crowd Approach Speed Crowd Density Field Average Velocity Field

Continuum Crowd Approach Speed For areas of low crowd density, the speed is depending on the terrain

Continuum Crowd Approach Speed For areas of high crowd density, the speed is depending on the crowd

Continuum Crowd Approach Speed For areas of medium crowd density, the speed is depending on both the terrain and the crowd

Continuum Crowd Approach Prediction Some predictive measures are necessary to reduce unnatural behavior: Predictive Discomfort - adds future density to discomfort field - should deal with perpendicular crossing Expected Periodic Field Changes - calculates expected speed - should deal with situations like traffic lights and doors

Implementation The algorithm used is as follows: Algorithm

Implementation The algorithm used is as follows: Algorithm

Implementation Density Conversion

Implementation Dynamic Field Construction Choosing least cost neighbor: Finite difference approximation:

Experiment 2D and 3D setups 3.4 GHz Nvidia Quadro FX 3400 [Movie]

Results/Conclusion Simulation steps took between 2 and 5 fps (?) Human animations were too simple Vortices and lanes emerged Agent interaction was possible Minimum Distance Enforcement was necessary

Assessment  The idea to merge local and global path planning is nice, but is it really better? weird behavior at traffic lights collisions still happen discomfort does not behave ‘natural’ enough individual control is lost there is no apparent group identity/cohesion  Does this method more closely resemble human psychology and path planning? global and local goals wandering

Assessment  It is not clear how the grid size is chosen, or how its choice influences the system  It is not clear why there is a ‘hard cut’ between low, medium and high crowd density speed calculations  There is no real mention of goal selection

Assessment  The experimental setup was not merged with an agents approach (as mentioned in the paper), only compared against it, so there is no way to see agent interactions with continuum crowds  FPS is not a measure of time, so how to evaluate these experiments?

Assessment  The results did not include tables, graphs or any other data visualization