CN114543832B

CN114543832B - Road travel information analysis pushing method and system based on local area characteristics

Info

Publication number: CN114543832B
Application number: CN202210448795.7A
Authority: CN
Inventors: 董永斌; 黄碧银; 刘明东
Original assignee: Shenzhen Local Baoxin Media Technology Co ltd
Current assignee: Shenzhen Local Baoxin Media Technology Co ltd
Priority date: 2022-04-27
Filing date: 2022-04-27
Publication date: 2022-07-01
Anticipated expiration: 2042-04-27
Also published as: CN114543832A

Abstract

The invention relates to the technical field of travel navigation, in particular to a road travel information analysis pushing method and a road travel information analysis pushing system based on local area characteristics, wherein the road travel information analysis pushing method based on the local area characteristics comprises the following steps: the method comprises the steps of receiving travel information sent by a plurality of pushing devices, wherein the pushing devices are arranged at various positions in a preset area, each pushing device has a unique node position, the pushing devices are used for receiving the travel information sent from a user terminal within a preset range, and the travel information comprises a travel type, a starting position and an ending position; generating at least one route according to the starting position, the ending position and the node positions of the plurality of pushing devices; screening out an optimal route from the multiple routes according to the travel types under the condition that the multiple routes exist; and pushing the optimal route to a user terminal. The method and the device have the effect of providing the user with the travel route more adaptive to the preference demand.

Description

Road travel information analysis pushing method and system based on local area characteristics

Technical Field

The invention relates to the technical field of travel navigation, in particular to a road travel information analysis pushing method and system based on local area characteristics.

Background

The rapid development of the internet provides convenience to the work and life of people. Currently, in some applications, the daily travel of a user is facilitated by providing travel-related functions such as querying travel routes, taking a car. However, the functions related to travel lack consideration of preference requirements of users for travel routes, so that the applicability of travel modes cannot be comprehensively evaluated, and a better route cannot be provided for daily travel of the users.

Disclosure of Invention

In order to provide a travel route more adaptive to preference requirements for a user, the application provides a road travel information analysis pushing method and system based on local area characteristics.

The above object of the present invention is achieved by the following technical solutions:

a road travel information analysis pushing method based on local area characteristics comprises the following steps:

the method comprises the steps of receiving travel information sent by a plurality of pushing devices, wherein the pushing devices are arranged at various positions in a preset area, each pushing device has a unique node position, and the pushing devices are used for receiving the travel information sent by a user terminal in a preset range and comprise a travel type, a starting position and an ending position;

generating at least one route according to the starting position, the ending position and the node positions of the plurality of pushing devices;

screening out an optimal route from the multiple routes according to the travel types under the condition that the multiple routes exist;

and pushing the optimal route to a user terminal.

By adopting the technical scheme, the user sends the trip information to the pushing devices in a local preset area within the preset range of any one of the pushing devices, then the pushing devices send the trip information to the system, the system generates at least one route according to the starting position and the ending position in the trip information and the node positions of the pushing devices, when a plurality of routes are generated, the best route of the most suitable trip type is screened out from the plurality of routes, and then the trip route which is more suitable for preference requirements is provided for the user.

The present application may be further configured in a preferred example to: generating at least one route according to a start location, an end location and a node location of a plurality of push devices, comprising:

A. acquiring a plurality of termination node positions with the distance from the termination position smaller than a first preset value;

B. taking the starting position as an a-th node position, a = 1;

C. after node positions in a preset area are screened according to the position of the a-th node and the position of the termination node, a plurality of positions of the a + 1-th node, the distance between which and the position of the a-th node is smaller than a second preset value, are obtained, and the a + 1-th node positions are associated with the corresponding positions of the a-th node;

D. assigning a +1 to a;

E. judging whether a node position which is the same as the position corresponding to any termination node position in the termination node positions exists in the a-th node positions;

performing the C, D, E procedure for each of a plurality of a-th node positions when there is no node position among the a-th node positions that is the same as a position corresponding to any of the plurality of termination node positions;

