Charge Station based Routing

[CodeBear801]

Detail design for proposal #196 (comment)

Charge Station based Routing means treat charge stations as nodes in graph, weight between nearby or reachable charge stations as edges, and then apply classic routing algorithm, such as Dijkstra, to calculate best solution.

User story mapping

https://www.processon.com/view/link/5e6fec80e4b011fcce9965bb

High level architecture

Project Page:

https://github.com/Telenav/osrm-backend/projects/6

Other links

Search along route solution #120

[CodeBear801]

Tasks list:

• Research on google::S2 Research on usage of google::s2 #236
• Prepare for charge station input Oasis - Prepare for charge station input #237
• Build spatial index for charge stations based on Google::S2 Oasis - Build spatial index for charge stations based on Google::S2 #239
• Generate connectivity for charge stations Oasis-Generate connectivity for charge stations #238
• Retrieve charge stations near orig and destination Oasis - Retrieve charge stations near orig and destination #240
• Refactor package stationgraph to support charge station based graph Oasis - Refactor package stationgraph to support charge station based graph #282
• Extend oasis service's graph - relax connectivity during running time Oasis - Extend oasis service's graph - relax connectivity during running time #241
• Extend oasis service's graph - multiple orig and destination Oasis - Extend oasis service's graph - multiple orig and destination #242
• Profile and optimization Profile OASIS service for charge station based routing #344