WO2020238691A1

WO2020238691A1 - Image processing method and apparatus, and electronic device and storage medium

Info

Publication number: WO2020238691A1
Application number: PCT/CN2020/090968
Authority: WO
Inventors: 吕蒙; 徐泽皓
Original assignee: 腾讯科技（深圳）有限公司
Priority date: 2019-05-29
Filing date: 2020-05-19
Publication date: 2020-12-03
Also published as: EP3910292A1; JP2022517195A; EP3910292B1; EP3910292A4; CN110186473B; US20240310184A1; JP7313450B2; US20210341307A1; US12044544B2; CN110186473A

Abstract

An image processing method and apparatus, and an electronic device and a storage medium. The method comprises: acquiring a remaining mileage parameter of a vehicle (S101); acquiring an initial position of the vehicle in a map display interface (S102); determining a target endurance area in the map display interface according to the initial position and the remaining mileage parameter (S103); and displaying the target endurance area in the map display interface (S104).

Description

Image processing method, device, electronic equipment and storage medium

This application claims the priority of a Chinese patent application filed with the Chinese Patent Office on May 29, 2019, the application number is 201910458925.3, and the invention title is "an image processing method, device, electronic equipment, and storage medium". The reference is incorporated in this application.

Technical field

This application relates to the field of computer technology, and in particular to an image processing method, device, electronic equipment, and storage medium.

Background technique

When a user travels in a car, the user often plans the next trip according to the remaining cruising mileage of the car. At present, the display of the car's cruising mileage is often in the form of numerical values, that is, the cruising mileage is displayed numerically on the car dashboard. For example, the instrument panel displays "Courage Range 100km".

However, simply displaying the remaining mileage by numerical values will result in the information being not directly or specific enough to the user. In the follow-up, the user is required to manually estimate the actual reachable range based on the current road conditions and the remaining cruising mileage, and then determine the itinerary. The efficiency of itinerary planning is reduced.

Summary of the invention

The embodiments of the present application provide an image processing method, device, electronic device, and storage medium, which can intuitively show users the actual reach of a car, thereby improving the efficiency of travel planning.

The embodiment of the application provides an image processing method, which is executed by an electronic device, and includes:

Obtain the remaining mileage parameters of the vehicle;

Acquiring the starting position of the vehicle in the map display interface;

Determining a target cruising area in the map display interface according to the starting position and the remaining mileage parameter;

The target battery life area is displayed in the map display interface.

The embodiment of the present application also provides an image processing device, including:

The first obtaining module is used to obtain the remaining mileage parameters of the vehicle;

The second acquiring module is used to acquire the starting position of the vehicle in the map display interface;

A target area determination module, configured to determine a target endurance area in the map display interface according to the starting position and the remaining mileage parameter;

The first acquisition module is also used to display the target battery life area in the map display interface.

An embodiment of the present application also provides an electronic device, including: a processor and a memory;

The processor is connected to a memory, where the memory is used to store a computer program, and the processor is used to call the computer program to execute the method in the embodiment of the present application.

The embodiment of the present application also provides a computer storage medium, the computer storage medium stores a computer program, and the computer program includes program instructions. When the program instructions are executed by a processor, the method.

In the embodiment of this application, the remaining mileage parameters of the vehicle are obtained; the starting position of the vehicle in the map display interface is obtained; the target endurance area is determined in the map display interface according to the starting position and the remaining mileage parameters; in the map display interface Show the target battery life area. It can be seen from the above that, compared to manually estimating the target endurance area based on the remaining mileage and current road conditions, by automatically determining the target endurance area on the map interface, it can more intuitively show the user the actual reach of the car, thereby improving the subsequent journey. Efficiency of planning.

Brief description of the drawings

In order to more clearly describe the technical solutions in the embodiments of the present application or the prior art, the following will briefly introduce the drawings that need to be used in the description of the embodiments or the prior art. Obviously, the drawings in the following description are only These are some embodiments of the present application. For those of ordinary skill in the art, other drawings can be obtained based on these drawings without creative work.

FIG. 1 is an image processing system architecture diagram provided by an embodiment of the present application;

2a-2b are schematic diagrams of an image processing scene provided by an embodiment of the present application;

FIG. 3a is a schematic flowchart of an image processing method provided by an embodiment of the present application;

FIG. 3b is a schematic diagram of a process for determining a target endurance area provided by an embodiment of the present application;

FIG. 4 is a schematic diagram of determining original candidate points provided by an embodiment of the present application;

FIG. 5 is a schematic diagram of determining a target point that meets a position mutation condition provided by an embodiment of the present application;

FIG. 6 is another schematic diagram of determining a target point that meets a position mutation condition provided by an embodiment of the present application;

FIG. 7 is a schematic flowchart of another image processing method provided by an embodiment of the present application;

FIG. 8 is a schematic diagram of a relationship between a first length threshold and a second length threshold according to an embodiment of the present application;

Fig. 9a is a schematic diagram of determining a first unit road network data block provided by an embodiment of the present application;

Figure 9b is a schematic diagram of determining a second unit road network data block provided by an embodiment of the present application;

Figure 10a is another schematic diagram of determining a second unit road network data block provided by an embodiment of the present application;

FIG. 10b is a schematic diagram of determining candidate points according to an embodiment of the present application;

FIG. 11a is a schematic diagram of determining the path distance of a road network according to an embodiment of the present application;

FIG. 11b is a schematic diagram of a target endurance area provided by an embodiment of the present application;

FIG. 12 is a schematic structural diagram of an image processing apparatus provided by an embodiment of the present application;

FIG. 13 is a schematic structural diagram of an electronic device provided by an embodiment of the present application.

Detailed ways

The technical solutions in the embodiments of the present application will be described clearly and completely in conjunction with the accompanying drawings in the embodiments of the present application. Obviously, the described embodiments are only a part of the embodiments of the present application, rather than all the embodiments. Based on the embodiments in this application, all other embodiments obtained by a person of ordinary skill in the art without creative work shall fall within the protection scope of this application.

Please refer to FIG. 1, which is a diagram of an image processing system architecture provided by an embodiment of the present application. The server 10g establishes a connection with the user terminal cluster and the car cluster through the switch 10f and the communication bus 10e. The user terminal cluster may include: a user terminal 10a, a user terminal 10c, etc., and a car cluster that has a binding relationship with the user terminal 10a and the user terminal 10c. It may include: car 10b, car 10d, etc.

Taking the user terminal 10a and the car 10b as an example, when the car navigation in the car 10b is activated, the car 10b sends the remaining mileage and current position to the server 10g through the switch 10f and the communication bus 10e. The server 10g determines the actual reach of the car 10b on the map according to the remaining mileage and the current position. The server 10g may send the actual reachable range to the car 10b, and display the actual reachable range on the map page of the car navigation in the car 10b. The server 10f may also send the actual reachable range to the user terminal 10a that has a binding relationship with the car 10b, and may also display the actual reachable range on the map page of the user terminal 10a.

Of course, the actual reachable range can also be determined on the map page by the car (or the user terminal) according to the remaining mileage of the car and the current location. Similarly, it can be on the map page of the car navigation (or the map page of the user terminal) Display the actual reachable range.

The following specifically describes how the user terminal 10a determines the actual reach of the car based on the remaining mileage and the current position of the car as an example.

Among them, the user terminal 10a, user terminal 10c, etc. shown in FIG. 1 may include mobile phones, tablet computers, notebook computers, handheld computers, mobile Internet devices (MID, mobile internet devices), wearable devices (such as smart watches, smart bracelets) and many more.

Please refer to FIG. 2a-2b, which are schematic diagrams of an image processing scene provided by an embodiment of the present application. As shown in the interface 20b of the user terminal 10a in Figure 2a, the user clicks on the "My Car" App to start the App. The App is used to manage the car information of the car that has a binding relationship with the user terminal 10a, that is, the car can pass through The Internet of Vehicles sends car information to the user terminal 10a, and the user terminal 10a can also send instructions to the car through the Internet of Vehicles.

The user terminal 10a obtains the remaining mileage of the car and the current location information of the car, and obtains the map scale factor of the built-in map page 20a of the "My Car" App, and determines the radius factor according to the map scale factor and the remaining mileage. The terminal device 10a uses the current position information of the car as the center and the radius coefficient as the radius in the map page 20a to determine the original reachable area 20c. It can be known that since the original reachable area 20c is a circle determined by the remaining mileage, no matter which direction the car drives, the remaining mileage exhaustion point must be located in the original reachable area 20c or on the boundary of the original reachable area 20c.

On the map page 20a, the user terminal 10a divides the original reachable area 20b into 4 unit original reachable areas with the center of the original reachable area 20c as the center and 90° intervals, which are: unit original reachable area 20d, unit original reachable area 20e, unit original reachable area 20f, and unit original reachable area 20g, it can be known that the original reachable area of each unit is fan-shaped.

For each unit's original reachable area, the user terminal 10a respectively determines multiple candidate points in the area. The number of candidate points in the original reachable area of each unit may be the same or different; and the original The method of selecting candidate points in the reachable area can be the same or different.

For example, candidate points can be selected in the original reachable area of each unit in a random manner, or alternative points can be selected in the original reachable area of each unit in a manner of the same distance.

