Presenter: Robin van Olst. Prof. Dr. Dirk Helbing Heads two divisions of the German Physical Society of the ETH Zurich Ph.D. Péter Molnár Associate Professor.

Slides:



Advertisements
Similar presentations
Lecture 7: Potential Fields and Model Predictive Control
Advertisements

A predictive Collision Avoidance Model for Pedestrian Simulation Author: Ioannis Karamouzas et al. Presented by: Jessica Siewert.
Crowds In A Polygon Soup Next-Gen Path Planning David Miles 3/23/2006.
Objectives: 1.Be able to distinguish between distance and displacement 2.Explain the difference between speed and velocity 3.Be able to interpret motion.
Carnegie Mellon University TRAJECTORY MODIFICATION TECHNIQUES IN COVERAGE PLANNING By - Sanjiban Choudhury (Indian Institute of Technology, Kharagpur,
The Vector Field Histogram Erick Tryzelaar November 14, 2001 Robotic Motion Planning A Method Developed by J. Borenstein and Y. Koren.
School of Systems, Engineering, University of Reading rkala.99k.org April, 2013 Motion Planning for Multiple Autonomous Vehicles Rahul Kala Genetic Algorithm.
1 Reactive Pedestrian Path Following from Examples Ronald A. Metoyer Jessica K. Hodgins Presented by Stephen Allen.
Click to edit Master subtitle style Urban Mobility: A Data-Driven Approach Anders Johansson casa.ucl.ac.uk –
Social Force Model for Pedestrian Dynamics 1998 Sai-Keung Wong.
content 1. theoretical background: dynamics in the city 2. basics: architectural sociology and adverting psychology 3. physical place analysis: reeperbahn,
Vermelding onderdeel organisatie June 1, Microscopic Pedestrian Flow Modeling Prof. Dr. Ir. S. P. Hoogendoorn Dr. Winnie Daamen Ir. M.C. Campanella.
John S Gero Agents – Agent Simulations AGENT-BASED SIMULATIONS.
Presenter: Robin van Olst. Avneesh SudRussell Gayle Erik Andersen Stephen GuyMing Lin Dinesh Manocha.
Motion and Forces Unit Chapter 1 Section 3. Acceleration.
Search and Escape in “The Snorks World” Guillaume Poncin Gregory Kron Monday, June 9 th 2003.
1 University of Freiburg Computer Networks and Telematics Prof. Christian Schindelhauer Mobile Ad Hoc Networks Mobility (II) 11th Week
Coulomb’s Law Physics 102 Professor Lee Carkner Lecture 10.
Chapter 5: Path Planning Hadi Moradi. Motivation Need to choose a path for the end effector that avoids collisions and singularities Collisions are easy.
Studying the Force of Gravity
Ioannis Karamouzas, Roland Geraerts, Mark Overmars Indicative Routes for Path Planning and Crowd Simulation.
University of Central Florida Institute for Simulation & Training Title slide Continuous time-space simulations of pedestrian crowd behavior of pedestrian.
Position, Velocity, Acceleration, & Speed of a Snowboarder.
Using the Corridor Map Method for Path Planning for a Large Number of Characters Roland Geraerts, Arno Kamphuis, Ioannis Karamouzas, Mark Overmars MIG’08.
Newton’s 1 st Law of Mechanics A particle will continue is a straight line at constant speed unless acted upon by a net push or pull (i.e. force). The.
Review of Two-Scale Particle Simulation Paper by: Barbara Solenthaler ETH Zurich Markus Gross ETH Zurich.
Kinematics in One Dimension Chapter 2. Expectations After this chapter, students will:  distinguish between distance and displacement  distinguish between.
Resistance of an object to a change in its motion inertia.
Unit 4 – Lecture 2. Acceleration Acceleration – the rate of change of velocity change in velocity over a change in time a acceleration t f - t i change.
Motion Graphs. Motion-Time Graph Describing motion is occasionally difficult to do with words Graphs can help simplify this description greatly – Position.
Motion and Forces (p ). Motion describes how objects travel in space and time The main variables in the description of motion are: –Speed (velocity)
Artificial Intelligence in Game Design Dynamic Path Planning Algorithms.
Biomechanical Principles of Motion through air and water
Chapter: Force and Newton’s Laws
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:
Jeopardy Motion Speed & Time AccelerateVelocity What? Q $100 Q $200 Q $300 Q $400 Q $500 Q $100 Q $200 Q $300 Q $400 Q $500 Final Jeopardy.
Mobility Models for Wireless Ad Hoc Network Research EECS 600 Advanced Network Research, Spring 2005 Instructor: Shudong Jin March 28, 2005.
 Motion  Change in position during a time period  3 types of motion –Speed –Velocity –Acceleration.
Roland Geraerts and Erik Schager CASA 2010 Stealth-Based Path Planning using Corridor Maps.
Forces and Motion. Motion Definition An event that involves the change in position or location of something.
 You will be able to explain the relationship between motion and a frame of reference  You will be able to relate speed to distance and time  You will.
Simulating Crowds Simulating Dynamical Features of Escape Panic & Self-Organization Phenomena in Pedestrian Crowds Papers by Helbing.
School of Systems, Engineering, University of Reading rkala.99k.org April, 2013 Motion Planning for Multiple Autonomous Vehicles Rahul Kala Congestion.
Acceleration & Inclined Planes Unit 5 – Lecture 3.
M OTION AND FORCES CHAPTER 1 Science Ms. Curd. P OSITION Definition: The location of a place or object When you identify the position of an object you.
Motion Notes. Key Terms 1)Motion: 2)Reference point: The state in which one object’s distance from another is changing. A place or object used for comparison.
Chapter 11 - Motion. Physics – The science that studies the relationship between matter and energy. 5 major areas of study in Physics: Mechanics Electricity.
Acceleration & Force Section 8.2.
Section 11.1, Distance and Displacement Choosing a Frame of Reference –To describe motion, one must decide what the motion is relative to. –In a moving.
Mrs. Bryant’s 6th Grade Science
Crowd Modelling & Simulation
Acceleration Unit 1 Lesson 2
Flocking Geometric objects Many objects
Uniform Motion.
What is Motion?.
Simulating Dynamical Features of Escape Panic
Driving in City Traffic
MOTION GRAPHS Distance – time graphs
Roland Geraerts and Mark Overmars CASA’08
Graphing Motion Walk Around
VISWALK Pedestrian Modelling
Essential Question: How is energy conserved?
Non-contact forces Forces between objects when they are not touching.
Acceleration.
Forces and the Laws of Motion
Physical Science: Chapter 11
Acceleration.
Velocity vs Time Graphs – Notebooks
Unit 7 Matter in Motion
Presentation transcript:

Presenter: Robin van Olst

Prof. Dr. Dirk Helbing Heads two divisions of the German Physical Society of the ETH Zurich Ph.D. Péter Molnár Associate Professor of Computer and Information Science at Clark Atlanta University

Social force: a measure for motivation to move  What is a social force model? ◦ Models the probable motion of a pedestrian  Only for simple situations  Follows the gas-kinetic pedestrian model  Why use a social force model? ◦ Comparison to empirical data ◦ Useful for designing big areas

 How does a social force model work?

 Consists of 4 parts 1.Acceleration towards desired velocity of motion 2.Repulsive effects 3.Attractive effects 4.Fluctuations (randomness)  Path used: the edges of a polygon ◦ Why?

 Pedestrian want to reach his goal comfortably ◦ No detours ◦ Goal is an area, not a point  Steers towards the closest point of the area ◦ Takes his time to slow down  I.e. nearing goal or avoiding an obstacle

 Acquiring the desired direction 1

 Acquiring the acceleration ◦ Actual velocity: ◦ Relaxation term: Desired Deviation

 Pedestrian is repelled from: ◦ Other pedestrians  Depends on density and speed ◦ Borders of obstacles

 Repulsion from other pedestrians β ◦ Distance from other pedestrians: ◦ is a monotonic decreasing function with equipotential lines α β

 Repulsion from other pedestrians β ◦ is a monotonic decreasing function with equipotential lines ◦ Semi-minor axis:  Dependant on step width: ◦ Applies gradient: α β

 Repulsion from border B ◦ Distance from border: ◦ Point on border closest to α is chosen α B

 Pedestrians may be attracted to a person or an object ◦ Friend, street artist, window displays..  Pedestrian loses interest over time ◦ Attraction decreases with time t

 Repulsive and attractive effects get direction dependent weights:  Repulsive effects:  Attractive effects:

 The resulting function:

 Add fluctuations ◦ Decides on equal decisions  Final touch: limit the pedestrian’s speed by a maximum ◦ Cap the desired speed by a maximum speed

 Large number of pedestrians are used  Pedestrians enter at random positions  Simple setup ◦ No attractive effects or fluctuations are applied  Variables are set ◦ Chosen to match empirical data  Desired speed: 1.34 ms -1 (std: 0.26 ms -1 )  Max speed: 1.3 * desired speed  Relaxation time: 0.5  Decrease for more aggressive walking  Angle of sight: 200°  Walkway width: 10 meters

 Results ◦ Pedestrians heading in the same direction form (dynamically varying) lanes  Periodic boundary conditions prevent newly spawned pedestrians from messing lanes up Size denotes velocity

 Once a pedestrian passes the door, more follow ◦ Increasing pressure from the waiting group causes alternations  Matches observations Size denotes velocity

 Simple model, easy to understand  Describes some realistic behavior ◦ Seems open to complex adaptations

 Repulsive effect doesn’t take the current velocity into account  Doesn’t handle complex paths at all ◦ Blocked paths, taking alternate routes  Combine with path planning (corridor based method)  Situations this simple are too rare? ◦ How would it handle under complex situations?