Skip to main content

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.

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.

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

1

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.
2

Pick an algorithm

Click No informada (BFS, UCS, DFS) or Informada (Greedy, A*) in the side panel, then select the specific algorithm.
3

Watch the search

The taxi animates its route, honking at passengers and slowing through traffic. Audio effects play for each event.
4

Review the results

A modal displays nodes expanded, path steps, total cost, and the exact search time in milliseconds — separate from animation time.

Project structure

robotaxi-zoox/
├── main.py                    # Entry point
├── algoritmosBusqueda/
│   ├── informada/wrapper.py   # Greedy & A* implementation
│   └── noinformada/wrapper.py # BFS, DFS, UCS implementation
├── mundo/
│   ├── models/grid.py         # Grid world model
│   ├── models/node.py         # Search state node
│   └── io/map_loader.py       # Map file loader
├── application/
│   ├── runner.py              # RobotaxiApp main class
│   ├── ejecucion.py           # Algorithm dispatcher
│   ├── audio.py               # AudioManager
│   ├── carga.py               # File selection & grid loading
│   └── config.py              # UI and algorithm constants
├── ui/
│   └── visualizador.py        # Pygame map renderer
├── mapas/test/                # 8 built-in test maps
├── audio/                     # WAV sound assets
└── launchers/                 # Windows .bat & macOS .command wrappers
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.

Build docs developers (and LLMs) love