Skip to content

Customized A* search algorithm for bike routing in ASU campus

License

Notifications You must be signed in to change notification settings

AjinxPatil/asu-bikerouting-algorithm

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

8 Commits
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Dynamic Pathfinding for Bike Routes in ASU Campus

This project presents a customized A* search algorithm suited for finding best bike routes in Arizona State University Campus. The algorithm can always be tweaked and extrapolated to any other area. The project considers ASU campus specifically to increase the accuracy of the algorithm by considering some characteristics of the campus.

This algorithm considers crowd density at different places in campus to determine the quickest routes between two points. The best route is defined by the time it take to reach destination. The crowd density factor is computed from the semester class schedules of the schools in campus. In simple words, a particular area is preferred less by the algorithm if it has classes scheduled at that particular time. The crowd density is more when students are rushing in or coming out of classes. Other factors that algorithm takes into account are time-specific walk-only zones, bike lanes and walkways.

Authors

  1. Ajinkya Patil
  2. Saurabh Kardile
  3. Ajay Kulkarni

From School of Computing, Informatics, and Decision Systems Engineering, Arizona State University, Tempe, AZ 85281

Date: December 2, 2016

About

Customized A* search algorithm for bike routing in ASU campus

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages