CN110730271B - Schedule reminding method and device, storage medium and terminal - Google Patents
Schedule reminding method and device, storage medium and terminal Download PDFInfo
- Publication number
- CN110730271B CN110730271B CN201910966173.1A CN201910966173A CN110730271B CN 110730271 B CN110730271 B CN 110730271B CN 201910966173 A CN201910966173 A CN 201910966173A CN 110730271 B CN110730271 B CN 110730271B
- Authority
- CN
- China
- Prior art keywords
- time
- congestion
- destination
- preset
- probability
- 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
- H04M—TELEPHONIC COMMUNICATION
- H04M1/00—Substation equipment, e.g. for use by subscribers
- H04M1/72—Mobile telephones; Cordless telephones, i.e. devices for establishing wireless links to base stations without route selection
- H04M1/724—User interfaces specially adapted for cordless or mobile telephones
- H04M1/72448—User interfaces specially adapted for cordless or mobile telephones with means for adapting the functionality of the device according to specific conditions
- H04M1/72451—User interfaces specially adapted for cordless or mobile telephones with means for adapting the functionality of the device according to specific conditions according to schedules, e.g. using calendar applications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04M—TELEPHONIC COMMUNICATION
- H04M1/00—Substation equipment, e.g. for use by subscribers
- H04M1/72—Mobile telephones; Cordless telephones, i.e. devices for establishing wireless links to base stations without route selection
- H04M1/724—User interfaces specially adapted for cordless or mobile telephones
- H04M1/72448—User interfaces specially adapted for cordless or mobile telephones with means for adapting the functionality of the device according to specific conditions
- H04M1/72457—User interfaces specially adapted for cordless or mobile telephones with means for adapting the functionality of the device according to specific conditions according to geographic location
Abstract
The embodiment of the application discloses a schedule reminding method, a schedule reminding device, a storage medium and a terminal, wherein the method comprises the following steps: acquiring travel information; the travel information comprises travel date, arrival time and destination; calculating a first congestion probability of a preset path at an arrival time based on historical traffic data before a trip date; the method comprises the steps that a preset path is a path which is overlapped in a plurality of travel routes from a starting place to a destination; when the first congestion probability is larger than the preset probability, determining the non-congestion time of the destination based on historical traffic data; and sending out a schedule reminding message comprising the non-congestion time. The terminal calculates a first congestion probability of a coincident path in a plurality of travel routes from a starting place to a destination based on historical traffic data, determines non-congestion time of the destination based on the historical traffic data when the first congestion probability is larger than a preset probability, and sends the non-congestion time to a user, so that the user changes a travel plan to avoid congestion.
Description
Technical Field
The present application relates to the field of computer technologies, and in particular, to a schedule reminding method, an apparatus, a storage medium, and a terminal.
Background
A user reminds himself of participating in a certain activity at a destination at a specified time by setting a schedule, and a mobile phone sends out a reminder before the specified time to remind the user of starting, wherein the user starts from the current position to the destination. Therefore, the navigation service provides congestion avoidance service based on the current road traffic state, and provides a congestion avoidance path for the user. However, the navigation service provides the congestion avoidance path for the user based on a plurality of paths planned between the current position and the destination, and when congestion occurs in all the plurality of paths, the navigation service cannot provide a better choice for the user, and at this time, the user only can choose to continue driving on the congestion path, and the user may not reach the destination at the designated time.
Disclosure of Invention
The embodiment of the application provides a schedule reminding method, a schedule reminding device, a storage medium and a terminal, and can solve the problem that a user cannot arrive at a destination on time due to congestion between a departure place and the destination. The technical scheme is as follows;
in a first aspect, an embodiment of the present application provides a schedule reminding method, where the method includes:
acquiring travel information; wherein the travel information comprises a travel date, an arrival time and a destination;
calculating a first congestion probability of a preset path at the arrival time based on historical traffic data before the trip date; the preset path is a path which is overlapped in a plurality of travel routes from a starting place to the destination;
when the first congestion probability is larger than a preset probability, determining the non-congestion time of the destination based on the historical traffic data;
sending a schedule reminding message; wherein the schedule reminding message comprises the non-congestion time.
In a second aspect, an embodiment of the present application provides a schedule reminding apparatus, where the apparatus includes:
the acquisition module is used for acquiring travel information; wherein the travel information comprises a travel date, an arrival time and a destination;
the first congestion probability calculation module is connected with the acquisition module and used for calculating a first congestion probability of a preset path at the arrival time based on historical traffic data before the trip date; the preset path is a path which is overlapped in a plurality of travel routes from a starting place to the destination;
the non-congestion time determination module is connected with the first congestion probability calculation module and used for determining the non-congestion time of the destination based on the historical traffic data when the first congestion probability is greater than a preset probability; and
the reminding module is connected with the non-congestion time determining module and used for sending out schedule reminding messages; wherein the schedule reminding message comprises the non-congestion time.
In a third aspect, embodiments of the present application provide a computer storage medium storing a plurality of instructions adapted to be loaded by a processor and to perform the above-mentioned method steps.
In a fourth aspect, an embodiment of the present application provides a terminal, including: a processor and a memory; wherein the memory stores a computer program adapted to be loaded by the processor and to perform the above-mentioned method steps.
The beneficial effects brought by the technical scheme provided by some embodiments of the application at least comprise:
in the embodiment of the application, a terminal calculates a first congestion probability of a coincident path in a plurality of travel routes from a starting place to a destination based on historical traffic data, determines non-congestion time of the destination based on the historical traffic data when the first congestion probability is greater than a preset probability, and sends the non-congestion time to a user; so that the user changes the trip plan to avoid congestion.
Drawings
In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, it is obvious that the drawings in the following description are only some embodiments of the present application, and for those skilled in the art, other drawings can be obtained according to the drawings without creative efforts.
Fig. 1 is a schematic structural diagram of a terminal provided in an embodiment of the present application;
FIG. 2 is a schematic structural diagram of an operating system and a user space provided in an embodiment of the present application;
FIG. 3 is an architectural diagram of the android operating system of FIG. 1;
FIG. 4 is an architecture diagram of the IOS operating system of FIG. 1;
fig. 5 is a schematic interface display diagram of a terminal according to an embodiment of the present disclosure;
fig. 6 is a schematic interface display diagram of a terminal according to an embodiment of the present disclosure;
fig. 7 is a schematic flowchart of a schedule reminding method according to an embodiment of the present application;
fig. 8 is a schematic flowchart of a schedule reminding method according to an embodiment of the present application;
fig. 9 is a schematic structural diagram of a schedule reminding apparatus according to an embodiment of the present application.
Detailed Description
In order to make the objects, technical solutions and advantages of the present application more clear, embodiments of the present application will be described in further detail below with reference to the accompanying drawings.
When the following description refers to the accompanying drawings, like numbers in different drawings represent the same or similar elements unless otherwise indicated. The embodiments described in the following exemplary embodiments do not represent all embodiments consistent with the present application. Rather, they are merely examples of apparatus and methods consistent with certain aspects of the application, as detailed in the appended claims.
In the description of the present application, it is to be understood that the terms "first," "second," and the like are used for descriptive purposes only and are not to be construed as indicating or implying relative importance. The specific meaning of the above terms in the present application can be understood in a specific case by those of ordinary skill in the art. Further, in the description of the present application, "a plurality" means two or more unless otherwise specified. "and/or" describes the association relationship of the associated objects, meaning that there may be three relationships, e.g., a and/or B, which may mean: a exists alone, A and B exist simultaneously, and B exists alone. The character "/" generally indicates that the former and latter associated objects are in an "or" relationship.
Referring to fig. 1, a block diagram of a terminal according to an exemplary embodiment of the present application is shown. A terminal in the present application may include one or more of the following components: a processor 110, a memory 120, an input device 130, an output device 140, and a bus 150. The processor 110, memory 120, input device 130, and output device 140 may be connected by a bus 150.
The Memory 120 may include a Random Access Memory (RAM) or a read-only Memory (ROM). Optionally, the memory 120 includes a non-transitory computer-readable medium. The memory 120 may be used to store instructions, programs, code sets, or instruction sets. The memory 120 may include a program storage area and a data storage area, wherein the program storage area may store instructions for implementing an operating system, instructions for implementing at least one function (such as a touch function, a sound playing function, an image playing function, etc.), instructions for implementing various method embodiments described below, and the like, and the operating system may be an Android (Android) system (including a system based on Android system depth development), an IOS system developed by apple inc (including a system based on IOS system depth development), or other systems. The storage data area may also store data created by the terminal in use, such as a phonebook, audio-video data, chat log data, and the like.
Referring to fig. 2, the memory 120 may be divided into an operating system space, in which an operating system runs, and a user space, in which native and third-party applications run. In order to ensure that different third-party application programs can achieve a better operation effect, the operating system allocates corresponding system resources for the different third-party application programs. However, the requirements of different application scenarios in the same third-party application program on system resources are different, for example, in a local resource loading scenario, the third-party application program has a higher requirement on the disk reading speed; in the animation rendering scene, the third-party application program has a high requirement on the performance of the GPU. The operating system and the third-party application program are independent from each other, and the operating system cannot sense the current application scene of the third-party application program in time, so that the operating system cannot perform targeted system resource adaptation according to the specific application scene of the third-party application program.
In order to enable the operating system to distinguish a specific application scenario of the third-party application program, data communication between the third-party application program and the operating system needs to be opened, so that the operating system can acquire current scenario information of the third-party application program at any time, and further perform targeted system resource adaptation based on the current scenario.
Taking an operating system as an Android system as an example, programs and data stored in the memory 120 are as shown in fig. 3, and a Linux kernel layer 320, a system runtime library layer 340, an application framework layer 360, and an application layer 380 may be stored in the memory 120, where the Linux kernel layer 320, the system runtime library layer 340, and the application framework layer 360 belong to an operating system space, and the application layer 380 belongs to a user space. The Linux kernel layer 320 provides underlying drivers for various hardware of the terminal, such as a display driver, an audio driver, a camera driver, a bluetooth driver, a Wi-Fi driver, a power management, and the like. The system runtime library layer 340 provides a main feature support for the Android system through some C/C + + libraries. For example, the SQLite library provides support for a database, the OpenGL/ES library provides support for 3D drawing, the Webkit library provides support for a browser kernel, and the like. Also provided in the system runtime library layer 340 is an Android runtime library (Android runtime), which mainly provides some core libraries that can allow developers to write Android applications using the Java language. The application framework layer 360 provides various APIs that may be used in building an application, and developers may build their own applications by using these APIs, such as activity management, window management, view management, notification management, content provider, package management, session management, resource management, and location management. At least one application program runs in the application layer 380, and the application programs may be native application programs carried by the operating system, such as a contact program, a short message program, a clock program, a camera application, and the like; or a third-party application developed by a third-party developer, such as a game-like application, an instant messaging program, a photo beautification program, a shopping program, and the like.
Taking an operating system as an IOS system as an example, programs and data stored in the memory 120 are shown in fig. 4, and the IOS system includes: a Core operating system Layer 420(Core OS Layer), a Core Services Layer 440(Core Services Layer), a Media Layer 460(Media Layer), and a touchable Layer 480(Cocoa Touch Layer). The kernel operating system layer 420 includes an operating system kernel, drivers, and underlying program frameworks that provide functionality closer to hardware for use by program frameworks located in the core services layer 440. The core services layer 440 provides system services and/or program frameworks, such as a Foundation framework, an account framework, an advertisement framework, a data storage framework, a network connection framework, a geographic location framework, a motion framework, and so forth, as required by the application. The media layer 460 provides audiovisual related interfaces for applications, such as graphics image related interfaces, audio technology related interfaces, video technology related interfaces, audio video transmission technology wireless playback (AirPlay) interfaces, and the like. Touchable layer 480 provides various common interface-related frameworks for application development, and touchable layer 480 is responsible for user touch interaction operations on the terminal. Such as a local notification service, a remote push service, an advertising framework, a game tool framework, a messaging User Interface (UI) framework, a User Interface UIKit framework, a map framework, and so forth.
In the framework shown in FIG. 4, the framework associated with most applications includes, but is not limited to: a base framework in the core services layer 440 and a UIKit framework in the touchable layer 480. The base framework provides many basic object classes and data types, provides the most basic system services for all applications, and is UI independent. While the class provided by the UIKit framework is a basic library of UI classes for creating touch-based user interfaces, iOS applications can provide UIs based on the UIKit framework, so it provides an infrastructure for applications for building user interfaces, drawing, processing and user interaction events, responding to gestures, and the like.
The Android system can be referred to as a mode and a principle for realizing data communication between the third-party application program and the operating system in the IOS system, and details are not repeated herein.
The input device 130 is used for receiving input instructions or data, and the input device 130 includes, but is not limited to, a keyboard, a mouse, a camera, a microphone, or a touch device. The output device 140 is used for outputting instructions or data, and the output device 140 includes, but is not limited to, a display device, a speaker, and the like. In one example, the input device 130 and the output device 140 may be combined, and the input device 130 and the output device 140 are touch display screens for receiving touch operations of a user on or near the touch display screens by using any suitable object such as a finger, a touch pen, and the like, and displaying user interfaces of various applications. The touch display screen is generally provided at a front panel of the terminal. The touch display screen may be designed as a full-face screen, a curved screen, or a profiled screen. The touch display screen can also be designed to be a combination of a full-face screen and a curved-face screen, and a combination of a special-shaped screen and a curved-face screen, which is not limited in the embodiment of the present application.
In addition, those skilled in the art will appreciate that the configurations of the terminals illustrated in the above-described figures do not constitute limitations on the terminals, as the terminals may include more or less components than those illustrated, or some components may be combined, or a different arrangement of components may be used. For example, the terminal further includes a radio frequency circuit, an input unit, a sensor, an audio circuit, a wireless fidelity (WiFi) module, a power supply, a bluetooth module, and other components, which are not described herein again.
In the embodiment of the present application, the main body of execution of each step may be the terminal described above. Optionally, the execution subject of each step is an operating system of the terminal. The operating system may be an android system, an IOS system, or another operating system, which is not limited in this embodiment of the present application.
The terminal of the embodiment of the application can also be provided with a display device, and the display device can be various devices capable of realizing a display function, for example: a cathode ray tube display (CR), a light-emitting diode display (LED), an electronic ink panel, a Liquid Crystal Display (LCD), a Plasma Display Panel (PDP), and the like. The user can view information such as displayed text, images, video, etc. using the display device on the terminal 101. The terminal may be a smart phone, a tablet computer, a gaming device, an AR (Augmented Reality) device, an automobile, a data storage device, an audio playing device, a video playing device, a notebook, a desktop computing device, a wearable device such as an electronic watch, an electronic glasses, an electronic helmet, an electronic bracelet, an electronic necklace, an electronic garment, or the like.
In the terminal shown in fig. 1, the processor 110 may be configured to call an application program stored in the memory 120 and specifically execute the background blurring method according to the embodiment of the present application.
According to the technical scheme provided by the embodiment of the application, after travel information comprising travel date, arrival time and destination is obtained; calculating a first congestion probability of a preset path at the arrival time based on historical traffic data before the trip date; when the first congestion probability is larger than a preset probability, determining the non-congestion time of the destination based on the historical traffic data; sending a schedule reminding message; the method and the device solve the problem that the user cannot arrive at the destination on time due to congestion between the departure place and the destination, calculate a first congestion probability of a coincident path in a plurality of travel routes from the departure place to the destination based on historical traffic data, determine non-congestion time of the destination based on the historical traffic data when the first congestion probability is larger than a preset probability, and send the non-congestion time to the user; so that the user changes the trip plan to avoid congestion.
In the following method embodiments, for convenience of description, only the main execution body of each step is described as a terminal.
The schedule reminding method provided by the embodiment of the present application will be described in detail below with reference to fig. 5 to 7.
Referring to fig. 5 to 7, a flow chart of a schedule reminding method is provided in the embodiment of the present application. As shown in fig. 5 to 7, the method of the embodiment of the present application may include the steps of:
s701, obtaining travel information; wherein the travel information comprises a travel date, an arrival time and a destination.
The terminal is internally provided with schedule reminding software, the trip information can be information which is input in the schedule reminding software by a user in advance, and the input information can be characters and/or language. A display interface of the schedule reminding software may include a text input box 501, and a user may input travel information including a travel date, an arrival time, and a destination through the text input box 501.
The trip date can be year, month and day, and can also be month and day; the arrival time is the ideal time that the user wishes to reach the destination.
For example, a Beijing bird nest initiates a concert at ten am on September, and the user plans to reach the bird nest at thirty minutes at nine am on September to watch the concert; at this time, the user may set the date of travel to september one day, the arrival time to nine am thirty minutes, and the destination to the beijing bird nest.
S702, calculating a first congestion probability of a preset path at the arrival time based on historical traffic data before the travel date; the preset path is a path which is overlapped in a plurality of travel routes from the departure place to the destination.
The historical traffic data can be traffic data in a preset historical time interval before the trip date; the preset historical time interval may be 7 days, 10 days, 15 days, 20 days, 30 days, or the like.
The preset historical time interval may be intermittent; specifically, the preset historical time interval may be uniformly selected time, for example, when the preset historical time interval is 7 days, the historical traffic data may be traffic data including 7 days before the trip date, which are 1 st day, 3 rd day, 5 th day, 7 th day, 9 th day, 11 th day and 13 th day; the preset historical time interval may also be randomly selected time, for example, when the preset historical time interval is 7 days, the historical traffic data may include traffic data of 7 days including 1 st day, 2 nd day, 4 th day, 6 th day, 7 th day, 10 th day and 12 th day before the trip date; the preset historical time interval may also be a time selected according to the environment of the current date, for example, when the preset historical time interval is 7 days, the historical traffic data is traffic data similar to the environment of the current date including 7 days before the trip date, including 3 rd day, 5 th day, 6 th day, 8 th day, 10 th day, 11 th day and 12 th day.
The preset historical time interval may also be continuous, for example, the historical traffic data may be traffic data including 7 days before the trip date, including 1 st day, 2 nd day, 3 rd day, 4 th day, 5 th day, 6 th day and 7 th day.
It should be noted that the selection manner of the preset historical time interval may be a default of the system, or may be preset according to needs, which is not limited in the present invention.
The preset path is a path which is overlapped in a plurality of travel routes from the starting place to the destination. The plurality of routes comprise one or more than two routes, when only one route is available from the starting place to the destination, namely the coincident route is only one, and the preset route is the whole route from the starting place to the destination. When the travel routes from the starting place to the destination comprise a plurality of routes, the preset route is a superposed route in the travel routes, the number of the superposed routes can be one or more than two, and when the superposed route is one, the superposed route is the preset route; when the coincident path includes a plurality of paths, the preset path may be a superposition of the plurality of the coincident paths.
When there is only one travel route from the departure place to the destination, the preset route may also be a route close to the destination by a preset distance in the routes from the departure place to the destination; for example, when the preset distance is 100m, the preset route is a link from 100m away from the destination to the destination. When a plurality of travel routes from a starting place to a destination are included, and a path close to the destination by a preset distance is included in a superposed route of any travel route, the preset path is a path close to the destination by the preset distance; for example, the overlapped routes are S1, S2, and S3, and S3 includes a route close to the destination by a preset distance, and if the preset distance is 100m, the preset route is a link from 100m away from the destination to the destination.
It should be noted that the selection manner of the preset path may be a default of the system, or may be preset according to needs, which is not limited in the present invention.
And S703, when the first congestion probability is greater than a preset probability, determining the non-congestion time of the destination based on the historical traffic data.
When the first congestion probability is larger than the preset probability, the time spent for reaching the destination according to the arrival time set by the user is longer; therefore, according to the method and the device, the non-congestion time reaching the destination is replanned for the user based on the historical traffic data, so that the congestion probability of the preset path can be smaller than the preset probability when the user reaches the destination at the non-congestion time.
S704, sending a schedule reminding message; wherein the schedule reminding message comprises the non-congestion time.
After the terminal plans the non-congestion time, a prompt is sent to the user to inform the user in advance that the user should consider arriving at the destination at the non-congestion time.
In the embodiment of the application, a terminal calculates a first congestion probability of a coincident path in a plurality of travel routes from a starting place to a destination based on historical traffic data, determines non-congestion time of the destination based on the historical traffic data when the first congestion probability is greater than a preset probability, and sends the non-congestion time to a user; so that the user changes the trip plan to avoid congestion.
Please refer to fig. 8, which is a flowchart illustrating a schedule reminding method according to an embodiment of the present application. The embodiment is exemplified by applying the schedule reminding method to the terminal. The schedule reminding method can comprise the following steps:
s801, obtaining travel information; wherein the travel information comprises a travel date, an arrival time and a destination.
See S701 specifically, and the details are not repeated here.
S802, acquiring the current position, and taking the current position as the departure place.
The current position can be a position which is automatically positioned by the terminal after the user sets the travel information; the method is suitable for the situation that the departure place of the user is the same as the position for setting the travel information; the terminal positioning can adopt a Beidou positioning technology or a GPS positioning technology. The current location may also be a location that the user inputs when setting the travel information.
And S803, determining that the distance between the current position and the destination is greater than a preset distance.
The distance between the current location and the destination refers to the length of a travel route from the current location to the destination. When a plurality of travel routes from the current location to the destination are included, the distance between the current location and the destination may refer to an average value, a maximum value, or a minimum value of the plurality of travel routes.
The preset distance is a distance that a user can select to reach through a vehicle; the vehicle may be a self-propelled vehicle, a bus, a taxi, or the like; the preset distance may be more than 2 km. When the distance between the current position and the destination is greater than a preset distance, the step S804 is entered; otherwise, no action is taken.
S804, calculating the times of congestion of the preset path at the arrival time in a preset historical time interval before the travel date.
When there is only one overlapped path, the occurrence of congestion may mean that time taken to pass through the overlapped path is greater than preset time taken corresponding to the overlapped path. When the number of the overlapped paths is only one, and the overlapped paths include a path close to the destination by a preset distance, the occurrence of congestion may further mean that the time taken to pass through the path close to the destination by the preset distance is longer than the preset time taken corresponding to the preset distance.
When the multiple coincident paths exist, the occurrence of congestion may mean that the total time spent on passing through all the coincident paths is greater than the preset time spent on corresponding to all the coincident paths; for example, when the overlapping paths are S1, S2, and S3, the total time taken to pass through S1+ S2+ S3 is greater than the preset time taken corresponding to the path length of S1+ S2+ S3. When the number of the overlapped paths is more than one, the occurrence of congestion may also mean that the passing time of more than half of the overlapped paths in all the overlapped paths is longer than the corresponding preset consumed time; for example, when the overlapping paths are S1, S2, and S3, the time taken to pass through S1 and S3 is greater than the preset time taken corresponding thereto. When the multiple coincident paths include multiple paths, and any one of the multiple paths includes a path close to the destination by a preset distance, the occurrence of congestion may also mean that the time spent on passing through the path close to the destination by the preset distance in the multiple coincident paths is longer than the preset time spent on corresponding to the preset distance; for example, the overlapped paths are S1, S2, and S3, and the path Sa included in S3 is close to the destination by a preset distance, and the time taken to pass through the Sa is greater than the preset time taken corresponding thereto.
And S805, taking the ratio of the congestion times to the total times as the first congestion probability.
In the embodiment of the application, the times can be in days; the congestion times refer to the number of days of congestion in a preset historical time interval; the first congestion probability is a proportional value of the number of days in which congestion occurs and the total number of days in a preset historical time interval. If the preset historical time interval is 7 days, and the preset route is congested in 3 days at the arrival time, the first congestion probability is 3/7.
And S806, when the first congestion probability is larger than a preset probability, acquiring a preselected arrival time period before the arrival time.
The preselected time period of arrival is a period of time before the arrival time and/or a period of time after the arrival time. For example, the preselected arrival time period may be sixty minutes before the arrival time and fifteen minutes after the arrival time; at this time, if the arrival time input by the user is nine am thirty minutes, the preselected arrival time period is from eight am thirty minutes to nine am forty-five minutes.
The preselected arrival time period may be an acceptable time range preset by the user, or a default time range of the terminal.
A plurality of preselected arrival times are determined within the preselected arrival time period S807.
The preselected arrival time may be a time selected at fixed time intervals within the preselected arrival time period; if the preselected arrival time period is from eight am thirty-five to nine am forty-five and the time interval is 15 minutes, the preselected arrival time may be from eight am thirty-ten, eight am forty-five, nine am fifteen, nine am thirty-minute, and nine am forty-five. The time interval may be 1 minute, 2 minutes, 3 minutes, etc., and may be appropriately adjusted according to actual needs.
The time interval may be a time preset by a user, or may be a time default by the terminal.
And S808, calculating a second congestion probability of the preset path at each preselected arrival time based on the historical traffic data.
The calculation of the second congestion probability may be referred to as S702, S804, and S805, which is not described herein.
And S809, taking the preselected arrival time with the minimum second congestion probability as the non-congestion time.
And S810, determining a plurality of travel routes according to the departure place and the destination.
After acquiring a departure place and a destination, the terminal determines a plurality of road nodes to be passed from the departure place to the destination according to the map data; then, a plurality of road nodes are arranged in sequence, and a plurality of travel routes from the departure place to the destination can be obtained.
S811, calculating the passing time of each travel route to the destination at the non-congestion time based on the historical traffic data.
The transit time for each travel route to reach the destination at the non-congested time includes: splitting the travel route to obtain a plurality of road sections; arranging a plurality of links in order of decreasing distance from the destination; taking a road section closest to a destination as a first road section, and calculating first time consumed for passing the first road section based on historical traffic data, wherein the first time is time consumed by the whole first road section when first congestion time reaches a next node of the first road section; the method comprises the steps that a first waiting time needing to wait at a previous node of a first road section can be obtained based on historical traffic data, a second arrival time can be obtained according to the non-congestion time, the first time and the first waiting time, and the second arrival time is used as the time of a next node of a next road section; and then, according to the calculation mode of the first road section, the passing time of all road sections and the waiting time of all nodes can be obtained, and the passing time of the travel route can be obtained by adding the passing time of all road sections and the waiting time of all nodes.
In the embodiment of the application, the splitting of the travel route may be performed based on road nodes, and if there is a first node at a position 100m away from the departure place in the travel route, and there is a second node at a position 300m away from the first node, the travel route may be split into 0-100m, 100-400m, and the like.
When the non-congestion time is nine am, the specific implementation of the passing time of the travel route to the destination under the non-congestion time is as follows: the road sections which are divided into the travel route from the departure place by taking the road nodes as the basis comprise 0-500m, 500-2000m, 2000-5000m and 5000-7000 m; the sequence of the multiple links from the small distance to the large distance with the destination is as follows: 5000-7000m, 2000-5000m, 500-2000m and 0-500 m; taking the road section of 5000-7000m as a first road section, and calculating that 12 minutes is consumed for passing the road section of 5000-7000m total length of 2000m when the corresponding node of 7000m is reached at nine am based on historical traffic data; at this time, it can be calculated according to the two times of nine am and 12 minutes that the node corresponding to 5000m in the case that the node needs to reach forty-eight am at 5000-7000m, and based on the historical traffic data, the first waiting time of the node corresponding to 5000m at forty-eight am can be obtained to be 2 minutes; the second arrival time of the 2000-5000m road section can be obtained according to the result and is forty-six minutes at eight am; after the above steps are repeated, the transit time of the 2000-5000m road segment is 20 minutes, and the second waiting time at the node corresponding to 2000m is 1 minute; obtaining the traffic time of the road section of 500-2000m as 18 minutes, and the second waiting time of the node corresponding to 500m as 5 minutes; the passage time for a road section of 0-500m is 6 minutes. The transit time of the travel route is 12+2+20+1+18+5+ 6-64 minutes.
And S812, planning a first departure time according to the shortest passing time and the non-congestion time.
And selecting the travel route with the shortest passing time as the optimal driving route, and calculating first departure time according to the shortest passing time and the non-congestion time. In this embodiment of the application, the schedule reminding message may further include the optimal driving route.
S813, sending a schedule reminding message; wherein the schedule reminding message comprises the non-congestion time and/or the first departure time.
When the first congestion probability is larger than the preset probability, the terminal gives a prompt of the non-congestion time and/or the first departure time, and the user can choose to depart at the first departure time so as to arrive at the destination at the non-congestion time.
And S814, when the first congestion probability is smaller than or equal to a preset probability, planning a second departure time based on the arrival time.
The step of planning the second departure time based on the arrival time is similar to the step of planning the first departure time based on the non-congestion time, and may be referred to in detail in S811 and S812, and is not described herein again.
S815, sending a schedule reminding message; wherein the schedule reminder message includes the second departure time.
When the first congestion probability is smaller than or equal to a preset probability, the terminal gives a prompt of the second departure time, and the user can choose to depart at the second departure time so as to arrive at the destination at the arrival time.
The schedule reminding message can remind the user in a voice mode and/or a display mode. For example, the display interface of the schedule reminding software may further include a display frame 602, and after the terminal calculates the non-congestion time, the first departure time, or the second departure time, the non-congestion time, the first departure time, or the second departure time may be displayed to the user through the display frame 602. The schedule reminding message may be a reminder sent after the terminal calculates the preset time of the non-congestion time, the first departure time or the second departure time, or the schedule reminding message may be a reminder sent after the user inputs the preset time of the travel information. The schedule reminding message can be sent when a display interface of the schedule reminding software is displayed on the terminal (namely, the schedule reminding software is running). The schedule reminding message can also be sent when the terminal is in a bright screen (namely when the terminal is in an operating state, the schedule reminding software can be in a closed state or a background operating state); due to the fact that the non-congestion time, the first departure time or the second departure time can be calculated only within a period of time after the terminal acquires the travel information, the terminal still sends out the reminding when the user closes the display interface of the schedule reminding software through the mode, and the user can be ensured to receive the schedule reminding message.
In the embodiment of the application, a terminal calculates a first congestion probability of a coincident path in a plurality of travel routes from a starting place to a destination based on historical traffic data, determines non-congestion time of the destination based on the historical traffic data when the first congestion probability is greater than a preset probability, and sends the non-congestion time to a user; so that the user changes the trip plan to avoid congestion.
The following are embodiments of the apparatus of the present application that may be used to perform embodiments of the method of the present application. For details which are not disclosed in the embodiments of the apparatus of the present application, reference is made to the embodiments of the method of the present application.
Referring to fig. 9, a schematic structural diagram of a schedule reminder apparatus according to an exemplary embodiment of the present application is shown. The schedule reminding device can be realized by software, hardware or a combination of the software and the hardware to form all or part of the terminal. The device includes:
an obtaining module 901, configured to obtain travel information; wherein the travel information comprises a travel date, an arrival time and a destination;
a first congestion probability calculating module 902, connected to the obtaining module 901, configured to calculate a first congestion probability of a preset route at the arrival time based on historical traffic data before the trip date; the preset path is a path which is overlapped in a plurality of travel routes from a starting place to the destination;
a non-congestion time determination module 903, connected to the first congestion probability calculation module 902, configured to determine a non-congestion time of the destination based on the historical traffic data when the first congestion probability is greater than a preset probability; and
a reminding module 904, connected to the non-congestion time determination module 903, for sending a schedule reminding message; wherein the schedule reminding message comprises the non-congestion time.
Optionally, the first congestion probability calculating module 902 includes:
the congestion times calculation unit is used for calculating the times of congestion of the preset path at the arrival time in a preset historical time interval before the trip date;
and the first congestion probability determination unit is used for taking a ratio value of the congestion times and the total times as the first congestion probability.
Optionally, the non-congestion time determination module 903 includes:
a preselection arrival time period acquisition unit for acquiring a preselection arrival time period before the arrival time;
a preselected arrival time determining unit for determining a plurality of preselected arrival times within the preselected arrival time period;
the second congestion probability calculation unit is used for calculating a second congestion probability of the preset path at each preselected arrival time based on the historical traffic data;
and the non-congestion time determining unit is used for taking the preselected arrival time with the minimum second congestion probability as the non-congestion time.
Optionally, the apparatus further comprises a first departure time planning module for planning a first departure time based on the non-congestion time.
Optionally, the first departure time planning module includes:
a travel route determining unit, configured to determine a plurality of travel routes according to the departure place and the destination;
a transit time calculation unit for calculating a transit time for each of the travel routes to reach the destination at the non-congested time based on the historical traffic data;
and the first departure time planning unit is used for planning the first departure time according to the shortest passing time and the non-congestion time.
Optionally, the apparatus further includes a second departure time planning module configured to plan a second departure time based on the arrival time when the first congestion probability is less than or equal to a preset probability.
Optionally, the apparatus further includes a determining module, configured to obtain a current location, and use the current location as the departure place; and determining that the distance between the current position and the destination is greater than a preset distance.
It should be noted that, when the schedule reminding device provided in the foregoing embodiment executes the schedule reminding method, only the division of the functional modules is illustrated, and in practical applications, the function distribution may be completed by different functional modules according to needs, that is, the internal structure of the device is divided into different functional modules, so as to complete all or part of the functions described above. In addition, the schedule reminding device and the schedule reminding method provided by the above embodiments belong to the same concept, and the detailed implementation process is shown in the method embodiments, which is not described herein again.
The above-mentioned serial numbers of the embodiments of the present application are merely for description and do not represent the merits of the embodiments.
In the embodiment of the application, a terminal calculates a first congestion probability of a coincident path in a plurality of travel routes from a starting place to a destination based on historical traffic data, determines non-congestion time of the destination based on the historical traffic data when the first congestion probability is greater than a preset probability, and sends the non-congestion time to a user; so that the user changes the trip plan to avoid congestion.
An embodiment of the present application further provides a computer storage medium, where the computer storage medium may store a plurality of instructions, where the instructions are suitable for being loaded by a processor and executing the method steps in the embodiments shown in fig. 7 to 8, and a specific execution process may refer to specific descriptions of the embodiments shown in fig. 7 to 8, which are not described herein again.
The application also provides a terminal, which comprises a processor and a memory; wherein the memory stores a computer program adapted to be loaded by the processor and to perform the above-mentioned method steps.
It will be understood by those skilled in the art that all or part of the processes of the methods of the embodiments described above can be implemented by a computer program, which can be stored in a computer-readable storage medium, and when executed, can include the processes of the embodiments of the methods described above. The storage medium may be a magnetic disk, an optical disk, a read-only memory or a random access memory.
The above disclosure is only for the purpose of illustrating the preferred embodiments of the present application and is not to be construed as limiting the scope of the present application, so that the present application is not limited thereto, and all equivalent variations and modifications can be made to the present application.
Claims (7)
1. A schedule reminding method is characterized by comprising the following steps:
acquiring travel information; wherein the travel information comprises a travel date, an arrival time and a destination;
calculating a first congestion probability of a preset path at the arrival time based on historical traffic data before the trip date; the preset path is a path which is overlapped in a plurality of travel routes from a starting place to the destination;
when the first congestion probability is larger than a preset probability, determining the non-congestion time of the destination based on the historical traffic data; wherein determining the non-congestion time of the destination based on the historical traffic data comprises: acquiring a preselected arrival time period before the arrival time, wherein the preselected arrival time period is an acceptable time range preset by a user; determining a plurality of preselected arrival times within the preselected arrival time period; calculating a second congestion probability of the preset path at each of the preselected arrival times based on the historical traffic data; taking the preselected arrival time with the minimum second congestion probability as the non-congestion time;
the method further comprises the following steps: planning a first departure time based on the non-congestion time; the planning a first departure time based on the non-congestion time comprises: determining a plurality of travel routes according to the departure place and the destination; calculating a transit time for each of the travel routes to reach the destination at the non-congested time based on the historical traffic data; planning a first departure time according to the shortest passing time and the non-congestion time;
sending a schedule reminding message; wherein the schedule reminding message comprises the non-congestion time and the first departure time.
2. The method of claim 1, wherein calculating a first congestion probability for a preset route at the arrival time based on historical traffic data prior to the travel date comprises:
calculating the times of congestion of the preset path at the arrival time in a preset historical time interval before the trip date;
and the proportion value of the congestion times and the total times is used as the first congestion probability.
3. The method of claim 1, wherein a second departure time is planned based on the arrival time when the first congestion probability is less than or equal to a preset probability.
4. The method according to any one of claims 1 to 3, wherein before calculating the first congestion probability at the arrival time for the preset route based on historical traffic data before the travel date, further comprising:
acquiring a current position, and taking the current position as the place of departure;
determining that a distance between the current location and the destination is greater than a preset distance.
5. A schedule reminder apparatus, comprising:
the acquisition module is used for acquiring travel information; wherein the travel information comprises a travel date, an arrival time and a destination;
the first congestion probability calculation module is connected with the acquisition module and used for calculating a first congestion probability of a preset path at the arrival time based on historical traffic data before the trip date; the preset path is a path which is overlapped in a plurality of travel routes from a starting place to the destination;
the non-congestion time determination module is connected with the first congestion probability calculation module and used for determining the non-congestion time of the destination based on the historical traffic data when the first congestion probability is greater than a preset probability; wherein the non-congestion time determination module comprises: a preselection arrival time period acquisition unit for acquiring a preselection arrival time period before the arrival time; a preselected arrival time determining unit for determining a plurality of preselected arrival times within the preselected arrival time period; the second congestion probability calculation unit is used for calculating a second congestion probability of the preset path at each preselected arrival time based on the historical traffic data; a non-congestion time determination unit configured to determine a preselected arrival time at which a second congestion probability is smallest as the non-congestion time;
a first departure time planning module to plan a first departure time based on the non-congestion time; the first departure time planning module includes: a travel route determining unit, configured to determine a plurality of travel routes according to the departure place and the destination; a transit time calculation unit for calculating a transit time for each of the travel routes to reach the destination at the non-congested time based on the historical traffic data; a first departure time planning unit for planning a first departure time according to a shortest transit time and the non-congestion time; and
the reminding module is connected with the non-congestion time determining module and used for sending out schedule reminding messages; wherein the schedule reminding message comprises the non-congestion time and the first departure time.
6. A computer storage medium, characterized in that it stores a plurality of instructions adapted to be loaded by a processor and to perform the method steps of any of claims 1 to 4.
7. A terminal, comprising: a processor and a memory; wherein the memory stores a computer program adapted to be loaded by the processor and to perform the method steps of any of claims 1 to 4.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910966173.1A CN110730271B (en) | 2019-10-12 | 2019-10-12 | Schedule reminding method and device, storage medium and terminal |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910966173.1A CN110730271B (en) | 2019-10-12 | 2019-10-12 | Schedule reminding method and device, storage medium and terminal |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110730271A CN110730271A (en) | 2020-01-24 |
| CN110730271B true CN110730271B (en) | 2021-04-20 |
Family
ID=69221100
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910966173.1A Active CN110730271B (en) | 2019-10-12 | 2019-10-12 | Schedule reminding method and device, storage medium and terminal |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110730271B (en) |
Families Citing this family (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112330094A (en) * | 2020-10-09 | 2021-02-05 | 广州市物联万方电子科技有限公司 | Container scheduling method and device and server |
| CN112665604A (en) * | 2020-12-31 | 2021-04-16 | 重庆文理学院 | Intelligent vehicle guiding platform |
| CN113358130A (en) * | 2021-05-31 | 2021-09-07 | 中国银行股份有限公司 | Method, device and equipment for acquiring planned path and readable storage medium |
| CN113850419A (en) * | 2021-09-10 | 2021-12-28 | 果客行(苏州)科技有限公司 | Route recommendation method, device, equipment and storage medium based on travel big data |
| CN115240423B (en) * | 2022-07-24 | 2024-03-01 | 福建港南实业有限公司 | Internet-based intelligent urban traffic allocation method and system |
Family Cites Families (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7522995B2 (en) * | 2004-02-05 | 2009-04-21 | Nortrup Edward H | Method and system for providing travel time information |
| CN103824467B (en) * | 2013-12-18 | 2016-03-02 | 招商局重庆交通科研设计院有限公司 | For reservation type communication navigation method of servicing and the device of POV |
| CN105466443A (en) * | 2015-12-24 | 2016-04-06 | 魅族科技（中国）有限公司 | Navigation method and terminal |
| CN106096762A (en) * | 2016-06-01 | 2016-11-09 | 四川九洲电器集团有限责任公司 | A kind of paths planning method and electronic equipment |
| US10006778B2 (en) * | 2016-11-11 | 2018-06-26 | Ford Global Technologies, Llc | Method and apparatus for vehicular travel assistance |
| CN106705988B (en) * | 2017-03-06 | 2019-02-12 | Oppo广东移动通信有限公司 | Road conditions methods of exhibiting, device and computer equipment |
| CN107527188A (en) * | 2017-08-29 | 2017-12-29 | 深圳天珑无线科技有限公司 | Processing method and processing device, terminal and the computer-readable medium of stroke reminding time |
-
2019
- 2019-10-12 CN CN201910966173.1A patent/CN110730271B/en active Active
Also Published As
| Publication number | Publication date |
|---|---|
| CN110730271A (en) | 2020-01-24 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110730271B (en) | Schedule reminding method and device, storage medium and terminal | |
| US10637763B2 (en) | Computing system implementing an on-demand transport service based on sub-regional utilization conditions | |
| CN110035180B (en) | Card display method, device, terminal and storage medium | |
| CN107889070B (en) | Picture processing method, device, terminal and computer readable storage medium | |
| CN111459586B (en) | Remote assistance method, device, storage medium and terminal | |
| US20140026065A1 (en) | Transportation service communication method, apparatus and system | |
| CN106643774B (en) | Navigation route generation method and terminal | |
| CN113779166B (en) | Geofence control method and device, storage medium and electronic equipment | |
| CN112863219B (en) | Position updating method and device, storage medium and electronic equipment | |
| US20210377196A1 (en) | Server-side ui task control for onboarding users to a messaging platform | |
| CN110572815A (en) | Network access method, device, storage medium and terminal | |
| CN113780978A (en) | Arrival reminding method and device, storage medium and electronic equipment | |
| CN110702346B (en) | Vibration testing method and device, storage medium and terminal | |
| CN115379005A (en) | Message processing method and device, storage medium and electronic equipment | |
| CN113114849A (en) | Alarm clock reminding method and device, storage medium and terminal | |
| US10296306B2 (en) | Embedded location awareness in UML modeling for mobile and IoT development | |
| CN114186526A (en) | Automatic punching method and device for integrated circuit based on R tree MBR algorithm | |
| CN113419650A (en) | Data moving method and device, storage medium and electronic equipment | |
| CN113312572A (en) | Resource processing method and device, storage medium and electronic equipment | |
| CN113972989A (en) | Data verification method and device, storage medium and electronic equipment | |
| CN113311986A (en) | Business information display method, device, equipment and computer readable medium | |
| CN110908629A (en) | Electronic equipment operation method and device, electronic equipment and storage medium | |
| CN115757949A (en) | Content delivery method, device and equipment | |
| CN111641692B (en) | Session data processing method and device and electronic equipment | |
| CN114443204A (en) | Interface content generation method and device, storage medium and computer equipment |
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 |