in the case that there is a node position in the a-th node positions that is the same as the position corresponding to any of the termination node positions in the termination node positions, the step C, D is executed once, and at least one route is generated according to all the node positions, wherein the at least one route is a route with a starting position as a starting point and a termination position as an end point, the sequence numbers of the node positions between the starting position and the termination position are arranged in a small-to-large order, and the adjacent node positions in each route are associated with each other.

By adopting the technical scheme, the starting position is used as the initial position, a plurality of new node positions with the distance smaller than the second preset value are sequentially and circularly obtained until at least one new node position is obtained, the distance between the node position and the ending position is smaller than the first preset value, the new node positions are obtained again, then at least one route is generated according to the obtained node positions, each route is a route with the starting position as the starting point and the ending position as the end point, the serial numbers of the node positions between the starting position and the ending position are arranged according to the small-to-large sequence, and the adjacent node positions in each route are all associated with each other, in this way, a plurality of routes can be traversed through the node positions of a plurality of pushing devices, a user can go out according to each node in the route for each time, the situation of navigation errors is simple and not easy to occur, and when the distance between the node position and the ending position is smaller than the first preset value, and acquiring the node positions once again, so that more nodes can be obtained through diffusion, and partial node positions which are not located at the starting position and the end position are acquired, so that more route schemes are obtained.

The present application may be further configured in a preferred example to: the travel type comprises a plurality of type labels, each sub-route is provided with at least one type label, and the sub-route is a route between two node positions with the distance smaller than a second preset value;

C. after node positions in a preset area are screened according to the position of the a-th node and the position of the termination node, a plurality of positions of the a + 1-th node, the distance between which and the position of the a-th node is smaller than a second preset value, are obtained, and the positions of the a + 1-th node are associated with the corresponding positions of the a-th node, wherein the method comprises the following steps:

c1, establishing a target circular area on the horizontal reference plane by taking the position of the a-th node as the center of a circle and n as the radius, wherein n is the distance between the position of the a-th node and the position of the termination node;

c2, dividing the target circular area into q equal fan-shaped areas by a preset dividing value q, wherein the dividing value q is a positive integer;

c3, establishing a perpendicular line perpendicular to the straight line passing through the a-th node position and the terminating node position on the horizontal reference plane, on the a-th node position, and dividing the target circular region into a distant region on the side far from the terminating node position and a close region on the side close to the terminating node position;

c4, acquiring the number of each type of label in each sector area in the far-away area, and sequencing the labels according to the number of each type of label in the travel-containing type at least;

c5, removing the sector area with the minimum number of all types of labels in the travel types in the remote area;

and C6, acquiring a plurality of a +1 th node positions with the distance from the a-th node position smaller than a second preset value in the remaining fan-shaped area, and associating the a +1 th node positions with the corresponding a-th node positions.

By adopting the technical scheme, before a plurality of new node positions with the distances smaller than the second preset value are obtained each time, partial areas are removed, and then possible bad and teaching routes are directly removed, so that the calculation power is saved.

The present application may be further configured in a preferred example to: the trip information sent by the user terminal also carries a unique identifier associated with the user terminal; the method for analyzing and pushing road travel information of local area characteristics further comprises the following steps:

under the condition that only a travel type and an initial position carrying the same unique identifier are received within a preset time span, generating a first matching time domain according to a timestamp of the received travel type and a timestamp of the initial position; screening a historical termination position with the highest occurrence frequency in a preset data table according to the first matching time domain, the trip type and the starting position to obtain a simulated termination position; reasoning to obtain a first possible item according to the travel type, the simulation termination position and the first matching time domain; inquiring local area news information related to the first possible item, and pushing the local area news information to a user terminal associated with a unique identifier carried by trip information, wherein past historical trip information and time nodes corresponding to the historical trip information are stored in the preset data table, and the historical trip information comprises a historical trip type, a historical starting position and a historical ending position;

under the condition that only the travel type and the termination position carrying the same unique identifier are received within a preset time span, generating a second matching time domain according to the timestamp of the received travel type and the timestamp of the termination position; reasoning to obtain a second possible item according to the travel type, the termination position and the second matching time domain; inquiring local regional news information related to the second possible item, and pushing the local regional news information to a user terminal associated with the unique identifier carried by the travel information;

under the condition that only the starting position and the ending position carrying the same unique identifier are received within a preset time span, generating a third matching time domain according to the time stamp of the received starting position and the time stamp of the ending position; screening out a historical trip type with the highest frequency of occurrence in a preset data table according to the third matching time domain, the starting position and the ending position to obtain a simulated trip type; and reasoning to obtain a third possible item according to the simulated travel type, the termination position and the first matching time domain, inquiring local regional news information related to the third possible item, and pushing the local regional news information to a user terminal associated with the unique identifier carried by the travel information.

By adopting the technical scheme, when a user only sends out two pieces of information in the travel information within the range of the pushing devices within a preset time span, the simulation travel type or the simulation termination position is deduced through a model, the possible items of the user for travel are obtained according to the travel type and the simulation termination position, or the simulation travel type and the simulation termination position, or the travel type and the termination position, and the matching time, then local regional news information related to the possible items is inquired, and the information is pushed to the user terminal to play a role in reminding and suggesting the user to supplement the third information.

The present application may be further configured in a preferred example to: in the case that there are a plurality of routes, screening out an optimal route among the plurality of routes according to a travel type, including:

counting the number of various types of labels in each route;

the route containing the most labels of all types in the travel types is the most optimal route.

The present application may be further configured in a preferred example to: the generating a first matching time domain according to the timestamp of the received travel type and the timestamp of the start position includes:

and taking out the time division in the travel type timestamp and the time division in the timestamp of the initial position, and obtaining a first matching time domain according to the time division in the travel type timestamp and the time division in the timestamp of the initial position.

The present application may be further configured in a preferred example to: screening the end position with the highest occurrence frequency in a preset data table according to the first matching time domain, the travel type and the start position to obtain the end position with the highest occurrence frequency as a simulation end position, wherein the method comprises the following steps:

screening out historical trip information of a time node in a preset database, wherein the time node is located in the first matching time domain, and using the historical trip information as a first trip information set;

screening out historical trip information with a historical trip type consistent with the trip type and a historical starting position consistent with the starting position in the first trip information set as a second trip information set;

and screening the historical termination position with the highest occurrence frequency in the second travel information set as a simulation termination position.

The present application may be further configured in a preferred example to: the pushing devices are respectively arranged at the joints of roads in a preset area.

The second objective of the present invention is achieved by the following technical solutions:

road trip information analysis push system based on local regional characteristics includes:

the system comprises a receiving module, a plurality of pushing devices and a control module, wherein the receiving module is used for receiving travel information sent by the pushing devices, the pushing devices are arranged at various positions in a preset area, each pushing device has a unique node position, and the pushing devices are used for receiving the travel information sent by a user terminal and comprise a travel type, a starting position and an ending position;

the route generation module is used for generating at least one route according to the starting position, the ending position and the node positions of the plurality of pushing devices;

the route screening module is used for screening out the optimal route from the multiple routes according to the travel types under the condition that the multiple routes exist;

and the sending module is used for pushing the optimal route to the user terminal.

In summary, the present application includes at least one of the following beneficial technical effects:

1. the method comprises the steps that a user sends travel information to a pushing device in a local preset area within a preset range of any one of a plurality of pushing devices, then the pushing device sends the travel information to a system, the system generates at least one route according to a starting position and an ending position in the travel information and node positions of the plurality of pushing devices, when a plurality of routes are generated, analysis is carried out by combining travel types of the user, the best route of the most suitable travel type is screened out from the plurality of routes, and then the travel route which is more suitable for preference needs is provided for the user;

2. taking a starting position as an initial, sequentially and circularly acquiring a plurality of new node positions with the distance smaller than a second preset value until at least one new node position is acquired, wherein the distance between the node position and an ending position is smaller than a first preset value, then acquiring the node positions once again, then generating at least one route according to the acquired node positions, wherein each route is a route with the starting position as a starting point and the ending position as a terminal point, the serial numbers of the node positions between the starting position and the ending position are arranged in a small-to-large manner, and the adjacent node positions in each route are all associated with each other, in this way, a plurality of routes can be traversed through the node positions of a plurality of pushing devices, a user can go out according to each node in the routes according to the employment, the situation of navigation errors is simple and is not easy to occur, and when the distance between the node position and the ending position is smaller than the first preset value, acquiring the position of the primary node again, obtaining more nodes by diffusion, and acquiring part of the positions of the nodes which are not positioned at the initial position and the final position to further obtain more route schemes;

