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.

Slides:



Advertisements
Similar presentations
Computer Supported Cooperative Work by an Agent Oriented Software Engineering Approach: CSCW by AOSE Darlinton Carvalho
Advertisements

Outline Flows Flow tiles Applications Assessment Conclusion.
A predictive Collision Avoidance Model for Pedestrian Simulation Author: Ioannis Karamouzas et al. Presented by: Jessica Siewert.
Controlling Individual Agents in High Density Crowd Simulation N. Pelechano, J.M. Allbeck and N.I. Badler (2007)
Guang Tan, Stephen A. Jarvis, and Anne-Marie Kermarrec IEEE Transactions on Mobile Computing, VOL. 8, NO.6, JUNE Yun-Jung Lu.
Better Group Behaviors in Complex Environments using Global Roadmaps O. Burchan Bayazit, Jyh-Ming Lien and Nancy M. Amato Presented by Mohammad Irfan Rafiq.
Way to go: A framework for multi-level planning in games Norman Jaklin Wouter van Toll Roland Geraerts Department of Information and Computing Sciences.
 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.
Crowd Simulation Sai-Keung Wong. Crowd Simulation A process of simulating the movement of a large number of entities or characters. While simulating these.
Jur van den Berg, Stephen J. Guy, Ming Lin, Dinesh Manocha University of North Carolina at Chapel Hill Optimal Reciprocal Collision Avoidance (ORCA)
Video Session Gur Harary and Ayellet Tal. "Visualizing 3D Euler Spirals" Dmitry N. Krasnoshchekov, Valentin Polishchuk, and Arto Vihavainen. "Shape Approximation.
PEDESTRAIN CELLULAR AUTOMATA AND INDUSTRIAL PROCESS SIMULATION Alan Jolly (a), Rex Oleson II (b), Dr. D. J. Kaup (c) (a,b,c) Institute for Simulation and.
Bart van Greevenbroek.  Authors  The Paper  Particle Swarm Optimization  Algorithm used with PSO  Experiment  Assessment  conclusion.
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.
KAIST CS780 Topics in Interactive Computer Graphics : Crowd Simulation A Task Definition Language for Virtual Agents WSCG’03 Spyros Vosinakis, Themis Panayiotopoulos.
Real-time crowd motion planning: Scalable Avoidance and Group Behavior (2008) Authors: Yersin, Maïm, Morini, Thalman Presented by: Jessica Siewert.
Path Planning for Multi Agent Systems by Kemal Kaplan.
UNC Chapel Hill M. C. Lin COMP259: Physically-Based Modeling, Simulation & Animation Tues/Thur 12:30pm – 1:45pm (SN 011)
Adapted from: CULLIDE: Interactive Collision Detection Between Complex Models in Large Environments using Graphics Hardware Naga K. Govindaraju, Stephane.
Continuum Crowds Adrien Treuille, Siggraph 王上文.
11/08/00 Dinesh Manocha, COMP258 Subdivision Curves & Surfaces Work of G. de Rham on Corner Cutting in 40’s and 50’s Work of Catmull/Clark and Doo/Sabin.
Optimal Area Covering by Mobile Robot presented by: Nelly Chkolunov Fentahun Assefa-Dawit Fentahun Assefa-Dawit supervised by: Alexey Talyansky Technion.
Real-time Crowd Movement On Large Scale Terrains Speaker: Alvin Date:4/26/2004From:TPCG03.
The UNIVERSITY of NORTH CAROLINA at CHAPEL HILL Constraint-Based Motion Planning using Voronoi Diagrams Maxim Garber and Ming C. Lin Department of Computer.
RoboCup: The Robot World Cup Initiative Based on Wikipedia and presentations by Mariya Miteva, Kevin Lam, Paul Marlow.
Bottom-Up Coordination in the El Farol Game: an agent-based model Shu-Heng Chen, Umberto Gostoli.
Crowd Simulations Guest Instructor - Stephen J. Guy.
Multi-Layered Navigation Meshes Wouter G. van Toll, Atlas F. Cook IV, Roland Geraerts ICT.OPEN 2011.
Real-Time Concepts for Embedded Systems Author: Qing Li with Caroline Yao ISBN: CMPBooks.
Zhiyong Wang In cooperation with Sisi Zlatanova
REAL-TIME NAVIGATION OF INDEPENDENT AGENTS USING ADAPTIVE ROADMAPS Avneesh Sud 1, Russell Gayle 2, Erik Andersen 2, Stephen Guy 2, Ming Lin 2, Dinesh Manocha.
An affinity-driven clustering approach for service discovery and composition for pervasive computing J. Gaber and M.Bakhouya Laboratoire SeT Université.
Robot Crowd Navigation using Predictive Position Fields in the Potential Function Framework Ninad Pradhan, Timothy Burg, and Stan Birchfield Electrical.
Leslie Luyt Supervisor: Dr. Karen Bradshaw 2 November 2009.
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.
Establishing Precedents
1 IE 607 Heuristic Optimization Particle Swarm Optimization.
Adrian Treuille, Seth Cooper, Zoran Popović 2006 Walter Kerrebijn
Controlling Individual Agents in High-Density Crowd Simulation
Crowds (and research in animation and games) CSE 3541 Matt Boggus.
Wouter G. van Toll Atlas F. Cook IV Roland Geraerts Realistic Crowd Simulation with Density-Based Path Planning ICT.OPEN / ASCI October 22nd, 2012.
Computer Animation Rick Parent Computer Animation Algorithms and Techniques Behavioral Animation: Crowds.
CORNELL UNIVERSITY CS 764 Seminar in Computer Vision Ramin Zabih Fall 1998.
Cross-Layer Scheduling for Power Efficiency in Wireless Sensor Networks Mihail L. Sichitiu Department of Electrical and Computer Engineering North Carolina.
Rigid Body Dynamics: A Graphical Simulation Eugene Paik
Particle Swarm Optimization (PSO)
Governance, Risk and Ethics. 2 Section A: Governance and responsibility Section B: Internal control and review Section C: Identifying and assessing risk.
UNC Chapel Hill David A. O’Brien Automatic Simplification of Particle System Dynamics David O’Brien Susan Fisher Ming C. Lin Department of Computer Science.
Cognitive Modeling Cogs 4961, Cogs 6967 Psyc 4510 CSCI 4960 Mike Schoelles
Eliminating External Fragmentation in a Non-Moving Garbage Collector for Java Author: Fridtjof Siebert, CASES 2000 Michael Sallas Object-Oriented Languages.
On the Computation of All Global Minimizers Through Particle Swarm Optimization IEEE Transactions On Evolutionary Computation, Vol. 8, No.3, June 2004.
CG-UFRGS Real-Time Multi-Agent Path Planning on Arbitrary Surfaces Rafael P. Torchelsen 1, Luiz F. Scheidegger 1, Guilherme N. Oliveira 1, Rui Bastos 2,
Crowds (and research in computer animation and games)
Computer Animation Algorithms and Techniques
COMP259: Physically-Based Modeling, Simulation & Animation
Crowd Simulation (INFOMCRWS) - Introduction to Crowd Simulation
Crowds (and research in computer animation and games)
Navigation In Dynamic Environment
Sounding Liquids: Automatic Sound Synthesis from Fluid Simulations
Crowd Simulation (INFOMCRWS) - UU Crowd Simulation Software
Workshop II UU Crowd Simulation Framework
COMP259: Physically-Based Modeling, Simulation & Animation
CIS 488/588 Bruce R. Maxim UM-Dearborn
Workshop 1: Crowd Simulation Software & Collision Avoidance
R. W. Eberth Sanderling Research, Inc. 01 May 2007
Robot Motion Planning Project
Global Vector Field Computation for Feedback Motion Planning
Presentation transcript:

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

