Your browser (Internet Explorer 8 or lower) is out of date. It has known security flaws and may not display all features of this and other websites. Learn how to update your browser.

X

# ABM

#### Clone of Accident warning through VANET

If an accident occurs at a place, the master car informs the OBUs of neighbouring cars in group about the accident and they change direction . Some of the cars depending upon their position become master car in other groups and the process of warning is propagated to car population in radius of the accident.
• 7 years 7 months ago

#### Clone of The Game of Life

An implementation of the classic Game of Life using agent based modeling.

Rules:
• A live cell with less than two alive neighbors dies.
• A live cell with more than three alive neighbors dies.
• A dead cell with three neighbors becomes alive.
• 4 years 6 months ago

#### Clone of Estacionamento

This model is a classic instance of an Erlang Queuing Process.
We have the entities:- A population of cars which start off in a "crusing" state;- At each cycle, according to a Poisson distribution defined by "Arrival Rate" (which can be a constant, a function of time, or a Converter to simulate peak hours), some cars transition to a "looking" for an empty space state.- If a empty space is available (Parking Capacity  > Count(FindState([cars population],[parked]))) then the State transitions to "Parked."-The Cars stay "parked" according to a Normal distribution with Mean = Duration and SD = Duration / 4- If the Car is in the state "Looking" for a period longer than "Willingness to Wait" then the state timeouts and transitions to impatient and immediately transitions to "Crusing" again.
The model is set to run for 24 hours and all times are given in hours (or fraction thereof)
WIP:- Calculate the average waiting time;- Calculate the servicing level, i.e., 1- (# of cars impatient)/(#cars looking)
A big THANK YOU to Scott Fortmann-Roe for helping setup the model's framework.
• 5 years 10 months ago

#### Clone of Clone of Parking Lot Problem (WIP)

This model is a classic instance of an Erlang Queuing Process.
We have the entities:- A population of cars which start off in a "crusing" state;- At each cycle, according to a Poisson distribution defined by "Arrival Rate" (which can be a constant, a function of time, or a Converter to simulate peak hours), some cars transition to a "looking" for an empty space state.- If a empty space is available (Parking Capacity  > Count(FindState([cars population],[parked]))) then the State transitions to "Parked."-The Cars stay "parked" according to a Normal distribution with Mean = Duration and SD = Duration / 4- If the Car is in the state "Looking" for a period longer than "Willingness to Wait" then the state timeouts and transitions to impatient and immediately transitions to "Crusing" again.
The model is set to run for 24 hours and all times are given in hours (or fraction thereof)
WIP:- Calculate the average waiting time;- Calculate the servicing level, i.e., 1- (# of cars impatient)/(#cars looking)
A big THANK YOU to Scott Fortmann-Roe for helping setup the model's framework.
• 6 years 3 months ago

#### Clone of The Game of Life

An implementation of the classic Game of Life using agent based modeling.

Rules:
• A live cell with less than two alive neighbors dies.
• A live cell with more than three alive neighbors dies.
• A dead cell with three neighbors becomes alive.
• 1 year 7 months ago

#### Clone of The Game of Life

An implementation of the classic Game of Life using agent based modeling.

Rules:
• A live cell with less than two alive neighbors dies.
• A live cell with more than three alive neighbors dies.
• A dead cell with three neighbors becomes alive.
• 5 years 2 months ago