CN115900744A - Charging path planning method and device and server - Google Patents
Charging path planning method and device and server Download PDFInfo
- Publication number
- CN115900744A CN115900744A CN202211541429.2A CN202211541429A CN115900744A CN 115900744 A CN115900744 A CN 115900744A CN 202211541429 A CN202211541429 A CN 202211541429A CN 115900744 A CN115900744 A CN 115900744A
- Authority
- CN
- China
- Prior art keywords
- charging
- charging station
- vehicle
- charged
- historical
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 56
- 238000004590 computer program Methods 0.000 claims description 23
- 230000003203 everyday effect Effects 0.000 claims description 21
- 238000012216 screening Methods 0.000 claims description 17
- 238000012545 processing Methods 0.000 claims description 15
- 238000012163 sequencing technique Methods 0.000 claims description 4
- 239000002131 composite material Substances 0.000 claims description 3
- 238000004891 communication Methods 0.000 description 12
- 230000008569 process Effects 0.000 description 10
- 238000013507 mapping Methods 0.000 description 6
- 238000010586 diagram Methods 0.000 description 5
- 238000004364 calculation method Methods 0.000 description 4
- 230000008878 coupling Effects 0.000 description 3
- 238000010168 coupling process Methods 0.000 description 3
- 238000005859 coupling reaction Methods 0.000 description 3
- 230000000694 effects Effects 0.000 description 3
- 239000000446 fuel Substances 0.000 description 3
- 230000008859 change Effects 0.000 description 2
- 230000005611 electricity Effects 0.000 description 2
- 230000006870 function Effects 0.000 description 2
- 230000003993 interaction Effects 0.000 description 2
- 230000003287 optical effect Effects 0.000 description 2
- 238000007791 dehumidification Methods 0.000 description 1
- 238000011156 evaluation Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000006386 neutralization reaction Methods 0.000 description 1
- 230000002093 peripheral effect Effects 0.000 description 1
- 230000004044 response Effects 0.000 description 1
- 230000003068 static effect Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 238000012546 transfer Methods 0.000 description 1
- 238000009423 ventilation Methods 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
- G01C21/00—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
- G01C21/26—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network
- G01C21/34—Route searching; Route guidance
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
- G06Q10/047—Optimisation of routes or paths, e.g. travelling salesman problem
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B60—VEHICLES IN GENERAL
- B60L—PROPULSION OF ELECTRICALLY-PROPELLED VEHICLES; SUPPLYING ELECTRIC POWER FOR AUXILIARY EQUIPMENT OF ELECTRICALLY-PROPELLED VEHICLES; ELECTRODYNAMIC BRAKE SYSTEMS FOR VEHICLES IN GENERAL; MAGNETIC SUSPENSION OR LEVITATION FOR VEHICLES; MONITORING OPERATING VARIABLES OF ELECTRICALLY-PROPELLED VEHICLES; ELECTRIC SAFETY DEVICES FOR ELECTRICALLY-PROPELLED VEHICLES
- B60L53/00—Methods of charging batteries, specially adapted for electric vehicles; Charging stations or on-board charging equipment therefor; Exchange of energy storage elements in electric vehicles
- B60L53/60—Monitoring or controlling charging stations
- B60L53/66—Data transfer between charging stations and vehicles
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02T—CLIMATE CHANGE MITIGATION TECHNOLOGIES RELATED TO TRANSPORTATION
- Y02T10/00—Road transport of goods or passengers
- Y02T10/60—Other road transportation technologies with climate change mitigation effect
- Y02T10/70—Energy storage systems for electromobility, e.g. batteries
Landscapes
- Engineering & Computer Science (AREA)
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Remote Sensing (AREA)
- Radar, Positioning & Navigation (AREA)
- Economics (AREA)
- Strategic Management (AREA)
- General Physics & Mathematics (AREA)
- Physics & Mathematics (AREA)
- Quality & Reliability (AREA)
- Operations Research (AREA)
- Tourism & Hospitality (AREA)
- Marketing (AREA)
- General Business, Economics & Management (AREA)
- Entrepreneurship & Innovation (AREA)
- Theoretical Computer Science (AREA)
- Game Theory and Decision Science (AREA)
- Development Economics (AREA)
- Automation & Control Theory (AREA)
- Electric Propulsion And Braking For Vehicles (AREA)
Abstract
The application provides a charging path planning method, a charging path planning device and a server, and relates to the field of computers. The method comprises the following steps: the server obtains a charging request. The charging request includes a current position and a remaining capacity of the vehicle to be charged. And the server screens the current position and the residual electric quantity of the vehicle to be charged to obtain a first charging station set. The first charging station set includes at least one charging station. The server determines a comprehensive service index of each charging station according to the charging station historical information and the vehicle historical information of each charging station in the first charging station set. And the server determines the charging station with the maximum comprehensive service index as a target charging station from the first charging station set according to the comprehensive service index. And the server plans a charging path according to the current position of the vehicle to be charged and the position information of the target charging station. The method improves the charging efficiency of the vehicle to be charged.
Description
Technical Field
The present application relates to the field of computers, and in particular, to a charging path planning method, apparatus, and server.
Background
With the popularization of electric vehicles, electric vehicles have gradually replaced conventional fuel automobiles as one of important vehicles. Similar with the fuel car need go to filling station and refuel, electric vehicle need go to the charging station when the electric quantity is less and charge.
When the electric quantity of the electric vehicle is lower than the electric quantity threshold value, the electric vehicle can remind the user to go to a charging station for charging. The user can look over the positional information of charging station on terminal equipment such as cell-phone, car machine. The user can select a target charging station by himself and determine the charging path plan for the charging by navigation.
However, there are problems that the user selects a charging station randomly, the waiting time is long, the electric quantity of the charging equipment is insufficient, and the like, the charging efficiency of the electric vehicle of the user in the charging station cannot be guaranteed, and the charging efficiency is low.
Disclosure of Invention
The application provides a charging path planning method, a charging path planning device and a charging path planning server, which are used for solving the problems that a user selects a charging station, the charging station is random, the waiting time is long, the electric quantity of charging equipment is insufficient, the charging efficiency of an electric vehicle of the user in the charging station cannot be guaranteed, and the charging efficiency is low.
In a first aspect, the present application provides a charging path planning method, including:
acquiring a charging request, wherein the charging request comprises the current position and the residual electric quantity of a vehicle to be charged;
screening to obtain a first charging station set according to the current position of the vehicle to be charged and the residual electric quantity, wherein the first charging station set comprises at least one charging station;
determining a comprehensive service index of each charging station according to the charging station historical information and the vehicle historical information of each charging station in the first charging station set;
determining the charging station with the maximum comprehensive service index as a target charging station from the first charging station set according to the comprehensive service index;
and planning a charging path according to the current position of the vehicle to be charged and the position information of the target charging station.
Optionally, the determining a comprehensive service index of each charging station according to the charging station history information and the vehicle history information of each charging station in the first charging station set specifically includes:
determining historical use parameters of each charging station according to historical charging records of the vehicles to be charged in the vehicle historical information;
determining the driving parameters and the estimated arrival time of each charging station according to the position information of each charging station, the current position of the vehicle to be charged, the weather information and the road condition information;
determining a queuing waiting parameter and a charging electric quantity parameter of the charging station at a moment corresponding to the estimated arrival time according to the historical information of the charging station;
and calculating to obtain a comprehensive service index of each charging station according to the historical use parameter, the driving parameter, the queuing waiting parameter, the charging electric quantity parameter and a preset weight.
Optionally, the determining the historical usage parameter of each charging station according to the historical charging record of the vehicle to be charged in the vehicle historical information specifically includes:
determining the historical use time of each charging station according to the historical charging records;
determining a time parameter according to the time difference between the historical using time and the current time;
and superposing the time parameters of each charging station to obtain the historical use parameters of each charging station.
Optionally, the determining, according to the charging station history information, a queuing waiting parameter and a charging electric quantity parameter of the charging station at a time corresponding to the estimated arrival time specifically includes:
determining an arrival time period according to the estimated arrival time;
counting the number of the charging vehicles which are charged by the charging station and the charging time of each charging vehicle in the arrival time period every day in the charging station history information within a preset time period;
calculating the queuing waiting parameters according to the number of the charging vehicles reaching the charging station for charging and the charging duration of each charging vehicle in the arrival time period every day;
acquiring the residual electric quantity of the charging station at the estimated arrival time every day in the historical information of the charging station within a preset time length;
and determining the charging electric quantity parameter according to the residual electric quantity of the charging station at the estimated arrival time every day.
Optionally, the screening, according to the current location of the vehicle to be charged and the remaining power, to obtain a first charging station set specifically includes:
determining a travelable distance according to the residual electric quantity, the weather information and the road condition information;
determining a plurality of reachable charging stations of the vehicle to be charged according to the current position and the travelable distance;
and forming a plurality of accessible charging stations of the vehicle to be charged into the first charging station set.
Optionally, the method further comprises:
screening a preset number of charging stations with the maximum comprehensive service index from the first charging station set to form a second charging station set;
and sequencing the charging stations in the second charging station set according to the comprehensive service index, and outputting the sequenced charging stations.
In a second aspect, the present application provides a charging path planning apparatus, including:
the charging system comprises an acquisition module, a charging module and a charging module, wherein the acquisition module is used for acquiring a charging request which comprises the current position and the residual electric quantity of a vehicle to be charged;
the processing module is used for screening to obtain a first charging station set according to the current position of the vehicle to be charged and the residual electric quantity, wherein the first charging station set comprises at least one charging station; determining a comprehensive service index of each charging station according to the charging station historical information and the vehicle historical information of each charging station in the first charging station set; determining the charging station with the maximum comprehensive service index as a target charging station from the first charging station set according to the comprehensive service index; and planning a charging path according to the current position of the vehicle to be charged and the position information of the target charging station.
Optionally, the processing module is specifically configured to:
determining historical use parameters of each charging station according to historical charging records of the vehicles to be charged in the vehicle historical information;
determining the driving parameters and the estimated arrival time of each charging station according to the position information of each charging station, the current position of the vehicle to be charged, the weather information and the road condition information;
determining a queuing waiting parameter and a charging electric quantity parameter of the charging station at a moment corresponding to the estimated arrival time according to the historical information of the charging station;
and calculating to obtain a comprehensive service index of each charging station according to the historical use parameter, the driving parameter, the queuing waiting parameter, the charging electric quantity parameter and a preset weight.
Optionally, the processing module is specifically configured to:
determining the historical use time of each charging station according to the historical charging records;
determining a time parameter according to the time difference between the historical using time and the current time;
and superposing the time parameters of each charging station to obtain the historical use parameters of each charging station.
Optionally, the processing module is specifically configured to:
determining an arrival time period according to the estimated arrival time;
counting the number of the charging vehicles which are charged by the charging station and the charging time of each charging vehicle in the arrival time period every day in the charging station history information within a preset time period;
calculating the queuing waiting parameters according to the number of the charging vehicles which reach the charging station for charging and the charging time of each charging vehicle in the arrival time period every day;
acquiring the residual electric quantity of the charging station at the estimated arrival time every day in the historical information of the charging station within a preset time length;
and determining the charging electric quantity parameter according to the residual electric quantity of the charging station at the estimated arrival time every day.
Optionally, the processing module is specifically configured to:
determining a travelable distance according to the residual electric quantity, the weather information and the road condition information;
determining a plurality of charging stations which can be reached by the vehicle to be charged according to the current position and the travelable distance;
a plurality of charging stations that can be reached by the vehicle to be charged are grouped into the first charging station set.
Optionally, the processing module is further configured to:
screening a preset number of charging stations with the maximum comprehensive service index from the first charging station set to form a second charging station set;
and sequencing the charging stations in the second charging station set according to the comprehensive service index, and outputting the sequenced charging stations.
In a third aspect, the present application provides a server, comprising: a memory and a processor;
the memory is used for storing a computer program; the processor is configured to perform the method for charge path planning in the first aspect and any one of the possible designs of the first aspect according to a computer program stored in the memory.
In a fourth aspect, the present application provides a computer-readable storage medium, in which a computer program is stored, and when at least one processor of a server executes the computer program, the server executes the method for planning a charging path in any one of the possible designs of the first aspect and the first aspect.
In a fifth aspect, the present application provides a computer program product comprising a computer program which, when executed by at least one processor of a server, causes the server to perform the method for charge path planning in any one of the possible designs of the first aspect and the first aspect.
According to the charging path planning method, the charging path planning device and the server, the charging request is obtained. The charging request comprises the current position and the residual capacity of the vehicle to be charged; and screening to obtain a first charging station set according to the current position and the residual electric quantity of the vehicle to be charged. The first charging station set comprises at least one charging station; determining a comprehensive service index of each charging station according to the charging station historical information and the vehicle historical information of each charging station in the first charging station set; determining a charging station with the maximum comprehensive service index as a target charging station from the first charging station set according to the comprehensive service index; according to the current position of the vehicle to be charged and the position information of the target charging station, the charging path is planned, the charging efficiency of the vehicle to be charged in the charging station is improved, and therefore the user experience effect is improved.
Drawings
In order to more clearly illustrate the technical solutions in the present application or prior art, the drawings used in the embodiments or the description of the prior art are briefly described below, and it is obvious that the drawings in the following description are some embodiments of the present application, and it is obvious for those skilled in the art to obtain other drawings without creative efforts.
Fig. 1 is a schematic view of a charging path planning scenario according to an embodiment of the present application;
fig. 2 is a flowchart of a charging path planning method according to an embodiment of the present disclosure;
fig. 3 is a schematic structural diagram of a charging path planning apparatus according to an embodiment of the present disclosure;
fig. 4 is a schematic hardware structure diagram of a server according to an embodiment of the present application.
Detailed Description
To make the objects, technical solutions and advantages of the present application clearer, the technical solutions of the present application will be described clearly and completely with reference to the accompanying drawings in the present application, and it is obvious that the described embodiments are some, but not all embodiments of the present application. All other embodiments obtained by a person of ordinary skill in the art based on the embodiments in the present application without making any creative effort belong to the protection scope of the present application.
The terms "first," "second," "third," "fourth," and the like in the description and in the claims of the present application and in the above-described drawings are used for distinguishing between similar elements and not necessarily for describing a particular sequential or chronological order. It will be appreciated that the data so used may be interchanged where appropriate. For example, first information may also be referred to as second information, and similarly, second information may also be referred to as first information, without departing from the scope herein. Furthermore, the terms "comprises," "comprising," and "having," and any variations thereof, are intended to cover a non-exclusive inclusion, such that a process, method, system, article, or apparatus that comprises a list of steps or elements is not necessarily limited to those steps or elements expressly listed, but may include other steps or elements not expressly listed or inherent to such process, method, article, or apparatus.
The word "if" as used herein may be interpreted as "at" \8230; "or" when 8230; \8230; "or" in response to a determination ", depending on the context.
Also, as used herein, the singular forms "a", "an" and "the" are intended to include the plural forms as well, unless the context indicates otherwise.
The terms "or" and/or "as used herein are to be construed as inclusive or meaning any one or any combination. Thus, "a, B or C" or "a, B and/or C" means "any of the following: a; b; c; a and B; a and C; b and C; A. b and C ". An exception to this definition will occur only when a combination of elements, functions, steps or operations are inherently mutually exclusive in some way.
With the popularization of electric vehicles, electric vehicles have gradually replaced conventional fuel automobiles as one of important vehicles. The electric vehicle may be provided with a threshold value of the electric quantity in the vehicle. When the electric quantity of the electric vehicle is lower than the electric quantity threshold value, the vehicle machine of the electric vehicle can remind a user of charging. Under the condition that the user can not go to private charging pile in time to charge, the user can go to the charging station to charge. The user can check the position information of the nearby charging station on the mobile phone, the car machine and other terminal equipment. The user may select a target charging station from the charging stations. The user can complete the charging path planning on the terminal device according to the target charging station. The user can go to the charging station to charge according to the planned charging path. Although when the terminal device displays a nearby charging station, certain charging station information may be attached. However, the charging station information is generally fixed information such as location information and charging pile number information. When a user looks at a nearby charging station, the user cannot generally acquire the use condition of the charging station at the current moment and the estimated use condition of the charging station at a future moment. Therefore, there is randomness in selecting a charging station by the user, and there may occur problems such as long waiting time, insufficient power of the charging device, and the like after the user arrives at the charging station. Therefore, the prior art has the problem that the charging efficiency of the user after the electric vehicle goes to the charging station cannot be guaranteed. The main reason for this problem is because the target charging station selected by the user is not the optimal charging station. In order to solve the above problem, a charging path planning method provided in the embodiment of the present application is provided. According to the charging path planning method, the optimal target charging station can be obtained through screening according to the charging station historical information of the charging station near the vehicle to be charged and the vehicle historical information of the vehicle to be charged. Furthermore, the charging path can be planned according to the target charging station. After the user goes to the charging station according to this route of charging, can effectively improve the charge efficiency of waiting to charge the vehicle to improve user experience.
An exemplary application scenario of the embodiments of the present application is described below. In the following examples, the vehicles are all used to refer to electric vehicles.
Fig. 1 illustrates a scene schematic diagram of a charging path planning according to an embodiment of the present application. As shown in fig. 1, when the charge amount of the vehicle is too low, the vehicle machine of the vehicle may generate a charging request. The vehicle may send the charging request to the server. The server may acquire the current position and the remaining amount of power of the vehicle to be charged from the charging request after acquiring the charging request. The server can inquire the charging stations near the vehicle to be charged according to the current position. Alternatively, the server may determine the distance to be traveled of the vehicle to be charged according to the remaining amount of power. The server can determine the charging station which can be reached by the vehicle to be charged before the electricity is exhausted according to the travelable distance. As shown in fig. 1, the server may display, in a terminal device such as a car machine, a positional relationship between the charging stations and the vehicle to be charged.
In the present application, a server is used as an execution subject to execute the charging path planning method according to the following embodiments. Specifically, the execution body may be a hardware device of the server, or a software application in the server, or a computer-readable storage medium on which the software application implementing the following embodiment is installed, or code of the software application implementing the following embodiment.
The technical solution of the present application will be described in detail below with specific examples. The following several specific embodiments may be combined with each other, and details of the same or similar concepts or processes may not be repeated in some embodiments.
Fig. 2 shows a flowchart of a charging path planning method according to an embodiment of the present application. On the basis of the embodiment shown in fig. 1, as shown in fig. 2, with a server as an execution subject, the method of this embodiment may include the following steps:
s101, a charging request is obtained, wherein the charging request comprises the current position and the residual capacity of the vehicle to be charged.
In this embodiment, the server may obtain the charging request sent by the terminal device. The terminal device may be a vehicle machine of a vehicle. Alternatively, the terminal device may be a mobile phone bound to the vehicle. The current position and the remaining capacity of the vehicle to be charged may be included in the charge request. Optionally, the charging request may further include vehicle information of the vehicle to be charged. The vehicle information includes a vehicle identification. The vehicle identification is used to uniquely identify the vehicle to be charged.
In one example, the server may further store the current location of the vehicle to be charged, the remaining amount of power, and vehicle information in a database. The vehicle identification is used for searching various information corresponding to the vehicle to be charged in the database.
S102, screening to obtain a first charging station set according to the current position and the residual electric quantity of the vehicle to be charged, wherein the first charging station set comprises at least one charging station.
In this embodiment, the server may determine the distance to be traveled of the vehicle to be charged according to the remaining capacity of the vehicle to be charged. The server may determine the selection range of the charging station according to the current position of the vehicle to be charged and the travelable distance. The server may acquire all charging stations within the selection range. The server may add these charging stations to the first set of charging stations. Optionally, the server may also obtain charging station information for the charging stations when determining the charging stations. The charging station information may include charging station history information, charging station location information, charging pile information in the charging station, and the like.
In one example, the specific process of the server screening to obtain the first charging station set may include:
step 1, determining a distance to drive according to the residual electric quantity, the weather information and the road condition information.
In this step, the main factor affecting the travelable distance of the vehicle is the remaining capacity. In the running process of the vehicle, under a stable running state, the electric energy consumed by the running of the vehicle per kilometer is stable. Therefore, the server can acquire the power consumption parameter per kilometer of travel set by the technician according to experience. The server can predict the distance that the vehicle to be charged can travel according to the power consumption parameter.
In addition, the change of the weather information and the road condition information may also affect the power consumption of the vehicle during driving. For example, when the weather is cold or hot, the driver often needs to turn on the air conditioner while driving. The use of the air conditioner may cause an increase in the power consumption of the vehicle. Because the power consumptions at different temperatures are different under different modes of cold air, hot air, dehumidification, ventilation and the like of the air conditioner. Therefore, after acquiring the temperature information and the humidity information in the weather information, the server may determine the power consumption per minute of the air conditioner according to the mapping relationship between the air conditioner mode and the temperature and the power consumption per minute parameter set by the technician according to experience. As another example, in the case of road congestion, the running speed of the vehicle is slow, and the vehicle may be braked, started, and the like more frequently. Therefore, in the case of road congestion, the power consumption of the vehicle during traveling may increase. The server can also obtain additional power consumption parameters set by technicians according to experience and running per kilometer.
The server can comprehensively calculate the distance to be traveled of the vehicle to be charged according to the power consumption parameter running every kilometer, the power consumption per minute of the air conditioner and the extra power consumption parameter running every kilometer.
And 2, determining a plurality of reachable charging stations of the vehicle to be charged according to the current position and the travelable distance.
In this step, the server may obtain, according to the preset distance threshold, all charging stations whose linear distance from the current position to the vehicle to be charged is smaller than or equal to the preset distance threshold. These charging stations may be charging stations in the vicinity of the vehicle to be charged. The preset distance threshold may be determined according to the travelable distance. For example, when the distance to be traveled is 20 km, the preset distance threshold may be 20 km. Since the travel distance of the vehicle is generally greater than the straight distance during actual travel. Therefore, the server can also acquire the navigation distances from the charging stations to the vehicle to be charged. The server may retain charging stations in which the navigation distance is less than or equal to the travelable distance. In addition, after waiting to charge the vehicle and reaching the charging station, waiting to charge the vehicle and usually need look for in the parking area that the charging station corresponds and fill electric pile, and carry out the charging. Therefore, the server can reserve a certain buffer distance for the vehicle to be charged to run in the charging station. The server may further delete charging stations for which the sum of the navigation distance and the buffer distance is greater than the travelable distance. The server may determine that there are remaining charging stations as charging stations that the vehicle to be charged can reach.
And 3, forming a plurality of accessible charging stations of the vehicle to be charged into a first charging station set.
In this step, the server may add these reachable charging stations to the first set of charging stations. The charging station names or charging station electricity numbers of the reachable charging stations can be included in the first charging station set. The charging station name or the charging station number can generally be used to uniquely identify a charging station.
S103, determining a comprehensive service index of each charging station according to the charging station historical information and the vehicle historical information of each charging station in the first charging station set.
In this embodiment, the server may evaluate the charging station according to the charging station history information of the charging station, so as to determine the quality of service of the charging station. The server can realize the evaluation of the service quality of the charging station through the comprehensive service index. The server can also determine the probability of the user going to the charging station according to the vehicle history information, so that the effectiveness of the calculation of the comprehensive service index of the charging station is improved.
In one example, the calculation process of the integrated service indicator may specifically include the following steps:
step 1, determining historical use parameters of each charging station according to historical charging records of vehicles to be charged in vehicle historical information.
In this step, the server acquires the charging habit of the vehicle to be charged from the vehicle history information. The server can calculate and obtain the historical use parameters of each charging station according to the charging habits. When the vehicle to be charged frequently goes to a certain charging station for charging, the historical use parameters of the charging station are larger. For a charging station that the vehicle to be charged has not traveled, the historical usage parameter may be 0.
Specifically, the server may implement the calculation of the historical usage parameter according to the following steps:
and 11, determining the historical use time of each charging station according to the historical charging records.
In this step, the server may obtain a historical charging record of the vehicle to be charged within a preset time period. The preset duration is a default value. For example, the preset length of time may be within the last 5 years. Alternatively, the server may also obtain a historical charging record from a preset starting time. The preset start time may be a default value. For example, the preset starting time may be a time when the user purchases a car. The historical charging record at least comprises historical use time. In addition, the historical charging record can also comprise information such as historical charging stations, historical charging electric quantity, historical charging duration and the like.
And step 12, determining a time parameter according to the time difference between the historical use time and the current time.
In this step, the server may calculate a time difference between the historical use time and the current time. The unit of this time difference may be days. The server may be provided with a mapping table or a mapping formula of the time difference to the time parameter. The server may calculate the time parameter according to the mapping table or the mapping formula through the time difference. The mapping table or formula may be preset by a skilled person. Since the reference value of the charging record is larger closer to the current time, the time parameter is smaller as the time difference is larger in this step. Conversely, if the time difference is larger, the time parameter is smaller. For example, the time difference may be inversely proportional to the time parameter. For example, when the time difference is 1 day, the time parameter may be 1. As another example, when the time difference is 389 days, the time parameter may be 1/389.
And step 13, overlapping the time parameters of each charging station to obtain the historical use parameters of each charging station.
In this step, the server may superimpose the time parameters of the same charging station to obtain the historical usage parameters of the charging station. For example, the vehicle to be charged may travel to charging station a for charging 5 days and 10 days, respectively. Then, the historical usage parameter of charging station a is 0.2+0.1=0.3. As another example, charging station B may be included in the first set of charging stations. If the vehicle to be charged does not go to the charging station B for charging, the historical usage parameter of the charging station B may be 0.
In one implementation, the server may further optimize the historical usage parameter according to a historical driving trajectory. The specific process can comprise the following steps:
and step 14, obtaining the historical driving track of the vehicle to be charged in the vehicle historical information, and screening the historical driving track.
In this step, the server may obtain a historical travel track of the vehicle to be charged within a preset time period. The preset duration is a default value. For example, the preset length of time may be within the last 5 years. Alternatively, the server may also acquire a history of the travel locus from a preset start time. The preset start time may be a default value. For example, the preset starting time may be a time when the user purchases a car. The history travel track may specifically include a travel track and a travel time.
Alternatively, the server may retain all the historical travel tracks within a range of a radius of the travelable distance centered on the current position.
Optionally, the server may further filter the historical driving track according to the map information at the current time to delete the road segments in which driving is not possible.
And step 15, determining a historical driving track closest to each charging station according to the historical driving track and the position information of each charging station in the first charging station set.
In this step, the server may calculate a travel track closest to the charging station according to the location information of each charging station in the first charging station set. In the calculation of this step, the server may determine a travel track closest to the distance of each charging station by calculating the point-to-line distance. Note that there may be a travel track repetition of a plurality of history travel tracks in the history travel track, and the travel time is different. When a driving track nearest to a charging station is repeated corresponding to a plurality of driving tracks and the driving time is different from the historical driving track, the plurality of historical driving tracks are the historical driving track nearest to the charging station.
And step 16, determining distance parameters and weight parameters according to the history running track which is closest to each charging station.
In this step, the server may obtain the travel time of at least one historical travel track corresponding to each charging station. The server may calculate a time difference between the travel time and the current time. The server may calculate a time parameter based on the time difference. The server may accumulate at least one time parameter corresponding to each charging station to obtain a weight parameter. The server can calculate the distance of the distance which needs to be increased for detouring to the charging station according to the historical driving track. The server may calculate the distance parameter based on the distance traveled. The larger the increased distance of the route, the less recommended the server is for the vehicle to be charged to travel to the charging station. Thus, the greater the distance of the journey, the smaller the distance parameter may be. For example, the range distance may be inversely proportional to the distance parameter.
And 17, optimizing historical use parameters according to the distance parameters and the weight parameters.
In this step, the server may superimpose the product of the distance parameter and the weight parameter on the historical usage parameter to optimize the historical usage parameter.
And 2, determining the driving parameters and the estimated arrival time of each charging station according to the position information of each charging station, the current position of the vehicle to be charged, the weather information and the road condition information.
In this step, the server may determine a distance between each charging station and the current location through the map according to the location information and the current location of each charging station. The average traveling speed may be set in the server. The average travel speed may be preset by a technician. Alternatively, the average travel speed may also be calculated from a historical travel speed of the vehicle to be charged. In a weather scene such as rain, snow, fog, etc., the traveling speed of the vehicle is generally reduced. Therefore, the server can adjust the average traveling speed according to the weather information. For example, in heavy fog, the average travel speed of the vehicle may decrease by 20%. Under different road conditions such as congestion and smoothness, the running speed of the vehicle can also change. Therefore, the server can adjust the average running speed according to the road condition information. For example, when congestion occurs, the server may adjust the average traveling speed of the congested link according to the congestion degree. The server may calculate the driving parameter according to the average driving speed of the vehicle. The server can calculate the running time of the vehicle to be charged, which is taken as each charging station from the current position, according to the adjusted average running speed. The server may determine an estimated arrival time based on the travel time and the current time.
And 3, determining a queuing waiting parameter and a charging electric quantity parameter of the charging station at the moment corresponding to the estimated arrival time according to the historical information of the charging station.
In this step, the server may also obtain historical information of the charging station within a preset duration. The preset duration is a default value. For example, the preset length of time may be within the last 5 years. Alternatively, the server may also acquire charging station history information from a preset start time. The preset start time may be a default value. For example, the preset starting time may be a charging station setup time. The charging station history information may include a queuing situation of the charging station at the estimated arrival time and a charging station remaining capacity. The server can calculate the queuing waiting parameter according to the queuing condition. The server can also calculate to obtain a charging electric quantity parameter according to the residual electric quantity of the charging station.
Specifically, the specific step of the server calculating the queue waiting parameter and the charging capacity parameter may include:
and step 31, determining an arrival time period according to the estimated arrival time.
In this step, the server may be divided into a plurality of time periods a day. The server can determine a time period corresponding to the estimated arrival time according to the estimated arrival time. This time period is the arrival time period. For example, the server may divide the day into 4 time periods, where 0 o ' clock-6 o ' clock is the first time period, 6-12 o ' clock is the second time period, 12-18 o ' clock is the third time period, and 18-24 o ' clock is the fourth time period.
And step 32, counting the number of the charging vehicles which are charged by the charging station and the charging time of each charging vehicle in the arrival time period every day in the historical information of the charging station within the preset time period.
In this step, the server may count the vehicles that arrive at the charging station for charging within the arrival time period in the charging station history information. The server may count the number of vehicles that reach the charging station and are charged during the arrival time period each day. The server may further acquire a charging time period and a charging amount of the vehicle that arrives at the charging station and is charged within the arrival time period every day.
In one implementation, if the date corresponding to the current time is a special date containing a special meaning, such as a holiday, the server may separate the charging station history information corresponding to the special date from all the charging station history information. Alternatively, the server may perform processing using only the charging station history information corresponding to these special dates. Alternatively, the server may process the charging station history information corresponding to these special dates and the charging station history information corresponding to other dates, respectively.
And step 33, calculating the queuing waiting parameters according to the number of the charging vehicles reaching the charging station for charging and the charging time of each charging vehicle in the arrival time period every day.
In this step, the server may calculate the first waiting parameter for each day according to the number of the charging vehicles that reach the charging station for charging in the arrival time period and the charging time period of each charging vehicle for each day. Alternatively, the server may accumulate the charge durations of the vehicles that are reached within the reaching time period each day to obtain the total charge duration. The server may use a ratio of the total charging time period to the number of charging vehicles as the queue waiting parameter.
In one implementation manner, after the server respectively processes the charging station history information corresponding to the special dates and the charging station history information corresponding to other dates to obtain the queue waiting parameters corresponding to the special dates and the queue waiting parameters corresponding to other dates, the server may use a preset weight index to calculate a weighted sum of the two queue waiting parameters. The weighted sum is the queue waiting parameter that is ultimately used.
And step 34, acquiring the residual electric quantity of the charging station at the estimated arrival time every day in the historical information of the charging station within the preset time length.
In this step, the server may obtain the remaining power of each charging station at the estimated arrival time of each day in the charging station history information.
And step 35, determining a charging electric quantity parameter according to the residual electric quantity of the charging station at the estimated arrival time every day.
In this step, the server may calculate the average value of the remaining power. The average value is the charging electric quantity parameter.
In one implementation, after the server processes the charging station history information corresponding to the special dates and the charging station history information corresponding to other dates respectively to obtain the charging electric quantity parameters corresponding to the special dates and the charging electric quantity parameters corresponding to other dates, the server may calculate a weighted sum of the two charging electric quantity parameters by using a preset weight index. The weighted sum is the charge capacity parameter that is ultimately used.
And 4, calculating to obtain a comprehensive service index of each charging station according to the historical use parameters, the driving parameters, the queuing waiting parameters, the charging electric quantity parameters and the preset weight.
In this step, the server may be preset with preset weights of the historical usage parameters, the driving parameters, the queue waiting parameters, and the charging electric quantity parameters. The server can determine the comprehensive service index of each charging station by calculating the weighted sum of the historical use parameter, the driving parameter, the queuing waiting parameter and the charging electric quantity parameter.
And S104, determining the charging station with the maximum comprehensive service index as a target charging station from the first charging station set according to the comprehensive service index.
In this embodiment, the server may determine the charging station with the largest neutralization service index after calculating the comprehensive service index of each charging station in the first charging station set. The server may take the charging station as the target charging station.
In one example, the server may further filter a preset number of charging stations with the largest comprehensive service index from the first charging station set to form a second charging station set. The preset number may be set by a skilled person based on empirical values. For example, the preset number may be 6. The server may rank the charging stations in the second set of charging stations according to the composite service indicator. The server may output the ordered preset number of charging stations. The user can check the charging stations on the mobile phone, the car machine and other terminal equipment. The server may obtain a selection instruction generated when the user selects the charging station. The server may determine a target charging station according to the selection instruction.
And S105, planning a charging path according to the current position of the vehicle to be charged and the position information of the target charging station.
In this embodiment, the server may determine the location information of the target charging station after determining the target charging station. The server may plan a charging path on the map according to the location information and the current location. The server can send the planned charging path to terminal equipment such as a mobile phone and a vehicle machine.
According to the charging path planning method, the server can obtain the charging request. The current position and the remaining capacity of the vehicle to be charged may be included in the charge request. The server can obtain a first charging station set through screening according to the current position and the residual electric quantity of the vehicle to be charged. The first charging station set includes at least one charging station. The server may determine a composite service indicator for each charging station based on the charging station history information and the vehicle history information for each charging station in the first set of charging stations. The server can determine the charging station with the maximum comprehensive service index as the target charging station from the first charging station set according to the comprehensive service index. The server can plan the charging path according to the current position of the vehicle to be charged and the position information of the target charging station. In this application, through calculating the comprehensive service index of each charging station, realize the affirmation of target charging station, the server can go to the target charging station through the guide user, improves the charge efficiency of waiting to charge the vehicle at the charging station to improve user experience.
Fig. 3 shows a schematic structural diagram of a charging path planning apparatus according to an embodiment of the present application, and as shown in fig. 3, the charging path planning apparatus 10 of the present embodiment is used to implement operations corresponding to a server in any one of the method embodiments, where the charging path planning apparatus 10 of the present embodiment includes:
the obtaining module 11 is configured to obtain a charging request, where the charging request includes a current location and a remaining power of a vehicle to be charged.
The processing module 12 is configured to obtain a first charging station set by screening according to the current location and the remaining power of the vehicle to be charged, where the first charging station set includes at least one charging station. And determining a comprehensive service index of each charging station according to the charging station historical information and the vehicle historical information of each charging station in the first charging station set. And determining the charging station with the maximum comprehensive service index as a target charging station from the first charging station set according to the comprehensive service index. And planning a charging path according to the current position of the vehicle to be charged and the position information of the target charging station.
In one example, the processing module 12 is specifically configured to:
and determining the historical use parameters of each charging station according to the historical charging records of the vehicles to be charged in the vehicle historical information.
And determining the driving parameters and the estimated arrival time of each charging station according to the position information of each charging station, the current position of the vehicle to be charged, the weather information and the road condition information.
And determining a queuing waiting parameter and a charging electric quantity parameter of the charging station at the moment corresponding to the estimated arrival time according to the historical information of the charging station.
And calculating to obtain a comprehensive service index of each charging station according to the historical use parameters, the driving parameters, the queuing waiting parameters, the charging electric quantity parameters and the preset weight.
In one example, the processing module 12 is specifically configured to:
and determining the historical use time of each charging station according to the historical charging records.
And determining a time parameter according to the time difference between the historical using time and the current time.
And superposing the time parameters of each charging station to obtain the historical use parameters of each charging station.
In one example, the processing module 12 is specifically configured to:
and determining an arrival time period according to the estimated arrival time.
In the statistical charging station historical information, the number of the charging vehicles which are charged by the charging station and the charging time of each charging vehicle are reached in the arrival time period every day in the preset time period.
The number of charging vehicles reaching the charging station for charging in the arrival time period and the charging time period of each charging vehicle every day, and the queue waiting parameter is calculated.
In the acquisition of the historical information of the charging station, the residual electric quantity of the charging station at the estimated arrival time every day is within the preset time.
And determining a charging electric quantity parameter according to the residual electric quantity of the charging station at the estimated arrival time every day.
In one example, the processing module 12 is specifically configured to:
and determining the distance to be travelled according to the residual electric quantity, the weather information and the road condition information.
And determining a plurality of reachable charging stations of the vehicle to be charged according to the current position and the travelable distance.
A plurality of charging stations that can be reached by a vehicle to be charged are grouped into a first charging station group.
In one example, the processing module 12 is further configured to:
and screening the first charging station set to obtain a preset number of charging stations with the maximum comprehensive service index, and forming a second charging station set.
And sequencing the charging stations in the second charging station set according to the comprehensive service index, and outputting the sequenced charging stations.
The charging path planning apparatus 10 provided in the embodiment of the present application may implement the method embodiment, and specific implementation principles and technical effects thereof may be referred to the method embodiment, which is not described herein again.
Fig. 4 shows a hardware structure diagram of a server provided in an embodiment of the present application. As shown in fig. 4, the server 20 is configured to implement the operation corresponding to the server in any of the above method embodiments, where the server 20 of this embodiment may include: memory 21, processor 22 and communication interface 24.
A memory 21 for storing a computer program. The Memory 21 may include a Random Access Memory (RAM), a Non-Volatile Memory (NVM), at least one disk Memory, a usb disk, a removable hard disk, a read-only Memory, a magnetic disk or an optical disk.
And a processor 22 for executing the computer program stored in the memory to implement the charging path planning method in the above embodiments. Reference may be made in particular to the description relating to the method embodiments described above. The Processor 22 may be a Central Processing Unit (CPU), other general purpose Processor, a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), or the like. A general purpose processor may be a microprocessor or the processor may be any conventional processor or the like. The steps of a method disclosed in connection with the present invention may be embodied directly in a hardware processor, or in a combination of the hardware and software modules within the processor.
Alternatively, the memory 21 may be separate or integrated with the processor 22.
When memory 21 is a separate device from processor 22, server 20 may also include bus 23. The bus 23 is used to connect the memory 21 and the processor 22. The bus 23 may be an Industry Standard Architecture (ISA) bus, a Peripheral Component Interconnect (PCI) bus, an Extended ISA (EISA) bus, or the like. The bus may be divided into an address bus, a data bus, a control bus, etc. For ease of illustration, the buses in the figures of the present application are not limited to only one bus or one type of bus.
The communication interface 24 is used to enable interaction with the terminal device. The terminal equipment can be a vehicle machine. The server 20 may obtain the charging request uploaded by the vehicle via the communication interface 24. Alternatively, the server 20 may also send the charging path to the car machine through the communication interface 24, so that the car machine can automatically drive to the charging station using the charging path. Alternatively, the server 20 may also send the charging path to the vehicle via the communication interface 24, so that the driver can drive to the charging station according to the charging path. Or, the terminal device can also be a mobile phone. The server 20 can obtain the charging request uploaded by the mobile phone through the communication interface 24. The mobile phone can acquire the residual electric quantity of the vehicle through interaction with the vehicle machine. The server 20 can also send a charging path to the handset through the communication interface 24 so that the driver can travel to the charging station according to the charging path.
The server provided in this embodiment may be used to execute the above charging path planning method, and the implementation manner and the technical effect thereof are similar, and details are not described herein again.
The present application further provides a computer-readable storage medium, in which a computer program is stored, and the computer program is used for implementing the methods provided by the above-mentioned various embodiments when being executed by a processor.
The computer readable storage medium may be a computer storage medium or a communication medium. Communication media includes any medium that facilitates transfer of a computer program from one place to another. Computer storage media may be any available media that can be accessed by a general purpose or special purpose computer. For example, a computer readable storage medium is coupled to the processor such that the processor can read information from, and write information to, the computer readable storage medium. Of course, the computer readable storage medium may also be an integral part of the processor. The processor and the computer-readable storage medium may reside in an Application Specific Integrated Circuit (ASIC). Additionally, the ASIC may reside in user equipment. Of course, the processor and the computer-readable storage medium may also reside as discrete components in a communication device.
In particular, the computer-readable storage medium may be implemented by any type of volatile or non-volatile Memory device or combination thereof, such as Static Random-Access Memory (SRAM), electrically-Erasable Programmable Read-Only Memory (EEPROM), erasable Programmable Read-Only Memory (EPROM), programmable Read-Only Memory (PROM), read-Only Memory (ROM), magnetic Memory, flash Memory, magnetic disk, or optical disk. A storage media may be any available media that can be accessed by a general purpose or special purpose computer.
The present application also provides a computer program product comprising a computer program stored in a computer readable storage medium. The computer program can be read by at least one processor of the device from a computer-readable storage medium, and execution of the computer program by the at least one processor causes the device to implement the methods provided by the various embodiments described above.
Embodiments of the present application further provide a chip, where the chip includes a memory and a processor, where the memory is used to store a computer program, and the processor is used to call and run the computer program from the memory, so that a device in which the chip is installed executes the method in the above various possible embodiments.
In the several embodiments provided in the present application, it should be understood that the disclosed apparatus and method may be implemented in other ways. For example, the above-described apparatus embodiments are merely illustrative, and for example, a division of modules is only one type of division of logical functions, and other divisions may be realized in practice, for example, a plurality of modules may be combined or may be integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed coupling or direct coupling or communication connection between each other may be through some interfaces, indirect coupling or communication connection between devices or modules, and may be in an electrical, mechanical or other form.
Wherein the modules may be physically separated, e.g. mounted at different locations of one device, or mounted on different devices, or distributed over multiple network elements, or distributed over multiple processors. The modules may also be integrated, for example, in the same device, or in a set of codes. The respective modules may exist in the form of hardware, or may also exist in the form of software, or may also be implemented in the form of software plus hardware. The method and the device can select part or all of the modules according to actual needs to achieve the purpose of the scheme of the embodiment.
When the respective modules are implemented as integrated modules in the form of software functional modules, they may be stored in a computer-readable storage medium. The software functional module is stored in a storage medium and includes several instructions to enable a computer device (which may be a personal computer, a server, or a network device) or a processor to execute some steps of the methods according to the embodiments of the present application.
It should be understood that, although the steps in the flowcharts in the above embodiments are shown in sequence as indicated by the arrows, the steps are not necessarily performed in sequence as indicated by the arrows. The steps are not performed in the exact order shown and may be performed in other orders unless explicitly stated herein. Moreover, at least some of the steps in the figures may include multiple sub-steps or multiple stages that are not necessarily performed at the same time, but may be performed at different times, in different orders, and may be performed alternately or at least partially with respect to other steps or sub-steps of other steps.
Finally, it should be noted that: the above embodiments are only used to illustrate the technical solutions of the present application, and not to limit the same. Although the present application has been described in detail with reference to the foregoing embodiments, it should be understood by those of ordinary skill in the art that: it is also possible to modify the solutions described in the previous embodiments or to substitute some or all of them with equivalents. And the modifications or the substitutions do not make the essence of the corresponding technical solutions depart from the scope of the technical solutions of the embodiments of the present application.
Claims (10)
1. A method for planning a charging path, the method comprising:
acquiring a charging request, wherein the charging request comprises the current position and the residual electric quantity of a vehicle to be charged;
screening to obtain a first charging station set according to the current position of the vehicle to be charged and the residual electric quantity, wherein the first charging station set comprises at least one charging station;
determining a comprehensive service index of each charging station according to the charging station historical information and the vehicle historical information of each charging station in the first charging station set;
determining the charging station with the maximum comprehensive service index as a target charging station from the first charging station set according to the comprehensive service index;
and planning a charging path according to the current position of the vehicle to be charged and the position information of the target charging station.
2. The method of claim 1, wherein determining a composite service indicator for each charging station of the first set of charging stations based on the charging station history information and the vehicle history information for each charging station comprises:
determining historical use parameters of each charging station according to historical charging records of the vehicles to be charged in the vehicle historical information;
determining the driving parameters and the estimated arrival time of each charging station according to the position information of each charging station, the current position of the vehicle to be charged, the weather information and the road condition information;
determining a queuing waiting parameter and a charging electric quantity parameter of the charging station at a moment corresponding to the estimated arrival time according to the historical information of the charging station;
and calculating to obtain a comprehensive service index of each charging station according to the historical use parameters, the driving parameters, the queuing waiting parameters, the charging electric quantity parameters and a preset weight.
3. The method according to claim 2, wherein the determining historical usage parameters of each charging station according to the historical charging records of the vehicles to be charged in the vehicle history information specifically comprises:
determining the historical use time of each charging station according to the historical charging records;
determining a time parameter according to the time difference between the historical using time and the current time;
and superposing the time parameters of each charging station to obtain the historical use parameters of each charging station.
4. The method according to claim 2, wherein the determining, according to the charging station history information, a queuing waiting parameter and a charging electric quantity parameter of the charging station at a time corresponding to the estimated arrival time specifically includes:
determining an arrival time period according to the estimated arrival time;
counting the number of the charging vehicles which are charged by the charging station and the charging time of each charging vehicle in the arrival time period every day in the charging station history information within a preset time period;
calculating the queuing waiting parameters according to the number of the charging vehicles which reach the charging station for charging and the charging time of each charging vehicle in the arrival time period every day;
acquiring the residual electric quantity of the charging station at the estimated arrival time every day in the historical information of the charging station within a preset time length;
and determining the charging electric quantity parameter according to the residual electric quantity of the charging station at the estimated arrival time every day.
5. The method according to any one of claims 1 to 4, wherein the screening of the first charging station set according to the current location and the remaining capacity of the vehicle to be charged comprises:
determining a travelable distance according to the residual electric quantity, the weather information and the road condition information;
determining a plurality of charging stations which can be reached by the vehicle to be charged according to the current position and the travelable distance;
a plurality of charging stations that can be reached by the vehicle to be charged are grouped into the first charging station set.
6. The method according to any one of claims 1-4, further comprising:
screening a preset number of charging stations with the maximum comprehensive service index from the first charging station set to form a second charging station set;
and sequencing the charging stations in the second charging station set according to the comprehensive service index, and outputting the sequenced charging stations.
7. A charging path planning apparatus, the apparatus comprising:
the charging system comprises an acquisition module, a charging module and a charging module, wherein the acquisition module is used for acquiring a charging request which comprises the current position and the residual electric quantity of a vehicle to be charged;
the processing module is used for screening to obtain a first charging station set according to the current position of the vehicle to be charged and the residual electric quantity, wherein the first charging station set comprises at least one charging station; determining a comprehensive service index of each charging station according to the charging station historical information and the vehicle historical information of each charging station in the first charging station set; determining the charging station with the maximum comprehensive service index as a target charging station from the first charging station set according to the comprehensive service index; and planning a charging path according to the current position of the vehicle to be charged and the position information of the target charging station.
8. A server, characterized in that the device comprises: a memory, a processor;
the memory is used for storing a computer program; the processor is configured to implement the charge path planning method according to any one of claims 1 to 6, according to the computer program stored in the memory.
9. A computer-readable storage medium, in which a computer program is stored, which, when being executed by a processor, is configured to implement the charging path planning method according to any one of claims 1 to 6.
10. A computer program product, characterized in that the computer program product comprises a computer program which, when being executed by a processor, implements the charging path planning method according to any one of claims 1 to 6.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211541429.2A CN115900744A (en) | 2022-12-02 | 2022-12-02 | Charging path planning method and device and server |
| PCT/CN2023/135333 WO2024114719A1 (en) | 2022-12-02 | 2023-11-30 | Charging path planning method and apparatus, and server |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211541429.2A CN115900744A (en) | 2022-12-02 | 2022-12-02 | Charging path planning method and device and server |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN115900744A true CN115900744A (en) | 2023-04-04 |
Family
ID=86489358
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202211541429.2A Pending CN115900744A (en) | 2022-12-02 | 2022-12-02 | Charging path planning method and device and server |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN115900744A (en) |
| WO (1) | WO2024114719A1 (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116432985A (en) * | 2023-06-09 | 2023-07-14 | 湖南智慧平安科技有限公司 | Intelligent community information processing method and system based on Internet of things |
| CN116489217A (en) * | 2023-06-21 | 2023-07-25 | 广汽埃安新能源汽车股份有限公司 | Charging station information pushing method and device |
| CN117698452A (en) * | 2024-02-06 | 2024-03-15 | 国网江苏省电力有限公司电力科学研究院 | Active charging guiding method and related device for electric automobile in Internet of vehicles environment |
| WO2024114719A1 (en) * | 2022-12-02 | 2024-06-06 | 浙江极氪智能科技有限公司 | Charging path planning method and apparatus, and server |
Family Cites Families (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR101752159B1 (en) * | 2015-11-23 | 2017-07-11 | 동의대학교 산학협력단 | Navigation apparatus and control method thereof |
| CN108981736B (en) * | 2018-05-28 | 2021-03-16 | 国网江苏省电力有限公司电力科学研究院 | Electric vehicle charging path optimization method based on user travel rule |
| CN109501630B (en) * | 2018-12-04 | 2022-06-10 | 国网电动汽车服务有限公司 | Real-time recommendation method and system for electric vehicle charging scheme |
| CN112498164A (en) * | 2020-11-30 | 2021-03-16 | 国网北京市电力公司 | Processing method and device of charging strategy |
| CN112665600B (en) * | 2020-12-03 | 2022-11-04 | 国网北京市电力公司 | Path planning method and device, computer readable storage medium and processor |
| CN113607177B (en) * | 2021-07-12 | 2024-03-19 | 河南财经政法大学 | Electric automobile intelligent charging path guiding method considering multi-source time-space data |
| CN114581180B (en) * | 2022-03-02 | 2024-01-12 | 北京百度网讯科技有限公司 | Charging station recommendation method, charging pile state determination method and device |
| CN114623844A (en) * | 2022-03-14 | 2022-06-14 | 车主邦（北京）科技有限公司 | Navigation data processing method, device, program product, medium and electronic equipment |
| CN114841543A (en) * | 2022-04-25 | 2022-08-02 | 湖南兴桩新能源科技有限公司 | AI-based charging pile operation state management method, device and storage medium |
| CN114954129A (en) * | 2022-06-10 | 2022-08-30 | 中国第一汽车股份有限公司 | Charging station information recommendation method and device, electronic terminal and storage medium |
| CN115391681A (en) * | 2022-08-30 | 2022-11-25 | 上汽通用五菱汽车股份有限公司 | Charging station recommendation method and device, electronic equipment and readable storage medium |
| CN115900744A (en) * | 2022-12-02 | 2023-04-04 | 浙江极氪智能科技有限公司 | Charging path planning method and device and server |
-
2022
- 2022-12-02 CN CN202211541429.2A patent/CN115900744A/en active Pending
-
2023
- 2023-11-30 WO PCT/CN2023/135333 patent/WO2024114719A1/en unknown
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2024114719A1 (en) * | 2022-12-02 | 2024-06-06 | 浙江极氪智能科技有限公司 | Charging path planning method and apparatus, and server |
| CN116432985A (en) * | 2023-06-09 | 2023-07-14 | 湖南智慧平安科技有限公司 | Intelligent community information processing method and system based on Internet of things |
| CN116432985B (en) * | 2023-06-09 | 2023-09-22 | 田凯文 | Intelligent community information processing method and system based on Internet of things |
| CN116489217A (en) * | 2023-06-21 | 2023-07-25 | 广汽埃安新能源汽车股份有限公司 | Charging station information pushing method and device |
| CN116489217B (en) * | 2023-06-21 | 2023-09-12 | 广汽埃安新能源汽车股份有限公司 | Charging station information pushing method and device |
| CN117698452A (en) * | 2024-02-06 | 2024-03-15 | 国网江苏省电力有限公司电力科学研究院 | Active charging guiding method and related device for electric automobile in Internet of vehicles environment |
| CN117698452B (en) * | 2024-02-06 | 2024-05-03 | 国网江苏省电力有限公司电力科学研究院 | Active charging guiding method and related device for electric automobile in Internet of vehicles environment |
Also Published As
| Publication number | Publication date |
|---|---|
| WO2024114719A1 (en) | 2024-06-06 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN115900744A (en) | Charging path planning method and device and server | |
| EP3702202B1 (en) | Method and system to optimize distributed charging station efficiency and user experience | |
| CA2951583C (en) | System and method for recommending charging station for electric vehicle | |
| US20200104965A1 (en) | Systems and methods for managing ridesharing vehicles | |
| Yuan et al. | p^ 2charging: Proactive partial charging for electric taxi systems | |
| EP2645062B1 (en) | Route search system and method for electric automobile | |
| CN109177802B (en) | Electric automobile ordered charging system and method based on wireless communication | |
| US20170043671A1 (en) | Control system for electric vehicle service network | |
| WO2013108246A2 (en) | Approximation of remaining travelable distance of a vehicle powered by a battery | |
| JP6672589B2 (en) | Power consumption prediction device, power consumption prediction method, server device | |
| WO2013024484A1 (en) | Estimation and management of loads in electric vehicle networks | |
| US11807120B2 (en) | Electric vehicle charging management system and method | |
| CN111815096B (en) | Shared automobile throwing method, electronic equipment and storage medium | |
| JP6428190B2 (en) | Shared vehicle management apparatus and shared vehicle management method | |
| JP2016143245A (en) | Server device and reservation acceptance method | |
| CN113306448A (en) | Charging prompting method, device, equipment and storage medium | |
| JP2013074776A (en) | Electric car charging system | |
| CN116756509A (en) | Energy management optimization method, device, equipment and storage medium | |
| JP6719501B2 (en) | Battery replacement fee determination system | |
| JP7403117B2 (en) | Car navigation system, method, and program for electric vehicles | |
| CN108229708B (en) | Reservation charging method and device based on unmanned aerial vehicle | |
| JP2023177413A (en) | Information processing device, information processing method and program | |
| US20220414553A1 (en) | Information processing device, information processing method and non-transitory computer readable medium | |
| TR2023006505A2 (en) | CHARGING PLAN SYSTEM AND METHOD FOR ELECTRIC VEHICLES | |
| CN116631074A (en) | Parking charging method and device based on calculation force and readable storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |