Projects done in the Artificial Intelligence Course during Masters at USC
- Description: Placing Police Officers to the Blocks having some value(most number of crime activities in that block) such that you address max points such that no 2 officers are on same row & column & diagonal(similar to n queens)
- Rest of the description can be found under description.pdf under Placing Police Officers folder.
- activity_score.py: Used dfs search technique with recursion similar to nqueens problem and comparing all the nqueen solutions and giving the maximum score. Pruned search space as when queens are equal to number of blocks.
- Description: Two communities LAHSA(Homeless community), SPLA(Parking LA community) providing bed spaces as well parking spaces for homeless people and optimizing the spaces based on constraints and giving each other alternate turns to choose the best candidate(game playing algorithm)
- Rest of the description can be found under description.pdf under Serving Homeless community folder.
- game_playing_algo.py: Implemented alternate turn game playing algo which optimizes the best candidate to choose so that bed spaces and parking lots are filled optimally.
- Sample inputs and their corresponding outputs are given.
- Description: Navigate the autonomous car without getting hit on obstacles and earning maximum money. Each block has a positive value which is basically money and obstacles have losses too. Objective is to drive car along the matrix to get maximum money.
- Rest of the description can be found under description.pdf under Navigating Autonomous Car folder.
- max_reward.py: Used Policy Iteration as well as Value Iteration to get the best policy and based on that policy simulated the car to move with probabilites of going either in direction according to policy or other directions.
- Sample input and output are given.