svpino/cs7641-assignment4

CS7641 - Machine Learning - Assignment 4 - Markov Decision Processes

41
/ 100
Emerging

This project helps machine learning students explore and analyze how different Markov Decision Process (MDP) algorithms learn optimal behavior in grid-world scenarios. Students input grid maps with start points, goals, walls, and hazards, along with custom reward values for these elements. The output includes performance metrics like average reward, number of steps, and time taken, which can be used to generate charts for assignment reports. It's designed for students taking a Machine Learning course, specifically those studying MDPs.

No commits in the last 6 months.

Use this if you need to run experiments and analyze the performance of Value Iteration, Policy Iteration, and Q-Learning algorithms on grid-based problems for a Machine Learning assignment.

Not ideal if you are looking for a general-purpose reinforcement learning library or a tool for real-world, complex decision-making problems beyond educational grid-world simulations.

machine-learning-education reinforcement-learning-experiments markov-decision-processes algorithm-analysis grid-world-simulations
Stale 6m No Package No Dependents
Maintenance 2 / 25
Adoption 5 / 25
Maturity 16 / 25
Community 18 / 25

How are scores calculated?

Stars

14

Forks

13

Language

Java

License

MIT

Last pushed

Sep 22, 2025

Commits (30d)

0

Get this data via API

curl "https://pt-edge.onrender.com/api/v1/quality/ml-frameworks/svpino/cs7641-assignment4"

Open to everyone — 100 requests/day, no key needed. Get a free key for 1,000/day.