3. before a plurality of new node positions with the distances smaller than a second preset value are obtained each time, part of areas are removed, and possible bad and teaching routes are directly removed, so that computing power is saved;

4. when a user only sends out two pieces of information in the travel information within the range of the pushing devices within a preset time span, the simulation travel type or the simulation termination position is deduced through a model, then the possible items of the user for travel are obtained according to the travel type and the simulation termination position, or the simulation travel type and the simulation termination position, or the travel type and the termination position, and the matching time, then local regional news information related to the possible items is inquired, and the information is pushed to the user terminal to play a role in reminding and suggesting the user to supplement the third information.

Drawings

Fig. 1 is a schematic flowchart of a road travel information analysis pushing method based on local area characteristics in an embodiment of the present application;

fig. 2 is a flowchart illustrating implementation of step C of a road travel information analyzing and pushing method based on local area characteristics according to an embodiment of the present application;

fig. 3 is a flowchart illustrating a step S3 of the method for analyzing and pushing road travel information based on local area characteristics according to an embodiment of the present application;

fig. 4 is a schematic block diagram of a road travel information analysis pushing system based on local area characteristics according to an embodiment of the present application.

Detailed Description

The following description of the exemplary embodiments of the present application, taken in conjunction with the accompanying drawings, includes various details of the embodiments of the application for the understanding of the same, which are to be considered exemplary only. Accordingly, those of ordinary skill in the art will recognize that various changes and modifications of the embodiments described herein can be made without departing from the scope and spirit of the present application. Also, descriptions of well-known functions and constructions are omitted in the following description for clarity and conciseness.

It should be noted that the terms "first", "second", etc. in the present invention are used for distinguishing similar objects, and are not necessarily used for describing a particular order or sequence. It is to be understood that the data so used is interchangeable under appropriate circumstances such that the embodiments of the disclosure described herein are capable of operation in other sequences than those illustrated or described herein. The implementations described in the exemplary embodiments below are not intended to represent all implementations consistent with the present disclosure.

In addition, the term "and/or" herein is only one kind of association relationship describing an associated object, and means that there may be three kinds of relationships, for example, a and/or B, which may mean: a exists alone, A and B exist simultaneously, and B exists alone. In addition, the character "/" herein generally indicates that the former and latter related objects are in an "or" relationship, unless otherwise specified.

The method and the system for analyzing and pushing road travel information based on local area characteristics according to the present application are described below with reference to the accompanying drawings.

Fig. 1 is a schematic flowchart of a method for analyzing and pushing road travel information based on local area characteristics in an embodiment of the present application, and as shown in fig. 1, the method for analyzing and pushing road travel information based on local area characteristics includes:

s1, receiving the trip information sent by the pushing device;

s2, generating at least one route according to the starting position, the ending position and the node positions of the plurality of pushing devices;

s3, screening out the optimal route from the multiple routes according to the travel types under the condition that the multiple routes exist;

and S4, pushing the optimal route to the user terminal.

Specifically, the number of the pushing devices is multiple, the pushing devices are arranged at various positions in a preset area, the preset area can be an administrative planning area such as a city, an economic district, a village and a town, a city and a county, the pushing devices can be columnar, specific shapes and expression styles can be designed according to characteristics of the city or a local area, the pushing devices can be arranged at the joints of roads in the preset area, namely, the connecting nodes of the roads in the whole preset area are used as the installation positions of the pushing devices, and the pushing devices can also be arranged at some more obvious positions in the preset area so as to be convenient for a user to identify; for the judgment of the saliency, based on the fact that the distance between two pushing devices is smaller than a second preset distance, whether a common user can obviously check the saliency from the route from any one pushing device to the other pushing device or not is judged; the specific judging mode can adopt that a plurality of people move from any one of the pushing devices to the other pushing device in sequence, collects the evaluation of the showing or not, and determines the showing or not according to the occupation ratio of the positive evaluation.

