This is a project template from UC Berkeley, for a simple search agent. This specific implementation sets a scenario, where the agent is an autonomous vacuum cleaner, trying to reach dirt spilled in different parts of a randomly generated room in the most efficient way possible. The project utilizes various search algorithms including, but not limited to; Greedy Best First Search, Uniform Cost Search, and A* Search utilizing both path cost and a Manhattan heuristic. The project displays both the search path and tiles visited for the vacuum to reach the different piles of dirt through a tkinter UI.
-
Randomized Rooms: To be filled
-
Path and Node Display: To be filled
Follow these steps to set up and run the Vacuum Cleaning Simulator:
-
Download or clone the repository to your local machine:
git clone https://github.com/Daksh2060/vacuum-cleaning-simulator
Feel free to reach out if you have any questions, suggestions, or feedback:
- Email: [email protected]
- LinkedIn: @Daksh Patel