As shown in Figure 2a, for the unit's original reachable area 20d, the candidate points selected in the area are candidate point 1 and candidate point 2. For the unit's original reachable area 20e, the selected candidate points in this area The candidate points are candidate point 3 and candidate point 4; for the unit's original reachable area 20f, the candidate points selected in the area are candidate point 5 and candidate point 6; for the unit's original reachable area 20g In other words, the candidate points selected in the area are candidate point 7 and candidate point 8.

The next step is to filter and retain the above 8 candidate points. The specific process is: for all candidate points, the user terminal 10a calls the route navigation interface to determine the distance between each candidate point and the current position of the car. The user terminal 10a deletes the candidate points with the shortest road network distance greater than the remaining mileage. On the contrary, the user terminal 10a reserves the candidate points with the shortest road network distance less than or equal to the remaining mileage. It should be noted that when the candidate point is in an unreachable area of the road network, such as rivers, mountains, enclosed areas, etc., it means that the shortest distance between the candidate point and the current position of the car is infinite.

After filtering some candidate points, the remaining candidate points in the original reachable area of each unit need to be filtered again. The specific process of re-filtering is: the user terminal 10a only retains the original reachable area of each unit The candidate points farthest from the center of the circle (that is, the current position of the car), filter out the remaining candidate points in the original reachable area of each unit. The distance measurement method here can be the distance in the map page 20a or the shortest distance of the road network.

As shown in Figure 2a, for the unit's original reachable area 20d, the last remaining candidates are candidate point 1 and candidate point 2 (because candidate point 1 and candidate point 2 are points on the circle, the two The candidate points may be retained at the same time); for the unit’s original reachable area 20e, the last remaining candidate is the candidate point 4; for the unit’s original reachable area 20f, the last remaining candidate is the candidate point 6; For the unit's original reachable area of 20g, the last remaining option is point 7.

In the map page 20a, the user terminal 10a connects the remaining candidate points in a clockwise or counterclockwise order, that is, connects candidate point 1, candidate point 2, candidate point 4, candidate point 6 and backup points in sequence. Select point 7, after connecting, the actual reachable area 20h can be determined on the map page 20a, and the actual reachable area 20h can be rendered on the map page 20a, that is, the actual reachable area 20h is marked on the map page 20a.

If the remaining mileage is less than or equal to the mileage threshold, the user terminal 10a may render the boundary of the actual reachable area 20h in red; if the remaining mileage is greater than the mileage threshold, the user terminal 10a may render the boundary of the actual reachable area 20h in blue. Of course, in addition to rendering the boundary of the actual reachable area 20h with different colors for prompting the user, lines of different thicknesses, or solid lines and/or dashed lines may also be used to render the boundary of the actual reachable area 20h for prompting the user.

As shown in the interface 20x in Figure 2b, after starting the "My Car" APP, before entering the APP, a preset animation can be played on the screen of the user terminal, and at the same time, the user terminal 10a can be displayed on the map page in parallel In 20a, the actual reachable area is determined at 20h. When it is detected that the actual reachable area 20h is determined, as shown in the interface 20y, stop playing the animation and enter the APP homepage. The map page 20a that has rendered the actual reachable area 20h is displayed on the homepage. At the same time, in the APP homepage, you can The license plate of the car that has a binding relationship with the user terminal 10a, the owner's name, the remaining mileage (that is, the battery life in FIG. 2b), and the remaining power (or remaining fuel) are also displayed. In this way, the user can view the longest distance range that the car can travel through the user terminal 10a, which is convenient for planning a trip.

Subsequently, the user terminal 10a may send the rendered map page 20a of the actual reachable area 20h to the car that has a binding relationship with the user terminal 10a. When the car’s car navigation is started, the rendering can be displayed on the car’s display screen. The map page 20a of the actual reachable area 20h is used to remind the owner of the actual reach of the car.

Among them, determine the original endurance area (such as the original reachable area 20c in the embodiment corresponding to FIG. 2a), and generate original candidate points (such as candidate 1, candidate point 2 in the corresponding embodiment in FIG. 2a). Alternative 8). The specific process of determining the target cruising area (such as the actual reachable area 20h in the embodiment corresponding to FIG. 2a) can be referred to the following embodiments corresponding to FIG. 3a to FIG. 11b.

Please refer to FIG. 3a, which is a schematic flowchart of an image processing method provided by an embodiment of the present application. As shown in FIG. 3a, the image processing method may include:

Step S101: Obtain remaining mileage parameters of the vehicle.

The image processing process in this application involves cars and terminal equipment. The execution subject of the following steps can be a car or a terminal device; if the execution subject is a car, the car can send the area data to the car after determining the target endurance area. The terminal device of the binding relationship; if the execution subject is the terminal device, the terminal device can also send the area data to the car that has a binding relationship with the terminal device after determining the target cruising area. The subsequent embodiments are described with the terminal device as the execution subject.

Specifically, the terminal device (such as the user terminal 10a in the corresponding embodiment in FIG. 2a above) obtains the remaining mileage parameter of the vehicle (for example, a car); wherein the remaining mileage parameter may be sent by the vehicle to the terminal device through the Internet of Vehicles, The remaining mileage parameter is the length of the distance that the vehicle can still travel based on the current electricity or fuel amount. For example, the remaining mileage parameter is 200km.

Step S102: Acquire the starting position of the vehicle on the map display interface.

Specifically, the terminal device obtains the current location of the vehicle, where the current location may also be sent by the vehicle to the terminal device through the Internet of Vehicles.

The terminal device determines the starting position in the map display interface (such as the map page 20a in the embodiment corresponding to FIG. 2a) according to the current position of the vehicle.

Step S103: Determine a target cruising area in the map display interface according to the starting position and the remaining mileage parameter.

Specifically, the terminal device may randomly determine multiple target points around the starting position in the map display interface with the starting position as the center. In the map display interface, the above multiple target points are connected, and the obtained area is called the target endurance area (for example, the actual reachable area 20h in the corresponding embodiment in FIG. 2a).

In an embodiment, the terminal device obtains the map scale factor of the map display interface, where the map scale factor is the ratio of the length of the line segment on the map display interface to the length of the corresponding line segment on the ground through the horizontal projection.

Since the remaining mileage parameter is the actual distance, in order to determine the distance of the remaining mileage parameter on the map display interface, the terminal device determines the mileage radius coefficient according to the remaining mileage parameter and the map scale factor.

For example, the map scale factor is: 1cm:10km. If the remaining mileage parameter is 100km, according to the proportional relationship, the mileage radius factor is 10cm, that is, the actual distance is 100km, and the distance on the map display interface is 10cm.

In the map display interface, the terminal device uses the starting position as the center of the circle and the mileage radius coefficient as the radius to generate a circle (called the mileage circle), and use the area corresponding to the mileage circle in the map display interface as the target cruising area.

In the embodiment, in addition to the above two ways to determine the target endurance area, the following method (that is, the third method) can also be used to determine the target endurance area: In the map display interface, the terminal device uses the starting position as the center of the circle. Take the mileage radius coefficient as the radius to generate a circle (called mileage circle), and use the area corresponding to the mileage circle in the map display interface as the original cruising area (such as the original reachable area 20c in the corresponding embodiment in FIG. 2a).

It can be known that since the original cruising area is the circle determined on the map display interface according to the remaining mileage parameters, it has nothing to do with the real road network, and the real roads are generally curved, so no matter which direction the vehicle is driving, the fuel volume The exhaustion point or the power exhaustion point must be in the original endurance area or on the boundary of the original endurance area.

In an embodiment, in the map display interface, the terminal device generates a square area with the starting position as the center, wherein the distance from the center to the vertex of the positive direction area may be equal to the mileage radius coefficient. Similarly, the terminal device can use the aforementioned square area as the original battery life area.

Optionally, in the map display interface, the terminal device generates a regular hexagon area with the start as the center, wherein the distance between the center of the regular hexagon area and each vertex may be equal to the mileage radius coefficient. Similarly, the terminal device can use the aforementioned regular hexagonal area as the original endurance area.

Determine multiple original candidate points in the original endurance area (for example, multiple original candidate points can be determined in a random manner), and select the original candidate points reachable by the vehicle from the multiple original candidate points as Reachable candidate point; where the vehicle reachable means that the distance of the road network path between the reachable candidate point and the starting position is less than or equal to the remaining mileage parameter. The road network path distance refers to the real road distance between point A and point B. Generally speaking, because the road has bends and the straight-line distance between two points is the shortest, the road network path distance is greater than the straight-line distance between two points.

In the embodiment, if the original candidate point is in an unreachable area of the road network such as rivers, mountain areas, and closed control areas, it can be considered that the road network path distance between the original candidate point and the starting position is infinite, that is, It is said that the original candidate point in the unreachable area of the road network will be deleted and will not be regarded as the reachable candidate point.

Regarding the reachable candidate points as target points, in the map display interface, connect the above-mentioned multiple target points, and the obtained area is called the target endurance area.

Step S104: Display the target battery life area on the map display interface.

Specifically, the terminal device may render the target endurance area on the map display interface, that is, mark the target endurance area on the map display interface.

If the remaining mileage parameter is less than or equal to the mileage threshold, the terminal device may render the boundary of the target cruising area in red; if the remaining mileage parameter is greater than the mileage threshold, the terminal device may render the boundary of the target cruising area in blue. Of course, in addition to rendering the boundary of the target endurance area with different colors, you can also use different thickness lines, or use solid and/or dashed lines to render the boundary of the target endurance area, and you can even render the entire target endurance area with different colors. .