Introduction Increase of agent-based methods to model virtual crowds: off-line (movies) real-time (games, virtual environments)

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: Use composite agents to model different emergent behaviors: - embody intangible factors (social, psychological) - use pre-existing collision avoidance

Related Work Rule-based systems Social Forces models Continuum Crowd theory Claim: All these can be combined with Composite Agents approach

Composite Agents General multi-agent system (SIMULATOR): environment Φ Env set of Agents = {A 1,A 2,…,A n } with states φ i external state ε i position p i velocity v i geometric representation G i internal state ι i goal position, memory, mental state Definitions

Composite Agents General multi-agent system (SIMULATOR): Algorithm for each agent: GatherNeighbors() field of view, nearest-k neighbors E Nbr = {ε k | A k є GatherNeighbors(A i )} Update() φ i ← Update(φ i,E Nbr,Φ Env ) Definitions

Composite Agents Definitions Composite Agent: Basic Agent standard agent A i from SIMULATOR contains a set of Proxy Agents P i,j Proxy Agent “hands extended from the basic agent […], encouraging [other agents] to step away to avoid collision”

Composite Agents Definitions Proxy Agent P i,j ε i,j ι i,j acces to ι i

Composite Agents Definitions

Composite Agents Types Different kinds of intangible factors: Aggression Social Priority Authority Protection and Guidance

Composite Agents Types Aggression: Urgency modeled as property Urgency Expression of that urgency modeled by adding aggression proxy P i,1

Composite Agents Types Urgency: constant dynamic (velocity-based, distance-based)

Composite Agents Types Example Urgency

Composite Agents Types Social Priority: Priority modeled as property Priority Expression of that priority modeled by adding priority proxy P i,1

Composite Agents Types Example Social Priority

Composite Agents Types Authority: Trailblazer modeled as property Trail Identifier Expression of that trailblazer modeled by adding trail proxies P i,1,P i,2,…,P i,m

Composite Agents Types Example Authority

Composite Agents Types Protection and Guidance: Mother M and Child K M maintains information about K M provides protection and guidance for K Expression of M’s behavior modeled by adding a protection or guidance proxie P i,1

Composite Agents Types Protection: Guidance:

Composite Agents Types Example Protection and Guidance

Implementation

Proxy Updates information contained in proxy Dynamic States Conditional Neighbors proxies not in neighbor set of parent agent, trail proxies not in neighbor sets of group members Visualization 2D and 3D

Experiment Office Evacuation, Subway Station, Embassy [Movie]

Results

Conclusion Composite agents can be succesfully used to model emergent crowd behaviors This yields little computational overhead

Assessment (Almost) good paper length, but lacking information almost everywhere Experiments barely compare between methods or even sufficiently in the same method Ending seems too short, incomplete, or superficial Conclusion is not epic, and maybe too bold

Assessment The ‘math’ section seems misplaced and arbitrary, also too compact to really check its use and correctness Almost nothing is mentioned about goal selection, map creation, or the selection of locations of proxy agents Accompanying website ( has very little informationhttp://gamma.cs.unc.edu/CompAgent/

Assessment The notion of ‘groups’ is not really explored ‘Any geometrical shape’ is not explained ‘Future work’ should be current work