Robotaxi Zoox is a Python AI project that puts five classical search algorithms head-to-head inside an animated city simulation. A robotaxi must collect every passenger scattered across a grid map and then drive to a shared destination — the search algorithm you choose determines how it finds that route.Documentation Index
Fetch the complete documentation index at: https://mintlify.com/Juan-Carlos-Cruz/robotaxi-zoox/llms.txt
Use this file to discover all available pages before exploring further.
Quick Start
Run the simulation in one command and explore all five algorithms
Installation
Set up Python, pygame, and platform-specific launchers
Search Algorithms
Understand BFS, DFS, UCS, Greedy, and A* side by side
API Reference
Explore the Grid, Node, and search function signatures
What Robotaxi Zoox does
The simulation models a classic multi-goal search problem from AI: visit every pickup location before arriving at a fixed endpoint, while minimising cost over a weighted grid.5 Algorithms
BFS, DFS, UCS, Greedy Best-First, and A* — select any at runtime
Animated Visualiser
Watch the taxi move step by step with city tile graphics in Pygame
Metrics Report
Nodes expanded, path length, cost, depth, and search time per run
How it works
Choose a map
Select a
.txt grid file from mapas/test/. Each cell encodes terrain type — free road, wall, passenger, high-traffic zone, or destination.Pick an algorithm
Click No informada (BFS, UCS, DFS) or Informada (Greedy, A*) in the side panel, then select the specific algorithm.
Watch the search
The taxi animates its route, honking at passengers and slowing through traffic. Audio effects play for each event.
Project structure
Robotaxi Zoox requires a graphical environment to run the full GUI. To validate search logic without a display, use
make test — it runs all algorithm tests headlessly.