Please refer to FIG. 3b, which is a schematic diagram of a process for determining the target endurance area provided by an embodiment of the present application. The determination of the target endurance area includes steps 201 to S204, and steps 201 to S204 are step S103 in the embodiment corresponding to FIG. 3a. A specific embodiment of the third way to determine the target endurance area in:

Step S201: Determine multiple original candidate points according to the starting position and the remaining mileage parameter.

In the map display interface, the terminal device uses the starting position as the center of the circle and the mileage radius coefficient as the radius to generate a mileage circle. The area corresponding to the mileage circle in the map display interface is used as the original cruising area.

The terminal device obtains the polar angle interval coefficient, and divides the original endurance area with the starting position as the center and the polar angle interval coefficient as the interval, and can obtain multiple unit original endurance areas (as shown in the corresponding embodiment in Figure 2a, the unit original reachability Area 20d, unit original reachable area 20e, unit original reachable area 20f, and unit original reachable area 20g), the area and shape of the original range of each unit can be the same.

It can be known that if the original endurance area is circular, then the original endurance area of each unit is a sector, and the central angle of the sector is equal to the polar angle interval coefficient.

When the original endurance area is circular, in order to make the area and shape of the original endurance area of the divided unit the same, it is necessary to ensure that the polar angle interval coefficient can be divisible by 360°, so that the original endurance area can be divided into N identical The unit of the original endurance area, N is an integer greater than or equal to 1.

Generally speaking, when the polar angle interval coefficient is smaller, the target endurance area drawn is more refined, and correspondingly, the amount of calculation and data will be increased; when the polar angle interval coefficient is larger, the original endurance area of the divided unit The smaller the number, which may cause the final depiction of the target endurance area is not accurate enough. Therefore, in order to balance the calculation amount and the fineness of the target endurance area, the embodiment of the present application determines through multiple experiments that when the polar angle interval coefficient is equal to 10°, the calculation amount and the fineness of the target endurance area can reach a better balance.

In the embodiment, if the original endurance area is a square, then the terminal device still uses the starting position as the center and the polar angle interval coefficient as the interval. After dividing the original endurance area, multiple triangle or quadrilateral unit original endurance areas can be obtained. And the vertex angle with respect to the starting position in the vertex angle of the unit original cruising area is equal to the polar angle interval coefficient.

In the embodiment, if the original endurance area is a regular hexagon, the terminal device still uses the starting position as the center and the polar angle interval coefficient is equal to 60° as the interval. After dividing the original endurance area, six equilateral triangles can be obtained. Unit original endurance area, and the unit original endurance area vertex angle is equal to 60°.

The terminal device then divides the original battery life area of each unit to obtain one or more original battery life sub-areas. The dividing principle is the side length of each unit’s original battery life sub-areas (the side length here refers to the The difference between the length) and the first length threshold is less than the preset difference threshold.

In the map display interface, the terminal device regards the vertices of the original battery life sub-region of each unit as the original candidate points (for example, candidate 1, candidate point 2..., candidate point 8 in the corresponding embodiment in Figure 2a above ).

The following describes the specific process of dividing a unit's original battery life area into one or more unit original battery sub-areas and determining multiple original candidate points. Please refer to FIG. 4, which is a schematic diagram of determining original candidate points provided by an embodiment of the present application. The original endurance area is evenly divided into 8 original endurance areas. The original endurance area of one of the units is described below. It can be known that the original endurance area of the unit is fan-shaped. The terminal device divides the original endurance area of the unit from the two dimensions of radius and polar diameter. The radius refers to the intersection curve between the concentric circle curve of the original endurance area and the original endurance area of the unit. The extreme diameter refers to the point on the circumference of the unit original endurance area. To the line segment between the vertices of the fan, the segmentation target is that the difference between the side length of the "curved rectangle" or "curved triangle" enclosed by each polar diameter and radius and the first length threshold is less than the preset Difference threshold. It can be seen from Figure 4 that by dividing the two dimensions of radius and polar diameter, the original battery life area of a unit can be divided into 9 original battery life sub-areas, and the side length of the original battery life sub-areas of each unit is approximately approx. Equal to the first length threshold.

The terminal device can use all the vertices of the original battery life sub-areas of the unit as the original candidate points. As can be seen from Figure 4, the 9 original battery life sub-areas correspond to 12 candidate points.

In the embodiment, the above is to use all the vertices of the original battery life sub-region as the original candidate points. Since the outer radius of the fan shape is larger than the inner radius, the distance between two adjacent original candidate points in the outer radius Must be greater than the distance between two adjacent original candidate points located in the inner radius. In order to make the distance between all the original candidate points approximately equal, for the original candidate points located in the inner radius, it is necessary to filter a part of the original candidate points. The goal of selecting points is to make the distance between all retained original candidate points approximately equal.

For example, the distance between the 4 original candidate points located in the outermost circle in Figure 4 must be greater than the distance between the 4 original candidate points located in the innermost circle. , The two original candidate points can be filtered out so that the distance between the remaining original candidate points is approximately equal to the distance between the four original candidate points located in the outermost circle.

Step S202: Select the original candidate point that is reachable by the vehicle from the multiple original candidate points as the reachable candidate point.

Specifically, the following takes an original candidate point as an example to illustrate how to determine whether the original candidate point is a reachable candidate point. The terminal device determines the road network path distance between the original candidate point and the starting position. The road network path distance refers to the real road distance between point A and point B. Generally speaking, because the road has bends and the straight-line distance between two points is the shortest, the road network path distance is greater than the straight-line distance between two points.

In order to avoid confusion, I reiterate the difference between the three distances here. The distance in the map display interface refers to the page distance. Generally speaking, the distance is relatively small, and the unit is generally cm; the distance in the map display interface It can correspond to a straight line distance in the real world, and they are proportional; the road network path distance refers to the road path distance (or the path planning distance). Generally speaking, the true straight line distance between point A and point B Is less than or equal to the path distance of the road network.

The original candidate points all have corresponding road network path distances, delete the original candidate points corresponding to the road network path distance greater than the remaining mileage parameter, and keep those original candidates corresponding to the road network path distance less than or equal to the remaining mileage parameter Point, the terminal device can use all the retained original candidate points as reachable candidate points, that is, the real road network location corresponding to the candidate point is the location that the vehicle can reach based on the remaining mileage parameters.

In the embodiment, if the original candidate point is in an unreachable area of the road network, for example, in a river, mountainous area, closed control area, etc., it can be considered that the road network path distance between the original candidate point and the starting position is infinite , That is to say, the original candidate point in the unreachable area of the road network will be deleted and will not be regarded as the reachable candidate point.

Step S203: Determine the reachable candidate point as a target point.

Specifically, the terminal device separately determines the distance between the starting position and each reachable candidate point in the map display interface (referred to as the map distance). In each unit's original battery life area, the reachable device with the largest map distance is selected. The selected point is the target point to be determined in the original endurance area.

In the embodiment, the terminal device determines the road network path distance between the starting position and each reachable candidate point (referred to as the candidate road network path distance). In each unit original range, there will be the largest candidate road. The reachable candidate point of the network path distance is used as the target point to be determined in the original endurance area.

For each unit’s original battery life area and each original candidate point, the reachable candidate points in each unit’s original battery life area can be determined in the above manner, and then the distance within each unit’s original battery life area The farthest reachable candidate point from the starting position is used as the target point to be determined, and finally the target points to be determined in the original endurance area of all units are regarded as target points.

Step S204: In the map display interface, connect the multiple target points to obtain the target endurance area.

Specifically, in the map display interface, the terminal device may connect each target point in a clockwise sequence or a counterclockwise sequence to obtain a candidate closed circle. The terminal device can directly use the area corresponding to the candidate closed circle in the map display interface as the target endurance area.

Since the distribution of the road network is very complicated, the boundary smoothing process can be further performed on the candidate closed circle to reduce the influence of the singular points caused by the singular distribution of the road network on the drawing of the target range area, and then the terminal device will smooth the boundary The processed area is regarded as the target endurance area.

Smoothing the boundary of the candidate closed circle includes: finding the target point that meets the location mutation condition, deleting the target point that meets the location mutation condition, and then connecting the remaining target points in a clockwise or counterclockwise direction. The area is the target endurance area after boundary smoothing. A sudden change in position means that the target point changes to a convex point or a concave point.

There are two ways for the terminal equipment to perform boundary smoothing on the candidate closed circle. The following describes one of the ways: the terminal equipment extracts 3 target points from all target points, which are the first reachable point and the first Two reachable points and third reachable points, and in the candidate closed circle, the second reachable point is adjacent to the first reachable point, and the second reachable point is adjacent to the third reachable point, in simple terms , The second reachable point is in the middle, and the first reachable point and the third reachable point are on both sides.

The terminal device connects the first reachability point and the second reachability point to obtain the first connection line; the terminal device connects the second reachability point and the third reachability point to obtain the second connection line, and the terminal device connects the first connection line to The angle between the second connecting line is taken as the angle of the connecting line (because the intersection of the first connecting line and the second connecting line is the second reachable point, there is a clamp between the first connecting line and the second connecting line Angular). If the included angle of the connecting line is less than the included angle threshold, it indicates that the second reachable point is a target point that satisfies the location mutation condition, and the terminal device can delete the second reachable point.

