CN110086867B - Vehicle returning network point pushing method - Google Patents
Vehicle returning network point pushing method Download PDFInfo
- Publication number
- CN110086867B CN110086867B CN201910340013.6A CN201910340013A CN110086867B CN 110086867 B CN110086867 B CN 110086867B CN 201910340013 A CN201910340013 A CN 201910340013A CN 110086867 B CN110086867 B CN 110086867B
- Authority
- CN
- China
- Prior art keywords
- car
- network point
- user
- returning network
- historical
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/50—Network services
- H04L67/51—Discovery or management thereof, e.g. service location protocol [SLP] or web services
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/50—Network services
- H04L67/52—Network services specially adapted for the location of the user terminal
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/50—Network services
- H04L67/55—Push-based network services
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Navigation (AREA)
- User Interface Of Digital Computer (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention discloses a car-returning network pushing method, relating to the technical field of intelligent travel, which comprises the steps of receiving a car-returning instruction sent by a user, judging whether the current user has a history order and obtaining the current vehicle taking network point of the current user according to the user identification, if the current user has the history order, then according to the vehicle taking network point, a first historical vehicle returning network point corresponding to the vehicle taking network point is obtained from the historical order, the current position of the vehicle is obtained, a second historical vehicle returning network point, the distance between the current position and the second historical vehicle returning network point is smaller than a set threshold value, the vehicle returning network points with the same position are obtained from the second historical vehicle returning network point, whether the number of the vehicle returning network points is larger than the set threshold value or not is judged, when the user needs to return the car, the car returning network points of nearby suitable users are automatically recommended to the user, the user does not need to manually search, and the car using experience of the user is improved.
Description
Technical Field
The invention belongs to the technical field of intelligent travel, and particularly relates to a method for pushing car-returning outlets.
Background
At present, when a user needs to return the automobile after using the shared automobile, the user needs to drag a map to search nearby automobile returning network points each time, operation of the user is not facilitated, and the user experience of using the automobile is poor.
Disclosure of Invention
In order to overcome the defects in the prior art, the embodiment of the invention provides a returning vehicle network point pushing method, which comprises the following steps:
receiving a car returning instruction sent by a user, judging whether the current user has a historical order or not according to a user identifier, and acquiring a current car taking network point of the current user, wherein the user identifier comprises a user number, an identity card number and a mobile phone number;
if the current user has a historical order, acquiring a first historical taxi returning network point corresponding to the taxi taking network point from the historical order according to the taxi taking network point;
acquiring the current position of a vehicle, and acquiring a second historical car returning network point, wherein the distance between the current position and the second historical car returning network point is smaller than a set threshold value, from the first historical car returning network point;
obtaining the car returning network points with the same position from the second historical car returning network points and judging whether the number of the car returning network points is greater than a set threshold value or not, wherein the method comprises the following steps:
if yes, pushing the car returning network point to user equipment;
and if not, acquiring a third history car returning network point from the history order, acquiring a plurality of car returning network points with the same position from the third history car returning network point, respectively calculating the number of the plurality of car returning network points and pushing the car returning network point with the maximum number to the user equipment.
Preferably, the method further comprises:
if the current user does not have a historical order, obtaining a car-returning network point with the distance from the current position smaller than a set threshold value according to the current position of the car, and pushing the car-returning network point to user equipment.
The method for pushing the car returning network points provided by the embodiment of the invention has the following beneficial effects:
when the user needs to return the car, the car returning network points of nearby suitable users are automatically recommended to the user, the user does not need to manually search, and the car using experience of the user is improved.
Drawings
Fig. 1 is a schematic flow chart of a method for pushing a car-returning network point according to an embodiment of the present invention.
Detailed Description
The invention is described in detail below with reference to the figures and the embodiments.
Referring to fig. 1, the method for pushing a car-returning network point provided by the embodiment of the invention includes the following steps:
s101, receiving a car returning instruction sent by a user, judging whether the current user has a historical order and acquiring the current car taking network point of the current user according to a user identification, wherein the user identification comprises a user number, an identity card number and a mobile phone number.
S102, if the current user has a historical order, acquiring a first historical taxi returning network point corresponding to the taxi taking network point from the historical order according to the taxi taking network point.
S103, acquiring the current position of the vehicle, and acquiring a second historical car returning network point, wherein the distance between the current position and the second historical car returning network point is smaller than a set threshold value, from the first historical car returning network point.
As a specific example, 500 meters may be set as a threshold for obtaining the distance to the current location in the first historical carriage return network.
S104, obtaining the car returning network points with the same position from the second historical car returning network points and judging whether the number of the car returning network points is larger than a set threshold value or not, wherein the method comprises the following steps:
if yes, pushing the car returning network point to the user equipment;
and if not, acquiring a third history car returning network from the history order, acquiring a plurality of car returning network points with the same position from the third history car returning network point, respectively calculating the number of the plurality of car returning network points and pushing the car returning network point with the maximum number to the user equipment.
As a specific example, the threshold value of the number of the car-returning network points may be set to 3.
Optionally, the method further comprises:
and if the current user does not have a historical order, acquiring a car-returning network point with the distance from the current position smaller than a set threshold value according to the current position of the vehicle, and pushing the car-returning network point to the user equipment.
As a specific example, 1000 meters may be set as a threshold value of the distance between the current position of the vehicle and the car-returning network point.
The method for pushing the car returning network points comprises the steps of receiving a car returning instruction sent by a user, judging whether the current user has a historical order and obtaining the current car returning network point of the current user according to a user identification, obtaining a first historical car returning network point corresponding to the current car returning network point from the historical order according to the current car returning network point if the current user has the historical order, obtaining the current position of a vehicle, obtaining a second historical car returning network point, wherein the distance between the current position and the second historical car returning network point is smaller than a set threshold value, obtaining car returning network points with the same position from the second historical car returning network point, judging whether the number of the car returning network points is larger than the set threshold value, automatically recommending the car returning network points of nearby suitable users to the user when the user needs to return the car, avoiding manual searching of the user, and improving the car using experience of the user.
In the foregoing embodiments, the descriptions of the respective embodiments have respective emphasis, and for parts that are not described in detail in a certain embodiment, reference may be made to related descriptions of other embodiments.
It will be appreciated that the relevant features of the method and apparatus described above are referred to one another. In addition, "first", "second", and the like in the above embodiments are for distinguishing the embodiments, and do not represent merits of the embodiments.
It is clear to those skilled in the art that, for convenience and brevity of description, the specific working processes of the above-described systems, apparatuses and units may refer to the corresponding processes in the foregoing method embodiments, and are not described herein again.
The algorithms and displays presented herein are not inherently related to any particular computer, virtual machine, or other apparatus. Various general purpose systems may also be used with the teachings herein. The required structure for constructing such a system will be apparent from the description above. Moreover, the present invention is not directed to any particular programming language. It is appreciated that a variety of programming languages may be used to implement the teachings of the present invention as described herein, and any descriptions of specific languages are provided above to disclose the best mode of the invention.
In addition, the memory may include volatile memory in a computer readable medium, Random Access Memory (RAM) and/or nonvolatile memory such as Read Only Memory (ROM) or flash memory (flash RAM), and the memory includes at least one memory chip.
As will be appreciated by one skilled in the art, embodiments of the present application may be provided as a method, system, or computer program product. Accordingly, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present application may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The present application is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the application. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
In a typical configuration, a computing device includes one or more processors (CPUs), input/output interfaces, network interfaces, and memory.
The memory may include forms of volatile memory in a computer readable medium, Random Access Memory (RAM) and/or non-volatile memory, such as Read Only Memory (ROM) or flash memory (flash RAM). The memory is an example of a computer-readable medium.
Computer-readable media, including both non-transitory and non-transitory, removable and non-removable media, may implement information storage by any method or technology. The information may be computer readable instructions, data structures, modules of a program, or other data. Examples of computer storage media include, but are not limited to, phase change memory (PRAM), Static Random Access Memory (SRAM), Dynamic Random Access Memory (DRAM), other types of Random Access Memory (RAM), Read Only Memory (ROM), Electrically Erasable Programmable Read Only Memory (EEPROM), flash memory or other memory technology, compact disc read only memory (CD-ROM), Digital Versatile Discs (DVD) or other optical storage, magnetic cassettes, magnetic tape magnetic disk storage or other magnetic storage devices, or any other non-transmission medium that can be used to store information that can be accessed by a computing device. As defined herein, a computer readable medium does not include a transitory computer readable medium such as a modulated data signal and a carrier wave.
It should also be noted that the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other identical elements in the process, method, article, or apparatus that comprises the element.
As will be appreciated by one skilled in the art, embodiments of the present application may be provided as a method, system, or computer program product. Accordingly, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present application may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The above are merely examples of the present application and are not intended to limit the present application. Various modifications and changes may occur to those skilled in the art. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present application should be included in the scope of the claims of the present application.
Claims (2)
1. A car returning network point pushing method is characterized by comprising the following steps:
receiving a car returning instruction sent by a user, judging whether the current user has a historical order or not according to a user identifier, and acquiring a current car taking network point of the current user, wherein the user identifier comprises a user number, an identity card number and a mobile phone number;
if the current user has a historical order, acquiring a first historical taxi returning network point corresponding to the taxi taking network point from the historical order according to the taxi taking network point;
acquiring the current position of a vehicle, and acquiring a second historical car returning network point, wherein the distance between the current position and the second historical car returning network point is smaller than a set threshold value, from the first historical car returning network point;
obtaining the car returning network points with the same position from the second historical car returning network points and judging whether the number of the car returning network points is greater than a set threshold value or not, wherein the method comprises the following steps:
if yes, pushing the car returning network point to user equipment;
and if not, acquiring a third history car returning network point from the history order, acquiring a plurality of car returning network points with the same position from the third history car returning network point, respectively calculating the number of the plurality of car returning network points and pushing the car returning network point with the maximum number to the user equipment.
2. The method of claim 1, further comprising:
if the current user does not have a historical order, according to the current position of the vehicle, obtaining a car-returning network point, the distance between which and the current position is less than a set threshold value, and pushing the car-returning network point to user equipment.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910340013.6A CN110086867B (en) | 2019-04-25 | 2019-04-25 | Vehicle returning network point pushing method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910340013.6A CN110086867B (en) | 2019-04-25 | 2019-04-25 | Vehicle returning network point pushing method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110086867A CN110086867A (en) | 2019-08-02 |
| CN110086867B true CN110086867B (en) | 2022-04-01 |
Family
ID=67416784
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910340013.6A Active CN110086867B (en) | 2019-04-25 | 2019-04-25 | Vehicle returning network point pushing method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110086867B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112783932A (en) * | 2021-01-13 | 2021-05-11 | 北京首汽智行科技有限公司 | Parking lot recommendation method and system |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101075378A (en) * | 2006-05-17 | 2007-11-21 | 战威 | Riding combined system and its controlling method |
| CN108091173A (en) * | 2018-01-25 | 2018-05-29 | 贵州宜行智通科技有限公司 | Parking stall guidance information method for pushing and device |
| CN108154250A (en) * | 2016-12-02 | 2018-06-12 | 重庆邮电大学 | A kind of public bicycles intelligent dispatching system region partitioning method based on k-means algorithms |
| CN109367542A (en) * | 2018-09-25 | 2019-02-22 | 珠海格力电器股份有限公司 | A kind of method and apparatus controlling vehicle driving |
| CN109466546A (en) * | 2018-11-20 | 2019-03-15 | 广州小鹏汽车科技有限公司 | Automatic parking method and system |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| FR2980879B1 (en) * | 2011-09-30 | 2021-02-12 | Ier Systems | METHOD AND SYSTEM FOR MANAGING PARKING SPACES IN THE CONTEXT OF AUTOMATED VEHICLE RENTAL, AND VEHICLE RENTAL INSTALLATION. |
| KR20150024494A (en) * | 2013-08-26 | 2015-03-09 | 주식회사 케이티 | System and method for parking control |
-
2019
- 2019-04-25 CN CN201910340013.6A patent/CN110086867B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101075378A (en) * | 2006-05-17 | 2007-11-21 | 战威 | Riding combined system and its controlling method |
| CN108154250A (en) * | 2016-12-02 | 2018-06-12 | 重庆邮电大学 | A kind of public bicycles intelligent dispatching system region partitioning method based on k-means algorithms |
| CN108091173A (en) * | 2018-01-25 | 2018-05-29 | 贵州宜行智通科技有限公司 | Parking stall guidance information method for pushing and device |
| CN109367542A (en) * | 2018-09-25 | 2019-02-22 | 珠海格力电器股份有限公司 | A kind of method and apparatus controlling vehicle driving |
| CN109466546A (en) * | 2018-11-20 | 2019-03-15 | 广州小鹏汽车科技有限公司 | Automatic parking method and system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110086867A (en) | 2019-08-02 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109360413B (en) | Vehicle scheduling method and system | |
| CN105991674B (en) | Information pushing method and device | |
| CN109032912B (en) | Pressure testing method for vehicle-mounted terminal firmware upgrading | |
| US20180365339A1 (en) | Application classification method and apparatus | |
| CN110086867B (en) | Vehicle returning network point pushing method | |
| CN104063831A (en) | Method and device for providing railway route schemes | |
| CN110069488A (en) | A kind of date storage method, method for reading data and its device | |
| CN111177093A (en) | Method, device and medium for sharing scientific and technological resources | |
| CN106156185B (en) | Method, device and system for inquiring service request execution state | |
| CN115503693A (en) | Dynamic management method and device for vehicle parking map | |
| CN113326211B (en) | Test case generation method and device | |
| CN106454884A (en) | Method for distinguishing homonymous wireless access points and equipment thereof | |
| CN109299125B (en) | Database updating method and device | |
| CN114138787A (en) | Bar code identification method, equipment and medium | |
| CN112509164A (en) | Attendance card-punching method, attendance card-punching device, attendance card-punching equipment and storage medium | |
| CN113327358A (en) | Method and device for preventing mistaken brushing and passing brake | |
| CN106897331B (en) | User key position data acquisition method and device | |
| CN110536325B (en) | Method for improving communication connection success rate of vehicle-mounted intelligent equipment | |
| CN111090825A (en) | Dynamic customization method for webpage content | |
| CN112507193A (en) | Data updating method, device, equipment and storage medium | |
| CN105206062A (en) | Searching method and device | |
| CN113449208A (en) | Space query method, device, system and storage medium | |
| CN109067613B (en) | Method for testing networking success rate of identity card identification equipment | |
| CN109872081A (en) | A kind of business datum obtains, sending method and system | |
| CN112017031B (en) | Information pushing method and device |
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 |