Route Planner C++

Rami Awar · February 14, 2020

What is it?

This is an implementation of the route planner project in Udacity’s C++ Nanodegree. Using IO2D (C++ graphics library) and OSM (OpenStreetMap) data and pugixml, A* search is implemented on abstracted classes out of the OSM data. Below are the results on some maps.

Path planning on map of Beirut, Lebanon. Path planning on map of Beirut, Lebanon.

Challenges

  • Parsing OpenStreetMap xml data into C++ classes
  • Creating traversable nodes out of OpenStreetMap data
  • Implementing A* search algorithm on parsed data

Solutions

  • Using pugixml to parse XML file into several classes. Only a subset of the OSM data was read, as that is what interests us for path finding.
  • Used IO2D to render the OSM data in C++
  • Implemented A* search algorithm using C++ and integrated it with OSM data

Twitter, Facebook