The terminal device can continue to extract three target points from the remaining target points, as the first reachable point, the second reachable point, and the third reachable point, respectively, to determine again whether the second reachable point meets the location mutation condition. Continue to loop until there is no target point that meets the position mutation condition among the remaining target points.

For example, please refer to FIG. 5, which is a schematic diagram of determining a target point that satisfies a position mutation condition according to an embodiment of the present application. As shown in Fig. 5, the candidate closed circle includes: target point A, target point B, target point C, target point D, target point E, and target point F. The terminal device can first set target point A as the first reachable point, target point B as the second reachable point, and target point C as the third reachable point. Since ∠ABC is greater than the included angle threshold, the target point B does not meet the position mutation condition. The terminal device then regards target point B as the first reachable point, target point C as the second reachable point, and target point D as the third reachable point. Since ∠BCD is greater than the included angle threshold, target point C It is a target point that does not meet the location mutation condition. By analogy, when the target point E is regarded as the first reachable point, the target point F is regarded as the second reachable point, and the target point A is regarded as the third reachable point, since ∠EFA is less than the included angle threshold, the target point F is satisfied For the target point of the location mutation condition, the terminal device can delete the target point F. The subsequent terminal device again judges whether there is a target point that meets the location mutation condition based on the remaining target points. As shown in Figure 5, after deleting target point F, the remaining target point A, target point B, target point C, target point D, and target point E do not meet the position mutation condition, so the terminal device can follow the clockwise sequence Or connect the remaining target point A, target point B, target point C, target point D, and target point E counterclockwise, and the area obtained after the connection is the target endurance area after boundary smoothing.

The following describes another way of smoothing the candidate closed circle: the terminal device extracts 3 target points from all target points, which are the first reachable point, the second reachable point, and the third reachable point. Point, and in the candidate closed circle, the second reachable point is adjacent to the first reachable point, and the second reachable point is adjacent to the third reachable point. Simply put, the second reachable point is in the middle, The first reachable point and the third reachable point are located on both sides.

The terminal device connects the first reachable point and the third reachable point to obtain the third connecting line, and determines the distance between the second reachable point and the third connecting line (called the connecting line distance), and determines the third connecting line The length of the connection line is divided by the length of the third connection line, and the ratio obtained is called the connection line scale factor. If the scale factor of the connection line is greater than the preset scale factor threshold, the terminal device can use the second reachable point as the target point that meets the location mutation condition, and the terminal device can delete the second reachable point.

For example, please refer to FIG. 6, which is another schematic diagram of determining a target point that meets a position mutation condition provided by an embodiment of the present application. As shown in Figure 6, the candidate closed circle includes: target point A, target point B, target point C, target point D, target point E, and target point F.

The terminal device can first set target point A as the first reachable point, target point B as the second reachable point, and target point C as the third reachable point. Since the distance between target point B and line AC is divided by The length of the line segment AC is less than the preset proportional coefficient threshold, so the target point B does not meet the position mutation condition. The terminal device then regards the target point B as the first reachable point, the target point C as the second reachable point, and the target point D as the third reachable point. Because the distance between the target point C and the line segment BD is divided by the line segment The length of the BD is less than the preset proportional coefficient threshold, so the target point C does not meet the position mutation condition. By analogy, when the target point E is the first reachable point, the target point F is the second reachable point, and the target point A is the third reachable point, because the distance D1 between the target point F and the line segment AE (ie The distance of the connecting line in the foregoing) divided by the length D2 of the line segment AE (that is, the length of the third connecting line in the foregoing) is greater than the preset proportional coefficient threshold. Therefore, the target point F is the target point that meets the location mutation condition, and the terminal device can Delete the target point F. As shown in Figure 6, after deleting target point F, the remaining target point A, target point B, target point C, target point D, and target point E all do not meet the position mutation condition, so the terminal device can follow the clockwise order or Connect the remaining target point A, target point B, target point C, target point D, and target point E counterclockwise, and the area obtained after the connection is the target endurance area after boundary smoothing.

Please refer to FIG. 7, which is a schematic flowchart of another image processing method provided by an embodiment of the present application. As shown in FIG. 7, the image processing method may include:

Step S301: Obtain the remaining mileage parameters of the vehicle, and obtain the starting position of the vehicle on the map display interface.

For the specific process of step S301, please refer to the description of step S101 to step S102 in the corresponding embodiment of FIG. 3a, which will not be repeated here.

Step S302: Determine multiple original candidate points according to the starting position and the remaining mileage parameter.

For the specific process of step S302, please refer to the description of step S201 in the corresponding embodiment in FIG. 3b, which will not be repeated here.

Step S303: Determine the candidate point road network area of the original candidate point, and obtain the road network data in the candidate point road network area from the road network data set as the candidate point road network data.

Specifically, the following takes an original candidate point as an example to illustrate how to determine the candidate point road network data of the original candidate point.

The terminal device obtains the second length threshold. In the real road network, the real position corresponding to the original candidate point is the center of the circle, and the second length threshold is the radius to determine the circle. The area corresponding to the circle is the candidate point road network area ; It can be known that the second length threshold refers to the true straight line distance.

In the embodiment, in addition to being circular, the candidate point road network area may also be square. In a real road network, a square is determined by taking the real position corresponding to the original candidate point as the center and the second length threshold value as the distance from the center to the vertex, and the area corresponding to the square is the road network area of the candidate point. Wherein, the second length threshold may be equal to 1km.

When the second length threshold is 1km, the candidate point road network area can be understood as: the real road area of 1km around the original candidate point is the candidate point road network area.

In an embodiment, according to the scale factor of the map display interface and the aforementioned first length threshold (the aforementioned first length threshold is used to divide multiple unit original battery life sub-regions), the first length threshold can be converted into a true straight-line distance A. The true straight-line distance A and the second length threshold B satisfy the following relationship: A=2×B, and the second length threshold is the best empirical value determined through multiple experiments, and the first length threshold is determined by the above relationship of.

For example, when the second length threshold is equal to 1km, the true straight-line distance A corresponding to the first length threshold is 2km. On the premise that the true straight-line distance A and the second length threshold B meet the double relationship, all the original candidate points The corresponding candidate road network areas can basically cover the real road area corresponding to the original endurance area, avoiding the omission of the road area, and making the final target endurance area more accurate.

Please refer to FIG. 8, which is a schematic diagram of the relationship between the first length threshold and the second length threshold according to an embodiment of the present application. Take 4 original candidate points (original candidate point A, original candidate point B, original candidate point C, original candidate point D) as an example. The candidate road network area corresponding to the original candidate point A is area 70a; the candidate road network area corresponding to the original candidate point B is area 70b; the candidate road network area corresponding to the original candidate point C is area 70c; The candidate road network area corresponding to point D is area 70d. The true straight-line distance between the original candidate point A and the original candidate point B = 2 times the radius of the road network area of the above 4 candidate points. It can be seen from Figure 8 that it is precisely because of the double relationship that the above 4 The two candidate road network areas can basically cover the real road area formed by the four original candidate points in the road network area. This can prevent the road area from being missed, thereby making the final target endurance area more accurate.

The terminal device obtains the road network data of each candidate point road network area from the road network data collection as the candidate point road network data.

The following is a specific description of how to obtain the road network data contained in a candidate point road network area. The road network data collection can be stored in the database in the form of <Block, Rec>, where Block is the road network data block, and Rec is the unit road network data block. The road network data set can correspond to multiple blocks, and each block contains multiple Rec. Each Rec may not contain road network data, may contain one road network data, or may contain multiple road network data. The road network data contained in all Rec can be combined into a road network data set, each block is approximately equal, and the Rec contained in each block is also approximately equal, so in order to determine the road network data contained in the candidate point road network area , Logically, you need to determine the Rec where the candidate point road network area is located.

In the embodiment, the actual side length corresponding to each Block can be 12.5km*8.33km, and the actual side length corresponding to each Rec can be 100m*100m. It can also be understood that each Block can correspond to a real road network. Area, the road network area is a rectangle with a side length of 12.5km*8.33km, each Rec can also correspond to a real road network area, the road network area is a rectangle with a side length of 100m*100m, and logically adjacent Rec (or Block) is also adjacent in the real road network area.

The terminal device obtains the longitude and latitude information of the road network area where the original candidate point is located, where the longitude and latitude information includes longitude and latitude, and searches multiple road network data blocks for the road network data block corresponding to the above longitude and latitude information as the target road network data block. Which can be searched by geometric hash. The geometric hash search method refers to the existence of a hash function h(x, y), and the longitude and latitude in the latitude and longitude information are substituted into the hash function as x and y respectively to obtain the hash value z, the hash value = road The id of the network data block, that is, the target road network data block corresponding to the longitude and latitude information can be found through the latitude and longitude information and the hash function.

The terminal device searches for the four boundary latitude and longitude coordinates corresponding to the target data block, and according to the number of unit road network data blocks contained in the target road network data block, can determine the unit road network data block corresponding to the above-mentioned longitude and latitude information (referred to as the first unit Road network data block).

For example, refer to FIG. 9a, which is a schematic diagram of determining a first unit road network data block provided by an embodiment of the present application. The road network data block shown in Figure 9a includes 12 unit road network data blocks (respectively, unit road network data block 1, unit road network data block 2,..., unit road network data block 12), and the road The four boundary latitude and longitude coordinates of the network data block are (0,0), (80,0), (0,80), (80,80), if the latitude and longitude information corresponding to the original candidate point 1 is (25,25) ), since the 12 unit road network data blocks are evenly divided, it can be calculated that the unit road network data block corresponding to the latitude and longitude information (25, 25) is unit road network data block 6, namely unit road network data block 6 It is the first unit road network data block.

The terminal device obtains the second length threshold, and determines the second unit road network data block according to the second length threshold and the first unit road network data block, where the distance between the second unit road network data block and the first unit road network data block The true straight line distance is less than or equal to the second length threshold.

The terminal device may use the road network area corresponding to the first unit road network data block and the road network area corresponding to the second unit road network data block as candidate point road network areas.

In order to quickly determine the second unit road network data block, the terminal device does not need to separately determine whether each unit road network data block is the second unit road network data block, and the second length threshold can be set to the true side length corresponding to the unit road network data block. The ratio of is used as the data block coefficient, and then the first unit road network data block is taken as the center, and it extends in 4 directions (including horizontal to right, horizontal to left, vertical upward, and vertical downward) to extend the unit data block passed by The number is equal to the data block coefficient. The unit road network data blocks other than the first unit road network data block contained in the rectangular area obtained after extension are all the second unit road network data blocks, and the rectangle obtained after extension The road network area corresponding to the area is the candidate point road network area.

For example, refer to FIG. 9b, which is a schematic diagram of determining a second unit road network data block provided by an embodiment of the present application. The road network data block A shown in Figure 9b contains 36 unit road network data blocks, and the unit road network data block 1 is the first unit road network data block. If the second length threshold is 200m, and the unit road network data block corresponds to The actual side length of is equal to 100m, then the data block coefficient=200/100=2, taking the unit road network data block 1 as the center, extending the distance of 2 unit road network data blocks horizontally to the left, and horizontally to the right Extend the distance of 2 unit road network data blocks in the direction, extend the distance of 2 unit road network data blocks in the vertical upward direction, and extend the distance of 2 unit road network data blocks in the vertical downward direction, so as to determine the area All unit road network data blocks except for unit road network data block 1 in 80a are the second unit road network data blocks.

In the foregoing manner, the candidate point area corresponding to each original candidate point and the first unit road network data block and the second unit road network data block can be determined. In order to determine whether there is road network data in the candidate point area, the terminal device extracts the road network data contained in the first unit road network data block from the database, and extracts the road network data contained in the second unit road network data block, which will be extracted The road network data as the road network data collection.

Due to the need to extend outwards, there is a case where the second unit road network data block corresponds to multiple Blocks. Please refer to FIG. 10a, which is another schematic diagram of determining the second unit road network data block provided by an embodiment of the present application. Figure 10a contains 4 road network data blocks (respectively road network data block 1, road network data block 2, road network data block 3 and road network data block 4), and unit road network data block 2 is the first unit road network Data block, when the data block coefficient is equal to 2, it can be determined according to the above method that the unit road network data blocks in area 80b except for unit road network data block 2 are all the second unit road network data blocks. The network data block belongs to 4 road network data blocks. In this case, the terminal device needs to find the road network data contained in the first unit road network data block and the second unit road network data block from the 4 road network data blocks in the database. The road network data contained in the network data block is used as the candidate point road network data.

Step S304: If the candidate point road network data is a non-empty set, determine the original candidate point as a candidate point.

Specifically, if the candidate point road network data is a non-empty set, that is to say, there are real roads in the candidate point road network area (that is, the candidate point road network area is not in a river, mountain area, or closed control area ), the terminal device can use the original candidate point as a candidate point.

Refer to FIG. 10b, which is a schematic diagram of determining candidate points according to an embodiment of the present application. Figure 10b contains 12 original candidate points (respectively original candidate points A, ..., original candidate point L), and point S is the starting position. In Figure 10b, if there is a road network data connection between the two original candidate points, a solid line is used to connect the two candidate points; if there is no road network data connection between the two original candidate points, a dashed line is used to connect the two Alternative points. It can be seen from Figure 10b that since the original candidate point A, the original candidate point B, the original candidate point C, and the original candidate point D are in the lake area, the four original candidate points above are in the candidate road network area There is no road network data, so the terminal device can filter out the original candidate point A, the original candidate point B, the original candidate point C, and the original candidate point D; relatively, the remaining 8 original candidate points (ie The original candidate points E,..., and the original candidate points L) all have road network data in the candidate road network areas corresponding to them, and the terminal device can use all the remaining 8 original candidate points as candidate points.

Step S305: Determine the road network path distance between the candidate point and the starting position according to the road network data set.

For the selected candidate points, the terminal device can call the path planning interface to determine the road network path distance between each candidate point and the starting position. The road network path distance refers to the real road distance between two points (Or the path planning distance).

The path planning interface can determine the path distance of the road network between the candidate point and the starting position based on the Dijkstra algorithm in the path planning or the A* search algorithm. Both of the above two algorithms belong to the shortest path algorithm. Dijkstra's algorithm has higher accuracy but a large amount of calculation, while the accuracy of the A* search algorithm is reduced, but the amount of calculation is small. The following uses the A* search algorithm as an example to explain in detail how to determine the distance of the road network path between the candidate point and the starting position.

Refer to FIG. 11a, which is a schematic diagram of determining the path distance of a road network according to an embodiment of the present application. In order to determine the road network path distance (also the shortest distance) from vertex V0 to vertex V5, the open list and the close list are first generated, and both lists are empty sets at this time. The terminal device first adds (V0, 0) to the open list. At this time, the open list contains (V0, 0), and the close list is empty. The first element in (V0, 0) represents the vertex, and the second element represents the The distance between the vertex and the starting vertex V0.

The terminal device adds the vertex adjacent to V0 to the open list, and adds (V0, 0) to the close list. At this time, the open list contains: (V2, 10), (V4, 30), (V5, 100) ), the close list contains (V0, 0).

Select the smallest V2 from the open list and add it to the close list. The terminal device adds the vertices adjacent to V2 to the open list and adjusts the distance from each vertex to V0. At this time, the open list contains: (V1, 15), (V4, 30), (V3, 60), (V5, 100), the close list contains (V0, 0), (V2, 10).

Since V1 is already a boundary vertex, V1 is deleted from the open list. Then select the smallest V4 from the open list and add it to the close list. The terminal device adds the vertices adjacent to V4 to the open list and adjusts the distance from each vertex to V0. At this time, the open list contains: (V3, 50) , (V5, 90), (V5, 100), the close list contains (V0, 0), (V2, 10), (V4, 30).

Select the smallest V3 from the open list and add it to the close list. The terminal device adds the vertices adjacent to V3 to the open list and adjusts the distance from each vertex to V0. At this time, the open list contains: (V5, 60), The close list contains (V0, 0), (V2, 10), (V4, 30), (V3, 50).

Select V5 from the open list and add it to the close list. At this time, the open list is an empty set, and the close list contains (V0, 0), (V2, 10), (V4, 30), (V3, 50), (V5, 60).

So far, it is determined that the road network path distance from vertex V0 to vertex V5 is 60, and the corresponding path is V0→V2→V4→V3→V5.

Whether it is the A* search algorithm or the Dijkstra algorithm, the shortest path distance between two points (road network path distance) is determined according to the topology map. For the road network data set, the intersection of the two roads corresponds to the topology The vertices of the graph and the distance between roads correspond to the weights between two vertices in the topological graph. In this way, the corresponding topological graph can be generated from the road network data collection, and the road network path distance can be determined based on the path planning algorithm.

Step S306: If the road network path distance between the candidate point and the starting position is less than or equal to the remaining mileage parameter, determine the candidate point as the reachable candidate point.

Take those candidate points whose road network path distance from the starting position is less than or equal to the remaining mileage parameter as reachable candidate points; correspondingly, filter out those whose road network path distance from the starting position is greater than the remaining mileage parameter Candidate points.

Step S307: Determine the reachable candidate point as a target point, and connect the multiple target points in the map display interface to obtain the target cruising area.

For the specific process of step S307, please refer to the description of step S203 to step S204 in the corresponding embodiment of FIG. 3b, which will not be repeated here.

Step S308: Display the target battery life area on the map display interface.

For the specific process of step S308, reference may be made to the description of step S104 in the corresponding embodiment in FIG. 3a, which is not repeated here.

Please refer to FIG. 11b, which is a schematic diagram of a target endurance area provided by an embodiment of the present application. It can be seen from Figure 11b that the starting position of the vehicle is very close to the sea area, so when the terminal device selects the reachable candidate points reachable by the vehicle from the multiple original candidate points, those original equipment in the sea area The selected point will be judged as a point unreachable by the vehicle, so the original candidate points in the sea area will be filtered out, and the original candidate points that are retained by the vehicle can be used as reachable candidates point. Further, after determining the reachable candidate point, for each unit's original cruising area, the terminal device may use the reachable candidate point farthest from the starting position as the target point. Finally, the terminal device connects all target points on the map display interface in a clockwise or counterclockwise order, and the obtained area is the target endurance area.

It can be seen from the above that, compared to manually estimating the target endurance area based on the remaining mileage data and current road conditions, by automatically determining the target endurance area on the map interface, the actual reachable range of the car can be more intuitively displayed to the user, thereby improving the follow-up The efficiency of itinerary planning; further, the target endurance area determined by the embodiment of the present application is composed of multiple points that are farthest from the starting point and reachable, so the target endurance area has high accuracy.

Further, please refer to FIG. 12, which is a schematic structural diagram of an image processing apparatus according to an embodiment of the present application. As shown in Fig. 12, the image processing apparatus 1 can be applied to the terminal equipment in the corresponding embodiment of Figs. 3a-11b. The image processing apparatus 1 can include: a first acquisition module 11, a second acquisition module 12, and a target area determination module 13.

The first obtaining module 11 is used to obtain the remaining mileage parameters of the vehicle;

The second acquiring module 12 is configured to acquire the starting position of the vehicle in the map display interface;

The target area determining module 13 is configured to determine a target cruising area in the map display interface according to the starting position and the remaining mileage parameter;

The first obtaining module 11 is also used to display the target range of travel on the map display interface.

Among them, the specific functional implementation of the first acquisition module 11, the second acquisition module 12, and the target area determination module 13 can be referred to step S101 to step S104 in the corresponding embodiment of FIG. 3a, which will not be repeated here.

Referring to FIG. 12, the target area determining module 13 may include: a target point determining unit 131 and a connecting unit 132.

The target point determining unit 131 is configured to determine multiple target points in the map display interface according to the starting position and the remaining mileage parameter;

The connecting unit 132 is configured to connect the multiple target points in the map display interface to obtain the target endurance area.

For specific functional implementations of the target point determining unit 131 and the connecting unit 132, refer to step S103 in the corresponding embodiment of FIG. 3a, and details are not described herein again.

Referring to FIG. 12, the target point determination unit 131 may include: an original point determination subunit 1311, a selection subunit 1312, and a target point determination subunit 1313.

An original point determining subunit 1311, configured to determine multiple original candidate points according to the starting position and the remaining mileage parameter;

The selection subunit 1312 is configured to select an original candidate point reachable by the vehicle from the multiple original candidate points as the reachable candidate point;

The target point determining subunit 1313 is configured to determine the reachable candidate point as a target point.

Among them, the specific functional implementation of the original point determining subunit 1311, the selecting subunit 1312, and the target point determining subunit 1313 can be referred to step S201 to step S203 in the corresponding embodiment of FIG. 3b, which will not be repeated here.

Referring to FIG. 12, the original point determining subunit 1311 may include: an area determining subunit 13111 and a first dividing subunit 13112.

An area determination subunit 13111, configured to determine an original cruising area in the map display interface according to the starting position and the remaining mileage parameter;

The first division subunit 13112 is configured to divide the original battery life area into at least one unit original battery life area, and determine the original candidate points in each unit original battery life area.

For specific functional implementations of the area determining sub-unit 13111 and the first dividing sub-unit 13112, refer to step S202 in the corresponding embodiment of FIG. 3b, and details are not described herein again.

Referring to Fig. 12, the target point determining subunit 1313 may include: a first determining subunit 13131 and a second determining subunit 13132.

The first determining subunit 13131 is configured to select the reachable candidate point with the largest distance from the starting position from the reachable candidate points in the original cruising area of each unit as the candidate point corresponding to the original cruising area of the unit The target point to be determined;

The second determining subunit 13132 is configured to use the target points to be determined corresponding to the original range of all units as the target points.

For the specific functional implementation of the first determining sub-unit 13131 and the second determining sub-unit 13132, reference may be made to step S203 in the embodiment corresponding to FIG. 3b, which will not be repeated here.

Referring to FIG. 12, the selecting subunit 1312 may include: a first obtaining subunit 13121 and a first distance determining subunit 13122;

The first obtaining subunit 13121 is used to determine the candidate point road network area of each original candidate point;

The first distance determining subunit 13122 is configured to obtain the road network data in the candidate point road network area from the road network data set as the candidate point road network data;

The first distance determining subunit 13122 is further configured to determine the original candidate point as a candidate point if the candidate point road network data is a non-empty set;

The first distance determining subunit 13122 is further configured to determine the road network path distance between the candidate point and the starting position according to the road network data set;

The first distance determining subunit 13122 is further configured to determine the candidate point as the candidate point if the road network path distance between the candidate point and the starting position is less than or equal to the remaining mileage parameter Can reach alternative points.

For specific functional implementations of the first obtaining subunit 13121 and the first distance determining subunit 13122, reference may be made to step S303 to step S306 in the embodiment corresponding to FIG. 7 above, and details are not described herein again.

Referring to FIG. 12, the area determining sub-unit 13111 may include: a second obtaining sub-unit 131111 and a circumference determining sub-unit 131112.

The second obtaining subunit 131111 is configured to obtain a map scale coefficient corresponding to the map display interface;

The second obtaining subunit 131111 is further configured to determine the mileage radius coefficient according to the remaining mileage parameter and the map scale coefficient;

The circle determination subunit 131112 is used to generate a mileage circle in the map display interface, using the starting position as the center of the circle and the mileage radius coefficient as the radius, and corresponding the mileage circle in the map display interface The area of is determined as the original battery life area.

For the specific functional implementation of the second obtaining subunit 131111 and the circumference determining subunit 131112, refer to step S201 in the embodiment corresponding to FIG. 3b, and will not be repeated here.

Referring to FIG. 12, the first dividing subunit 13112 may include: a third obtaining subunit 131121 and a second dividing subunit 131122.

The third obtaining subunit 131121 is configured to obtain a polar angle interval coefficient, and divide the original endurance area into the at least one unit original endurance area according to the polar angle interval coefficient;

The second division subunit 131122 is used to divide each unit original battery life area into at least one unit original battery life sub-areas; the difference between the area side length of each unit original battery life sub-areas and the first length threshold is less than the difference threshold ；

The second division subunit 131122 is further configured to use the vertex of the original battery life subregion of each unit as the original candidate point in the map display interface.

For the specific functional implementation of the third acquiring subunit 131121 and the second dividing subunit 131122, refer to step S201 in the embodiment corresponding to FIG. 3b, and details are not described herein again.

Referring to FIG. 12, the first obtaining subunit 13121 may include: a fourth obtaining subunit 131211 and a searching subunit 131212.

The fourth acquisition subunit 131211 is used to acquire the longitude and latitude information of the original candidate point, and search for the target road network data block corresponding to the longitude and latitude information from multiple road network data blocks; the road network data set corresponds to the Multiple road network data blocks; each road network data block includes multiple unit road network data blocks;

The searching subunit 131212 is configured to search for the first unit road network data block corresponding to the longitude and latitude information from the multiple unit road network data blocks corresponding to the target road network data block;

The fourth obtaining subunit 131211 is further configured to obtain a second length threshold, and determine a second unit road network data block adjacent to the first unit road network data block according to the second length threshold;

The fourth acquiring subunit 131211 is further configured to use the road network area corresponding to the first unit road network data block and the road network area corresponding to the second unit road network data block as the original backup The optional point road network area of the selected point.

For the specific functional implementation of the fourth acquiring subunit 131211 and the searching subunit 131212, refer to step S303 in the embodiment corresponding to FIG. 7 above, and details are not described herein again.

Referring to FIG. 12, the first determining sub-unit 13131 may include: a second distance determining sub-unit 131311 and a third determining sub-unit 131312.

The second distance determining subunit 131311 is configured to determine the map distance between the reachable candidate point in the original range of the unit and the starting position in the map display interface;

The third determining subunit 131312 is configured to use the reachable candidate point with the largest map distance as the target point to be determined corresponding to the original range of the unit.

For the specific functional implementation of the second distance determining sub-unit 131311 and the third determining sub-unit 131312, refer to step S203 in the embodiment corresponding to FIG. 3b, which will not be repeated here.

Referring to FIG. 12, the first determining subunit 13131 may further include: a third distance determining subunit 131313 and a fourth determining subunit 131314.

The third distance determining subunit 131313 is configured to determine the road network path distance between the reachable candidate point in the original range of the unit and the starting position as a candidate road network path distance;

The fourth determining subunit 131314 is configured to use the reachable candidate point with the largest candidate road network path distance as the target point to be determined corresponding to the unit's original cruising area.

For specific functional implementations of the third distance determining sub-unit 131313 and the fourth determining sub-unit 131314, refer to step S303 in the corresponding embodiment of FIG. 7 above, and details are not described herein again.

Referring to FIG. 12, the connection unit 132 may include: a connection subunit 1321, a deletion subunit 1322.

The connecting subunit 1321 is used to connect each of the target points in a clockwise order or a counterclockwise order to obtain a candidate closed circle;

The deletion subunit 1322 is configured to delete the target point that meets the position mutation condition from the candidate closed circle;

The connection subunit 1321 is further configured to connect the remaining target points in the clockwise sequence or the counterclockwise sequence in the map display interface to obtain the target cruising area.

For the specific functional implementation of the connection subunit 1321 and the deletion subunit 1322, please refer to step S204 in the corresponding embodiment of FIG. 3b, which will not be repeated here.

Referring to Figure 12, the target point includes a first reachable point, a second reachable point, and a third reachable point; in the candidate closed circle, the second reachable point is relative to the first reachable point. Adjacent, and the second reachable point is adjacent to the third reachable point;

The image processing apparatus 1 may include: a first acquisition module 11, a second acquisition module 12, and a target area determination module 13; and may also include: a first connection module 14 and an included angle determination module 15.

The first connection module 14 is configured to connect the first reachable point and the second reachable point to obtain a first connection line;

The first connection module 14 is also used to connect the second reachable point and the third reachable point to obtain a second connection line;

The included angle determination module 15 is configured to determine the included angle of the connecting line according to the first connecting line and the second connecting line, and if the included angle of the connecting line is less than the included angle threshold, determine the second reachable point It is the target point that meets the mutation condition of the position.

The specific functional implementation of the first connection module 14 and the included angle determination module 15 can be found in step S204 in the corresponding embodiment of FIG. 3b, which will not be repeated here.

The image processing apparatus 1 may include: a first acquisition module 11, a second acquisition module 12, a target area determination module 13, a first connection module 14, an included angle determination module 15, and may also include: a second connection module 16, a coefficient determination module 17.

The second connection module 16 is configured to connect the first reachable point and the third reachable point to obtain a third connecting line;

The coefficient determining module 17 is configured to determine the connection line distance between the second reachable point and the third connection line, and generate a connection line scale coefficient according to the connection line distance and the length of the third connection line;

The coefficient determining module 16 is further configured to determine the second reachable point as a target point that satisfies the location mutation condition if the scale factor of the connecting line is greater than the scale factor threshold.

The specific functional implementation of the second connection module 16 and the coefficient determination module 17 can be found in step S204 in the corresponding embodiment of FIG. 3b, and details are not described herein again.

It can be seen from the above that, compared to manually estimating the target endurance area based on the remaining mileage data and the current road conditions, by automatically determining the target endurance area on the map interface, the actual reachable range of the car can be more intuitively displayed to the user, which can improve the follow-up The efficiency of itinerary planning; further, the target endurance area determined by the embodiment of the present application is composed of multiple points that are farthest from the starting point and reachable, so the target endurance area has high accuracy.

Further, please refer to FIG. 13, which is a schematic structural diagram of an electronic device according to an embodiment of the present application. The electronic device 1000 shown in FIG. 13 may be a terminal device in the embodiment corresponding to FIG. 3a to FIG. 11b described above. As shown in FIG. 13, the electronic device 1000 may include: a user interface 1002, a processor 1004, an encoder 1006, and a memory 1008. The signal receiver 1016 is used to receive or send data via the cellular interface 1010, the WIFI interface 1012,..., or the NFC interface 1014. The encoder 1006 encodes the received data into a data format processed by the computer. A computer program is stored in the memory 1008, and the processor 1004 is configured to execute the steps in any one of the foregoing method embodiments through the computer program. The memory 1008 may include a volatile memory (for example, a dynamic random access memory DRAM), and may also include a non-volatile memory (for example, a one-time programmable read-only memory OTPROM). In some examples, the memory 1008 may further include a memory remotely provided with respect to the processor 1004, and these remote memories may be connected to the electronic device 1000 via a network. The user interface 1002 may include a keyboard 1018 and a display 1020.

In the electronic device 1000 shown in FIG. 13, the processor 1004 may be used to call a computer program stored in the memory 1008 to implement:

Obtain the remaining mileage parameters of the vehicle;

Acquiring the starting position of the vehicle in the map display interface;

The target battery life area is displayed in the map display interface.

In one embodiment, when the processor 1004 executes the determination of the target cruising area in the map display interface according to the starting position and the remaining mileage parameter, it specifically executes the following steps:

Determining multiple target points in the map display interface according to the starting position and the remaining mileage parameter;

In the map display interface, the multiple target points are connected to obtain the target endurance area.

In one embodiment, when the processor 1004 executes the determination of multiple target points in the map display interface according to the starting position and the remaining mileage parameter, it specifically executes the following steps:

Determine multiple original candidate points according to the starting position and the remaining mileage parameter;

Selecting an original candidate point reachable by the vehicle from the multiple original candidate points as the reachable candidate point;

The reachable candidate point is determined as the target point.

In one embodiment, when the processor 1004 executes the determination of multiple original candidate points according to the starting position and the remaining mileage parameter, it specifically executes the following steps:

Determine the original cruising area in the map display interface according to the starting position and the remaining mileage parameter;

The original battery life area is divided into at least one unit original battery life area, and the original candidate points are respectively determined in each unit original battery life area.

In an embodiment, the processor 1004 specifically executes the following steps when determining the reachable candidate point as the target point:

From the reachable candidate points in the original cruising area of each unit, select the reachable candidate point with the largest distance from the starting position as the target point to be determined corresponding to the original cruising area of the unit;

The target point to be determined corresponding to the original cruising area of all units is taken as the target point.

In one embodiment, when the processor 1004 executes selecting the original candidate points reachable by the vehicle from the plurality of original candidate points as the reachable candidate points, it specifically executes the following steps:

Determine the candidate point road network area of each original candidate point, and obtain the road network data in the candidate point road network area from the road network data set as the candidate point road network data;

If the candidate point road network data is a non-empty set, determining the original candidate point as a candidate point;

Determine the road network path distance between the candidate point and the starting position according to the road network data set;

If the road network path distance between the candidate point and the starting position is less than or equal to the remaining mileage parameter, the candidate point is determined as the reachable candidate point.

In an embodiment, the processor 1004 specifically executes the following steps when executing the determination of the original cruising area in the map display interface according to the starting position and the remaining mileage parameter:

Acquiring a map scale factor corresponding to the map display interface;

Determine the mileage radius coefficient according to the remaining mileage parameter and the map scale coefficient;

In the map display interface, taking the starting position as the center of the circle, and the mileage radius coefficient as the radius, generate a mileage circle, and determine the area corresponding to the mileage circle in the map display interface as the original battery life area.

In one embodiment, when the processor 1004 executes the division of the original battery life area into at least one unit original battery life area, and respectively determines the original candidate points in each unit original battery life area, specifically executes the following steps:

Acquiring a polar angle interval coefficient, and dividing the original endurance area into the at least one unit original endurance area according to the polar angle interval coefficient;

Divide each unit's original battery life area into at least one unit original battery life sub-areas; the difference between the area side length of each unit original battery life sub-area and the first length threshold is less than the difference threshold;

In the map display interface, the vertex of the original battery life sub-region of each unit is used as the original candidate point.

In an embodiment, the processor 1004 specifically executes the following steps when determining the candidate point road network area of each original candidate point:

Obtain the longitude and latitude information of the original candidate point, and search for the target road network data block corresponding to the longitude and latitude information from multiple road network data blocks; the road network data set corresponds to the multiple road network data blocks; Each road network data block includes multiple unit road network data blocks;

Searching for the first unit road network data block corresponding to the latitude and longitude information from the multiple unit road network data blocks corresponding to the target road network data block;

Acquiring a second length threshold, and determining a second unit road network data block adjacent to the first unit road network data block according to the second length threshold;

The road network area corresponding to the first unit road network data block and the road network area corresponding to the second unit road network data block are used as the candidate point road network area of the original candidate point.

In one embodiment, the processor 1004 selects the reachable candidate point with the largest distance from the starting position from the reachable candidate points in the original range of each unit as the When the target point to be determined corresponding to the original battery life area, perform the following steps:

Determining the map distance between the reachable candidate point in the original battery life area of the unit and the starting position in the map display interface;

The reachable candidate point with the largest map distance is taken as the target point to be determined corresponding to the original range of the unit.

Determine the road network path distance between the reachable candidate point in the original endurance area of the unit and the starting position as a candidate road network path distance;

The reachable candidate point with the largest candidate road network path distance is taken as the target point to be determined corresponding to the unit original range.

In one embodiment, when the processor 1004 executes in the map display interface to connect the multiple target points to obtain the target endurance area, it specifically executes the following steps:

Connect each of the target points in a clockwise sequence or a counterclockwise sequence to obtain candidate closed circles;

Deleting target points that meet the position mutation condition from the candidate closed circle;

In the map display interface, the remaining target points are connected in the clockwise sequence or the counterclockwise sequence to obtain the target cruising area.

In one embodiment, the target point includes a first reachable point, a second reachable point, and a third reachable point; in the candidate closed circle, the second reachable point and the first reachable point Reach points are adjacent, and the second reachable point is adjacent to the third reachable point;

The processor 1004 further executes the following steps:

Connect the first reachable point and the second reachable point to obtain a first connection line;

Connect the second reachable point and the third reachable point to obtain a second connecting line;

Determine the included angle of the connecting line according to the first connecting line and the second connecting line, and if the included angle of the connecting line is less than the included angle threshold, the second reachable point is determined as the one that satisfies the position mutation condition Target.

In an embodiment, the target point includes a first reachable point, a second reachable point, and a third reachable point; in the candidate closed circle, the second reachable point and the first reachable point Reach points are adjacent, and the second reachable point is adjacent to the third reachable point;

The processor 1004 further executes the following steps:

Connect the first reachable point and the third reachable point to obtain a third connecting line;

Determine the connection line distance between the second reachable point and the third connection line, and generate a connection line scale factor according to the connection line distance and the length of the third connection line;

If the scale factor of the connecting line is greater than the scale factor threshold, the second reachable point is determined as the target point that satisfies the location mutation condition.

It should be understood that the electronic device 1000 described in the embodiment of the present application can execute the description of the image processing method in the foregoing embodiment corresponding to FIG. 3a to FIG. 11b, and may also execute the foregoing description of the image processing method in the foregoing embodiment corresponding to FIG. 12 The description of the image processing device 1 will not be repeated here. In addition, the description of the beneficial effects of using the same method will not be repeated.

In addition, the embodiments of the present application also provide a computer storage medium, and the computer storage medium stores the aforementioned computer program executed by the image processing apparatus 1, and the computer program includes program instructions. When the processor executes the program instructions, it can execute the description of the image processing method in the foregoing embodiment corresponding to FIG. 3a to FIG. 11b, and therefore, it will not be repeated here. In addition, the description of the beneficial effects of using the same method will not be repeated. For technical details not disclosed in the embodiments of the computer storage media involved in this application, please refer to the description of the method embodiments of this application.

A person of ordinary skill in the art can understand that all or part of the processes in the above-mentioned embodiments can be implemented by instructing relevant hardware through a computer program. The program can be stored in a computer readable storage medium. During execution, it may include the procedures of the above-mentioned method embodiments. Wherein, the storage medium may be a magnetic disk, an optical disc, a read-only memory (Read-Only Memory, ROM), or a random access memory (Random Access Memory, RAM), etc.

The above-disclosed are only the embodiments of the application, which of course cannot be used to limit the scope of rights of the application. Therefore, equivalent changes made according to the claims of the application still fall within the scope of the application.

Claims

An image processing method, executed by an electronic device, including:

Obtain the remaining mileage parameters of the vehicle;

Acquiring the starting position of the vehicle in the map display interface;

Determining a target cruising area in the map display interface according to the starting position and the remaining mileage parameter;

The target battery life area is displayed in the map display interface.
The method according to claim 1, wherein the determining the target cruising area in the map display interface according to the starting position and the remaining mileage parameter comprises:

Determining multiple target points in the map display interface according to the starting position and the remaining mileage parameter;

In the map display interface, the multiple target points are connected to obtain the target cruising area.
The method according to claim 2, wherein the determining multiple target points in the map display interface according to the starting position and the remaining mileage parameter comprises:

Determine multiple original candidate points according to the starting position and the remaining mileage parameter;

Selecting an original candidate point reachable by the vehicle from the multiple original candidate points as the reachable candidate point;

The reachable candidate point is determined as the target point.
The method according to claim 3, wherein the determining a plurality of original candidate points according to the starting position and the remaining mileage parameter comprises:

Determine the original cruising area in the map display interface according to the starting position and the remaining mileage parameter;

The original battery life area is divided into at least one unit original battery life area, and the original candidate points are respectively determined in each unit original battery life area.
The method according to claim 4, wherein the determining the reachable candidate point as a target point comprises:

From the reachable candidate points in the original cruising area of each unit, select the reachable candidate point with the largest distance from the starting position as the target point to be determined corresponding to the original cruising area of the unit;

The target point to be determined corresponding to the original cruising area of all units is taken as the target point.
The method according to any one of claims 3 to 5, wherein the selecting the original candidate points reachable by the vehicle from the plurality of original candidate points as the reachable candidate points comprises:

Determine the candidate point road network area of each original candidate point, and obtain the road network data in the candidate point road network area from the road network data set as the candidate point road network data;

If the candidate point road network data is a non-empty set, determine the original candidate point as a candidate point;

Determine the road network path distance between the candidate point and the starting position according to the road network data set;

If the road network path distance between the candidate point and the starting position is less than or equal to the remaining mileage parameter, the candidate point is determined as the reachable candidate point.
The method according to claim 4, wherein the determining the original cruising area in the map display interface according to the starting position and the remaining mileage parameter comprises:

Acquiring a map scale factor corresponding to the map display interface;

Determine the mileage radius coefficient according to the remaining mileage parameter and the map scale coefficient;

In the map display interface, taking the starting position as the center of the circle and the mileage radius coefficient as the radius, generate a mileage circle, and determine the area corresponding to the mileage circle in the map display interface as the original battery life area.
The method according to claim 4, wherein the dividing the original battery life area into at least one unit original battery life area, and separately determining the original candidate points in each unit original battery life area, comprises:

Acquiring a polar angle interval coefficient, and dividing the original endurance area into the at least one unit original endurance area according to the polar angle interval coefficient;

Divide each unit's original battery life area into at least one unit original battery life sub-areas; the difference between the area side length of each unit original battery life sub-area and the first length threshold is less than the difference threshold;

In the map display interface, the vertex of the original battery life sub-region of each unit is used as the original candidate point.
The method according to claim 6, wherein said determining the candidate point road network area of each original candidate point comprises:

Obtain the longitude and latitude information of the original candidate point, and search for the target road network data block corresponding to the longitude and latitude information from multiple road network data blocks; the road network data set corresponds to the multiple road network data blocks; Each road network data block includes multiple unit road network data blocks;

Searching for the first unit road network data block corresponding to the latitude and longitude information from the multiple unit road network data blocks corresponding to the target road network data block;

Acquiring a second length threshold, and determining a second unit road network data block adjacent to the first unit road network data block according to the second length threshold;

The road network area corresponding to the first unit road network data block and the road network area corresponding to the second unit road network data block are used as the candidate point road network area of the original candidate point.
The method according to claim 5, wherein, among the reachable candidate points in the original range of each unit, the reachable candidate point with the largest distance from the starting position is selected as the The target points to be determined corresponding to the original battery life area include:

Determining the map distance between the reachable candidate point in the original range of the unit and the starting position in the map display interface;

The reachable candidate point with the largest map distance is taken as the target point to be determined corresponding to the original range of the unit.
The method according to claim 5, wherein, among the reachable candidate points in the original range of each unit, the reachable candidate point with the largest distance from the starting position is selected as the The target points to be determined corresponding to the original battery life area include:

Determine the road network path distance between the reachable candidate point in the original endurance area of the unit and the starting position as a candidate road network path distance;

The reachable candidate point with the largest candidate road network path distance is taken as the target point to be determined corresponding to the unit original range.
The method according to claim 2, wherein the connecting the multiple target points in the map display interface to obtain the target endurance area comprises:

Connect each of the target points in a clockwise sequence or a counterclockwise sequence to obtain candidate closed circles;

Deleting target points that meet the position mutation condition from the candidate closed circle;

In the map display interface, the remaining target points are connected in the clockwise sequence or the counterclockwise sequence to obtain the target cruising area.
The method according to claim 12, wherein the target point includes a first reachable point, a second reachable point, and a third reachable point; in the candidate closed circle, the second reachable point and The first reachable point is adjacent, and the second reachable point is adjacent to the third reachable point;

The method also includes:

Connect the first reachable point and the second reachable point to obtain a first connection line;

Connect the second reachable point and the third reachable point to obtain a second connecting line;

Determine the included angle of the connecting line according to the first connecting line and the second connecting line. If the included angle of the connecting line is less than the included angle threshold, the second reachable point is determined as the one that satisfies the position mutation condition Target.
The method according to claim 12, wherein the target point includes a first reachable point, a second reachable point, and a third reachable point; in the candidate closed circle, the second reachable point and The first reachable point is adjacent, and the second reachable point is adjacent to the third reachable point;

The method also includes:

Connect the first reachable point and the third reachable point to obtain a third connecting line;

Determine the connection line distance between the second reachable point and the third connection line, and generate a connection line scale factor according to the connection line distance and the length of the third connection line;

If the scale factor of the connecting line is greater than the scale factor threshold, the second reachable point is determined as the target point that satisfies the location mutation condition.
An image processing device, which includes:

The first obtaining module is used to obtain the remaining mileage parameters of the vehicle;

The second acquiring module is used to acquire the starting position of the vehicle in the map display interface;

A target area determination module, configured to determine a target endurance area in the map display interface according to the starting position and the remaining mileage parameter;

The first acquisition module is also used to display the target battery life area in the map display interface.
The apparatus according to claim 15, wherein the target area determination module comprises:

A target point determining unit, configured to determine multiple target points in the map display interface according to the starting position and the remaining mileage parameter;

The connecting unit is configured to connect the multiple target points in the map display interface to obtain the target endurance area.
The apparatus according to claim 16, wherein the target point determination unit comprises:

An original point determination subunit, configured to determine multiple original candidate points according to the starting position and the remaining mileage parameter;

The selection subunit is used to select the original candidate point reachable by the vehicle from the multiple original candidate points as the reachable candidate point;

The target point determination subunit is used to determine the reachable candidate point as a target point.
The apparatus according to claim 17, wherein the original point determination subunit comprises:

An area determination subunit, configured to determine an original cruising area in the map display interface according to the starting position and the remaining mileage parameter;

The first division subunit is used to divide the original endurance area into at least one unit original endurance area, and to determine the original candidate points in each unit original endurance area.
An electronic device, including: a processor and a memory;

The processor is connected to a memory, wherein the memory is used to store a computer program, and the processor is used to call the computer program to execute the method according to any one of claims 1-14.
A computer storage medium, wherein the computer storage medium stores a computer program, and the computer program includes program instructions. When the program instructions are executed by a processor, the program instructions according to any one of claims 1-14 are executed. method.