https://github.com/alipc598/pathfinding
A* in comparison with weaker alternative(Branch and bound) algorithms
https://github.com/alipc598/pathfinding
astar-algorithm branch-and-bound pathfinding-algorithm python
Last synced: 26 days ago
JSON representation
A* in comparison with weaker alternative(Branch and bound) algorithms
- Host: GitHub
- URL: https://github.com/alipc598/pathfinding
- Owner: Alipc598
- License: mit
- Created: 2024-01-17T19:09:07.000Z (over 2 years ago)
- Default Branch: main
- Last Pushed: 2024-01-18T01:37:33.000Z (over 2 years ago)
- Last Synced: 2025-06-10T23:44:44.916Z (11 months ago)
- Topics: astar-algorithm, branch-and-bound, pathfinding-algorithm, python
- Language: Jupyter Notebook
- Homepage:
- Size: 232 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE.txt
Awesome Lists containing this project
README
# Pathfinding Algorithms Comparison
## Overview
This project provides a detailed comparison between two well-known pathfinding algorithms: A* and Branch and Bound. The comparison is based on various metrics such as nodes explored, execution time, and path efficiency across different scenarios.
## Features
- Implementation of the A* algorithm with heuristic function
- Implementation of the Branch and Bound algorithm
- Comparative analysis based on node exploration and execution time
- Visualizations of the algorithms' paths on grid-based maps
## Interactive Notebooks
The repository contains Jupyter notebooks that can be interactively explored to understand the behavior and performance of the algorithms. The notebooks include:
- `pathfinding_algorithm_comparison.ipynb`: A detailed comparison of the algorithms with visualizations and analysis.
## Usage
To interact with the notebooks, you can use services like [Binder](https://mybinder.org/) to launch a live environment or view them statically via [nbviewer](https://nbviewer.jupyter.org/).
## Results
The findings indicate that the A* algorithm generally outperforms the Branch and Bound in terms of efficiency and execution time, especially as the complexity of the pathfinding scenario increases.
## Visualization
The visualizations within the notebooks provide an intuitive understanding of the algorithms' search patterns and paths discovered.
## Contributing
Contributions to the project are welcome. Please fork the repository and submit a pull request with your suggested changes.
## License
This project is open-sourced under the MIT License. See the LICENSE file for more information.
## Contact
For any queries or further discussion related to this project, please open an issue on this repository.
## Acknowledgments
- The A* and Branch and Bound algorithms are well-documented in the field of computer science, and their comparative analysis provides valuable insights into pathfinding in various applications.
- Thanks to the community contributors and to all the researchers whose work has laid the foundation for these algorithms.
## Reference
This project is based on the comprehensive insights and methodologies presented in the paper "A Systematic Literature Review of A Pathfinding." This paper forms the foundation upon which the comparative analysis of the A* and Branch and Bound algorithms is built.