import React from 'react'; import { BookOpen, Users, Code, FileText, GraduationCap, Calendar } from 'lucide-react'; export const GroupInfo: React.FC = () => { return (
Artificial Intelligence Project
{author.name}
{author.role}
This project presents an interactive visualization tool for comparing search algorithms in the context of package delivery optimization. We implement and analyze six fundamental search strategies: Breadth-First Search (BFS), Depth-First Search (DFS), Iterative Deepening Search (IDS), Uniform Cost Search (UCS), Greedy Best-First Search, and A* Search. The system models a grid-based city environment with varying traffic conditions, blocked roads, and tunnel shortcuts, providing a comprehensive testbed for evaluating algorithm performance in terms of path optimality, computational efficiency, and memory utilization.
Backend
Python 3.11 + FastAPI
Frontend
React 19 + TypeScript + Vite
State Management
Zustand
Visualization
SVG + ShadCN
Styling
Tailwind CSS v4
Communication
REST API
| Algorithm | Type | Optimal | Complete |
|---|---|---|---|
| {algo.name} ({algo.code}) | {algo.type} | {algo.optimal} | {algo.complete} |
* When step costs are uniform
Manhattan Distance
h(n) = |xn - xg| + |yn - yg|
Euclidean Distance
h(n) = sqrt((xn - xg)2 + (yn - yg)2)
Tunnel-Aware Heuristic
Considers available tunnel shortcuts to improve estimate accuracy