Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/adamouization/ai-search-flight-route-planner
:airplane: Flight route planning agent using classic AI search algorithms (A*, Best-First, DFS, BFS).
https://github.com/adamouization/ai-search-flight-route-planner
a-star a-star-algorithm artificial-intelligence best-first-search breadth-first-search depth-first-search flight-planning route-planner search search-algorithm
Last synced: 4 days ago
JSON representation
:airplane: Flight route planning agent using classic AI search algorithms (A*, Best-First, DFS, BFS).
- Host: GitHub
- URL: https://github.com/adamouization/ai-search-flight-route-planner
- Owner: Adamouization
- License: gpl-3.0
- Created: 2019-09-30T18:47:05.000Z (over 5 years ago)
- Default Branch: master
- Last Pushed: 2020-01-20T16:25:33.000Z (almost 5 years ago)
- Last Synced: 2024-11-09T16:39:18.554Z (2 months ago)
- Topics: a-star, a-star-algorithm, artificial-intelligence, best-first-search, breadth-first-search, depth-first-search, flight-planning, route-planner, search, search-algorithm
- Language: Java
- Homepage:
- Size: 2.2 MB
- Stars: 4
- Watchers: 3
- Forks: 1
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
# AI-Search-Flight-Route-Planner [](http://hits.dwyl.io/Adamouization/AI-Search-Flight-Route-Planner) [](https://github.com/Adamouization/AI-Search-Flight-Route-Planner/blob/master/LICENSE)
Implementation and evaluation of a number of AI search algorithms applied to the task of a flight route planner. Search algorithms include Breadth-First Search, Depth-First Search, Best-First Search and A* Search.
The report, including a summary of features implemented, design & implementation decisions, evaluation and testing, can be read [here](https://github.com/Adamouization/AI-Search-Flight-Route-Planner/blob/master/report/report.pdf).
## Installation
1. Clone the project: `git clone https://github.com/Adamouization/AI-Search-Flight-Route-Planner`
2. Cd into the directory and compile the files:
```
cd AI-Search-Flight-Route-Planner
javac src/A1Main.java
```
## Usage
`java A1Main []`
where:
* `search_type` is the type of search algorithm to use to find a solution e.g. DFS, BFS, AStar, BestF.
* `world_size` is the size of the world *N* (number of parallels).
* `start_goal` is the starting point of the agent.
* `end_goal` is the goal point that the agent must reach.
* `obstacles` is a number of points that the search algorithms cannot take when looking for a route.
Examples:
* BFS: `java A1Main BFS 5 2,45 3,225`
* DFS: `java A1Main DFS 8 1,315 5,270`
* BestF with 1 obstacle: `java A1Main BestF 4 1,45 3,225 1,90`
* A* with 2 obstacles: `java A1Main AStar 4 1,45 3,225 1,90 1,0`
* No route: `java A1Main BFS 4 1,45 3,225 1,90 1,0 2,45`
## Javadocs
1. Generate the Javadocs: `javadoc -d javadoc src/*.java`
2. Open `javadoc/index.html` in your web browser.
## Contact
* email: [email protected]
* LinkedIn: [www.linkedin.com/in/adamjaamour](https://www.linkedin.com/in/adamjaamour/)
* website: www.adam.jaamour.com
* twitter: [@Adamouization](https://twitter.com/Adamouization)