🚕 Implementation of a smart taxi navigation system using A* Algorithm.

Given the position of a client and some taxis, the scope of this project is to find the closest taxi to the client and the best route that corresponds to this taxi.

Table of contents:

• TN2018-T1.pdf: Description of the problem in Greek.

• client.csv: This file contains the coordinates of the location of each client in the following form:

X, Y
23.733912, 37.975687
where X is the longitude and Y is the latitude.

• taxis.csv: This file contains the coordinates of the location and the ids of all taxis that are available in the following form:

  X, Y, id
  23.741587, 37.984125, 100
  where X is the longitude, Y is the latitude and id the id of the taxi.

• nodes.csv: This file contains the coordinates of some parts of the streets. Each street is identified by an id and, therefore, parts with the same id exist in the same street.

• myclient.csv, mytaxis.csv: Different coordinates for the client and the taxis. You can test it with your own too.

• uml.png: A class diagram of the Java project.

• routes.kml , myroutes.kml: The best route for each taxi in kml form.

• best-route.kml: The best route to the closest taxi (given the initital coordinates).