CN114201571A - Gas station recommendation method and device, electronic equipment and storage medium - Google Patents
Gas station recommendation method and device, electronic equipment and storage medium Download PDFInfo
- Publication number
- CN114201571A CN114201571A CN202111534445.4A CN202111534445A CN114201571A CN 114201571 A CN114201571 A CN 114201571A CN 202111534445 A CN202111534445 A CN 202111534445A CN 114201571 A CN114201571 A CN 114201571A
- Authority
- CN
- China
- Prior art keywords
- path
- gas station
- recommended
- distance
- coordinates
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 39
- 238000012216 screening Methods 0.000 claims abstract description 36
- 238000013439 planning Methods 0.000 claims abstract description 26
- 239000000446 fuel Substances 0.000 claims description 52
- 238000004590 computer program Methods 0.000 claims description 15
- 238000004891 communication Methods 0.000 claims description 11
- 238000001914 filtration Methods 0.000 claims description 4
- 238000005516 engineering process Methods 0.000 abstract description 4
- 238000007405 data analysis Methods 0.000 abstract description 2
- 230000006870 function Effects 0.000 description 8
- 238000010586 diagram Methods 0.000 description 6
- 238000007726 management method Methods 0.000 description 5
- 238000013473 artificial intelligence Methods 0.000 description 3
- 238000012545 processing Methods 0.000 description 3
- 239000004973 liquid crystal related substance Substances 0.000 description 2
- 230000003287 optical effect Effects 0.000 description 2
- 230000008569 process Effects 0.000 description 2
- 230000005540 biological transmission Effects 0.000 description 1
- 238000013500 data storage Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000011156 evaluation Methods 0.000 description 1
- 230000007246 mechanism Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000002093 peripheral effect Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 238000012384 transportation and delivery Methods 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/95—Retrieval from the web
- G06F16/953—Querying, e.g. by the use of web search engines
- G06F16/9537—Spatial or temporal dependent retrieval, e.g. spatiotemporal queries
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/29—Geographical information databases
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
- G06Q10/047—Optimisation of routes or paths, e.g. travelling salesman problem
Landscapes
- Engineering & Computer Science (AREA)
- Databases & Information Systems (AREA)
- Theoretical Computer Science (AREA)
- Business, Economics & Management (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Human Resources & Organizations (AREA)
- Economics (AREA)
- Strategic Management (AREA)
- Data Mining & Analysis (AREA)
- General Engineering & Computer Science (AREA)
- Development Economics (AREA)
- Game Theory and Decision Science (AREA)
- Remote Sensing (AREA)
- Entrepreneurship & Innovation (AREA)
- Marketing (AREA)
- Operations Research (AREA)
- Quality & Reliability (AREA)
- Tourism & Hospitality (AREA)
- General Business, Economics & Management (AREA)
- Navigation (AREA)
Abstract
The invention relates to a data analysis technology and discloses a gas station recommendation method, which comprises the following steps: calculating according to the average oil consumption and the current oil quantity to obtain the driving mileage; constructing a region to be recommended according to the current position coordinates and the predicted driving mileage, and planning a shortest path between the current position coordinates and each refueling station in the region to be recommended to obtain a first path; screening gas stations in the area to be recommended according to the driving mileage and the distance of the first path; planning a shortest path between the screened gas station and the destination position coordinate to obtain a second path; distance screening is carried out on the screened gas stations according to the first path and the second path, and a target gas station is obtained; and recommending the target gas station to the terminal equipment of the user corresponding to the target vehicle. The invention also relates to a blockchain technique, the first path may be stored in a blockchain link point. The invention also provides a gasoline station recommendation device, equipment and a medium. The method and the device can improve the accuracy of the recommendation of the gas station.
Description
Technical Field
The invention relates to a data analysis technology, in particular to a gas station recommendation method, a gas station recommendation device, electronic equipment and a storage medium.
Background
Along with the increasing number of automobiles in China, automobile refueling becomes a problem which is often met by people, and the attention of people is paid to how to recommend the most suitable gasoline station to an automobile owner.
At present, when an owner needs to refuel a vehicle, the owner often recommends to a gas station closest to the current position, however, the recommendation method of the gas station only recommends from one dimension of the current position, the travel time of the owner cannot be optimized, and the recommendation accuracy of the gas station is low.
Disclosure of Invention
The invention provides a method and a device for recommending a gas station, electronic equipment and a storage medium, and mainly aims to improve the accuracy of recommending the gas station.
Acquiring the current position coordinate, the destination position coordinate and the current oil quantity of a target vehicle;
acquiring the average fuel consumption of the target vehicle, and calculating according to the average fuel consumption and the current fuel amount to obtain the predicted driving mileage;
constructing a to-be-recommended area according to the current position coordinates and the predicted driving mileage, and acquiring the position coordinates of each gas station in the to-be-recommended area to obtain corresponding coordinates of a first to-be-recommended gas station;
planning a shortest path between the current position coordinate and the first to-be-recommended gas station coordinate to obtain a first path;
screening all the coordinates of the first gas station to be recommended according to the estimated driving mileage and the distance of the first path to obtain coordinates of a second gas station to be recommended;
planning a shortest path between the coordinate of the second gas station to be recommended and the coordinate of the destination position to obtain a second path;
distance screening is carried out on the gas stations corresponding to the second to-be-recommended gas station coordinates according to the distance of the first path and the distance of the second path, and a target gas station is obtained;
and pushing the information of the target gas station to the terminal equipment of the user corresponding to the target vehicle.
Optionally, the constructing a region to be recommended according to the current position coordinates and the predicted mileage includes:
determining the current position as a circle center, and constructing a circular area by taking the predicted driving mileage as a radius to obtain an initial area to be recommended;
and performing intersection operation on the initial region to be recommended and a preset travelable region to obtain the region to be recommended.
Optionally, the planning a shortest path between the current position coordinate and the first to-be-recommended gas station coordinate to obtain a first path includes:
acquiring all path nodes between the current position coordinates in the area to be recommended and the coordinates of the first gas station to be recommended;
taking the current position coordinate as an initial node, and taking the first to-be-recommended gas station coordinate as a termination node;
starting from the starting node, sequentially connecting adjacent path nodes along the direction from the starting node to the ending node until the path nodes are connected to the ending node to obtain a node graph;
determining a path from each starting node to the ending node in the node graph as a first initial path;
carrying out path communication screening of adjacent nodes on the first initial path to obtain a second initial path;
and screening the path lengths of all the second initial paths to obtain the first path.
Optionally, the performing path connection screening of adjacent nodes on the first initial path to obtain a second initial path includes:
judging whether any two adjacent nodes in the first initial path have path connection;
and when any two adjacent nodes in the first initial path have path connection, determining the first initial path as a second initial path.
Optionally, the performing path length screening on all the second initial paths to obtain the first path includes:
acquiring a path distance between any two adjacent nodes in the second initial path, and calculating to obtain a path distance to be selected;
and determining the second initial path with the minimum distance of the candidate paths as a first path.
Optionally, the screening all the coordinates of the first to-be-recommended gasoline stations according to the predicted driving mileage and the distance of the first path to obtain coordinates of second to-be-recommended gasoline stations includes:
calculating a difference value according to the distance of the first path and the estimated driving mileage to obtain a distance difference value;
determining the distance difference value larger than a preset error distance threshold value as a target distance difference value;
determining the first path corresponding to the target distance difference value as a target first path;
and determining the coordinates of the first to-be-recommended gas station corresponding to the target first path as the coordinates of the second to-be-recommended gas station.
Optionally, the distance screening is performed on the gas station corresponding to the second to-be-recommended gas station coordinate according to the distance of the first path and the distance of the second path to obtain a target gas station, including:
calculating according to the distance of the first path and the distance of the second path corresponding to each second gas station to be recommended to obtain a corresponding target distance;
selecting the second to-be-recommended gas station coordinate corresponding to the minimum target distance as a target to-be-recommended gas station coordinate;
and determining the gas station corresponding to the target gas station coordinate to be recommended as a target gas station.
In order to solve the above problem, the present invention further provides a gasoline station recommendation device, comprising:
the route planning module is used for acquiring the current position coordinates, the destination position coordinates and the current oil quantity of the target vehicle; acquiring the average fuel consumption of the target vehicle, and calculating according to the average fuel consumption and the current fuel amount to obtain the predicted driving mileage; constructing a to-be-recommended area according to the current position coordinates and the predicted driving mileage, and acquiring the position coordinates of each gas station in the to-be-recommended area to obtain corresponding coordinates of a first to-be-recommended gas station; planning a shortest path between the current position coordinate and the first to-be-recommended gas station coordinate to obtain a first path; screening all the coordinates of the first gas station to be recommended according to the estimated driving mileage and the distance of the first path to obtain coordinates of a second gas station to be recommended; planning a shortest path between the coordinate of the second gas station to be recommended and the coordinate of the destination position to obtain a second path;
the gas station screening module is used for performing distance screening on the gas stations corresponding to the second to-be-recommended gas station coordinates according to the distance of the first path and the distance of the second path to obtain a target gas station;
and the gas station recommendation module is used for pushing the information of the target gas station to the terminal equipment of the user corresponding to the target vehicle.
In order to solve the above problem, the present invention also provides an electronic device, including:
a memory storing at least one computer program; and
and the processor executes the computer program stored in the memory to realize the gas station recommendation method.
In order to solve the above problem, the present invention further provides a computer-readable storage medium, in which at least one computer program is stored, and the at least one computer program is executed by a processor in an electronic device to implement the gas station recommendation method described above.
According to the embodiment of the invention, distance screening is carried out on the gas stations corresponding to the coordinates of the second gas station to be recommended according to the distance of the first path and the distance of the second path to obtain a target gas station, screening and recommending are carried out from three dimensions of the current position, the destination position and the residual oil quantity of the vehicle, the recommended gas station can better save the travel time of a user, and the recommendation accuracy of the gas station of the user is improved; therefore, the method, the device, the electronic equipment and the readable storage medium for recommending the gas station, provided by the embodiment of the invention, improve the accuracy rate of recommending the gas station.
Drawings
Fig. 1 is a schematic flow chart of a gasoline station recommendation method according to an embodiment of the present invention;
FIG. 2 is a schematic diagram illustrating a node graph of a gas station recommendation method according to an embodiment of the present invention;
FIG. 3 is a block diagram of a fuel station recommendation device according to an embodiment of the present invention;
fig. 4 is a schematic internal structural diagram of an electronic device for implementing a gasoline station recommendation method according to an embodiment of the present invention;
the implementation, functional features and advantages of the objects of the present invention will be further explained with reference to the accompanying drawings.
Detailed Description
It should be understood that the specific embodiments described herein are merely illustrative of the invention and are not intended to limit the invention.
The embodiment of the invention provides a method for recommending a gas station. The execution subject of the gas station recommendation method includes, but is not limited to, at least one of electronic devices such as a server and a terminal, which can be configured to execute the method provided by the embodiment of the present application. In other words, the gas station recommendation method may be executed by software or hardware installed in a terminal device or a server device, and the software may be a blockchain platform. The server includes but is not limited to: the cloud server can be an independent server, or can be a cloud server providing basic cloud computing services such as cloud service, a cloud database, cloud computing, a cloud function, cloud storage, Network service, cloud communication, middleware service, domain name service, security service, a Content Delivery Network (CDN), a big data and artificial intelligence platform, and the like.
Referring to fig. 1, a flow diagram of a gasoline station recommendation method according to an embodiment of the present invention is shown, in the embodiment of the present invention, the gasoline station recommendation method includes:
and S1, acquiring the current position coordinates, the destination position coordinates and the current oil quantity of the target vehicle.
In detail, in the embodiment of the present invention, the target vehicle is a user vehicle that needs to perform a fueling scheme recommendation, the current position coordinate is a longitude and latitude of a current position of the target vehicle, the destination position coordinate is a longitude and latitude of a destination that the target vehicle plans to reach, and the current fuel amount is a volume of a remaining fuel amount of the target vehicle.
And S2, obtaining the average fuel consumption of the target vehicle, and calculating according to the average fuel consumption and the current fuel quantity to obtain the predicted driving mileage.
In the embodiment of the present invention, in order to better calculate how far the target vehicle can still run, it is necessary to obtain an average fuel consumption of the target vehicle, where the average fuel consumption may be an average fuel consumption of the target vehicle or an average fuel consumption of a vehicle type corresponding to the target vehicle.
Further, in the embodiment of the invention, the predicted driving mileage is obtained by calculating according to the average oil consumption and the current oil consumption.
For example: the average fuel consumption is 8 liters/hundred kilometers, the current fuel amount is 4L, and the predicted mileage is 4/8 × 100 — 50 kilometers.
S3, constructing a to-be-recommended area according to the current position coordinates and the predicted driving mileage, and acquiring the position coordinates of each gas station in the to-be-recommended area to obtain the corresponding coordinates of the first to-be-recommended gas station.
In the embodiment of the invention, because the predicted driving range is constant, the gas station which can be reached by the target vehicle needs to be in an area which can be reached after the predicted driving range is driven.
Specifically, in the embodiment of the present invention, constructing an area to be recommended according to the current position coordinates and the predicted mileage includes:
determining the current position as a circle center, and constructing a circular area by taking the predicted driving mileage as a radius to obtain an initial area to be recommended;
and performing intersection operation on the initial region to be recommended and a preset travelable region to obtain the region to be recommended.
In the embodiment of the present invention, the travelable region is a region in which the target vehicle can travel.
Further, in the embodiment of the present invention, only the target vehicle at the gas station in the area to be recommended may arrive before the fuel consumption is completed, and therefore, the embodiment of the present invention needs to obtain the position coordinates of each gas station in the area to be recommended, and obtain the corresponding coordinates of the first gas station to be recommended.
S4, planning a shortest path between the current position coordinate and the first to-be-recommended gas station coordinate to obtain a first path.
In detail, in the embodiment of the present invention, planning a shortest path between the current position coordinate and the first to-be-recommended gas station coordinate to obtain a first path includes:
step A: and all path nodes between the current position coordinate and the first to-be-recommended gas station coordinate in the recommended area.
Optionally, in the embodiment of the present invention, the route nodes are all intersections along the current position coordinate to the first to-be-recommended gas station coordinate in a preset map.
And B: and taking the current position coordinate as a starting node and the first to-be-recommended gas station coordinate as a terminating node.
And C: starting from the starting node, sequentially connecting adjacent path nodes along the direction from the starting node to the ending node until the path nodes are connected to the ending node to obtain a node graph;
for example: there are A, B, C total path nodes, along the direction from the start node to the end node, the start node is adjacent A, B, A is adjacent B, B is adjacent C and the end node, and C is adjacent the end node, then the node map is as shown in FIG. 2.
Step D: determining a path from each starting node to the ending node in the node graph as a first initial path;
for example: the node map is shown as the above map, and then there are four first initial paths of "start node-a-B-C-end node", "start node-a-B-end node", and "start node-B-end node".
Step E: carrying out path communication screening of adjacent nodes on the first initial path to obtain a second initial path;
in the embodiment of the present invention, not all of the first initial paths are effective paths, and therefore, path-through screening of adjacent nodes needs to be performed on the first initial paths to obtain second initial paths.
In detail, in order to determine whether any two adjacent nodes in the first initial path have path connection, the embodiment of the present invention screens all the first initial paths according to the determination result to obtain a second initial path; if the adjacent nodes have path connection, it represents that the two nodes are actually communicated, and if the adjacent nodes do not have path connection, it represents that the two nodes are not actually communicated, therefore, when there is two adjacent nodes in the first initial path without path connection, it proves that the first initial path cannot be communicated and is a path which does not exist, and when any two adjacent nodes in the first initial path have path connection, the first initial path is determined as a second initial path.
Step G: and screening the path lengths of all the second initial paths to obtain the first path.
In detail, in the embodiment of the present invention, the performing path length screening on all the second initial paths to obtain the first path includes:
step a: acquiring a path distance between any two adjacent nodes in the second initial path, and calculating to obtain a path distance to be selected;
for example: the second initial path is a starting node-B-terminating node, the path distance from the starting node to the path node B is 1KM, the path distance from the path node B to the terminating node is 3KM, and then the distance of the candidate path corresponding to the second path is 4 KM.
Step b: and determining the second initial path with the minimum distance of the candidate paths as a first path.
In another embodiment of the present invention, the first path may be stored in a blockchain node, and the data access efficiency is improved by using the characteristic of high throughput of the blockchain node.
S5, screening all the coordinates of the first to-be-recommended gasoline stations according to the estimated driving mileage and the distance of the first path to obtain coordinates of second to-be-recommended gasoline stations.
In detail, in the embodiment of the present invention, the screening all the coordinates of the first to-be-recommended gasoline station according to the predicted mileage and the distance of the first path to obtain the coordinates of the second to-be-recommended gasoline station includes:
and selecting a first to-be-recommended gasoline station coordinate with the distance of the first path being less than or equal to the expected driving mileage to obtain a corresponding second to-be-recommended gasoline station coordinate.
Optionally, in another embodiment of the present invention, the screening all the coordinates of the first to-be-recommended gasoline station according to the predicted mileage and the distance of the first path to obtain coordinates of a second to-be-recommended gasoline station includes:
step I: calculating a difference value according to the distance of the first path and the estimated driving mileage to obtain a distance difference value;
for example: the distance of the first path is 30KM, the predicted mileage is 40KM, and the distance difference is 10KM to 40-30 KM.
Step II: determining the distance difference value larger than a preset error distance threshold value as a target distance difference value;
in the embodiment of the invention, the error distance threshold is a threshold of an error between a preset vehicle driving distance and an actual driving distance, so that a target vehicle can be better ensured to reach a gas station with a first to-be-recommended gas station coordinate corresponding to the distance of the first path.
Step III: determining the first path corresponding to the target distance difference value as a target first path;
step IV: and determining the coordinates of the first to-be-recommended gas station corresponding to the target first path as the coordinates of the second to-be-recommended gas station.
S6, planning the shortest path between the coordinates of the second gas station to be recommended and the coordinates of the destination position to obtain a second path.
Optionally, planning the shortest path between the coordinates of the second gas station to be recommended and the coordinates of the destination location in the embodiment of the present invention is similar to S4, and is not described herein again.
And S7, performing distance screening on the gas station corresponding to the second to-be-recommended gas station coordinate according to the distance of the first path and the distance of the second path to obtain a target gas station.
In detail, in the embodiment of the present invention, the distance screening is performed on the gas station corresponding to the second to-be-recommended gas station coordinate according to the distance of the first path and the distance of the second path to obtain a target gas station, including:
calculating according to the distance of the first path and the distance of the second path corresponding to each second gas station to be recommended to obtain a corresponding target distance;
selecting the second to-be-recommended gas station coordinate corresponding to the minimum target distance as a target to-be-recommended gas station coordinate;
and determining the gas station corresponding to the target gas station coordinate to be recommended as a target gas station.
In another embodiment of the present invention, because the amount of fuel consumed to reach different gasoline stations is different, distance screening is performed on the gasoline station corresponding to the second to-be-recommended gasoline station coordinate according to the distance of the first path and the distance of the second path to obtain a target gasoline station, including:
step i: calculating according to the distance of the first path and the distance of the second path corresponding to each second gas station to be recommended to obtain a corresponding target distance;
step ii: calculating according to the distance of the first path, the average oil consumption and a preset oil price to obtain a first oil consumption cost;
specifically, in the embodiment of the present invention, the first fuel consumption rate is the distance of the first route, the average fuel consumption rate, and the preset fuel consumption rate is the first fuel consumption rate.
Step iii: calculating according to the distance of the second path, the average oil consumption and a preset oil price to obtain a second oil consumption cost;
specifically, in the embodiment of the present invention, the second fuel consumption rate is the distance of the second route, the average fuel consumption rate, and the preset fuel consumption rate is the second fuel consumption rate.
Step iv: calculating according to the distance of the first path, the average oil consumption, the current oil quantity, the oil tank volume of the target vehicle and a preset oil price to obtain a predicted refueling cost;
specifically, in the embodiment of the present invention, the predicted refueling cost (the volume of the fuel tank-the current fuel amount-the distance of the first path and the average fuel consumption) is the preset fuel price
Step v: calculating according to the estimated refueling cost, the first fuel consumption cost and the second fuel consumption cost to obtain a refueling residual value;
optionally, the remaining value of refuelling is predicted refuelling cost-the first consumption cost-the second consumption cost.
Step vi: calculating the ratio of the refueling residual value corresponding to each second to-be-recommended refueling station to the predicted refueling cost to obtain a refueling coefficient;
step vii: and determining the gas station corresponding to the second to-be-recommended gas station coordinate with the highest refueling coefficient as a target gas station.
S8, pushing the information of the target gas station to the terminal equipment of the user corresponding to the target vehicle.
Optionally, the information of the target gas station can be pushed to a terminal device of a user corresponding to the target vehicle in the embodiment of the present invention, and the terminal device may be an intelligent terminal such as a mobile phone, a computer, a tablet, and the like.
Specifically, the information of the target gas station in the embodiment of the present invention includes: and the position information, the business hours, the user evaluation and other information of the target gas station.
Fig. 3 is a functional block diagram of the gasoline station recommendation device of the present invention.
The gas station recommendation device 100 of the present invention can be installed in an electronic device. According to the implemented functions, the gasoline station recommendation device may include a path planning module 101, a gasoline station filtering module 102, and a gasoline station recommendation module 103, which may also be referred to as a unit, and refer to a series of computer program segments that can be executed by a processor of an electronic device and can perform fixed functions, and are stored in a memory of the electronic device.
In the present embodiment, the functions regarding the respective modules/units are as follows:
the path planning module 101 is configured to obtain a current position coordinate, a destination position coordinate, and a current oil amount of the target vehicle; acquiring the average fuel consumption of the target vehicle, and calculating according to the average fuel consumption and the current fuel amount to obtain the predicted driving mileage; constructing a to-be-recommended area according to the current position coordinates and the predicted driving mileage, and acquiring the position coordinates of each gas station in the to-be-recommended area to obtain corresponding coordinates of a first to-be-recommended gas station; planning a shortest path between the current position coordinate and the first to-be-recommended gas station coordinate to obtain a first path; screening all the coordinates of the first gas station to be recommended according to the estimated driving mileage and the distance of the first path to obtain coordinates of a second gas station to be recommended; planning a shortest path between the coordinate of the second gas station to be recommended and the coordinate of the destination position to obtain a second path;
the gas station screening module 102 is configured to perform distance screening on the gas stations corresponding to the second to-be-recommended gas station coordinates according to the distance of the first path and the distance of the second path to obtain a target gas station;
the gas station recommendation module 103 is configured to push information of the target gas station to a terminal device of a user corresponding to the target vehicle.
In detail, when the modules in the gasoline station recommendation device 100 according to the embodiment of the present invention are used, the same technical means as the gasoline station recommendation method described in fig. 1 are adopted, and the same technical effects can be produced, which is not described herein again.
Fig. 4 is a schematic structural diagram of an electronic device for implementing a gasoline station recommendation method according to the present invention.
The electronic device may comprise a processor 10, a memory 11, a communication bus 12 and a communication interface 13, and may further comprise a computer program, such as a gasoline station recommendation program, stored in the memory 11 and executable on the processor 10.
The memory 11 includes at least one type of readable storage medium, which includes flash memory, removable hard disk, multimedia card, card-type memory (e.g., SD or DX memory, etc.), magnetic memory, magnetic disk, optical disk, etc. The memory 11 may in some embodiments be an internal storage unit of the electronic device, for example a removable hard disk of the electronic device. The memory 11 may also be an external storage device of the electronic device in other embodiments, such as a plug-in mobile hard disk, a Smart Media Card (SMC), a Secure Digital (SD) Card, a Flash memory Card (Flash Card), and the like, which are provided on the electronic device. Further, the memory 11 may also include both an internal storage unit and an external storage device of the electronic device. The memory 11 may be used not only to store application software installed in the electronic device and various types of data, such as codes of a gas station recommendation program, etc., but also to temporarily store data that has been output or will be output.
The processor 10 may be composed of an integrated circuit in some embodiments, for example, a single packaged integrated circuit, or may be composed of a plurality of integrated circuits packaged with the same or different functions, including one or more Central Processing Units (CPUs), microprocessors, digital Processing chips, graphics processors, and combinations of various control chips. The processor 10 is a Control Unit (Control Unit) of the electronic device, connects various components of the whole electronic device by using various interfaces and lines, and executes various functions and processes data of the electronic device by running or executing programs or modules (e.g., gas station recommendation programs, etc.) stored in the memory 11 and calling data stored in the memory 11.
The communication bus 12 may be a PerIPheral Component Interconnect (PCI) bus or an Extended Industry Standard Architecture (EISA) bus. The bus may be divided into an address bus, a data bus, a control bus, etc. The communication bus 12 is arranged to enable connection communication between the memory 11 and at least one processor 10 or the like. For ease of illustration, only one thick line is shown, but this does not mean that there is only one bus or one type of bus.
Fig. 4 shows only an electronic device having components, and those skilled in the art will appreciate that the structure shown in fig. 4 does not constitute a limitation of the electronic device, and may include fewer or more components than those shown, or some components may be combined, or a different arrangement of components.
For example, although not shown, the electronic device may further include a power supply (such as a battery) for supplying power to each component, and preferably, the power supply may be logically connected to the at least one processor 10 through a power management device, so that functions of charge management, discharge management, power consumption management and the like are realized through the power management device. The power source may also include any component of one or more dc or ac power sources, recharging devices, power failure classification circuits, power converters or inverters, power status indicators, and the like. The electronic device may further include various sensors, a bluetooth module, a Wi-Fi module, and the like, which are not described herein again.
Optionally, the communication interface 13 may include a wired interface and/or a wireless interface (e.g., WI-FI interface, bluetooth interface, etc.), which is generally used to establish a communication connection between the electronic device and other electronic devices.
Optionally, the communication interface 13 may further include a user interface, which may be a Display (Display), an input unit (such as a Keyboard (Keyboard)), and optionally, a standard wired interface, or a wireless interface. Alternatively, in some embodiments, the display may be an LED display, a liquid crystal display, a touch-sensitive liquid crystal display, an OLED (Organic Light-Emitting Diode) touch device, or the like. The display, which may also be referred to as a display screen or display unit, is suitable, among other things, for displaying information processed in the electronic device and for displaying a visualized user interface.
It is to be understood that the described embodiments are for purposes of illustration only and that the scope of the appended claims is not limited to such structures.
The gas station recommendation program stored in the memory 11 of the electronic device is a combination of a plurality of computer programs, which when executed in the processor 10, can implement:
acquiring the current position coordinate, the destination position coordinate and the current oil quantity of a target vehicle;
acquiring the average fuel consumption of the target vehicle, and calculating according to the average fuel consumption and the current fuel amount to obtain the predicted driving mileage;
constructing a to-be-recommended area according to the current position coordinates and the predicted driving mileage, and acquiring the position coordinates of each gas station in the to-be-recommended area to obtain corresponding coordinates of a first to-be-recommended gas station;
planning a shortest path between the current position coordinate and the first to-be-recommended gas station coordinate to obtain a first path;
screening all the coordinates of the first gas station to be recommended according to the estimated driving mileage and the distance of the first path to obtain coordinates of a second gas station to be recommended;
planning a shortest path between the coordinate of the second gas station to be recommended and the coordinate of the destination position to obtain a second path;
distance screening is carried out on the gas stations corresponding to the second to-be-recommended gas station coordinates according to the distance of the first path and the distance of the second path, and a target gas station is obtained;
and pushing the information of the target gas station to the terminal equipment of the user corresponding to the target vehicle.
Specifically, the processor 10 may refer to the description of the relevant steps in the embodiment corresponding to fig. 1 for a specific implementation method of the computer program, which is not described herein again.
Further, the electronic device integrated module/unit, if implemented in the form of a software functional unit and sold or used as a separate product, may be stored in a computer readable storage medium. The computer readable medium may be non-volatile or volatile. The computer-readable medium may include: any entity or device capable of carrying said computer program code, recording medium, U-disk, removable hard disk, magnetic disk, optical disk, computer Memory, Read-Only Memory (ROM).
Embodiments of the present invention may also provide a computer-readable storage medium, where the computer-readable storage medium stores a computer program, and when the computer program is executed by a processor of an electronic device, the computer program may implement:
acquiring the current position coordinate, the destination position coordinate and the current oil quantity of a target vehicle;
acquiring the average fuel consumption of the target vehicle, and calculating according to the average fuel consumption and the current fuel amount to obtain the predicted driving mileage;
constructing a to-be-recommended area according to the current position coordinates and the predicted driving mileage, and acquiring the position coordinates of each gas station in the to-be-recommended area to obtain corresponding coordinates of a first to-be-recommended gas station;
planning a shortest path between the current position coordinate and the first to-be-recommended gas station coordinate to obtain a first path;
screening all the coordinates of the first gas station to be recommended according to the estimated driving mileage and the distance of the first path to obtain coordinates of a second gas station to be recommended;
planning a shortest path between the coordinate of the second gas station to be recommended and the coordinate of the destination position to obtain a second path;
distance screening is carried out on the gas stations corresponding to the second to-be-recommended gas station coordinates according to the distance of the first path and the distance of the second path, and a target gas station is obtained;
and pushing the information of the target gas station to the terminal equipment of the user corresponding to the target vehicle.
Further, the computer usable storage medium may mainly include a storage program area and a storage data area, wherein the storage program area may store an operating system, an application program required for at least one function, and the like; the storage data area may store data created according to the use of the blockchain node, and the like.
In the embodiments provided in the present invention, it should be understood that the disclosed apparatus, device and method can be implemented in other ways. For example, the above-described apparatus embodiments are merely illustrative, and for example, the division of the modules is only one logical functional division, and other divisions may be realized in practice.
The modules described as separate parts may or may not be physically separate, and parts displayed as modules may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of the present embodiment.
The embodiment of the application can acquire and process related data based on an artificial intelligence technology. Among them, Artificial Intelligence (AI) is a theory, method, technique and application system that simulates, extends and expands human Intelligence using a digital computer or a machine controlled by a digital computer, senses the environment, acquires knowledge and uses the knowledge to obtain the best result.
In addition, functional modules in the embodiments of the present invention may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit. The integrated unit can be realized in a form of hardware, or in a form of hardware plus a software functional module.
It will be evident to those skilled in the art that the invention is not limited to the details of the foregoing illustrative embodiments, and that the present invention may be embodied in other specific forms without departing from the spirit or essential attributes thereof.
The present embodiments are therefore to be considered in all respects as illustrative and not restrictive, the scope of the invention being indicated by the appended claims rather than by the foregoing description, and all changes which come within the meaning and range of equivalency of the claims are therefore intended to be embraced therein. Any reference signs in the claims shall not be construed as limiting the claim concerned.
The block chain is a novel application mode of computer technologies such as distributed data storage, point-to-point transmission, a consensus mechanism, an encryption algorithm and the like. A block chain (Blockchain), which is essentially a decentralized database, is a series of data blocks associated by using a cryptographic method, and each data block contains information of a batch of network transactions, so as to verify the validity (anti-counterfeiting) of the information and generate a next block. The blockchain may include a blockchain underlying platform, a platform product service layer, an application service layer, and the like.
Furthermore, it is obvious that the word "comprising" does not exclude other elements or steps, and the singular does not exclude the plural. A plurality of units or means recited in the system claims may also be implemented by one unit or means in software or hardware. The terms second, etc. are used to denote names, but not any particular order.
Finally, it should be noted that the above embodiments are only for illustrating the technical solutions of the present invention and not for limiting, and although the present invention is described in detail with reference to the preferred embodiments, it should be understood by those skilled in the art that modifications or equivalent substitutions may be made on the technical solutions of the present invention without departing from the spirit and scope of the technical solutions of the present invention.
Claims (10)
1. A method for fueling station recommendation, the method comprising:
acquiring the current position coordinate, the destination position coordinate and the current oil quantity of a target vehicle;
acquiring the average fuel consumption of the target vehicle, and calculating according to the average fuel consumption and the current fuel amount to obtain the predicted driving mileage;
constructing a to-be-recommended area according to the current position coordinates and the predicted driving mileage, and acquiring the position coordinates of each gas station in the to-be-recommended area to obtain corresponding coordinates of a first to-be-recommended gas station;
planning a shortest path between the current position coordinate and the first to-be-recommended gas station coordinate to obtain a first path;
screening all the coordinates of the first gas station to be recommended according to the estimated driving mileage and the distance of the first path to obtain coordinates of a second gas station to be recommended;
planning a shortest path between the coordinate of the second gas station to be recommended and the coordinate of the destination position to obtain a second path;
distance screening is carried out on the gas stations corresponding to the second to-be-recommended gas station coordinates according to the distance of the first path and the distance of the second path, and a target gas station is obtained;
and pushing the information of the target gas station to the terminal equipment of the user corresponding to the target vehicle.
2. The gas station recommendation method of claim 1, wherein the constructing the area to be recommended based on the current location coordinates and the predicted mileage comprises:
determining the current position as a circle center, and constructing a circular area by taking the predicted driving mileage as a radius to obtain an initial area to be recommended;
and performing intersection operation on the initial region to be recommended and a preset travelable region to obtain the region to be recommended.
3. The fueling station recommendation method of claim 1, wherein the planning a shortest path between the current location coordinate and the first to-be-recommended fueling station coordinate to obtain a first path comprises:
acquiring all path nodes between the current position coordinates in the area to be recommended and the coordinates of the first gas station to be recommended;
taking the current position coordinate as an initial node, and taking the first to-be-recommended gas station coordinate as a termination node;
starting from the starting node, sequentially connecting adjacent path nodes along the direction from the starting node to the ending node until the path nodes are connected to the ending node to obtain a node graph;
determining a path from each starting node to the ending node in the node graph as a first initial path;
carrying out path communication screening of adjacent nodes on the first initial path to obtain a second initial path;
and screening the path lengths of all the second initial paths to obtain the first path.
4. The method as claimed in claim 3, wherein the step of performing path connectivity screening of neighboring nodes on the first initial path to obtain a second initial path comprises:
judging whether any two adjacent nodes in the first initial path have path connection;
and when any two adjacent nodes in the first initial path have path connection, determining the first initial path as a second initial path.
5. The gas station recommendation method of claim 3, wherein said path length filtering all of said second initial paths to obtain said first path comprises:
acquiring a path distance between any two adjacent nodes in the second initial path, and calculating to obtain a path distance to be selected;
and determining the second initial path with the minimum distance of the candidate paths as a first path.
6. The fuel station recommendation method of claim 1, wherein the step of filtering all the coordinates of the first fuel station to be recommended according to the predicted mileage and the distance of the first route to obtain coordinates of a second fuel station to be recommended comprises:
calculating a difference value according to the distance of the first path and the estimated driving mileage to obtain a distance difference value;
determining the distance difference value larger than a preset error distance threshold value as a target distance difference value;
determining the first path corresponding to the target distance difference value as a target first path;
and determining the coordinates of the first to-be-recommended gas station corresponding to the target first path as the coordinates of the second to-be-recommended gas station.
7. The method for recommending gas stations as claimed in any of claims 1 to 6, wherein the step of performing distance filtering on the gas stations corresponding to the second coordinates of the gas station to be recommended according to the distance of the first path and the distance of the second path to obtain a target gas station comprises:
calculating according to the distance of the first path and the distance of the second path corresponding to each second gas station to be recommended to obtain a corresponding target distance;
selecting the second to-be-recommended gas station coordinate corresponding to the minimum target distance as a target to-be-recommended gas station coordinate;
and determining the gas station corresponding to the target gas station coordinate to be recommended as a target gas station.
8. A gas station recommendation device, comprising:
the route planning module is used for acquiring the current position coordinates, the destination position coordinates and the current oil quantity of the target vehicle; acquiring the average fuel consumption of the target vehicle, and calculating according to the average fuel consumption and the current fuel amount to obtain the predicted driving mileage; constructing a to-be-recommended area according to the current position coordinates and the predicted driving mileage, and acquiring the position coordinates of each gas station in the to-be-recommended area to obtain corresponding coordinates of a first to-be-recommended gas station; planning a shortest path between the current position coordinate and the first to-be-recommended gas station coordinate to obtain a first path; screening all the coordinates of the first gas station to be recommended according to the estimated driving mileage and the distance of the first path to obtain coordinates of a second gas station to be recommended; planning a shortest path between the coordinate of the second gas station to be recommended and the coordinate of the destination position to obtain a second path;
the gas station screening module is used for performing distance screening on the gas stations corresponding to the second to-be-recommended gas station coordinates according to the distance of the first path and the distance of the second path to obtain a target gas station;
and the gas station recommendation module is used for pushing the information of the target gas station to the terminal equipment of the user corresponding to the target vehicle.
9. An electronic device, characterized in that the electronic device comprises:
at least one processor; and the number of the first and second groups,
a memory communicatively coupled to the at least one processor;
wherein the memory stores a computer program executable by the at least one processor to enable the at least one processor to perform the gasoline station recommendation method of any of claims 1-7.
10. A computer-readable storage medium, storing a computer program, characterized in that the computer program, when being executed by a processor, implements the gasoline station recommendation method according to any one of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111534445.4A CN114201571B (en) | 2021-12-15 | 2021-12-15 | Gas station recommendation method and device, electronic equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111534445.4A CN114201571B (en) | 2021-12-15 | 2021-12-15 | Gas station recommendation method and device, electronic equipment and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114201571A true CN114201571A (en) | 2022-03-18 |
| CN114201571B CN114201571B (en) | 2024-03-19 |
Family
ID=80654008
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111534445.4A Active CN114201571B (en) | 2021-12-15 | 2021-12-15 | Gas station recommendation method and device, electronic equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114201571B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115238206A (en) * | 2022-08-03 | 2022-10-25 | 深圳市汇深网信息科技有限公司 | Nucleic acid detection point recommendation method based on group behavior analysis |
| CN117291327A (en) * | 2023-11-24 | 2023-12-26 | 广东车卫士信息科技有限公司 | Gas station recommendation method, device and equipment for vehicle and storage medium |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR20150043654A (en) * | 2013-10-14 | 2015-04-23 | 기아자동차주식회사 | Method and device for providng gas station information |
| CN105354278A (en) * | 2015-10-29 | 2016-02-24 | 东莞酷派软件技术有限公司 | Recommendation method, apparatus and system for vehicle-mounted fueling station |
| CN107167150A (en) * | 2016-03-07 | 2017-09-15 | 厦门歌乐电子企业有限公司 | A kind of automatic navigator and air navigation aid, navigation system |
| CN110704757A (en) * | 2019-10-22 | 2020-01-17 | 北京牛卡福网络科技有限公司 | Refueling strategy recommendation method and device |
-
2021
- 2021-12-15 CN CN202111534445.4A patent/CN114201571B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR20150043654A (en) * | 2013-10-14 | 2015-04-23 | 기아자동차주식회사 | Method and device for providng gas station information |
| CN105354278A (en) * | 2015-10-29 | 2016-02-24 | 东莞酷派软件技术有限公司 | Recommendation method, apparatus and system for vehicle-mounted fueling station |
| CN107167150A (en) * | 2016-03-07 | 2017-09-15 | 厦门歌乐电子企业有限公司 | A kind of automatic navigator and air navigation aid, navigation system |
| CN110704757A (en) * | 2019-10-22 | 2020-01-17 | 北京牛卡福网络科技有限公司 | Refueling strategy recommendation method and device |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115238206A (en) * | 2022-08-03 | 2022-10-25 | 深圳市汇深网信息科技有限公司 | Nucleic acid detection point recommendation method based on group behavior analysis |
| CN115238206B (en) * | 2022-08-03 | 2024-02-20 | 深圳市汇深网信息科技有限公司 | Detection point recommendation method and device based on group behavior analysis |
| CN117291327A (en) * | 2023-11-24 | 2023-12-26 | 广东车卫士信息科技有限公司 | Gas station recommendation method, device and equipment for vehicle and storage medium |
| CN117291327B (en) * | 2023-11-24 | 2024-03-19 | 广东车卫士信息科技有限公司 | Gas station recommendation method, device and equipment for vehicle and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114201571B (en) | 2024-03-19 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Lebeau et al. | Conventional, hybrid, or electric vehicles: which technology for an urban distribution centre? | |
| CN114201571B (en) | Gas station recommendation method and device, electronic equipment and storage medium | |
| CN103531025B (en) | A kind of share-car method utilizing line sectionalizing method to carry out match information | |
| US11669552B2 (en) | Use of geographic database comprising lane level information for traffic parameter prediction | |
| US20140379183A1 (en) | Dynamic Driving Range Maps for Improving Driving Range Anxiety | |
| US11282394B2 (en) | Methods and systems for spatial clustering based on mobility data | |
| CN112347214A (en) | Target area dividing method and device, electronic equipment and storage medium | |
| CN111860879A (en) | Message pushing method and device, electronic equipment and readable storage medium | |
| CN115409439A (en) | Multi-vehicle type supply chain scheduling method based on improved ant colony algorithm and electronic equipment | |
| CN113268678B (en) | Semantic mining method and device for vehicle stop points, storage medium and terminal | |
| JP2023535828A (en) | Routing method, device, equipment and medium | |
| Leyerer et al. | Decision support for sustainable and resilience-oriented urban parcel delivery | |
| CN112050820A (en) | Road matching method and device, electronic equipment and readable storage medium | |
| CN115829124A (en) | Charging pile address selection method, device, equipment and storage medium | |
| CN108332754B (en) | Path optimization method and device, electronic equipment and computer storage medium | |
| CN110672108B (en) | Gasoline station recommendation method and device based on driving direction | |
| CN114187489B (en) | Method and device for detecting abnormal driving risk of vehicle, electronic equipment and storage medium | |
| Holden et al. | Trip energy estimation methodology and model based on real-world driving data for green-routing applications | |
| CN114661055A (en) | Emergency logistics vehicle optimal path planning method, device, equipment and storage medium | |
| Yang et al. | Who is more likely to get a ride and where is easier to be picked up in ride-sharing mode? | |
| US20220067605A1 (en) | Ride access point defect scoring using spatial index | |
| CN113901166A (en) | Electronic map construction method, device, equipment and storage medium | |
| Gui et al. | Taxi Efficiency Measurements Based on Motorcade‐Sharing Model: Evidence from GPS‐Equipped Taxi Data in Sanya | |
| CN109426875A (en) | Share-car device and method | |
| CN111612186A (en) | Operation support device, vehicle, operation management device, and operation support method |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |