Given a starting position, ending position and number of obstacles, the program computes an optimal path using Markov Decision Processes
Clone the project
git clone https://github.com/vinaykakkad/robot-motion-planning.git
Creatre a virtual environment and activate
python -m venv env
env\Scripts\activae
Install dependencies
pip install -r requirements.txt
Run the script
python interface.py
-
Computes optimal path
-
Results like:
- Original environment map
- Visualizations for :
- optimal paths
- optimal policy
- reward function
- time taken
- Data of:
- original environment
- value iteration
- policy iteration
Python, tkinter, matplotlib, numpy
Thanks goes to these wonderful people (emoji key):
Vinay Kakkad π» |
Jap Purohit π» |
varun1352 π» |
PoojanSheth29 π» |
Shail-1231 π» |
sahilmiskeen95 π» |
rng4302 π» |
This project follows the all-contributors specification. Contributions of any kind welcome!