Each pushing device is provided with a unique node position, the node position is a GPS positioning position, the pushing devices are used for receiving travel information sent from the user terminal within a preset range, and the travel information sent from the user terminal also carries a unique identifier related to the user terminal; for the setting of the preset range, the preset range of each pushing device can be different, so that the preset area can be covered more comprehensively; the communication between the push device and the user terminal is preferably realized in a wireless communication mode, for example, a loRa technology, a WiFi/IEEE 802.11 protocol, a ZigBee/802.15.4 protocol, a Thread/IEEE 802.15.4 protocol, a Z-Wave protocol, etc., or a display device and an input device are provided on the push device, at this time, the display device and the input device are regarded as the user terminal, the display device is used for displaying a user interface, and the input device is used for a user to input corresponding travel information;

the travel information comprises a travel type, a starting position and an ending position; the travel types refer to the preference of the user when traveling, the travel types comprise a plurality of type labels, such as "leisure", "strolling", "walking", "running", "dog walking", "playing", "friend making", "party", "home-returning", "friend visiting", and the like, the type labels can acquire a plurality of answers input by the user in a questionnaire survey mode, then the answers are analyzed or matched to obtain corresponding type labels, and the type labels are set to be a plurality of types so as to explain the travel preference of the user from a plurality of angles, so that the route planning accuracy is improved. In the application, each sub-route also has at least one type label, the sub-route refers to a route between two node positions with a distance smaller than a second preset value, and the second preset value is also a preset distance value;

wherein generating at least one route according to the starting position, the ending position and the node positions of the plurality of pushing devices comprises:

B. taking the starting position as an a-th node position, a = 1;

D. assigning a +1 to a;

performing C, D, E for each of a plurality of a-th node positions when there is no node position among the plurality of a-th node positions that is the same as a position corresponding to any of the plurality of terminating node positions;

in the case that there is a node position in the a-th node positions that is the same as the position corresponding to any of the termination node positions in the termination node positions, the step C, D is executed once, and at least one route is generated according to all the node positions, wherein the at least one route is a route that takes the start position as a start point and the termination position as an end point, the serial numbers of the node positions between the start position and the termination position are arranged in a small-to-large order, and the adjacent node positions in each route are associated with each other.

It can be understood that the end position is a node position of the end position, the start position is a node position corresponding to the start position, the first preset value is a preset distance value, a plurality of end node positions with distances smaller than a first preset value in a preset area are obtained according to the node position of the end position, then a plurality of new node positions with distances smaller than a second preset value are sequentially and circularly obtained based on the node position of the start position, then a plurality of new node positions with distances smaller than the second preset value are continuously obtained based on the plurality of new node positions until at least one new node position is obtained, and the distance between the node position and the end position is smaller than the first preset value, then a plurality of new node positions are obtained based on the latest node positions, in an embodiment, the first preset value is set to be smaller than the second preset value, furthermore, when the last acquisition is carried out, the node positions which are not located at the starting position and the end position are acquired, even part of the node positions which are farther than the end position are acquired, more nodes are obtained through diffusion, then at least one route is generated according to the acquired node positions, each route takes the starting position as the starting point and the end position as the end point, the serial numbers of the node positions between the starting position and the end position are arranged in a small-to-large mode, and the adjacent node positions in each route are all related.

With reference to fig. 2, wherein, in step C, after the node positions in the preset area are screened according to the position of the a-th node and the position of the terminating node, a plurality of positions of the a + 1-th node, the distance between which and the position of the a-th node is smaller than a second preset value, are obtained, and the positions of the a + 1-th node are associated with the corresponding position of the a-th node, which specifically includes:

c1, establishing a target circular area on the horizontal reference surface by taking the position of the a-th node as the center of a circle and n as the radius;

c2, dividing the target circular area into q equal fan-shaped areas by a preset dividing value q;

c3, establishing a perpendicular line perpendicular to the straight line passing through the a-th node position and the termination node position on the horizontal reference plane, wherein the perpendicular line divides the target circular region into a far region at one side far from the termination node position and a near region at one side near to the termination node position;

The node separation method comprises the following steps that n is the distance between the position of an a-th node and the position of a termination node, a separation value q is a positive integer, the separation value q can be a preset fixed value or can be determined according to the number of nodes which are less than a second preset value from the position of the a-th node, and the separation value q is inversely proportional to the number of nodes which are less than the second preset value from the position of the a-th node; the preset number is a preset value or can be in direct proportion to the separation value q, and by the segmentation and rejection mode, before a plurality of new node positions with distances smaller than the second preset value are obtained each time, partial regions are rejected, and then inferior routes which may appear are directly rejected, so that the calculation power is saved.

In an embodiment, the method for analyzing and pushing road travel information of local area characteristics further includes:

under the condition that only a travel type and an initial position carrying the same unique identifier are received within a preset time span, generating a first matching time domain according to a timestamp of the received travel type and a timestamp of the initial position; screening a historical termination position with the highest occurrence frequency in a preset data table according to the first matching time domain, the trip type and the starting position to obtain a simulated termination position; deducing to obtain a first possible item according to the travel type, the simulation termination position and the first matching time domain; inquiring local regional news information related to the first possible item, and pushing the local regional news information to a user terminal associated with the unique identifier carried by the travel information;

under the condition that only the travel type and the termination position carrying the same unique identifier are received within a preset time span, generating a second matching time domain according to the timestamp of the received travel type and the timestamp of the termination position; reasoning to obtain a second possible item according to the travel type, the termination position and a second matching time domain; inquiring local regional news information related to the second possible item, and pushing the local regional news information to a user terminal associated with the unique identifier carried by the travel information;

under the condition that only the starting position and the ending position carrying the same unique identifier are received within a preset time span, generating a third matching time domain according to the time stamp of the received starting position and the time stamp of the ending position; screening the historical trip type with the highest frequency of occurrence in a preset data table according to the third matching time domain, the starting position and the ending position to obtain a simulated trip type; and reasoning to obtain a third possible item according to the simulated travel type, the termination position and the first matching time domain, inquiring local regional news information related to the third possible item, and pushing the local regional news information to a user terminal associated with the unique identifier carried by the travel information.

The historical travel information comprises historical travel types, historical starting positions and historical ending positions. If the preset time span is a preset value, for example, 1 hour, the system determines whether only the travel type and the end position, or the start position and the end position, or the travel type and the start position, which carry the same unique identifier are received within the time span of 1 hour; under the condition that only a travel type and an end position carrying the same unique identifier are received, generating a first matching time domain according to a timestamp of the received travel type and a timestamp of the start position, and specifically comprising:

and taking out the time division in the travel type timestamp and the time division in the starting position timestamp, and obtaining a first matching time domain according to the time division in the travel type timestamp and the time division in the starting position timestamp.

For example, if the timestamp of the received travel type is 2022 year 4 month 13 day 8:31:03, the timestamp of the received start position is 2022 year 4 month 13 day 8:51:09, and the end position is not received between 2022 year 4 month 13 day 7:31:03 and 2022 year 4 month 13 day 9:51:09, the time division 8:31 in the timestamp of the travel type and the time division 8:51 in the timestamp of the start position are taken out, and the first matching time domain is 8: 31-8: 51. Screening the historical termination position with the highest occurrence frequency in a preset data table to be used as a simulation termination position; the method specifically comprises the following steps:

screening out historical trip information of a time node in a preset database, wherein the time node is located in a first matching time domain, and using the historical trip information as a first trip information set;

Through the three screening, the most possible historical termination position with high matching degree can be obtained, and a simulation termination position is obtained; for the conditions that only the starting position and the ending position carrying the same unique identifier are received within the preset time span, and only the travel type and the ending position carrying the same unique identifier are received within the preset time span, the above manner of acquiring the simulation ending position may be referred to for the acquisition of the corresponding simulation information, which is not described herein again.

Further, a first possible item is obtained through reasoning according to the travel type, the simulation termination position and the first matching time domain; in one embodiment, the first possible item is obtained by using a model inference method, and the model is obtained by training in the following way:

performing labeling processing on each training sample in a training set of training samples to label out a first possible item of each training sample, wherein each training sample comprises a travel type sample, an end position sample and a first matching time domain sample, and the first possible item is associated with all or part of information in the training samples; and training the neural network through the training sample training set subjected to labeling processing to obtain the model.

For the inference of the second possible item and the third possible item, the manner of obtaining the first possible item may also be referred to, and details are not described herein.

After the first possible item, the second possible item or the third possible item is obtained through reasoning, local regional news information related to the first possible item, the second possible item or the third possible item is inquired, the inquiry mode can be obtained through crawling on a related local website or an information disclosure and announcement page, and then the latest related local regional news information is pushed to a user terminal related to a unique identifier carried by the travel information; the reminding device has the functions of reminding and suggesting the user to supplement the third information, is more gentle compared with direct reminding, and is not easy to cause user dislike.

With reference to fig. 3, in the step S3, if there are multiple routes, the method for screening out the optimal route from the multiple routes according to the travel type includes:

s31, counting the number of various types of labels in each route;

and S32, the route containing the most labels of all types in the travel types is the most optimal route.

And then, the route which best accords with the travel preference of the user can be matched for the user, and the user satisfaction degree is improved.

The application also provides a road trip information analysis push system based on local regional characteristics, refer to fig. 4, include:

the receiving module is used for receiving travel information sent by a plurality of pushing devices, the pushing devices are arranged at various positions in a preset area, each pushing device has a unique node position, the pushing devices are used for receiving the travel information sent by the user terminal, and the travel information comprises a travel type, a starting position and an ending position;

For specific limitations of the system for analyzing and pushing road travel information based on local area characteristics, reference may be made to the above limitations on the method for analyzing and pushing road travel information based on local area characteristics, and details are not repeated here. The steps of the method for analyzing and pushing road travel information based on local area characteristics may be wholly or partially implemented by software, hardware and a combination thereof.

Various implementations of the systems and techniques described here can be realized in digital electronic circuitry, integrated circuitry, application specific ASICs (application specific integrated circuits), computer hardware, firmware, software, and/or combinations thereof. These various embodiments may include: implemented in one or more computer programs that are executable and/or interpretable on a programmable system including at least one programmable processor, which may be special or general purpose, receiving data and instructions from, and transmitting data and instructions to, a storage system, at least one input device, and at least one output device.

These computer programs (also known as programs, software applications, or code) include machine instructions for a programmable processor, and may be implemented using high-level procedural and/or object-oriented programming languages, and/or assembly/machine languages. As used herein, the terms "machine-readable medium" and "computer-readable medium" refer to any computer program product, apparatus, and/or device (e.g., magnetic discs, optical disks, memory, Programmable Logic Devices (PLDs)) used to provide machine instructions and/or data to a programmable processor, including a machine-readable medium that receives machine instructions as a machine-readable signal. The term "machine-readable signal" refers to any signal used to provide machine instructions and/or data to a programmable processor.

To provide for interaction with a user, the systems and techniques described here can be implemented on a computer having: a display device (e.g., a CRT (cathode ray tube) or LCD (liquid crystal display) monitor) for displaying information to a user; and a keyboard and a pointing device (e.g., a mouse or a trackball) by which a user can provide input to the computer. Other kinds of devices may also be used to provide for interaction with a user; for example, feedback provided to the user can be any form of sensory feedback (e.g., visual feedback, auditory feedback, or tactile feedback); and input from the user may be received in any form, including acoustic, speech, or tactile input.

The systems and techniques described here can be implemented in a computing system that includes a back-end component (e.g., as a data server), or that includes a middleware component (e.g., an application server), or that includes a front-end component (e.g., a user computer having a graphical user interface or a web browser through which a user can interact with an implementation of the systems and techniques described here), or any combination of such back-end, middleware, or front-end components. The components of the system can be interconnected by any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include: local Area Networks (LANs), Wide Area Networks (WANs), and the Internet.

It should be understood that various forms of the flows shown above may be used, with steps reordered, added, or deleted. For example, the steps described in the present application may be executed in parallel, sequentially, or in different orders, and the present invention is not limited thereto as long as the desired results of the technical solutions disclosed in the present application can be achieved.

The above-described embodiments are not intended to limit the scope of the present disclosure. It should be understood by those skilled in the art that various modifications, combinations, sub-combinations and substitutions may be made in accordance with design requirements and other factors. Any modification, equivalent replacement, and improvement made within the spirit and principle of the present application shall be included in the protection scope of the present application.

Claims

1. The road travel information analysis and pushing method based on the local area characteristics is characterized by comprising the following steps:

pushing the optimal route to a user terminal;

B. taking the starting position as an a-th node position, a = 1;

D. assigning a +1 to a;

E. judging whether a node position which is the same as the position corresponding to any one of the termination node positions exists in the multiple a-th node positions or not;

performing the C, D, E step for each of a plurality of a-th node positions when there is no node position among the plurality of a-th node positions that is the same as a position corresponding to any of the plurality of termination node positions;

2. The method for analyzing and pushing road travel information based on local area characteristics as claimed in claim 1, wherein the travel type includes a plurality of type tags, each sub-route has at least one type tag, and the sub-route is a route between two node positions with a distance smaller than a second preset value;

3. The method for analyzing and pushing road travel information based on local area characteristics as claimed in claim 2, wherein the travel information sent from the user terminal further carries a unique identifier associated with the user terminal; the method for analyzing and pushing road travel information of local area characteristics further comprises the following steps:

under the condition that only a travel type and an initial position carrying the same unique identifier are received within a preset time span, generating a first matching time domain according to a timestamp of the received travel type and a timestamp of the initial position; screening a historical termination position with the highest occurrence frequency in a preset data table according to the first matching time domain, the travel type and the starting position to obtain a simulated termination position; deducing to obtain a first possible item according to the travel type, the simulation termination position and the first matching time domain; inquiring local area news information related to the first possible item, and pushing the local area news information to a user terminal associated with a unique identifier carried by trip information, wherein past historical trip information and time nodes corresponding to the historical trip information are stored in the preset data table, and the historical trip information comprises a historical trip type, a historical starting position and a historical ending position;

under the condition that only a travel type carrying the same unique identifier and a termination position are received within a preset time span, generating a second matching time domain according to a timestamp of the received travel type and a timestamp of the termination position; reasoning to obtain a second possible item according to the travel type, the termination position and the second matching time domain; inquiring local regional news information related to the second possible item, and pushing the local regional news information to a user terminal associated with the unique identifier carried by the travel information;

4. The method for analyzing and pushing road travel information based on local area characteristics as claimed in claim 3, wherein in case of existence of multiple routes, the method for screening out the best route from the multiple routes according to the travel type comprises:

counting the number of various types of labels in each route;

5. The method for analyzing and pushing road travel information based on local area characteristics as claimed in claim 4, wherein said generating a first matching time domain according to the timestamp of the received travel type and the timestamp of the start position comprises:

6. The method for analyzing and pushing road travel information based on local area characteristics as claimed in claim 5, wherein the step of screening the end position with the highest frequency of occurrence in a preset data table according to the first matching time domain, the travel type and the start position as a simulated end position comprises:

7. The method as claimed in claim 1, wherein the pushing devices are respectively disposed at the connection points of roads in a preset area.

8. The system for analyzing and pushing road travel information based on local area characteristics is used for implementing the method for analyzing and pushing road travel information based on local area characteristics according to claim 1, and comprises the following steps:

the sending module is used for pushing the optimal route to a user terminal;

A. acquiring a plurality of termination node positions of which the distances from the termination positions are smaller than a first preset value;

B. taking the starting position as an a-th node position, a = 1;

C. after screening the node positions in the preset area according to the position of the a-th node and the position of the termination node, acquiring a plurality of a + 1-th node positions of which the distance from the position of the a-th node is smaller than a second preset value, and associating the a + 1-th node positions with the corresponding a-th node positions;

D. assigning a +1 to a;