ductaingn / best-route

Path finding Web Application

Best-route

A web-app for finding the shortest route between two location in Liễu Giai Ward, Ba Đình District, Hà Nội, Việt Nam.

About the project

This work is a team project offered in course IT3160-Introduction to Artificial Intelligence of Hanoi University of Science and Technology. We used A* algorithm for finding the shortest route between two random location that user chose in Liễu Giai Ward, Ba Đình District, Hà Nội, Việt Nam.

Built with

• 
• 
• 

Getting Started

Prerequisites

• Install NodeJS
• Install NPM

npm install npm@latest -g

• Install Flask

Installation

1. Clone the repository
2. Install NPM packages

$ cd front_end
$ npm ci

3. Create a Virtual environment

$ cd back_end
$ python3 -m venv .venv

4. Install python libraries in Virtual environment

$ cd back_end
$ . .venv/bin/activate
$ pip install numpy
$ pip install pandas
$ pip install scikit-learn
$ pip install haversine

Usage

1. Activate the Virtual environment

$ cd back_end
$ . .venv/bin/activate
$ python3 server.py

2. Run the React scripts

$ cd front_end
$ npm start

3. Choose start and destination location
4. Hit FIND THE WAY button to request finding way
5. Result may be shown as follow

Contributing

Contributions are what make the open source community such an amazing place to learn, inspire, and create. Any contributions you make are greatly appreciated.

If you have a suggestion that would make this better, please fork the repo and create a pull request. You can also simply open an issue with the tag "enhancement". Don't forget to give the project a star! Thanks again!

1. Fork the Project
2. Create your Feature Branch (git checkout -b feature/AmazingFeature)
3. Commit your Changes (git commit -m 'Add some AmazingFeature')
4. Push to the Branch (git push origin feature/AmazingFeature)
5. Open a Pull Request

License

Distributed under the MIT License. See LICENSE.txt for more information.

Contact

Nguyen Duc Tai - [email protected]

Project Link: https://github.com/ductaingn/Best-route/

Acknowledgement

Materials: https://vi.wikipedia.org/wiki/Gi%E1%BA%A3i_thu%E1%BA%ADt_t%C3%ACm_ki%E1%BA%BFm_A*

https://www.youtube.com/watch?v=A60q6dcoCjw&t=776s

best-route's Issues

No route to display

Show traveled point

Given an array osmids of nodes, display these nodes on the map.

Display walk way

Display the walk way from markers points to their nearest nodes in the color different from the route color

The position of the markers can be extracted from {route} list (i.e route[0], route[route.length-1])
The position of the neareast node to the markers can also be extracted from {route} list (i.e route[1], route[route.length-2])

File: front_end/Features/Map/MapComponent.jsx

Show map

Show interactive map in which user can chose points by mouse click then mark the points with pin point icons.
Return an array of selected points' coordinates.

Fix find_nearest_node function in nearest_point.py

Wrong Output!

Test case: point = [21.0347047,105.8143796]
Output: 317129402
Expected output: 98042452

Setup Flask sever modules

Setup and push necessary modules of Flask to a new branch: backend/Set-up-sever

Generate tests and test cases

Generate tests and test cases to test the accuracy of a_star.py.

---

Generate 5 test cases by hand in this form:

Input: start_point_coordinates, end_point_coordinate

Output: path={start_node_id, node_1_id,..., node_k_id, end_node_id}
Correct Output: path={start_node_id, node_1_id,..., node_k_id, end_node_id}

Generate 1000 random test cases, compare a_star.py result path with other programs on the internet. Show:

Accuracy:= (Number of same result)/1000

Wrong cases: If accuracy < 1, show cases that their results differ in 2 program:

case's input: start_point_coordinates, end_point_coordinate
case's output of a_star.py: path={start_node_id, node_1_id,..., node_k_id, end_node_id}
case's output of the other program: path={start_node_id, node_1_id,..., node_k_id, end_node_id}