1 / 9

Traffic Dynamics in Scholastic Environments

Traffic Dynamics in Scholastic Environments. Alex Katkova. Abstract. The purpose of this project is to model TJ students in their native environment throughout a typical school day.

janae
Download Presentation

Traffic Dynamics in Scholastic Environments

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Traffic Dynamics in Scholastic Environments Alex Katkova

  2. Abstract • The purpose of this project is to model TJ students in their native environment throughout a typical school day. • The goal is to have dots to represent the students moving on the basis of probability to various parts of the building. • Students and teachers alike would be interested to see how clumps of students travel around the school. They would be able to see which areas need to be avoided and construct quickest routes.

  3. Background • The idea behind modeling is to create computational devices and them simulate them to model real phenomena. • Sugarscape – a simulation of agents moving around piles of sugar • Traffic jam simulation – made discoveries about human behavior • A goal is to make similar discoveries about student traffic

  4. Usefulness • Entertainment value for students and teachers • Allows planning of routes for those interested • May show that TJ needs a new building to accommodate all the students • Shows the feasibility of current fire drills at TJ • Will allow users to experiment with different class and break lengths – which could illustrate some scheduling problems.

  5. Algorithms • The main algorithm involved is the breadth-first search • General process for a step (not related to the bfs): • 1) Check whether you're supposed to be on break or in class • 2) Check if you need to switch floors – if you do, head for the nearest staircase, if you don't then head for your class. • 3) Go to the position that will get you nearer to your destination

  6. Fire Drill • The user may start a fire drill by pressing a button. • The students head to their specified locations for a drill • Can demonstrate the current efficiency of the fire drill procedure

  7. Expected Results • Several windows that represent floors • Rooms and walls clearly displayed • Correct movement of students • Fire drill • Ability to control environment variables • Indication of dot class

  8. Development • First Quarter: Display both floors • Have students move in random fashion • Second Quarter: Read in schedules • Have students follow schedules • Third Quarter: Refine student movement • Add fire drill • Fourth Quarter: Allow user to manipulate variables, add lunch

More Related