Recursive route planning method for electric vehicle

A recursive route planning method for an electric vehicle, the method comprising steps of:

• inputting a status condition, wherein the status condition has at least one starting point and at least one destination, mileages for remaining electric power and a route distance between the starting point and destination;
• searching all recharge stations between the starting point and destination covering the latitude and longitude;
• calculating distance between each recharge station to the starting point and to the destination;
• removing recharge stations that do not meet a search condition, wherein said search condition includes whether the distance between the recharge station(s) and the destination is longer than the distance between the starting point and the destination;
• integrating a list of recharge stations and planning at least one optimum route for the electric vehicle, wherein an optimum route is determined by one of the following factors:
• shortest time, shortest route, minimum times of recharge, shortest time of recharge and driving direction;
• and
• executing the steps above when any status condition changes to retrieve a new driving route,
• wherein the mileages for remaining electric power is obtained by modified method of estimating remaining mileage that is based on remaining electric power in the battery (SOC %) and distance already driven, and the modified method continues to modify when the remaining electric power in the battery (SOC %) decreases, and wherein the modified method of estimating remaining mileage comprising steps of dividing the driven distance (km) by consumed electric power of the driven distance (%) to obtain an electric power consuming amount of unit distance (km/%), and multiplying the electric power consuming amount of unit distance (km/%) with the remaining electric power in the battery (SOC %) to obtain the distance for remaining electric power (km).