C++ Project
Path planning with charging
Click the map below to connect two cities
Context
This GitHub repository contains a path planner I developed for the small electric plane described in this problem statement. I undertook this project to publicly showcase my C++ abilities, as my other C++ projects are private. To visualize my planner’s output, I first used Emscripten to compile my C++ code into WebAssembly. I then used the three.js JavaScript library to create an interactive map to run this WebAssembly module.
Problem overview
A company is developing a small electric plane. This plane uses batteries so it has a limited range. To support cross country travel, the company intends to create a network of charging stations at small airports across the United States. The plane charges faster at some stations than at others, and doesn’t need to fully charge at any one station. The company wants you to design an algorithm to find the minimum time path between any two of these airports.
Repository overview
My solution to this problem is described in detail in the README file of my GitHub repository. Explore this project to see how I transform this solution into modular, maintainable, and tested C++ code. Thank you for taking the time to look at my project. If you see something I can improve, please let me know by opening a GitHub issue.