Method, system and equipment for planning battery swap station
By displaying and editing candidate points of battery swap stations on the map, the problems of low planning efficiency and inaccurate site selection in the existing technology are solved, and more efficient and accurate planning and site selection are achieved.
Patent Information
- Application Number
- CN202510211962.X
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2025-02-25
- Publication Date
- 2025-05-30
AI Technical Summary
The existing battery swap station planning mainly relies on manual experience and lacks scientific and efficient planning methods, resulting in low planning efficiency and inaccurate site selection.
A battery swap station planning method is provided. By displaying the battery swap station candidate points in the target area on the map and receiving user editing requests, the candidate points are added, modified and deleted, thereby improving the efficiency of planning and the accuracy of site selection.
Through this method, not only can the site selection planning of the battery swap station be viewed on the map, but also the candidate points can be added, deleted and changed, which significantly improves the efficiency of the battery swap station planning and the accuracy of the site selection.
Smart Images

Figure CN120069449A_ABST
Abstract
Description
Technical Field
[0001] This application relates to the technical field of vehicles, and particularly to a planning method, system and device for a battery swapping station. Background Art
[0002] With the rapid development of new energy vehicles, the battery swapping station, as an important facility for energy supply of new energy vehicles, the importance of its network planning has become increasingly prominent. However, the existing planning of battery swapping stations mainly relies on manual experience and lacks scientific and efficient planning means. Due to the lack of intuitive and accurate planning means for the battery swapping station network, on average, each time a new station project is planned, it usually needs to go through multiple internal discussions among operation personnel, which takes too long. The time-consuming and laborious planning caused by the lack of quantitative analysis and standardization makes the network planning of battery swapping stations time-consuming and laborious. Summary of the Invention
[0003] Based on this, it is necessary to provide a planning method, system and device for a battery swapping station to effectively improve the efficiency of battery swapping station planning and the accuracy of site selection for the above technical problems.
[0004] In a first aspect, a planning method for a battery swapping station is provided, including:
[0005] Responding to a display request from a user, displaying candidate points of battery swapping stations in a target area on a map, where the candidate points are generated based on multi-source data of the target area;
[0006] Receiving an editing request from the user for the candidate points on the map;
[0007] Editing the candidate points according to the editing request, where editing the candidate points includes at least one of adding candidate points, modifying candidate points, and deleting candidate points.
[0008] In some examples, the editing of the candidate points according to the editing request includes:
[0009] For the operation of adding a candidate station, performing a circle selection within the target area according to a preset radius range;
[0010] When the circle selection area is confirmed, displaying the added candidate points in the circle selection area, where the radius of the circle selection area is within the radius range.
[0011] In some examples, the editing of the candidate points according to the editing request includes:
[0012] For the operation of modifying a candidate point, responding to the user's modification operation to change the position or the radius of the candidate point.
[0013] In some examples, editing the candidate location according to the editing request further includes:
[0014] Setting the level of the candidate location, where candidate locations of different levels are distinguished and displayed on the map in different colors.
[0015] In some examples, it further includes:
[0016] Receiving a regional planning request from the user for the target area on the map;
[0017] Drawing different divided areas within the target area according to the regional planning request, where different divided areas are distinguished and displayed in different colors.
[0018] In some examples, drawing different divided areas within the target area according to the regional planning request includes:
[0019] Drawing a closed area of any shape within the target area;
[0020] When the closed area is confirmed, obtaining a first divided area and displaying the first divided area in the corresponding color within the target area.
[0021] In some examples, displaying the first divided area in the corresponding color within the target area includes:
[0022] Setting the type of the first divided area;
[0023] Obtaining a corresponding target color according to the type and displaying the first divided area in the target color within the target area.
[0024] In some examples, responding to the user's display request and displaying candidate locations of battery swapping stations in the target area on the map includes:
[0025] Determining the target area according to the user's location information or the area selected by the user from the area list;
[0026] Obtaining multi-source data of the target area, where the multi-source data includes some or all of battery swapping station distribution, competitor battery swapping station distribution, urban road network, building distribution, and heat map of operating vehicle driving trajectories;
[0027] Generating candidate locations of the battery swapping stations according to the multi-source data and displaying the candidate locations of the battery swapping stations in the target area on the map.
[0028] In a second aspect, a planning system for a battery swapping station is provided, including:
[0029] A display module, configured to respond to a user's display request and display candidate points of battery swapping stations in a target area on a map, wherein the candidate points are generated based on multi-source data of the target area;
[0030] A receiving module, configured to receive an editing request of the user for the candidate points on the map;
[0031] An editing module, configured to edit the candidate points according to the editing request, wherein editing the candidate points includes at least one of adding candidate points, modifying candidate points, and deleting candidate points.
[0032] In a third aspect, a computer device is provided, including a memory, a processor, and a computer program stored on the memory and executable on the processor. When the processor executes the program, the planning method of the battery swapping station according to the first aspect is implemented.
[0033] By adopting the embodiments of the present application, candidate points of battery swapping stations in a target area are displayed on a map, then an editing request of the user for the candidate points on the map can be received, and finally, the candidate points are edited according to the editing request. Thus, not only can relevant information such as the site selection plan of the battery swapping station be viewed on the map, but also operations such as adding, deleting, and changing candidate points for the site selection of the battery swapping station can be performed, thereby improving the efficiency of battery swapping station planning and the accuracy of site selection. Description of the Drawings
[0034] By reading the detailed description of the non-restrictive embodiments with reference to the following drawings, other features, objectives, and advantages of the present application will become more obvious:
[0035] Figure 1 It is a flowchart of the planning method of the battery swapping station provided by the embodiment of the present application;
[0036] Figure 2 It is an application schematic diagram of the planning method of the battery swapping station provided by the embodiment of the present application;
[0037] Figure 3 It is a structural block diagram of the planning system of the battery swapping station provided by the embodiment of the present application;
[0038] Figure 4 It is a structural block diagram of the computer device provided by the embodiment of the present application. Detailed Embodiments
[0039] The present application will be further described in detail below in conjunction with the embodiments and the drawings. It can be understood that the specific embodiments described herein are only used to explain the related application, rather than limiting the application. Additionally, it should be noted that for the sake of description, only parts related to the application are shown in the drawings.
[0040] It should be noted that, without conflict, the embodiments and the features of the embodiments in the present application can be combined with each other. The present application will be described in detail below with reference to the accompanying drawings and in combination with the embodiments.
[0041] The planning method, system and equipment of a battery swapping station according to an embodiment of the present application will be described in detail below with reference to the accompanying drawings.
[0042] Figure 1 is a flowchart of a planning method of a battery swapping station according to an embodiment of the present application. As Figure 1 shown, the planning method of a battery swapping station according to an embodiment of the present application includes the following steps:
[0043] S101: In response to a user's display request, display candidate points of battery swapping stations in a target area on a map, where the candidate points are generated based on multi-source data of the target area.
[0044] In an embodiment of the present application, in response to a user's display request, displaying candidate points of battery swapping stations in a target area on a map includes: determining the target area according to the user's location information or the area selected by the user from a list of areas; obtaining multi-source data of the target area, where the multi-source data includes but is not limited to some or all of battery swapping station distribution, competing battery swapping station distribution, urban road network, building distribution, and heat map of operating vehicle driving trajectories; generating the candidate points of the battery swapping stations according to the multi-source data, and displaying the candidate points of the battery swapping stations in the target area on the map.
[0045] The target area can be a city. Taking a city as an example, according to an intelligent terminal carried by the user, etc., the city where the user is located can be located, or according to the user's IP address, the city where the user is located can be located. In this way, this city can be determined as the target area. Of course, the city selected by the user from the cities listed in the area list can also be used as the target area.
[0046] Specifically, a list of cities can be listed according to the city where the user is located and the areas (cities) that the user can view and operate. The user can select one of the cities as the target area. For example: combining the city where the user's IP is located or the user's location and the user's city list permissions, etc., to determine whether the user can view and operate the candidate points in the current city.
[0047] For example: if the city list is empty, the user is defaultly located to the city where the user's IP is located or the city where the user's location is located, and the user cannot view and operate the candidate points in the city.
[0048] If there is one piece of data in the city list and the city corresponding to this piece of data is the city where the user's IP is located, the default location is the city where the IP is located, and the candidate points in this city can be shown to the user. If the city corresponding to this piece of data is not the city where the user's IP is located, after switching to the city corresponding to this piece of data, the candidate points in this city can be viewed and operated on.
[0049] If there are multiple pieces of data in the city list and the city list contains the city where the IP is located, the default location is the city where the IP is located, and the candidate points in this city can be viewed and operated on. When the user switches cities in the city list, the candidate points in the switched city can be viewed and operated on.
[0050] After the user selects a city, the candidate points of the battery swapping stations in this city are shown on the map. Moreover, data layers corresponding to multi-source data can be shown on this map, for example: showing the existing distribution of battery swapping stations, the distribution of competing battery swapping stations, the urban road network, building distribution, heat map of the driving trajectories of operating vehicles, etc.
[0051] That is: rich urban information layers of this city can be shown on the map, such as: showing the distribution of battery swapping stations in the city, heat map of the driving trajectories of operating vehicles, vehicle and pedestrian traffic flow, urban geographical data, surrounding environment, etc., and some candidate points for newly built battery swapping stations can be automatically shown.
[0052] It should be noted that these candidate points are automatically generated. Among them, the generation methods are, for example, by means of big data and using artificial intelligence models, etc. Specifically, an electric vehicle user behavior model is constructed using big data analysis and machine learning algorithms, and multi-source data such as the user's historical charging and battery swapping records, vehicle driving paths, existing battery swapping station layouts, urban geographical features, traffic flow, and local policy orientations are analyzed and processed. After cleaning and analysis, the future electric vehicle ownership and development speed are predicted, the demand distribution of battery swapping stations is predicted, and candidate points are obtained.
[0053] Then, according to the prediction results, combined with geographical information and traffic networks, the geographical information of the battery swapping stations in the current city is automatically drawn on the map, including layers such as the urban road network, building power facilities, etc., and the distribution of self-built and competing battery swapping stations, real-time battery swapping data in the surrounding area, heat map of the driving trajectories of operating vehicles, city boundaries, candidate area traffic information (battery swapping vehicle flow, pedestrian flow), etc. can also be shown, and the overlay display of multiple layers is supported. Each layer supports individual display and hiding, realizing intuitive and efficient visual display, and at the same time optimizing parameters such as the location, quantity, and scale of the battery swapping stations, so that the optimized target locations include network coverage (ensuring that electric vehicle users can conveniently find battery swapping stations), balance (avoiding over-concentration or sparseness of battery swapping stations in certain areas), economy (reducing construction and operation costs), etc.
[0054] S102: Receive an editing request from the user for the candidate location on the map.
[0055] S103: Edit the candidate location according to the editing request, where editing the candidate location includes at least one of adding a candidate location, modifying a candidate location, and deleting a candidate location.
[0056] In an embodiment of the present application, editing the candidate location according to the editing request includes: for the operation of adding a candidate site, selecting an area within the target area according to a preset radius range; when the selected area is confirmed, display the added candidate location within the selected area, where the radius of the selected area is within the radius range.
[0057] In another example, editing the candidate location according to the editing request includes: for the operation of modifying a candidate location, in response to the user's modification operation, change the position or the radius of the candidate location.
[0058] In addition, editing the candidate location according to the editing request further includes: setting the level of the candidate location, where candidate locations of different levels are distinguished and displayed in different colors on the map.
[0059] That is: Provide an intuitive user interface to support the user in viewing the drawing result and optimization process of the swap station map. The user can edit and evaluate the map through the interface, such as adjusting the position of the swap station (the position of the candidate location), increasing or decreasing the number of swap stations (candidate locations), etc. Continuously optimize the map drawing algorithm and result according to the user's editing.
[0060] Specifically, drawing candidate locations can be used to mark prime locations or points of interest, such as subway stations, parking lots, business districts, areas with high traffic flow, etc. The candidate locations can overlap with the regional planning. The candidate locations are divided into different types of levels 1-5, for example, and are distinguished by different colors. They are displayed as circular coverage areas on the interface, and the maximum and minimum radii can be set; two methods for determining candidate locations are supported: (1) Automatically mark the location after searching and positioning to a specific location; (2) Click the mouse to determine the location.
[0061] When drawing, after selecting a position by searching or clicking, the information of the nearest battery swapping station around the selected position (station status, station type, straight-line distance, etc.) is displayed. Click the right-click menu "Select Points in a Circle", and the page enters the state of drawing candidate points. A dot that moves in real time following the mouse is displayed on the page as the starting point. Dragging the mouse outward from the dot can draw a circle, and the radius of the circle is limited within a range of 3000 meters, meeting the minimum area requirements for battery swapping stations. The drawing of candidate points supports operations such as dragging the position, redrawing, modifying the radius, and exiting. Multiple candidate points cannot overlap, and the boundaries of the drawn points can exceed the regional plan but cannot exceed the current city boundary.
[0062] In an embodiment of the present application, the method for planning a battery swapping station further includes: receiving a regional planning request of the user for the target area on the map; and drawing different divided areas within the target area according to the regional planning request, wherein the different divided areas are distinguished and displayed in different colors.
[0063] In this example, the step of drawing different divided areas within the target area according to the regional planning request includes: drawing a closed area of any shape within the target area; when the closed area is confirmed, obtaining a first divided area, and displaying the first divided area in the corresponding color within the target area.
[0064] Among them, the step of displaying the first divided area in the corresponding color within the target area includes: setting the type of the first divided area; obtaining the corresponding target color according to the type, and displaying the first divided area in the target color within the target area.
[0065] For example, the drawn area is used to distinguish the demand levels for building stations in different areas within a city, including three types: core area, coverage area, and demand area.
[0066] During drawing, after filling in the area name and type, enter the drawing state. The starting point and step tips that move in real time following the mouse will be displayed on the page. The step tips will change in real time according to the drawing state. Click on the starting point to determine the starting point and a starting point will be drawn on the page. When the mouse moves, an extension line will be drawn in real time from the starting point. Click again and the extension line will disappear. After a second vertex is generated on the page and connected to the starting point to form a line, continue to move the mouse and draw the extension line again. When there are no less than 3 vertices on the page, double-click to automatically close into a polygon and render it on the page. Different types of areas have specific color fills and borders for easy distinction. The closed polygon supports functions such as dragging vertices to scale the area, dragging edges to generate new vertices, and double-clicking to delete vertices. During the editing process, operations such as undo, redo, redraw, and exit are supported. The planned areas cannot intersect or overlap with each other, and the drawing area generally cannot exceed the current city boundary. By planning different areas within the city, the connection between the areas and the candidate points for the battery swapping stations can be established. For example, for relatively more core areas, usually more candidate points may need to be established. In this way, through the annotation of the core areas on the title diagram, it can be intuitively seen how many more candidate points need to be established within the core areas, etc., thus providing an objective and reliable basis for the adjustment of the candidate points and helping with the reasonable site selection of the candidate points.
[0067] As Figure 2 shown, according to an embodiment of the present application, the method for planning a battery swapping station is as follows. The specific implementation process is: First, the map is default-located to the city where the user's IP is located, and it is determined whether the user has switched the city. After determining the city, layers and information such as vehicle trajectory heat map, battery swapping station distribution, business district information, pedestrian flow, and city editing are rendered. Then, planning areas are generated, and planning areas are added / edited. Address queries are performed and addresses are selected. Finally, recommended candidate points are generated, and the candidate points can be edited. Eventually, the candidate points are reported and waiting for subsequent processes such as review.
[0068] According to the method for planning a battery swapping station of an embodiment of the present application, when responding to the user's display request, the candidate points of the battery swapping station in the target area are displayed on the map. Then, the editing request of the user for the candidate points on the map can be received. Finally, according to the editing request, the candidate points are edited. Thus, not only can relevant information such as the site selection plan of the battery swapping station be viewed on the map, but also operations such as adding, deleting, and changing the candidate points for the site selection of the battery swapping station can be performed, thereby improving the efficiency of the battery swapping station planning and the accuracy of the site selection.
[0069] Figure 3 is the structural block diagram of a battery swapping station planning system according to an embodiment of the present application. As Figure 3 shown, according to an embodiment of the present application, the battery swapping station planning system includes: a display module 310, a receiving module 320, and an editing module 330, where:
[0070] A display module 310, configured to respond to a user's display request and display candidate points of battery swapping stations in a target area on a map, where the candidate points are generated based on multi-source data of the target area;
[0071] A receiving module 320, configured to receive an editing request from the user for the candidate points on the map;
[0072] An editing module 330, configured to edit the candidate points according to the editing request, where editing the candidate points includes at least one of adding candidate points, modifying candidate points, and deleting candidate points.
[0073] According to the battery swapping station planning method of the embodiments of the present application, when responding to a user's display request, candidate points of battery swapping stations in a target area are displayed on a map, then an editing request from the user for the candidate points on the map can be received, and finally, the candidate points are edited according to the editing request. Thus, not only can relevant information such as the site selection plan of the battery swapping station be viewed on the map, but also operations such as adding, deleting, and changing the candidate points for the site selection of the battery swapping station can be performed, thereby improving the efficiency of battery swapping station planning and the accuracy of site selection.
[0074] For the specific limitations of the battery swapping station planning system, reference can be made to the limitations of the battery swapping station planning method described above, which will not be elaborated here. Each module of the above battery swapping station planning system can be implemented in whole or in part by software, hardware, and their combination. The above-mentioned each module can be embedded in or independent of the processor in the computer device in the form of hardware, or stored in the memory of the computer device in the form of software, so that the processor can call and execute the operations corresponding to the above each module.
[0075] Next, with reference to Figure 4 , Figure 4 FIG. shows a schematic structural diagram of a computer device suitable for implementing the embodiments of the present application.
[0076] As Figure 4 shown, the computer system includes a central processing unit (CPU) 1001, which can perform various appropriate actions and processes according to the program stored in the read-only memory (ROM) 1002 or the program loaded from the storage part 1008 into the random access memory (RAM) 1003. In the RAM 1003, various programs and data required for the operation instructions of the system are also stored. The CPU 1001, ROM 1002, and RAM 1003 are connected to each other through a bus 1004. The input / output (I / O) interface 1005 is also connected to the bus 1004.
[0077] The following components are connected to the I / O interface 1005: an input section 1006 including a keyboard, a mouse, etc.; an output section 1007 including a cathode ray tube (CRT), a liquid crystal display (LCD), etc., and a speaker, etc.; a storage section 1008 including a hard disk, etc.; and a communication section 1009 including a network interface card such as a LAN card, a modem, etc. The communication section 1009 performs communication processing via a network such as the Internet. A drive 1010 is also connected to the I / O interface 1005 as needed. A removable medium 1011 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, etc. is installed on the drive 1010 as needed so that a computer program read from it can be installed into the storage section 1008 as needed.
[0078] Specifically, according to an embodiment of the present application, the process described above with reference to the flowchart Figure 1 can be implemented as a computer-readable storage medium. For example, an embodiment of the present application includes a computer-readable storage medium that includes a computer program, and the computer program contains program code for executing the method shown in the flowchart, such as executing: in response to a user's display request, displaying candidate points of battery swapping stations in a target area on a map, where the candidate points are generated based on multi-source data of the target area;
[0079] receiving an edit request from the user for the candidate points on the map;
[0080] editing the candidate points according to the edit request, where editing the candidate points includes at least one of adding candidate points, modifying candidate points, and deleting candidate points.
[0081] Specifically, according to an embodiment of the present application, the process described above with reference to the flowchart Figure 1 can be implemented as a computer software program. For example, an embodiment of the present application includes a computer program product that includes a computer program carried on a computer-readable medium, and the computer program contains program code for executing the method shown in the flowchart, such as executing: in response to a user's display request, displaying candidate points of battery swapping stations in a target area on a map, where the candidate points are generated based on multi-source data of the target area;
[0082] receiving an edit request from the user for the candidate points on the map;
[0083] editing the candidate points according to the edit request, where editing the candidate points includes at least one of adding candidate points, modifying candidate points, and deleting candidate points.
[0084] In such an embodiment, the computer program includes program code for performing the method shown in the flowchart. In such an embodiment, the computer program can be downloaded and installed from a network through the communication section 1009, and / or installed from the removable medium 1011. When the computer program is executed by the central processing unit (CPU) 1001, the above functions defined in the system of the present application are performed.
[0085] It should be noted that the computer-readable medium shown in the present application can be a computer-readable signal medium, a computer-readable storage medium, or any combination of the two. A computer-readable storage medium can be, for example, but not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the above. More specific examples of the computer-readable storage medium can include, but are not limited to: an electrical connection having one or more wires, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the above. In the present application, the computer-readable storage medium can be any tangible medium that contains or stores a program, and the program can be used by or combined with an instruction execution system, apparatus, or device. In the present application, a computer-readable signal medium can include a data signal propagated in a baseband or as part of a carrier wave, which carries the computer-readable program code. Such a propagated data signal can take various forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination of the above. The computer-readable signal medium can also be any computer-readable medium other than the computer-readable storage medium, and the computer-readable medium can send, propagate, or transmit a program for use by or combined with an instruction execution system, apparatus, or device. The program code contained on the computer-readable medium can be transmitted by any appropriate medium, including but not limited to: wireless, wire, optical cable, RF, etc., or any suitable combination of the above.
[0086] The flowcharts and block diagrams in the accompanying drawings illustrate the possible architectures, functions, and operation instructions of systems, methods, and computer program products according to various embodiments of the present application. In this regard, each block in the flowchart or block diagram may represent a module, a program segment, or a part of code, and the foregoing module, program segment, or part of code contains one or more executable instructions for implementing the specified logical function. It should also be noted that in some alternative implementations, the functions marked in the blocks may occur in a different order than that marked in the accompanying drawings. For example, two connected blocks may actually be executed substantially in parallel, and they may sometimes be executed in the reverse order, depending on the functions involved. It should also be noted that each block in the block diagram and / or flowchart, as well as the combination of blocks in the block diagram and / or flowchart, may be implemented by a dedicated hardware-based system for performing the specified functions or operation instructions, or may be implemented by a combination of dedicated hardware and computer instructions.
[0087] The units or modules involved in the embodiments described in the present application may be implemented in software or in hardware. The described units or modules may also be provided in a processor. Among them, the names of these units or modules do not constitute a limitation to the units or modules themselves in some cases.
[0088] The technical features of the above embodiments can be combined arbitrarily. For the sake of brevity of description, not all possible combinations of the technical features in the above embodiments are described. However, as long as there is no contradiction in the combination of these technical features, it should be considered as within the scope described in this specification.
[0089] The above embodiments only represent several implementation manners of the present application, and the description thereof is relatively specific and detailed, but it should not be construed as a limitation to the scope of the patent application. It should be noted that for those of ordinary skill in the art, without departing from the concept of the present application, several modifications and improvements can still be made, and these all belong to the protection scope of the present application. Therefore, the protection scope of the patent of the present application shall be subject to the appended claims.
Claims
1. A method for planning a battery swap station, characterized in that: include: In response to a display request from a user, candidate locations of battery swap stations in a target area are displayed on a map, wherein the candidate locations are generated based on multi-source data of the target area; Receiving a user's editing request for the candidate point on the map; The candidate points are edited according to the edit request, wherein editing the candidate points includes at least one of adding a candidate point, modifying a candidate point, and deleting a candidate point.
2. The method for planning a battery swap station according to claim 1, characterized in that: The step of editing the candidate point according to the editing request includes: For the operation of adding candidate sites, circle the target area according to the preset radius range; After the circled area is confirmed, the added candidate points are displayed in the circled area, wherein the radius of the circled area is within the radius interval.
3. The method for planning a battery swap station according to claim 1, characterized in that: Editing the candidate point according to the editing request includes: For the operation of modifying the candidate point, in response to the modification operation of the user, the position of the candidate point or the radius of the candidate point is changed.
4. The method for planning a battery swap station according to any one of claims 1 to 3, characterized in that: The editing of the candidate point according to the editing request further includes: The levels of the candidate points are set, wherein candidate points of different levels are distinguished and displayed in different colors on the map.
5. The method for planning a battery swap station according to claim 1, characterized in that: Also includes: receiving a user's request for area planning of the target area on the map; According to the area planning request, different divided areas are drawn in the target area, wherein different divided areas are distinguished and displayed in different colors.
6. The method for planning a battery swap station according to claim 5, characterized in that: Drawing different divided areas in the target area according to the area planning request includes: Draw a closed area of any shape in the target area; When the closed area is confirmed, a first divided area is obtained, and the first divided area is displayed in a corresponding color within the target area.
7. The method for planning a battery swap station according to claim 6, characterized in that: The displaying the first divided area in the target area with a corresponding color includes: Setting the type of the first divided area; According to the type, a corresponding target color is obtained, and the first divided area is displayed in the target color within the target area.
8. The method for planning a battery swap station according to claim 1, characterized in that: The method of responding to a display request from a user and displaying candidate locations of a battery swap station in a target area on a map includes: Determining the target area according to the location information of the user or the area selected by the user from the area list; Obtain multi-source data of the target area, wherein the multi-source data includes part or all of the distribution of battery swap stations, distribution of competing battery swap stations, urban road network, building distribution, and operating vehicle driving trajectory heat map; Based on the multi-source data, candidate locations of the battery swap station are generated, and the candidate locations of the battery swap station in the target area are displayed on the map.
9. A planning system for a battery swap station, characterized in that: include: A display module, configured to respond to a user's display request and display candidate locations of battery swap stations in a target area on a map, wherein the candidate locations are generated based on multi-source data of the target area; A receiving module, used for receiving a user's editing request for the candidate point on the map; The editing module is used to edit the candidate points according to the editing request, wherein editing the candidate points includes at least one of adding candidate points, modifying candidate points and deleting candidate points.
10. A computer device comprising a memory, a processor and a computer program stored in the memory and executable on the processor, characterized in that: When the processor executes the program, the planning method for a battery swap station according to any one of claims 1-8 is implemented.