Thomas Jefferson High School for Science and Technology Hallway Traffic Simulation By: Paul Woods.

Slides:



Advertisements
Similar presentations
Ongoing Computer Science Curriculum Development Shane Torbert Thomas Jefferson High School for Science and Technology Fairfax County, Virginia.
Advertisements

Sensitivity Analysis A systematic way of asking “what-if” scenario questions in order to understand what outcomes could possibly occur that would effect.
Jaringan Komputer Lanjut Packet Switching Network.
Systems Analysis, Prototyping and Iteration Systems Analysis.
Hallway Traffic Simulator Peter Riggs Computer Systems Lab
The Essentials of 2-Level Design of Experiments Part I: The Essentials of Full Factorial Designs The Essentials of 2-Level Design of Experiments Part I:
Chapter 2- Visual Basic Schneider1 Chapter 2 Problem Solving.
Case Tools Trisha Cummings. Our Definition of CASE  CASE is the use of computer-based support in the software development process.  A CASE tool is a.
Latency-sensitive hashing for collaborative Web caching Presented by: Xin Qi Yong Yang 09/04/2002.
1 Sensor Relocation in Mobile Sensor Networks Guiling Wang, Guohong Cao, Tom La Porta, and Wensheng Zhang Department of Computer Science & Engineering.
EE631 Cooperating Autonomous Mobile Robots Lecture 5: Collision Avoidance in Dynamic Environments Prof. Yi Guo ECE Dept.
4/25/2006 ELEC7250: Hill 1 Brad Hill ELEC 7250 Logic Simulator.
Chapter 2 The Algorithmic Foundations of Computer Science
Real-time Crowd Movement On Large Scale Terrains Speaker: Alvin Date:4/26/2004From:TPCG03.
Interactive Layout Design Optimization Author: Jeremy J. Michalek Presented by: Hoda Homayouni.
NFA- to NFA conversion. Purpose This presentation presents an example execution of the algorithm which takes as input an NFA with -transitions and produces.
Introducing Hashing Chapter 21 Copyright ©2012 by Pearson Education, Inc. All rights reserved.
Chapter 2- Visual Basic Schneider1 Chapter 2 Problem Solving.
Data Structures and Programming.  John Edgar2.
Optimizing the Placement of Chemical and Biological Agent Sensors Daniel L. Schafer Thomas Jefferson High School for Science and Technology Defense Threat.
CS 0004 –Lecture 8 Jan 24, 2011 Roxana Gheorghiu.
Profile and a quick introduction Software Engineering: ) هندسة البرمجيات (in Arabic: is the branch of computer science Designed to develop a set rules.
Managing the development and purchase of information systems (Part 1)
Chapter 3: Completing the Problem- Solving Process and Getting Started with C++ Introduction to Programming with C++ Fourth Edition.
Thomas Jefferson High School for Science and Technology Hallway Traffic Simulation By: Paul Woods.
Final Year Project Interim Presentation Software Visualisation and Comparison Tool Presented By : Shane Lillis, , 4th Year Computer Engineering.
Group 4May Final Design Presentation DUNA* (Dynamic Urban Navigation using A*) Name of Team: A*
Department of Electrical Engineering, Southern Taiwan University Robotic Interaction Learning Lab 1 The optimization of the application of fuzzy ant colony.
1 Introduction to Computer Graphics with WebGL Ed Angel Professor Emeritus of Computer Science Founding Director, Arts, Research, Technology and Science.
Traffic Based Pathway Optimization Michael LeGore TJHSST CSL.
CS Data Structures I Chapter 2 Principles of Programming & Software Engineering.
Adrian Treuille, Seth Cooper, Zoran Popović 2006 Walter Kerrebijn
Using Information Technology to Reduce Traffic Jam in a Highly Traffic Congested City Sayed Ahmed and Rasit Eskicioglu We propose a cost effective and.
Data Structures and Algorithms Hashing First Year M. B. Fayek CUFE 2010.
Hashing is a method to store data in an array so that sorting, searching, inserting and deleting data is fast. For this every record needs unique key.
Chapter 1 Introduction Major Data Structures in Compiler
Hash Table March COP 3502, UCF 1. Outline Hash Table: – Motivation – Direct Access Table – Hash Table Solutions for Collision Problem: – Open.
Types of Algorithms. 2 Algorithm classification Algorithms that use a similar problem-solving approach can be grouped together We’ll talk about a classification.
Greg Kelly, Hanford High School, Richland, Washington.
Click to add text Systems Analysis, Prototyping and Iteration.
The Essentials of 2-Level Design of Experiments Part I: The Essentials of Full Factorial Designs The Essentials of 2-Level Design of Experiments Part I:
A Logarithmic Randomly Accessible Data Structure Tom Morgan TJHSST Computer Systems Lab
Invitation to Computer Science 5 th Edition Chapter 2 The Algorithmic Foundations of Computer Science.
1 Introduction to Computer Graphics with WebGL Ed Angel Professor Emeritus of Computer Science Founding Director, Arts, Research, Technology and Science.
Simulating Traffic Congestion on Route 1 Jimmy O'Hara Computer Systems Lab
Dynamic Programming & Memoization. When to use? Problem has a recursive formulation Solutions are “ordered” –Earlier vs. later recursions.
Chapter 2- Visual Basic Schneider1 Chapter 2 Problem Solving.
Traffic Dynamics in Scholastic Environments Alex Katkova.
Lecture1 Instructor: Amal Hussain ALshardy. Introduce students to the basics of writing software programs including variables, types, arrays, control.
Lab 6 Problem 1: DNA. DNA Given a string with length N, determine the number of occurrences of some given substrings (with length K) in that string. For.
CS Class 04 Topics  Selection statement – IF  Expressions  More practice writing simple C++ programs Announcements  Read pages for next.
Computer Systems Lab TJHSST Current Projects In-House, pt 2.
Chapter 2- Visual Basic Schneider1 Chapter 2 Problem Solving.
CIS-NG CASREP Information System Next Generation Shawn Baugh Amy Ramirez Amy Lee Alex Sanin Sam Avanessians.
Distributed Control and Autonomous Systems Lab. Sang-Hyuk Yun and Hyo-Sung Ahn Distributed Control and Autonomous Systems Laboratory (DCASL ) Department.
 Problem Analysis  Coding  Debugging  Testing.
The training simulator Final Conference, Athens, Greece 16 September 2011.
CSC 212 – Data Structures Lecture 28: More Hash and Dictionaries.
Introduction to PowerPoint
Rigid Body Dynamics Simulation
Requirements: Use Case Models and Narratives
EE631 Cooperating Autonomous Mobile Robots Lecture: Collision Avoidance in Dynamic Environments Prof. Yi Guo ECE Dept.
Introduction to PowerPoint
Use of Mathematics using Technology (Maltlab)
Physics-based simulation for visual computing applications
Abstract During rush hours traffic on Route 1 is at an almost standstill, the road is not capable of holding the amount of traffic that travels on it during.
The Essentials of 2-Level Design of Experiments Part I: The Essentials of Full Factorial Designs Developed by Don Edwards, John Grego and James Lynch.
The Essentials of 2-Level Design of Experiments Part I: The Essentials of Full Factorial Designs Developed by Don Edwards, John Grego and James Lynch.
TJHSST Hallway Simulation Paul Woods Pd
TJHSST Systems Lab Rigid Body Dynamics Simulation
Presentation transcript:

Thomas Jefferson High School for Science and Technology Hallway Traffic Simulation By: Paul Woods

Create an accurate simulation of TJHSST hallways and traffic Visualize the simulation to increase accessibility and reach Analyze results of the simulation and modify conditions to ease congestion and improve movement PURPOSE

AREA TO BE MAPPED

Continuum Crowds by Adrian Trueille, Seth Cooper, Zoran Popovic—University of Washington, Electronic Arts Calculated movement and collision at the same time Saved significant processing time Finding Multi-Constrained Feasible Paths By Using Depth-First Search by Zhenjiang L and J.J. Garcia- Luna-Aceves Provides a model algorithm for finding paths from one place to another BACKROUND RESEARCH

Continuum Performance OpenGL: Platform Independence Techniques by Tom True, Brad Grantham, Bob Kuehne, and Dave Shreiner. Errors and performance Interactive Graphics Using OpenGL and the Graphix Windowing Toolkit by Rance D. Necaise, Computer Science Department Washington and Lee University – Graphix Windowing Toolkit BACKROUND RESEARCH

Traffic Dynamics in Scholastic Environments by Alex Kotkova SIMILAR PAST RESEARCH

Accurate data involving hallway movement A working model allowing possible changes to be simulated EXPECTED RESULTS

Made using C programming language Simulates small model of school and shrunken student body Organizes data in arrays and hashes Effectively returns necessary and expected output Will be expanded later to include entire school and student body CURRENT MODELS

Organizational structures such as hashes to hold hall, room and student data An improved moving search to determine student paths of movement TOOLS IN CURRENT MODEL

MODEL SCHOOL MAP

Example Output From The Program: StudentNameStart10:0810:11Finish Student0Area3Area5Area2Area2 Student1Area1Area4Area5Area3 Student2Area1Area4Area5Area3 Student3Area2Area5Area4Area0 Student4Area1Area4Area5Area2 Student5Area3Area5Area2Area2...

Students: jon sally hill karel jim greg megan joe sarah ROOMS: RoomNumber:RoomNameHall0Hall1Hall2Hall3Hall r r r HALLS: HallNumber:Room0Room1Room2Room3Room4Room5Room SCHEDULES: StudentNumNameEvent0Event1Event2Event jon sally hill karel jim greg megan joe sarah 0333 HallNumhall0hall1hall2hall3 Hall0:0000 Hall1:2400 Hall2:1300 Hall3:2000 Hall4:1000 Time-Events Array EventTime

10:0810:11 460%10% 540%60% Hall Traffic as a Percentage of Students Using Hallway RESULTS TABLE Time

POSSIBILITIES AS TO WHY THIS OCCURED IN THIS EXPERIMENT More students going from rooms 0-1 to 2-3 than from 2-3 to 0-1 Class sizes of classes in rooms 2-3 bigger than in rooms 1-0 Students entering rooms 0-1 were closer and thus able to get to their classes more quickly Students do not take into account traffic when determining movement

POSSIBLE SOLUTIONS Switch classes in rooms 1 and 2 to see how that affects traffic. Program students avoid congested areas

FUTURE GOALS Finalize second phase algorithm Expand original model to include entire school and student body Take into account congestion when determining student movement Add visualization using OpenGL