A method and device for planning a charging path for a vehicle
By binding the charging pile to the road section and using the A-star algorithm to calculate the charging path, combined with the charging preference strategy, the problem of electric vehicles' "charging anxiety" during long-distance driving is solved, and the driving route is achieved without affecting the driving route. Find the best charging path and combination effects.
Patent Information
- Application Number
- CN202111020258.4
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2021-09-01
- Publication Date
- 2024-11-26
- Estimated Expiration
- 2041-09-01
AI Technical Summary
The prior art cannot directly plan the charging path based on the remaining power of the vehicle, charging pile information and user path preferences, resulting in the electric vehicle being easily triggered 'charging anxiety' when driving long distances.
By binding the charging pile to the road segment to generate the charging circuit segment, calculate the charging circuit path based on the charging circuit segment and the road network, and use the A-star algorithm topology search to find the optimal charging path that meets the battery life needs. At the same time, select the best charging circuit based on the preset charging preference strategy Excellent charging combination.
It effectively alleviates the "charging anxiety" of electric vehicles during long-distance driving, ensuring that the optimal charging path and charging combination are found without affecting the user's driving route to meet the battery life needs.
Smart Images

Figure CN115727863B_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the field of navigation, and in particular to a method and device for planning a charging path for a vehicle. Background Art
[0002] With the development of new energy vehicles, the market share of electric vehicles has increased year by year. As one of the key indicators of electric vehicles, battery life has attracted widespread attention from all walks of life. At present, there are two main ways to ensure the battery life of electric vehicles: fast battery replacement of battery packs and charging with charging piles. Among the two battery life methods, charging with charging piles has a higher market share and therefore has a wider user group demand. In addition, charging piles are gradually being incorporated into urban planning and management as part of urban infrastructure.
[0003] However, in the existing technology, there is no technical solution that can directly plan the charging route based on the current remaining power of the vehicle, the charging pile information and the user's route preference. It is necessary to manually pay attention to the power and arrange the charging. Especially in the scenario of long-distance driving, it is easy to cause "charging anxiety" for electric vehicle drivers, which brings many inconveniences to electric vehicle users.
[0004] In order to overcome the above-mentioned defects of the prior art, there is an urgent need in the art for a vehicle charging route planning method, which is used to directly plan one or more charging routes according to the vehicle's current remaining power, charging pile information and user route preference, and calculate the optimal charging combination among multiple charging pile combinations on the charging route based on a preset preference strategy, so as to meet the endurance requirements without affecting the user's planned driving route, and effectively alleviate the "charging anxiety" problem of electric vehicles during long-distance driving. Summary of the invention
[0005] A brief summary of one or more aspects is given below to provide a basic understanding of these aspects. This summary is not an exhaustive overview of all conceived aspects, and is neither intended to identify the key or critical elements of all aspects nor to define the scope of any or all aspects. Its only purpose is to give some concepts of one or more aspects in a simplified form as a prelude to a more detailed description that will be given later.
[0006] In order to overcome the above-mentioned defects of the prior art, the present invention provides a method for planning a charging path for a vehicle, comprising: binding charging piles to road sections to generate charging sections; generating a charging road network based on the charging sections; calculating a charging path based on the charging sections and the charging road network; and selecting an optimal charging pile charging combination in the charging path based on a preset charging preference strategy.
[0007] In one embodiment, preferably, the charging path is calculated based on the charging road section and the charging road network, including: matching the starting point to the road, and adding the vector node connected to the starting point as a forward vector node to the forward open table; matching the end point to the road, and adding the vector node connected to the end point as a reverse vector node to the reverse open table; in response to the forward open table and the reverse open table being both not empty, using the A-star algorithm to topologically step outward from the starting point to the forward vector node, calculating the remaining mileage of the forward vector node and updating the vector node connected to the forward vector node and not passed through as a new forward vector node to the forward open table, and at the same time using the A-star algorithm to topologically step outward from the end point to the reverse vector node, calculating the remaining mileage of the reverse vector node and updating the vector node connected to the reverse vector node and not passed through as a new reverse vector node to the reverse open table, and so on until the forward vector node meets the reverse vector node; and judging whether the remaining mileage of the forward vector node and the reverse vector node after meeting meet the remaining mileage condition, in response to the remaining mileage condition being met, the charging path is found and the calculation ends.
[0008] In one embodiment, preferably, the charging path planning method also includes: adding a charging index section in the charging road network, the charging index section is used to identify the charging section passed through so as to calculate the remaining mileage; calculating the remaining mileage of the forward vector node and calculating the remaining mileage of the reverse vector node, including: in response to the section in the current forward or reverse vector node being a charging index section, the remaining mileage of the current vector node is the vehicle's cruising range minus the distance from the current vector node to the nearest charging section passed in the topological process; and in response to the section in the current forward or reverse vector node being not a charging index section, the remaining mileage of the current vector node is the remaining mileage of the previous vector node in the topological process minus the section length of the current vector node.
[0009] Another aspect of the present invention provides a charging path planning device for a vehicle, comprising: a memory; and a processor coupled to the memory, wherein the processor is configured to implement the steps of any of the above-mentioned charging path planning methods.
[0010] The present invention also provides a computer-readable medium having a computer program stored thereon, and when the computer program is executed by a processor, the steps of any of the above-mentioned charging path planning methods are implemented.
[0011] The vehicle charging route planning method provided by the present invention can directly plan one or more charging routes according to the current remaining power of the vehicle, charging pile information and user route preference, and can calculate the optimal charging combination among multiple charging pile combinations on the charging route based on a preset preference strategy, thereby meeting the endurance requirements without affecting the user's planned driving route, and effectively alleviating the "charging anxiety" problem of electric vehicles during long-distance driving. BRIEF DESCRIPTION OF THE DRAWINGS
[0012] The above features and advantages of the present invention can be better understood after reading the detailed description of the embodiments of the present disclosure in conjunction with the following drawings. In the drawings, the components are not necessarily drawn to scale, and components with similar related properties or features may have the same or similar reference numerals.
[0013] Figure 1 is a schematic diagram of a method flow chart of a vehicle charging path planning method according to one aspect of the present invention;
[0014] Figure 2 is a schematic diagram of binding a charging pile to a road section according to an embodiment of the present invention;
[0015] Figure 3 is a schematic diagram of a charging network according to an embodiment of the present invention;
[0016] Figure 4 is a schematic diagram of a node topology process according to an embodiment of the present invention;
[0017] Figure 5 is a schematic diagram of the location of the lower high-speed charging index section according to an embodiment of the present invention;
[0018] Figure 6 is a schematic diagram of the location of an index road section for charging in a service area according to an embodiment of the present invention;
[0019] Figure 7 is a schematic flow chart of a method for calculating a charging path according to an embodiment of the present invention;
[0020] Figure 8 is a schematic diagram of selecting an optimal charging pile charging combination on a charging path according to an embodiment of the present invention; and
[0021] Fig. 9 2 is a schematic diagram of the structure of a vehicle charging path planning device according to another aspect of the present invention.
[0022] For the sake of clarity, a brief description of the reference numerals is given below:
[0023] 501 down high-speed charging index section
[0024] Highway 502 interchange
[0025] 503 Charging Section
[0026] 601 Charging Section
[0027] 602 Go to the service area to charge the index section
[0028] 801 Optimal Charging Pile Combination DETAILED DESCRIPTION
[0029] The following specific embodiments illustrate the implementation of the present invention, and those skilled in the art can easily understand other advantages and effects of the present invention from the contents disclosed in this specification. Although the description of the present invention will be introduced in conjunction with the preferred embodiment, this does not mean that the features of this invention are limited to this implementation. On the contrary, the purpose of introducing the invention in conjunction with the implementation is to cover other options or modifications that may be extended based on the claims of the present invention. In order to provide a deep understanding of the present invention, the following description will include many specific details. The present invention can also be implemented without using these details. In addition, in order to avoid confusion or blurring the focus of the present invention, some specific details will be omitted in the description.
[0030] In the description of the present invention, it should be noted that, unless otherwise clearly specified and limited, the terms "installed", "connected", and "connected" should be understood in a broad sense, for example, it can be a fixed connection, a detachable connection, or an integral connection; it can be a mechanical connection or an electrical connection; it can be a direct connection, or it can be indirectly connected through an intermediate medium, or it can be the internal communication of two components. For ordinary technicians in this field, the specific meanings of the above terms in the present invention can be understood according to specific circumstances.
[0031] In addition, the terms "upper", "lower", "left", "right", "top", "bottom", "horizontal" and "vertical" used in the following description should be understood as the directions shown in the paragraph and the related drawings. Such relative terms are only used for the convenience of description and do not mean that the device described therein must be manufactured or operated in a specific direction, and therefore should not be understood as limiting the present invention.
[0032] It is understood that although the terms "first", "second", "third", etc. may be used herein to describe various components, regions, layers and / or parts, these components, regions, layers and / or parts should not be limited by these terms, and these terms are only used to distinguish different components, regions, layers and / or parts. Therefore, the first component, region, layer and / or part discussed below may be referred to as a second component, region, layer and / or part without departing from some embodiments of the present invention.
[0033] In order to overcome the above-mentioned defects of the prior art, the present invention provides a vehicle charging route planning method, which can directly plan one or more charging routes according to the current remaining power of the vehicle, charging pile information and user route preference, and can calculate the optimal charging combination among multiple charging pile combinations on the charging path based on a preset preference strategy, so as to meet the endurance requirements without affecting the user's planned driving route, and effectively alleviate the "charging anxiety" problem of electric vehicles during long-distance driving.
[0034] Figure 1 The figure is a flow chart of a method for planning a vehicle charging path according to one aspect of the present invention.
[0035] Please refer to Figure 1 The vehicle charging path planning method 100 provided by the present invention includes:
[0036] Step 101: Bind the charging pile to the road section to generate a charging section.
[0037] In one embodiment, a charging pile is bound to a road section to generate a charging section, including: in response to the existence of an associated road section for the charging pile, the charging pile is bound to the associated road section to generate a charging section; in response to the absence of an associated road section for the charging pile, a road section with a matching name nearby is bound to the charging pile to generate a charging section; in response to the absence of an associated road section for the charging pile and the absence of a road section with a matching name nearby, the road section closest to the charging pile is bound to the charging pile to generate a charging section.
[0038] Figure 2 It is a schematic diagram of binding a charging pile with a road section according to an embodiment of the present invention.
[0039] Please refer to Figure 2 , lines represent roads, and dots represent charging piles. If a charging pile has an associated road section, the charging pile is directly bound to the associated road section. The associated road sections of the charging piles are pre-stored in the map database.
[0040] If a charging pile does not have an associated road section, check whether there is a road with a matching name near the charging pile. For example, if a charging pile is named "Guilin Road Charging Pile" and is located near "Guilin Road", then "Guilin Road Charging Pile" is bound to "Guilin Road".
[0041] If a charging pile has neither an associated road section nor a nearby road with a matching name, the charging pile will be bound to the road section with a closer distance. Figure 2 In the illustrated embodiment, the road sections indicated by the short bold lines are the charging road sections to which the charging piles indicated by the dots are bound.
[0042] Please go back Figure 1The vehicle charging path planning method 100 provided by the present invention further includes:
[0043] Step 102: Generate a charging road network based on the charging road segments.
[0044] In one embodiment, a charging road network is generated based on charging sections, including: traversing the highest functional level section, and in response to the highest level section being able to reach any charging section within the vehicle's cruising range, adding the highest level section to the charging road network; and traversing all charging sections, and in response to the distance between any two charging sections not exceeding the vehicle's cruising range, using the two charging sections as starting points and end points for route calculation, and adding functional level sections of Class III highways and above in the calculated path to the charging road network.
[0045] Figure 3 FIG. 4 is a schematic diagram of a charging network according to an embodiment of the present invention.
[0046] my country divides roads into five functional levels, namely expressways, first-class highways, second-class highways, third-class highways, and fourth-class highways, according to their usage tasks, functions, and traffic volume. In the step of generating a charging network, the sections with the highest functional level, i.e., the national expressways, are first traversed. If the highest-level section can reach any charging section within the vehicle's cruising range (e.g., 300 kilometers), it will be added to the charging network. The cruising range of a vehicle varies depending on the vehicle manufacturer and model, and is not used to limit the scope of protection of the present invention.
[0047] In addition, for all charging sections generated in step 101, if the distance between any two charging sections does not exceed the vehicle's cruising range, the two sections are used as the starting point and the end point for route calculation, and the sections with higher functional levels in the calculated path are added to the charging network.
[0048] Figure 3 The embodiment of FIG. 1 shows a charging network for a certain vehicle model generated according to the above method. It can be seen from the figure that the charging network generated by this method covers most of the administrative areas of my country. At the same time, the density of the charging network is positively correlated with the development level of the urban area.
[0049] Please come back Figure 1 The vehicle charging path planning method 100 provided by the present invention further includes:
[0050] Step 103: Calculate the charging path based on the charging road segment and the charging road network.
[0051] In one embodiment, a charging path is calculated based on a charging road section and a charging road network, including: matching a starting point to a road, and adding a vector node connected to the starting point as a forward vector node to a forward open table; matching an end point to a road, and adding a vector node connected to the end point as a reverse vector node to a reverse open table; in response to the forward open table and the reverse open table being both not empty, using an A-star algorithm to topologically step outward from the starting point to the forward vector node, calculating the remaining mileage of the forward vector node and updating the vector node connected to the forward vector node and not passed through as a new forward vector node to the forward open table, and at the same time using an A-star algorithm to topologically step outward from the end point to the reverse vector node, calculating the remaining mileage of the reverse vector node and updating the vector node connected to the reverse vector node and not passed through as a new reverse vector node to the reverse open table, and so on until the forward vector node meets the reverse vector node; and judging whether the remaining mileage of the forward vector node and the reverse vector node after meeting each other meets the remaining mileage condition, and in response to the remaining mileage condition being met, the charging path is found and the calculation ends.
[0052] Figure 4 FIG. 4 is a schematic diagram of a node topology process according to an embodiment of the present invention.
[0053] Please refer to Figure 4 , the environmental features in the map are represented by nodes and the line segments connected to the nodes, and a node and the line segments connected to the node constitute the basic vector nodes in the path calculation. Figure 4 In the embodiment shown, three basic vector nodes are included: A, B, and C. The vector nodes B and C are generated by extending the nodes of the vector node A outward, that is, B and C are topologically generated outward from A, and this process is called topology.
[0054] The open table is used to store basic vector nodes that have not been topologically processed, such as Figure 4 The vector nodes B and C in the illustrated embodiment have a bidirectional topology algorithm, and thus include two open tables, a forward open table and a reverse open table. The forward open table is used to store vector nodes that have not been topologically processed from the starting point topology, and the reverse open table is used to store vector nodes that have not been topologically processed from the end point topology. When the vector nodes in the open tables on both sides meet, it means that a path has been found.
[0055] The A-Star (A*) algorithm is the most effective direct search method for solving the shortest path in a static road network, and is also an effective algorithm for solving many search problems. The closer the distance estimate in the algorithm is to the actual value, the faster the final search speed. It is expressed by the formula: f*(n) = g*(n) + h*(n), where f*(n) is the minimum cost estimate from the initial state to the target state via state n, g*(n) is the minimum cost from the initial state to state n in the state space, and h*(n) is the minimum estimated cost of the path from state n to the target state. In the path search problem, the state is the node in the graph and the cost is the distance.
[0056] In one embodiment, the charging path is calculated based on the charging road segment and the charging road network, and further includes: in the topology process, after the vector node topology on the non-charging road network reaches a preset number of times, the topology is jumped, and the subsequent topology is only performed on the charging road network. This process is called jumping.
[0057] The present invention introduces charging index sections in the calculation of the remaining mileage. In one embodiment, the charging index sections include: a lower expressway charging index section, which connects the expressway conversion entrance and exit and the charging section, and the length of the lower expressway charging index section is within a preset distance range; a service area charging index section, which is a highway section connecting a service area with charging piles; and an easy-to-charge index section, which is a functional level section of a third-level highway or above, the distance to any charging section being within a preset distance range.
[0058] Figure 5 is a schematic diagram of the location of the lower high-speed charging index section according to an embodiment of the present invention; Figure 6 FIG. 4 is a schematic diagram of the location of an index road section for charging in a service area according to an embodiment of the present invention.
[0059] Please refer to Figure 5 , a charging section 503 is located under a section of a highway, and is connected to the highway through a highway conversion entrance and exit (IC section) 502. Therefore, the section connecting the highway and the highway conversion entrance and exit 502 is the lower highway charging index section 501.
[0060] Please refer to Figure 6 A service area is located near a certain expressway section. The service area is equipped with charging piles. The expressway section connected to the charging section 601 corresponding to the charging piles is the charging index section 602 to the service area.
[0061] In addition to the charging index sections for exiting the expressway and going to the service area, the charging index sections also include easy-to-charge index sections. The three types of charging index sections together provide a reference basis for calculating the remaining mileage conditions.
[0062] In one embodiment, the charging path planning method also includes: adding a charging index section in the charging road network, the charging index section is used to identify the charging section passed through so as to calculate the remaining mileage; calculating the remaining mileage of the forward vector node and calculating the remaining mileage of the reverse vector node, including: in response to the section in the current forward or reverse vector node being a charging index section, the remaining mileage of the current vector node is the vehicle's cruising range minus the distance from the current vector node to the nearest charging section passed in the topological process; and in response to the section in the current forward or reverse vector node being not a charging index section, the remaining mileage of the current vector node is the remaining mileage of the previous vector node in the topological process minus the section length of the current vector node.
[0063] In one embodiment, the remaining mileage condition includes: the sum of the remaining mileage of the forward vector node after the encounter plus the remaining mileage of the reverse vector node after the encounter is greater than the vehicle's cruising range.
[0064] Figure 7 FIG. 4 is a flow chart of a method for calculating a charging path according to an embodiment of the present invention.
[0065] exist Figure 7 In the illustrated embodiment, the calculation of the charging path first executes step 701: matching the start point and the end point to the road and generating vector nodes, which are added to the forward open table and the reverse open table respectively.
[0066] Next, execute step 702: determine whether the forward open list is empty.
[0067] If the forward open table is empty, it means that the starting point vector node cannot expand the topology to the periphery, and there are no surrounding vector nodes that can be connected to the starting point, and the path calculation fails.
[0068] If the forward open table is not empty, execute step 703: take out the vector node from the forward open table for topology. Set the loop condition and execute the judgment step 704 at the same time: judge whether the forward vector and the reverse vector meet, and add new vector nodes to the forward open table for external topology according to whether the layer requirements are met and the remaining power of the vector node. Finally, execute step 705: judge whether the remaining power of the vector node meets the remaining mileage condition when meeting.
[0069] When the loop condition of the forward topology is met, step 706 still needs to be executed: determine whether the reverse open table is empty. If it is empty, the calculation fails. If it is not empty, further start the external topology from the end point and fill the reverse open table.
[0070] Similar to the forward topology, in the reverse topology process, step 708 needs to be executed: determining whether the reverse vector meets the forward vector, until step 709: determining whether the remaining power of the vector node at the time of meeting meets the remaining mileage condition.
[0071] If the remaining power of the vector node when they meet meets the remaining mileage condition, the forward topology and the reverse topology will "join forces victoriously" and successfully calculate the optimal charging path.
[0072] Please go back Figure 1 The vehicle charging path planning method 100 provided by the present invention further includes:
[0073] Step 104: Select the optimal charging pile charging combination in the charging path based on the preset charging preference strategy.
[0074] In one embodiment, selecting the optimal charging pile charging combination in the charging path based on a preset charging preference strategy includes: traversing the charging combinations of all charging piles in the charging path; and comparing and selecting among multiple charging combinations based on the charging preference strategy to obtain the optimal charging pile charging combination.
[0075] In one embodiment, the charging preference strategy includes: a combination with fewer charging times is preferred.
[0076] Furthermore, in one embodiment, in response to the same number of charging times, the charging preference strategy also includes one or more of the following: a charging combination that passes through more service area charging piles or includes more charging sections in the charging path is preferred; a charging combination that passes through more fast-charging charging piles in the charging path is preferred; a charging combination that goes on and off the highway fewer times in the charging path is preferred; and a charging combination that is shorter the distance from the main route to the charging pile in the charging path is preferred.
[0077] Those skilled in the art will appreciate that the above-mentioned charging preference strategy is only provided for illustrative purposes to more clearly illustrate the technical solution of selecting the optimal charging pile charging combination under a specific charging preference strategy in the present invention, and is not intended to limit the scope of protection of the present invention. Any charging preference strategy formulated based on actual needs should fall within the scope of protection of the present invention.
[0078] Figure 8 FIG. 4 is a schematic diagram of selecting an optimal charging pile charging combination on a charging path according to an embodiment of the present invention.
[0079] Please refer to Figure 8 In one embodiment, the thick line segment in the figure represents the calculated charging path, on which there are multiple charging piles along the charging path. Figure 8Each charging station has two options: charging and not charging. Therefore, there are multiple charging stations on this charging path that have multiple charging combinations. Based on a specific charging preference strategy, the multiple combinations are ranked by merit, and finally the Figure 8 The optimal charging pile combination 801 represented by the grey dots is the optimal charging pile charging combination result selected on the charging path based on the charging preference strategy.
[0080] Although the above methods are illustrated and described as a series of actions for simplicity of explanation, it should be understood and appreciated that these methods are not limited by the order of the actions, because according to one or more embodiments, some actions may occur in a different order and / or concurrently with other actions from those illustrated and described herein or not illustrated and described herein but understandable to those skilled in the art.
[0081] Another aspect of the present invention provides a charging path planning device for a vehicle, comprising: a memory; and a processor coupled to the memory, wherein the processor is configured to implement the steps of any of the above-mentioned charging path planning methods.
[0082] Fig. 9 2 is a schematic diagram of the structure of a vehicle charging path planning device according to another aspect of the present invention.
[0083] like Fig. 9 As shown, the computer system / server 900 of the charging path planning device is in the form of a general computer device. The components of the computer system / server 900 may include one or more processors 902, a memory 901, and a bus 903 connecting different system components (including the memory 901 and the processor 902).
[0084] The bus 903 includes a data bus, an address bus, and a control bus. The product of the number of bits of the data bus and the operating frequency is proportional to the data transmission rate, the number of bits of the address bus determines the maximum addressable memory space, and the control bus (read / write) indicates the type of bus cycle and the time when the input / output operation is completed. The processor 902 is connected to the memory 901 via the bus 903 and is configured to implement the vehicle control method provided by any of the above embodiments.
[0085] The processor 902 is the computing and control core of the computer system / server 900 of the charging route planning device and is the final execution unit for information processing and program operation. The operations of all software layers in the computer system will eventually be mapped to the operations of the processor 902 through the instruction set. The functions of the processor 902 are mainly to process instructions, execute operations, control time, and process data.
[0086] The memory 901 refers to various storage devices in a computer for storing programs and data. The memory 901 may include a computer system readable medium in the form of a volatile memory, such as a random access memory (RAM) 904 and / or a cache memory 905 .
[0087] The random access memory (RAM) 904 is an internal memory that directly exchanges data with the processor 902. It can be read and written at any time (except when refreshing) and is very fast. It is usually used as a temporary data storage medium for the operating system or other running programs. Once the power is off, the data stored in it will be lost. The cache memory (Cache) 905 is a primary memory between the main memory and the processor 902. Its capacity is relatively small but its speed is much higher than the main memory, close to the speed of the processor 902.
[0088] The computer system / server 900 may further include other removable / non-removable, volatile / non-volatile computer system storage media. In this embodiment, the storage system 906 may be used to read and write non-removable, non-volatile magnetic media.
[0089] The memory 901 may also include at least one set of program modules 907. The program modules 907 may be stored in the memory 901. The program modules 907 include, but are not limited to, an operating system, one or more application programs, other program modules, and program data, each of which or some combination thereof may include an implementation of a network environment. The program modules 907 generally perform the functions and / or methods of the embodiments described in the present invention.
[0090] The computer system / server 900 may also communicate with one or more external devices 908 (e.g., keyboards, pointing devices, displays 909, etc.), one or more devices that enable a user to interact with the computer system / server 900, and / or any device that enables the computer system / server 900 to communicate with one or more other computing devices (e.g., network cards, modems, etc.). Such communication may occur through an input / output (I / O) interface 910.
[0091] The computer system / server 900 may also communicate with one or more networks (eg, a local area network (LAN), a wide area network (WAN), and / or a public network such as the Internet) via a network adapter 911. Fig. 9As shown, the network adapter 911 communicates with other modules of the computer system / server 900 via the bus 903. It should be understood that, although not shown in the figure, other hardware and / or software modules can be used in conjunction with the computer system / server 900, including but not limited to: microcode, device drivers, redundant processing units, external disk drive arrays, RAID systems, tape drives, and data backup storage systems.
[0092] The present invention also provides an embodiment of a computer readable medium, wherein a computer program is stored on the computer storage medium. When the computer program is executed by a processor, the steps of any one of the above-mentioned vehicle charging path planning methods can be implemented.
[0093] Those skilled in the art will appreciate that information, signals, and data may be represented using any of a variety of different technologies and techniques. For example, data, instructions, commands, information, signals, bits, symbols, and chips cited throughout the above description may be represented by voltage, current, electromagnetic waves, magnetic fields or magnetic particles, optical fields or optical particles, or any combination thereof.
[0094] Those skilled in the art will further appreciate that the various illustrative logic blocks, modules, circuits, and algorithm steps described in conjunction with the embodiments disclosed herein may be implemented as electronic hardware, computer software, or a combination of the two. To clearly illustrate this interchangeability of hardware and software, various illustrative components, blocks, modules, circuits, and steps are generally described above in terms of their functionality. Whether such functionality is implemented as hardware or software depends on the specific application and the design constraints imposed on the overall system. The technician may implement the described functionality in different ways for each specific application, but such implementation decisions should not be interpreted as resulting in a departure from the scope of the present invention.
[0095] The processor described in this case can be implemented using electronic hardware, computer software or any combination thereof. Whether such processors are implemented as hardware or software will depend on the specific application and the overall design constraints imposed on the system. As an example, the processor presented in this disclosure, any part of the processor, or any combination of processors can be implemented with a microprocessor, a microcontroller, a digital signal processor (DSP), a field programmable gate array (FPGA), a programmable logic device (PLD), a state machine, a gated logic, a discrete hardware circuit, and other suitable processing components configured to perform various functions described throughout this disclosure. The functionality of the processor presented in this disclosure, any part of the processor, or any combination of processors can be implemented with software executed by a microprocessor, a microcontroller, a DSP or other suitable platforms.
[0096] The steps of the method or algorithm described in conjunction with the embodiments disclosed herein may be embodied directly in hardware, in a software module executed by a processor, or in a combination of the two. The software module may reside in a RAM memory, a flash memory, a ROM memory, an EPROM memory, an EEPROM memory, a register, a hard disk, a removable disk, a CD-ROM, or any other form of storage medium known in the art. An exemplary storage medium is coupled to a processor so that the processor can read and write information from / to the storage medium. In an alternative, a storage medium may be integrated into a processor. The processor and the storage medium may reside in an ASIC. The ASIC may reside in a user terminal. In an alternative, the processor and the storage medium may reside in a user terminal as discrete components.
[0097] In one or more exemplary embodiments, the functions described may be implemented in hardware, software, firmware, or any combination thereof. If implemented as a computer program product in software, each function may be stored on or transmitted by a computer-readable medium as one or more instructions or codes. Computer-readable media include both computer storage media and communication media, including any medium that facilitates the transfer of a computer program from one place to another. Storage media may be any available medium that can be accessed by a computer. As an example and not limitation, such a computer-readable medium may include RAM, ROM, EEPROM, CD-ROM or other optical disk storage, disk storage or other magnetic storage device, or any other medium that can be used to carry or store the desired program code in the form of an instruction or data structure and can be accessed by a computer. Any connection is also properly referred to as a computer-readable medium. For example, if the software is transmitted from a website, a server, or other remote source using a coaxial cable, a fiber optic cable, a twisted pair, a digital subscriber line (DSL), or wireless technologies such as infrared, radio, and microwaves, the coaxial cable, fiber optic cable, twisted pair, DSL, or wireless technologies such as infrared, radio, and microwaves are included in the definition of the medium. Disk and disc as used herein include compact disc (CD), laser disc, optical disc, digital versatile disc (DVD), floppy disk and Blu-ray disc, wherein disk often reproduces data magnetically, while disc reproduces data optically with lasers. Combinations of the above should also be included within the scope of computer-readable media.
[0098] The previous description of the disclosure is provided to enable any person skilled in the art to make or use the disclosure. Various modifications to the disclosure will be apparent to those skilled in the art, and the general principles defined herein may be applied to other variations without departing from the spirit or scope of the disclosure. Thus, the disclosure is not intended to be limited to the examples and designs described herein, but should be granted the widest scope consistent with the principles and novel features disclosed herein.
Claims
1. A method for planning a charging path for a vehicle, comprising: Bind charging piles to road sections to generate charging sections; Generating a charging road network based on the charging road segment includes: traversing the highest functional level road segment, and in response to the highest functional level road segment being able to reach any of the charging road segments within the cruising range of the vehicle, adding the highest functional level road segment to the charging road network; and traversing all the charging road segments, and in response to the distance between any two of the charging road segments not exceeding the cruising range of the vehicle, using the two charging road segments as starting points and end points to calculate the route, and adding the functional level road segments of Class III highway and above in the calculated path to the charging road network; Calculating a charging path based on the charging road section and the charging road network includes: Match the starting point to the road, and add the vector node connected to the starting point as a forward vector node to the forward open table; Match the end point to the road, and add the vector node connected to the end point as a reverse vector node to the reverse open table; In response to the forward open table and the reverse open table being both not empty, the A-star algorithm is used to topologically step outward from the starting point to the forward vector node, calculate the remaining mileage of the forward vector node, and update the vector nodes connected to the forward vector node and not passed through as new forward vector nodes to the forward open table, and the A-star algorithm is used to topologically step outward from the end point to the reverse vector node, calculate the remaining mileage of the reverse vector node, and update the vector nodes connected to the reverse vector node and not passed through as new reverse vector nodes to the reverse open table, and so on until the forward vector node meets the reverse vector node; and Determine whether the remaining mileage of the forward vector node and the reverse vector node after the encounter meets the remaining mileage condition, and in response to satisfying the remaining mileage condition, find the charging path and end the calculation; Wherein, a charging index road section is added in the charging road network, and the charging index road section is used to identify the charging road section passed through so as to calculate the remaining mileage; The calculating the remaining mileage of the forward vector node and the calculating the remaining mileage of the reverse vector node include: In response to the road segment in the current forward or reverse vector node being the charging index road segment, the remaining mileage of the current vector node is the vehicle cruising range minus the distance from the current vector node to the nearest charging road segment passed in the topology process; and In response to the road segment in the current forward or reverse vector node not being the charging index road segment, the remaining mileage of the current vector node is the remaining mileage of the previous vector node in the topology process minus the road segment length of the current vector node; and In the charging path, an optimal charging pile charging combination is selected based on a preset charging preference strategy.
2. The charging path planning method according to claim 1, characterized in that: The calculating of the charging path based on the charging road section and the charging road network further includes: In the topology process, after the vector nodes on the non-charging network are topologically transferred to the vector nodes on the charging network for a preset number of times, the subsequent topology is only performed on the charging network.
3. The charging path planning method according to claim 1, characterized in that: The remaining mileage conditions include: The sum of the remaining mileage of the forward vector node after the encounter plus the remaining mileage of the reverse vector node after the encounter is greater than the vehicle's cruising range.
4. The charging path planning method according to claim 1, characterized in that: The charging index section includes: A lower high-speed charging index section, wherein the lower high-speed charging index section connects the highway conversion entrance and exit and the charging section, and the length of the lower high-speed charging index section is within a preset distance range; An index road section to a service area for charging, wherein the index road section to a service area for charging is a high-speed road section connecting a service area with charging piles; and The easy-to-charge index section is a functional level section of a third-level highway or above, where the distance to any of the charging sections is within a preset distance range.
5. The charging path planning method according to claim 1, characterized in that: The step of binding the charging pile to the road section to generate the charging road section includes: In response to the existence of an associated road section for the charging pile, binding the charging pile with the associated road section to generate the charging road section; In response to the charging pile not having the associated road section, binding a nearby road section with a matching name to the charging pile to generate the charging road section; In response to the charging pile not having the associated road section and no road section with a matching name nearby, the road section closest to the charging pile is bound to the charging pile to generate a charging road section.
6. The charging path planning method according to claim 1, characterized in that: The step of selecting the optimal charging pile charging combination in the charging path based on a preset charging preference strategy includes: Traversing the charging combinations of all the charging piles in the charging path; Based on the charging preference strategy, a comparison is made among the plurality of charging combinations to obtain the optimal charging pile charging combination.
7. The charging path planning method according to claim 6, characterized in that: The charging preference strategy includes: The combination with fewer charging times is better.
8. The charging path planning method according to claim 7, characterized in that: In response to the same number of charging times, the charging preference strategy further includes one or more of the following: A charging combination that passes through a service area charging pile or contains more charging sections in the charging path is more preferred; The charging combination with more fast charging piles in the charging path is better; The charging combination with fewer times of getting on and off the highway in the charging path is more optimal; and The charging combination with a shorter distance from the main route to the charging pile in the charging path is more optimal.
9. A charging path planning device for a vehicle, comprising: Memory; as well as A processor coupled to the memory, the processor being configured to implement the steps of the charging path planning method according to any one of claims 1 to 8.
10. A computer readable medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the steps of the charging path planning method according to any one of claims 1 to 8 are implemented.
