A route planner using the A* algorithm (uses Open Street Map data)
-
Updated
Aug 18, 2019 - C++
A route planner using the A* algorithm (uses Open Street Map data)
cpp17 implementation of A* Search Algorithm for finding the shortest path between two nodes on OpenStreetMap data
A route planner built in C++ that uses OpenStreetMap data, A* search and the IO2D visualization library to find a path between two points on a real-world map.
Makes use of the C++ IO2D library to render a 2D model of a map showing the shortest path between two nodes determined using the A-Star path finding algorithm
Implementation of A* algorithm : Udacity C++ Nanodegree Course project
Simple app for Autonomous Systems (Cars/Robots) Route/Path Planning.
This is the repo for Route Planning project in which we find a route planner that plots a path between two points on a map using real map data from the OpenStreeMap project using 2D graphics library IO2D and A* Search Algorithm.
Using real map data and A* search to find a path between two points - implemented using C++17
Udacity C++ Nanodegree Program- Build an OpenStreetMap Route Planner
A* plans a path using OpenStreetMap data and display it using IO2D library.
To associate your repository with the io2d topic, visit your repo's landing page and select "manage topics."