Skip to content

dipinknair/Path_Planning_Djikstra

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

7 Commits
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Path planning using Djikstra algorithm and A*

Description

Mobile robots have seen significant development over the years. Path planning in predictable or static environ- ments have largely been solved, while dynamic environments pose significant practical challenges. This project looks to add a possible development path of a hybrid approach. The agent progressing through the environment will stick to an initial path generated from the global frame by central computation. Then, the path will be recalculated only when an obstacle is close and interfering with the current path. Once past the interfering obstacle, the agent will reconnect with the original path. This hopes to distribute the computation burden between the central computer and agent which will free up some energy on the agent and less central management

Results

Video

Getting Started

Dependencies

  • Matlab 2012 or above

Executing program

Help

Authors

Dipin Nair Bejamin Russ Remi Carteret

Version History

License

This project is licensed under the University of Cincinnati Coursework Decision Engineering

References

About

Real time Path Planning using Djikstra and A* Algorithm

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages