https://github.com/kosa12/pathfinder-3d

This problem entails finding the shortest path on a 3D terrain grid from a start to a goal point, navigating around obstacles using the A* search algorithm, and visualizing the optimal path in both heatmap and 3D plot formats.
https://github.com/kosa12/pathfinder-3d

Last synced: 9 days ago
JSON representation

This problem entails finding the shortest path on a 3D terrain grid from a start to a goal point, navigating around obstacles using the A* search algorithm, and visualizing the optimal path in both heatmap and 3D plot formats.

• Host: GitHub
• URL: https://github.com/kosa12/pathfinder-3d
• Owner: kosa12
• License: mit
• Created: 2024-03-05T12:23:06.000Z (11 months ago)
• Default Branch: main
• Last Pushed: 2024-03-07T15:10:40.000Z (11 months ago)
• Last Synced: 2024-03-08T13:46:48.320Z (11 months ago)
• Language: Python
• Homepage:
• Size: 2.57 MB
• Stars: 0
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • Contributing: CONTRIBUTING.md
  • License: LICENSE

Awesome Lists containing this project

README

        

# 3D Pathfinding with Obstacles

This repository contains code for solving the problem of finding the shortest path on a 3D terrain grid while navigating around obstacles. The solution utilizes the A* search algorithm and provides visualizations of the optimal path in both heatmap and 3D plot formats.

# Problem Description

The problem involves navigating from a start point to a goal point on a 3D terrain grid. Each point on the grid represents a location with a specific height, and certain points are designated as obstacles. The objective is to find the shortest path from the start to the goal point while avoiding these obstacles.

# Solution Overview

The solution employs the A* search algorithm, a popular pathfinding algorithm known for its efficiency and accuracy in finding the shortest path in a graph. A heuristic function is used to guide the search towards the goal while considering the terrain's topology and the presence of obstacles.

# The following dependencies are required to run the code:

- matplotlib==3.4.3

- numpy==1.21.2

# Getting Started

To run the pathfinding algorithm and visualize the results:

1. Clone this repository to your local machine.

2. Ensure you have Python installed.

3. Install the required dependencies by running `pip install -r requirements.txt`.

4. Run the `pathfinder.py` script using Python.

# Screenshots

![App Screenshot](https://github.com/kosa12/Pathfinder-3D/blob/main/screenshots/100x100png)

## License

This project is licensed under the [MIT License](LICENSE).