1. semester: pathfinding in automated warehouses
Pathfinding in Automated Warehouses is a simulation tool
built to test and compare how different pathfinding strategies perform
in a warehouse layout. The system was designed from prioritized requirements
(MoSCoW) and evaluates algorithms through quantitative benchmarking across
three scenarios. It compares classic graph-traversal approaches (BFS and DFS)
against a 'worst-case' random/brute baseline, and reports key performance metrics
to make trade-offs between speed and route quality easy to see.
Features: warehouse layout simulation, BFS/DFS pathfinding, worst-case baseline
algorithm, console-based visualization, configurable test scenarios, performance
statistics/benchmarking and result comparison.