CN112184208A - Code scanning riding method, client, server, electronic equipment and storage medium - Google Patents
Code scanning riding method, client, server, electronic equipment and storage medium Download PDFInfo
- Publication number
- CN112184208A CN112184208A CN202010828195.4A CN202010828195A CN112184208A CN 112184208 A CN112184208 A CN 112184208A CN 202010828195 A CN202010828195 A CN 202010828195A CN 112184208 A CN112184208 A CN 112184208A
- Authority
- CN
- China
- Prior art keywords
- code scanning
- riding
- code
- time
- actual
- 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.)
- Withdrawn
Links
- 238000000034 method Methods 0.000 title claims abstract description 72
- 230000002159 abnormal effect Effects 0.000 claims abstract description 57
- 238000004590 computer program Methods 0.000 claims description 11
- 238000010586 diagram Methods 0.000 description 16
- 230000008569 process Effects 0.000 description 13
- 230000006870 function Effects 0.000 description 9
- 238000012545 processing Methods 0.000 description 4
- 230000009471 action Effects 0.000 description 3
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 230000006855 networking Effects 0.000 description 2
- 230000003287 optical effect Effects 0.000 description 2
- 230000001502 supplementing effect Effects 0.000 description 2
- 230000004075 alteration Effects 0.000 description 1
- 230000001680 brushing effect Effects 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 238000013500 data storage Methods 0.000 description 1
- 230000001419 dependent effect Effects 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 230000000750 progressive effect Effects 0.000 description 1
- 238000012546 transfer Methods 0.000 description 1
- 230000001960 triggered effect Effects 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q20/00—Payment architectures, schemes or protocols
- G06Q20/30—Payment architectures, schemes or protocols characterised by the use of specific devices or networks
- G06Q20/32—Payment architectures, schemes or protocols characterised by the use of specific devices or networks using wireless devices
- G06Q20/327—Short range or proximity payments by means of M-devices
- G06Q20/3276—Short range or proximity payments by means of M-devices using a pictured code, e.g. barcode or QR-code, being read by the M-device
-
- G06Q50/40—
Abstract
The invention provides a code scanning riding method, a client, a server, electronic equipment and a storage medium. The code scanning riding method comprises the following steps: under the condition that the normal riding code is not taken, displaying a pre-established abnormal riding code for code scanning, and acquiring a code scanning position and code scanning time during code scanning; generating a riding record according to the code scanning position and the code scanning time; and under the condition that the network connection is successful, carrying out payment operation aiming at the riding record. According to the invention, the abnormal riding code is created in advance and is used as a medium, so that normal riding can be realized under the condition that the normal riding code is not called successfully, and the payment operation is carried out under the condition that the network connection is successful, so that the ticket is supplemented after riding, and convenience is brought to a user for riding.
Description
Technical Field
The invention relates to the technical field of internet, in particular to a code scanning riding method, a client, a server, electronic equipment and a storage medium.
Background
With the rapid development of the internet technology, the intelligent transportation combining the internet and the transportation brings more and more convenience to people going out. Taking a public transport riding scene as an example, a user can ride the bus by using the riding code and pay riding cost, so that an entity ticket does not need to be purchased, and the bus is more convenient to ride.
Generally, a user can request a bus code in a networking environment or reserve a certain number of bus codes in advance, so that the user can call the bus code to carry out code scanning bus when riding the bus. However, the retrieval of the vehicle code depends on a network environment, a public transportation system environment, and the like. Therefore, if the weak network state or the network-free state is met or the bus system is abnormal, the bus code is not called successfully, and the bus cannot be ridden by scanning the code normally.
Disclosure of Invention
In view of the above, embodiments of the present invention are proposed to provide a code scanning riding method, a client, a server, an electronic device and a storage medium that overcome or at least partially solve the above problems.
In a first aspect, an embodiment of the present invention discloses a code scanning riding method, which is executed at a client, and includes:
under the condition that the normal riding code is not taken, displaying a pre-established abnormal riding code for code scanning, and acquiring a code scanning position and code scanning time during code scanning;
generating a riding record according to the code scanning position and the code scanning time;
and under the condition that the network connection is successful, carrying out payment operation aiming at the riding record.
Optionally, the generating a ride record according to the code scanning position and the code scanning time includes: obtaining candidate riding routes and candidate riding stations contained in the candidate riding routes; according to the code scanning position, matching the candidate bus taking stations to obtain an actual bus taking station; and matching to obtain an actual riding route from the candidate riding routes according to the code scanning time and the actual riding station, and taking the actual riding route as the riding record.
Optionally, the obtaining of the candidate riding route includes: calculating the running speed of the vehicle based on the code scanning position and the code scanning time, and determining the type of the vehicle corresponding to the running speed of the vehicle; and selecting a riding route corresponding to the vehicle type from pre-stored riding routes as the candidate riding route.
Optionally, the code scanning positions comprise an upper vehicle scanning position and a lower vehicle scanning position, and the actual vehicle taking stations comprise actual vehicle taking stations and actual vehicle getting-off stations; according to the code scanning position, obtaining an actual bus station from the candidate bus stations in a matching mode, wherein the actual bus station comprises the following steps: matching the upper vehicle scanning position and the lower vehicle scanning position with the positions of the candidate riding stations respectively; and taking the candidate riding station successfully matched with the upper vehicle scanning position as the actual vehicle loading station, and taking the candidate riding station successfully matched with the lower vehicle scanning position as the actual vehicle unloading station.
Optionally, the code scanning time comprises an entering code scanning time and a leaving code scanning time, and the actual taking station comprises an actual entering station and an actual leaving station; the step of obtaining the actual bus route from the candidate bus routes in a matching mode according to the code scanning time and the actual bus station comprises the following steps: calculating a first time interval between the getting-on code scanning time and the getting-off code scanning time; respectively calculating a second time interval from the actual vehicle-loading station to the actual vehicle-unloading station in the current candidate vehicle-loading route aiming at each candidate vehicle-loading route comprising the actual vehicle-loading station and the actual vehicle-unloading station; and when the difference value between the first time interval and the second time interval is smaller than a first preset time length, taking a route from the actual getting-on station to the actual getting-off station in the current candidate riding routes as the actual riding route.
Optionally, the acquiring a code scanning position during code scanning includes: acquiring a real-time positioning position during code scanning, and taking the real-time positioning position as a code scanning position; when the real-time positioning position acquisition fails, acquiring the last historical positioning position within a second preset time before the code scanning time, and taking the historical positioning position as the code scanning position; when the historical positioning position acquisition fails, acquiring a station position which has the largest riding times and exceeds a preset number in the code scanning time in a historical riding record, and taking the station position as the code scanning position; and when the site position acquisition fails, acquiring a position input by a user, and taking the position input by the user as the code scanning position.
In a second aspect, an embodiment of the present invention discloses a code scanning riding method, which is executed at a client, and includes:
under the condition that the normal riding code is not taken, displaying a pre-established abnormal riding code for code scanning, and acquiring a code scanning position and code scanning time during code scanning;
sending a riding record generation request to a server under the condition that network connection is successful, wherein the riding record generation request comprises the code scanning position and the code scanning time;
and receiving a bus taking record issued by the server and generated according to the code scanning position and the code scanning time, and performing payment operation aiming at the bus taking record.
In a third aspect, an embodiment of the present invention discloses a code scanning riding method, which is executed at a server, and includes:
receiving a riding record generation request sent by a client, wherein the riding record generation request comprises a code scanning position and code scanning time during code scanning; the code scanning position and the code scanning time are acquired by the client when the client displays the pre-established abnormal riding code for code scanning under the condition that the normal riding code is not taken successfully, and are sent under the condition that the network connection is successful;
generating a riding record according to the code scanning position and the code scanning time;
and issuing the riding record to the client so that the client carries out payment operation aiming at the riding record.
In a fourth aspect, an embodiment of the present invention discloses a client, where the client includes:
the system comprises an acquisition module, a code scanning module and a code scanning module, wherein the acquisition module is used for displaying a pre-established abnormal riding code to scan the code under the condition that the normal riding code is not taken, and acquiring a code scanning position and code scanning time during code scanning;
the first generation module is used for generating a riding record according to the code scanning position and the code scanning time;
and the payment module is used for carrying out payment operation aiming at the riding record under the condition that the network connection is successful.
Optionally, the first generating module comprises: the data acquisition unit is used for acquiring candidate riding routes and candidate riding stations contained in the candidate riding routes; the first matching unit is used for matching the candidate bus taking sites to obtain actual bus taking sites according to the code scanning positions; and the second matching unit is used for matching the candidate riding routes according to the code scanning time and the actual riding stations to obtain actual riding routes, and taking the actual riding routes as the riding records.
Optionally, the data acquiring unit includes: the type determining subunit is used for calculating the vehicle running speed based on the code scanning position and the code scanning time and determining the vehicle type corresponding to the vehicle running speed; and the route selection subunit is used for selecting a riding route corresponding to the vehicle type from pre-stored riding routes as the candidate riding route.
Optionally, the code scanning positions comprise an upper vehicle scanning position and a lower vehicle scanning position, and the actual vehicle taking stations comprise actual vehicle taking stations and actual vehicle getting-off stations; the first matching unit includes: the position matching subunit is used for respectively matching the upper vehicle scanning position and the lower vehicle scanning position with the positions of the candidate riding stations; and the station determining subunit is used for taking the candidate riding station successfully matched with the getting-on scanning position as the actual getting-on station and taking the candidate riding station successfully matched with the getting-off scanning position as the actual getting-off station.
Optionally, the code scanning time comprises an entering code scanning time and a leaving code scanning time, and the actual taking station comprises an actual entering station and an actual leaving station; the second matching unit includes: the first calculating subunit is used for calculating a first time interval between the code scanning time for the upper vehicle and the code scanning time for the lower vehicle; a second calculating subunit, configured to calculate, for each candidate riding route including the actual getting-on station and the actual getting-off station, a second time interval from the actual getting-on station to the actual getting-off station in the current candidate riding route, respectively; and the route determining subunit is configured to, when the difference between the first time interval and the second time interval is smaller than a first preset time length, use a route from the actual getting-on station to the actual getting-off station in the current candidate riding routes as the actual riding route.
Optionally, the obtaining module includes: the code scanning device comprises a first acquisition unit, a second acquisition unit and a control unit, wherein the first acquisition unit is used for acquiring a real-time positioning position during code scanning and taking the real-time positioning position as a code scanning position; a second obtaining unit, configured to, when obtaining of the real-time positioning location fails, obtain a last historical positioning location within a second preset duration before the code scanning time, and use the historical positioning location as the code scanning location; a third obtaining unit, configured to, when obtaining of the historical positioning position fails, obtain a station position in a historical riding record, where the riding frequency is the most and exceeds a preset frequency in the code scanning time, and use the station position as the code scanning position; and the fourth acquisition unit is used for acquiring the position input by the user when the station position acquisition fails, and taking the position input by the user as the code scanning position.
In a fifth aspect, an embodiment of the present invention discloses a client, where the client includes:
the system comprises an acquisition module, a code scanning module and a code scanning module, wherein the acquisition module is used for displaying a pre-established abnormal riding code to scan the code under the condition that the normal riding code is not taken, and acquiring a code scanning position and code scanning time during code scanning;
the sending module is used for sending a taking record generating request to a server under the condition that network connection is successful, wherein the taking record generating request comprises the code scanning position and the code scanning time;
and the first receiving module is used for receiving a riding record which is issued by the server and generated according to the code scanning position and the code scanning time, and carrying out payment operation aiming at the riding record.
In a sixth aspect, an embodiment of the present invention discloses a server, where the server includes:
the second receiving module is used for receiving a riding record generation request sent by a client, wherein the riding record generation request comprises a code scanning position and code scanning time during code scanning; the code scanning position and the code scanning time are acquired by the client when the client displays the pre-established abnormal riding code for code scanning under the condition that the normal riding code is not taken successfully, and are sent under the condition that the network connection is successful;
the second generation module is used for generating a riding record according to the code scanning position and the code scanning time;
and the issuing module is used for issuing the riding record to the client so that the client performs payment operation aiming at the riding record.
In a seventh aspect, an embodiment of the present invention discloses an electronic device, including: one or more processors; and one or more machine-readable media having instructions stored thereon; the instructions, when executed by the one or more processors, cause the processors to perform any of the code scanning ride methods performed by the client, or any of the code scanning ride methods performed by the server, as described above.
In an eighth aspect, an embodiment of the present invention discloses a computer-readable storage medium, on which a computer program is stored, where the program, when executed by a processor, implements any of the code scanning riding methods executed by a client, or implements any of the code scanning riding methods executed by a server.
In the embodiment of the invention, a client displays a pre-established abnormal bus code for code scanning under the condition that the normal bus code is not taken, and the code scanning position and the code scanning time are obtained during code scanning; generating a riding record according to the code scanning position and the code scanning time; and under the condition that the network connection is successful, carrying out payment operation aiming at the riding record. Therefore, in the embodiment of the invention, the abnormal riding code is created in advance, the abnormal riding code is used as a medium, normal riding can be realized even if the calling of the normal riding code fails, and the payment operation is carried out under the condition that the network connection is successful, so that the ticket is supplemented after riding, and the riding of a user is facilitated.
Drawings
Fig. 1 is a flow chart illustrating steps of a code scanning riding method according to an embodiment of the present invention.
Fig. 2 is a flow chart of steps of another code scanning ride method in accordance with an embodiment of the present invention.
Fig. 3 is a flow chart of steps of another code scanning ride method in accordance with an embodiment of the present invention.
Fig. 4 is a flow chart of steps of another code scanning ride method in accordance with an embodiment of the present invention.
Fig. 5 is a block diagram of a client according to an embodiment of the present invention.
Fig. 6 is a block diagram of another client according to an embodiment of the present invention.
Fig. 7 is a block diagram of a server according to an embodiment of the present invention.
Detailed Description
In order to make the aforementioned objects, features and advantages of the present invention comprehensible, embodiments accompanied with figures are described in further detail below.
The embodiment of the invention mainly relates to a scene that a user calls a ride code on a client to carry out code-scanning ride. When a user takes a bus, the user can preferentially conduct networking to transfer a normal bus taking code to carry out code scanning bus taking. But may cause a failure in the normal bus code retrieval due to a network or the like. In this case, in the embodiment of the invention, the abnormal riding code is used as a medium, and the code-scanning riding is performed through the abnormal riding code first, and then payment is performed under the condition that the network connection is successful.
In the embodiment of the present invention, the client may be an APP (application program) installed on a device such as a mobile terminal, and the server may be a server corresponding to the APP. The mobile terminal may be a mobile phone, a tablet computer, a wearable device, and the like.
Referring to fig. 1, a flow chart of steps of a code scanning ride method according to an embodiment of the present invention is shown. The code scanning riding method shown in fig. 1 is executed at the client.
As shown in fig. 1, a code scanning ride method may include the steps of:
And 102, generating a riding record by the client according to the code scanning position and the code scanning time.
And 103, the client performs payment operation aiming at the riding record under the condition that the network connection is successful.
The normal riding code is provided by a public transport system and can be successfully called under a normal environment. And the normal riding code is bound with the user, and the normal riding code can carry out real-time riding settlement. At present, when a client calls a normal riding code, the client is over dependent on a network environment, a public transport system environment and the like. Therefore, a failure in calling a normal car code may occur in an abnormal environment. For example, the abnormal environment may be as follows: network signals of the subway station are poor due to geographical positions; the public transport is influenced by the geographical environment, frequently meets complex environments such as bridge holes and the like, and has poor network environment; the public transportation system of the medium and small cities is often unstable, system abnormity occurs, and the like. If the passengers encounter the abnormal environment, the normal passenger number calling fails, so that the passengers can not ride the passengers by brushing the passenger number normally, people flow congestion at the subway entrance and exit and the upper and lower doors of the bus is caused, and normal passage is blocked.
In the embodiment of the invention, the abnormal riding code is created in advance on the client, and the abnormal riding code is bound with the user. The abnormal riding code is a riding code which can be successfully called in an abnormal environment and is agreed by the client and the public transport system in advance. The abnormal riding code cannot be used for real-time riding settlement, after the abnormal riding code is scanned, the client can be triggered to record information such as code scanning time and code scanning position, so that riding records can be generated later, and payment can be carried out on the riding records after the environment is recovered to be normal.
When a user takes a car, the client is started, and the normal riding code is called on the client. And if the network environment is normal and the public transport system environment is normal, the normal riding codes can be successfully called, and in this case, the client displays the normal riding, and the passenger gets the bus after the code is scanned. If the network environment is abnormal or the environment of the public transport system is abnormal, the calling of the normal riding code is failed, and under the condition, the client displays the pre-established abnormal riding code to carry out code scanning and then ride.
After scanning the abnormal riding codes, the client can acquire and record the code scanning position and the code scanning time in real time when scanning the codes. And then generating a riding record of the riding according to the code scanning position and the code scanning time. And under the condition that the network connection is successful, carrying out payment operation aiming at the riding record to complete ticket compensation.
In the embodiment of the invention, the abnormal riding code is created in advance and is used as a medium, so that normal riding can be realized even if the calling of the normal riding code fails, and the payment operation is carried out under the condition of successful network connection, thereby realizing the purpose of supplementing tickets after riding first and facilitating riding of users.
Referring to fig. 2, a flow chart of steps of another code scanning ride method of an embodiment of the present invention is shown. The code scanning riding method shown in fig. 2 is executed at the client.
As shown in fig. 2, the code scanning ride method may include the steps of:
When a user takes a bus, the user firstly calls a normal bus code, if the calling of the normal bus code fails due to reasons such as network and the like, the client displays a pre-established abnormal bus code, the user carries out code scanning bus through the abnormal bus code, and the code scanning position and the code scanning time during code scanning are obtained.
In an alternative embodiment, the code scanning time when the code is scanned is acquired, and the system time of the mobile terminal when the code is scanned is acquired by the client as the code scanning time.
In an alternative embodiment, the process of obtaining the code scanning position may include the following steps a 1-a 4:
step A1, acquiring a real-time positioning position during code scanning, and taking the real-time positioning position as the code scanning position.
It is considered that the mobile terminal generally has a positioning function, and a positioning position acquired by the positioning function is relatively accurate data. Therefore, the client can acquire the real-time positioning position during code scanning, and the real-time positioning position is used as the code scanning position, so that the accuracy of the code scanning position is ensured. The method for acquiring the positioning position at least comprises the following steps: positioning through a Global Positioning System (GPS) chip of the mobile terminal, and acquiring a Positioning position; positioning is carried out through mobile terminal signal tower data, and then a positioning position is obtained; and positioning is carried out through WiFi (Wireless-Fidelity) connection data, and then the positioning position is obtained.
Step A2, when the real-time positioning position fails to be obtained, obtaining the last historical positioning position within a second preset time before the code scanning time, and taking the historical positioning position as the code scanning position.
If the real-time positioning position acquisition in step a1 fails during code scanning due to poor network environment, etc., it is considered that the mobile terminal usually starts a timing positioning function to perform timing positioning, and caches data such as historical positioning position and historical positioning time corresponding to the historical positioning position. Therefore, when the real-time positioning position acquisition fails, the client can acquire the last historical positioning position within the second preset time before the code scanning time based on the cached historical positioning position and the historical positioning time, and the last historical positioning position is used as the code scanning position, so that the accuracy of the positioning position is still kept, and the accuracy of the code scanning position is further ensured.
For the specific value of the second preset duration, any suitable value can be selected according to practical experience. For example, the second preset time period may be set according to the coverage area of the station in the normal case, and the time period from entering the coverage area of the station to scanning the code at the station. For example, the second preset time period may be set to 15 seconds, 30 seconds, 1 minute, and so on.
And A3, when the historical positioning position fails to be obtained, obtaining the station position which has the largest riding times and exceeds the preset times in the code scanning time in the historical riding record, and taking the station position as the code scanning position.
If the acquisition of the real-time positioning position during code scanning in the step a1 fails due to poor network environment and the like, and the acquisition of the last historical positioning position within the second preset time period before the code scanning time in the step a2 fails due to the fact that the mobile terminal does not start the timing positioning function, or the historical positioning time corresponding to the last cached historical positioning position exceeds the second preset time period from the code scanning time, and the like, the user may take a bus at the fixed-time fixed station in consideration of the bus taking habit of the user, and therefore the code scanning position may be acquired according to the historical bus taking record of the user. The client can store historical bus taking records of the user, and the historical bus taking records can include information such as station positions of historical bus taking stations, code scanning time of the historical bus taking stations and the like. Therefore, when the historical positioning position acquisition fails, the client can acquire the station position with the largest number of rides in the code scanning time and the number of rides exceeding the preset number in the historical ride record, and take the station position as the code scanning position.
For the specific numerical value of the preset times, any applicable numerical value can be selected according to actual experience. For example, the preset number of times may be set to 10 times, 20 times, and the like.
Optionally, after acquiring the real-time location position during code scanning in step a1, the client may further prompt the user to confirm the real-time location position; after the last historical positioning position within a second preset time length before the code scanning time is obtained in the step a2, the client may further prompt the user to confirm the historical positioning position; after the station position where the number of rides is the largest and exceeds the preset number in the code scanning time in the historical riding record is obtained in the step a3, the client may prompt the user to confirm the station position, so as to further ensure the accuracy of the obtained code scanning position.
Step A4, when the station position acquisition fails, acquiring the position input by the user, and taking the position input by the user as the code scanning position.
If the real-time positioning location acquisition at the time of code scanning in the step a1 fails due to poor network environment or the like, and because the mobile terminal does not start the timing positioning function, or the last historical positioning position acquisition in the step a2 within the second preset time before the code scanning time fails due to the reason that the historical positioning time corresponding to the last cached historical positioning position exceeds the second preset time by the code scanning time, and the like, and due to the fact that there are no cars or the number of cars taken at the code scanning time is small in the historical car taking records, etc., the acquisition of the station position with the largest number of cars taken at the code scanning time and exceeding the preset number in the step A3 fails, the client may provide a user input box, manually input the position information by the user, acquire the position input by the user, and take the position input by the user as the code scanning position.
And 202, generating a riding record by the client according to the code scanning position and the code scanning time.
In the implementation, when a user gets on a bus or gets in a subway, the client displays an abnormal bus code to scan the code under the condition that the normal bus code is not taken, and acquires the position and time of the code scanning after the code scanning is successful, so that the user gets on the bus or gets in the station successfully; when a user gets off a bus or gets out of the bus with a subway, the client displays an abnormal bus code to scan the code, after the code is scanned successfully, the position of the lower bus code scanning and the time of the lower bus code scanning are obtained, and the user successfully gets off or goes out of the bus. Therefore, sweep the sign indicating number position and can include the sign indicating number position is swept to the last car and the sign indicating number position is swept to the lower car, sweep the sign indicating number time and can include the sign indicating number time is swept to the last car and sweep the sign indicating number time under and.
It should be noted that the abnormal riding code scanned when getting on or getting off may be the same abnormal riding code as the abnormal riding code scanned when getting on or getting off, or may be different abnormal riding codes, which is not limited in this embodiment of the present invention. For example, an abnormal riding code can be created, and the abnormal riding code is scanned when a vehicle gets on or enters a station and when the vehicle gets off or leaves the station; it is also possible to create an getting-on abnormal riding code and a getting-off abnormal riding code, scan the getting-on abnormal riding code when getting on or getting off, scan the getting-off abnormal riding code when getting off or getting off, and the like.
In an optional implementation, the process of generating the ride record according to the code scanning position and the code scanning time may include the following steps B1 to B3:
and step B1, acquiring candidate riding routes and candidate riding stations contained in the candidate riding routes.
In the embodiment of the invention, information such as a plurality of riding routes (names of routes and the like), riding stations (names, positions and the like of stations) contained in each riding route, vehicle types (the vehicle types can comprise buses and subways) corresponding to each riding route and the like are stored in a client in advance.
In an alternative embodiment, the process of obtaining the candidate ride route may include: calculating the running speed of the vehicle based on the code scanning position and the code scanning time, and determining the type of the vehicle corresponding to the running speed of the vehicle; and selecting a riding route corresponding to the vehicle type from pre-stored riding routes as the candidate riding route.
In the implementation, the code scanning position comprises an upper vehicle code scanning position and a lower vehicle code scanning position, and the code scanning time comprises an upper vehicle code scanning time and a lower vehicle code scanning time. First, the distance between the lower vehicle code scanning position and the upper vehicle code scanning position and the time interval between the lower vehicle code scanning time and the upper vehicle code scanning time can be calculated, the distance is divided by the time interval to obtain a quotient, and the quotient is used as the vehicle running speed. Then, according to the respective driving speeds of the public transport and the subway in real life, the corresponding relation between the driving speed of the vehicle and the type of the vehicle is preset, for example, a driving speed range of the vehicle corresponding to the type of the vehicle being the public transport and a driving speed range of the vehicle corresponding to the type of the subway can be set, and after the driving speed of the vehicle is calculated, the type of the vehicle corresponding to the driving speed of the vehicle is determined according to the preset corresponding relation between the driving speed of the vehicle and the type of the vehicle. And finally, selecting a riding route corresponding to the vehicle type from pre-stored riding routes, and taking the selected riding route as the candidate riding route. After the candidate riding routes are determined, the riding stations included in the candidate riding routes are respectively obtained to serve as the candidate riding stations.
And B2, matching the candidate bus taking sites according to the code scanning position to obtain an actual bus taking site.
In the matching process, the upper vehicle scanning position and the lower vehicle scanning position are respectively matched with the positions of the candidate riding stations; and taking the candidate riding station successfully matched with the upper vehicle scanning position as the actual vehicle loading station, and taking the candidate riding station successfully matched with the lower vehicle scanning position as the actual vehicle unloading station. And taking the actual vehicle-taking station and the actual vehicle-getting-off station as actual vehicle-taking stations. Through the matching between the positions, the calculation process is simpler and more convenient, and the matching result is more accurate.
In the implementation, when the positions of the upper vehicle scanning positions are matched, the distances between the positions of the upper vehicle scanning positions and the positions of the candidate riding stations are respectively calculated, and when the distance between the position of the upper vehicle scanning position and the position of a candidate riding station is smaller than a preset distance threshold value, the successful matching between the position of the upper vehicle scanning position and the candidate riding station is determined. Similarly, when the lower vehicle scanning position is matched, the distance between the lower vehicle scanning position and the position of each candidate riding station is calculated respectively, and when the distance between the lower vehicle scanning position and the position of a certain candidate riding station is smaller than a preset distance threshold value, the successful matching between the lower vehicle scanning position and the candidate riding station is determined. For the specific value of the distance threshold, any suitable value may be set according to practical experience, for example, the distance threshold is set to be 10 meters, 20 meters, 30 meters, and the like, which is not limited in this embodiment of the present invention.
And step B3, matching the candidate riding routes according to the code scanning time and the actual riding stations to obtain an actual riding route, and taking the actual riding route as the riding record.
Since there may be multiple candidate riding routes including the actual getting-on station and the actual getting-off station, and candidate riding stations passing between the actual getting-on station and the actual getting-off station in different candidate riding routes are also different, the actual riding route of the user needs to be further screened from the candidate riding routes.
Firstly, calculating a first time interval between the loading code scanning time and the unloading code scanning time; then, respectively calculating a second time interval from the actual vehicle-loading station to the actual vehicle-unloading station in the current candidate riding routes aiming at each candidate riding route comprising the actual vehicle-loading station and the actual vehicle-unloading station; and when the difference value between the first time interval and the second time interval is smaller than a first preset time length, taking a route from the actual getting-on station to the actual getting-off station in the current candidate riding routes as the actual riding route.
And for each pre-stored riding route, presetting the time interval between every two adjacent stations in the riding route according to actual experience. And for the current candidate riding route comprising the actual riding station and the actual getting-off station, acquiring the time interval between every two adjacent stations in the route from the actual riding station to the actual getting-off station in the current candidate riding route, and then calculating the sum of the acquired time intervals to be used as a second time interval from the actual riding station to the actual getting-off station in the current candidate riding route. And if the difference value between the second time interval corresponding to the current candidate riding route and the first time interval is smaller than a first preset time length, the user takes the current candidate riding route, so that the route from the actual getting-on station to the actual getting-off station in the current candidate riding route is used as the actual riding route. And the client stores the actual riding route as a riding record. Of course, the riding record may further include the time for scanning the code for getting on the vehicle, the time for scanning the code for getting off the vehicle, and other related information.
For the specific value of the first preset duration, any applicable value can be selected according to practical experience. For example, the first preset time period may be set to 1 minute, 2 minutes, 5 minutes, and so on.
Of course, the client may also prompt the user to confirm or modify the actual riding route, the actual getting-on station and the actual getting-off station in the riding record.
And 203, uploading the riding record to a server by the client under the condition that the network connection is successful.
And 204, the client receives payment information corresponding to the riding record sent by the server, and performs payment operation based on the payment information.
When the network connection is successful, the client can perform payment operation on the bus taking record generated under the condition that the normal bus taking code is not taken. The client can upload the riding record to the server through network connection. And after receiving the riding record, the server analyzes the riding record or communicates with a corresponding public transport system to obtain payment information corresponding to the riding record, wherein the payment information can comprise payment amount and the like, and the server issues the payment information to the client. And after receiving payment information corresponding to the riding record, the client performs payment operation based on the payment information.
In the embodiment of the invention, the abnormal riding code is set, and the code scanning position, the code scanning time and the like are recorded for generating the subsequent riding record, so that the ticket can be supplemented after getting on the bus in an abnormal environment, and convenience is brought to a user for riding the bus.
Referring to fig. 3, a flow diagram illustrating steps of another code scanning ride method in accordance with an embodiment of the present invention is shown. The code scanning riding method shown in fig. 3 is executed at the client.
As shown in fig. 3, the code scanning ride method may include the steps of:
Step 301 is the same as step 101 and step 201 in the above embodiments, and specific reference may be made to the related description in the above embodiments, and the embodiments of the present invention are not discussed in detail here.
In view of the fact that if the processes of storing the riding route information, generating the riding record and the like are executed locally at the client, more client resources may be occupied, in the embodiment of the invention, the riding route may be stored at the server, and the generating process of the riding record may be executed.
Therefore, after acquiring the code scanning position and the code scanning time during code scanning, the client records the code scanning position and the code scanning time. And under the condition that network connection is successful, the client generates a riding record generation request comprising the code scanning position and the code scanning time, and sends the riding record generation request to the server so as to request the server to generate a riding record.
And 303, the client receives a bus record which is issued by the server and generated according to the code scanning position and the code scanning time, and performs payment operation aiming at the bus record.
And after receiving the riding record generation request, the service end generates a riding record according to the code scanning position and the code scanning time, wherein the riding record can comprise an actual riding route, payment information and the like. And the service end sends the riding record to the client. And after receiving the riding record, the client performs payment operation on the basis of payment information included in the riding record aiming at the riding record.
Certainly, the client may also prompt the user to confirm or modify the actual riding route, the actual getting-on site and the actual getting-off site in the riding record, and if the user modifies the riding record, the client may send the riding record modified by the user to the server, receive payment information corresponding to the modified riding record issued by the server, and then execute the payment operation.
Referring to fig. 4, a flow diagram illustrating steps of another code scanning ride method in accordance with an embodiment of the present invention is shown. The code scanning riding method shown in fig. 4 is executed at the server.
As shown in fig. 4, the code scanning ride method may include the steps of:
And 402, generating a riding record by the server according to the code scanning position and the code scanning time.
The specific process of generating the ride record by the server according to the code scanning position and the code scanning time is basically the same as the process of generating the ride record by the client according to the code scanning position and the code scanning time in the step 202 in the above embodiment, and specific reference may be made to the relevant description in the above embodiment, which is not discussed in detail herein in the embodiment of the present invention.
It should be noted that, after obtaining the actual riding route in the manner of generating the riding record in step 202, the server further analyzes the actual riding route to obtain payment information corresponding to the actual riding route, where the payment information may include a payment amount, and therefore, the riding record generated by the server may include the actual riding route and corresponding payment information.
And 403, the server sends the riding record to the client, so that the client performs payment operation on the riding record.
Referring to fig. 5, a block diagram of a client according to an embodiment of the present invention is shown.
As shown in fig. 5, the client may include the following modules:
the obtaining module 501 is configured to, in a case that the normal riding code is not invoked, display a pre-created abnormal riding code for code scanning, and obtain a code scanning position and a code scanning time during code scanning;
a first generating module 502, configured to generate a riding record according to the code scanning position and the code scanning time;
and the payment module 503 is configured to perform payment operation for the ride record when the network connection is successful.
Optionally, the first generating module 502 includes: the data acquisition unit is used for acquiring candidate riding routes and candidate riding stations contained in the candidate riding routes; the first matching unit is used for matching the candidate bus taking sites to obtain actual bus taking sites according to the code scanning positions; and the second matching unit is used for matching the candidate riding routes according to the code scanning time and the actual riding stations to obtain actual riding routes, and taking the actual riding routes as the riding records.
Optionally, the data acquiring unit includes: the type determining subunit is used for calculating the vehicle running speed based on the code scanning position and the code scanning time and determining the vehicle type corresponding to the vehicle running speed; and the route selection subunit is used for selecting a riding route corresponding to the vehicle type from pre-stored riding routes as the candidate riding route.
Optionally, the code scanning positions comprise an upper vehicle scanning position and a lower vehicle scanning position, and the actual vehicle taking stations comprise actual vehicle taking stations and actual vehicle getting-off stations; the first matching unit includes: the position matching subunit is used for respectively matching the upper vehicle scanning position and the lower vehicle scanning position with the positions of the candidate riding stations; and the station determining subunit is used for taking the candidate riding station successfully matched with the getting-on scanning position as the actual getting-on station and taking the candidate riding station successfully matched with the getting-off scanning position as the actual getting-off station.
Optionally, the code scanning time comprises an entering code scanning time and a leaving code scanning time, and the actual taking station comprises an actual entering station and an actual leaving station; the second matching unit includes: the first calculating subunit is used for calculating a first time interval between the code scanning time for the upper vehicle and the code scanning time for the lower vehicle; a second calculating subunit, configured to calculate, for each candidate riding route including the actual getting-on station and the actual getting-off station, a second time interval from the actual getting-on station to the actual getting-off station in the current candidate riding route, respectively; and the route determining subunit is configured to, when the difference between the first time interval and the second time interval is smaller than a first preset time length, use a route from the actual getting-on station to the actual getting-off station in the current candidate riding routes as the actual riding route.
Optionally, the obtaining module 501 includes: the code scanning device comprises a first acquisition unit, a second acquisition unit and a control unit, wherein the first acquisition unit is used for acquiring a real-time positioning position during code scanning and taking the real-time positioning position as a code scanning position; a second obtaining unit, configured to, when obtaining of the real-time positioning location fails, obtain a last historical positioning location within a second preset duration before the code scanning time, and use the historical positioning location as the code scanning location; a third obtaining unit, configured to, when obtaining of the historical positioning position fails, obtain a station position in a historical riding record, where the riding frequency is the most and exceeds a preset frequency in the code scanning time, and use the station position as the code scanning position; and the fourth acquisition unit is used for acquiring the position input by the user when the station position acquisition fails, and taking the position input by the user as the code scanning position.
Referring to fig. 6, a block diagram of another client according to an embodiment of the present invention is shown.
As shown in fig. 6, the client may include the following modules:
the obtaining module 601 is configured to, in the case that the normal riding code is not invoked, display a pre-created abnormal riding code for code scanning, and obtain a code scanning position and a code scanning time during code scanning;
a sending module 602, configured to send a ride record generation request to a server under a condition that network connection is successful, where the ride record generation request includes the code scanning position and the code scanning time;
the first receiving module 603 is configured to receive a riding record issued by the server and generated according to the code scanning position and the code scanning time, and perform payment operation according to the riding record.
Referring to fig. 7, a block diagram of a server according to an embodiment of the present invention is shown.
As shown in fig. 7, the server may include the following modules:
the second receiving module 701 is configured to receive a riding record generation request sent by a client, where the riding record generation request includes a code scanning position and code scanning time during code scanning; the code scanning position and the code scanning time are acquired by the client when the client displays the pre-established abnormal riding code for code scanning under the condition that the normal riding code is not taken successfully, and are sent under the condition that the network connection is successful;
a second generating module 702, configured to generate a ride record according to the code scanning position and the code scanning time;
the issuing module 703 is configured to issue the riding record to the client, so that the client performs payment operation on the riding record.
In the embodiment of the invention, the abnormal riding code is created in advance and is used as a medium, so that normal riding can be realized even if the calling of the normal riding code fails, and the payment operation is carried out under the condition of successful network connection, thereby realizing the purpose of supplementing tickets after riding first and facilitating riding of users.
For the device embodiment, since it is basically similar to the method embodiment, the description is simple, and for the relevant points, refer to the partial description of the method embodiment.
In an embodiment of the invention, an electronic device is also provided. The electronic device may include one or more processors and one or more machine-readable media having instructions, such as an application program, stored thereon. When executed by the one or more processors, the instructions cause the processors to perform the code scanning ride method executed by the client or the code scanning ride method executed by the server.
In an embodiment of the present invention, there is also provided a non-transitory computer-readable storage medium having a computer program stored thereon, where the computer program is executable by a processor of an electronic device to perform the code scanning ride method performed by a client or the code scanning ride method performed by a server. For example, the non-transitory computer readable storage medium may be a ROM, a Random Access Memory (RAM), a CD-ROM, a magnetic tape, a floppy disk, an optical data storage device, and the like.
The embodiments in the present specification are described in a progressive manner, each embodiment focuses on differences from other embodiments, and the same and similar parts among the embodiments are referred to each other.
As will be appreciated by one skilled in the art, embodiments of the present invention may be provided as a method, apparatus, or computer program product. Accordingly, embodiments of the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, embodiments of the present invention may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
Embodiments of the present invention are described with reference to flowchart illustrations and/or block diagrams of methods, terminal devices (systems), and computer program products according to embodiments of the invention. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing terminal to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing terminal, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing terminal to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing terminal to cause a series of operational steps to be performed on the computer or other programmable terminal to produce a computer implemented process such that the instructions which execute on the computer or other programmable terminal provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
While preferred embodiments of the present invention have been described, additional variations and modifications of these embodiments may occur to those skilled in the art once they learn of the basic inventive concepts. Therefore, it is intended that the appended claims be interpreted as including preferred embodiments and all such alterations and modifications as fall within the scope of the embodiments of the invention.
Finally, it should also be noted that, herein, relational terms such as first and second, and the like may be used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. Also, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or terminal that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or terminal. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other like elements in a process, method, article, or terminal that comprises the element.
The code scanning riding method, the client, the server, the electronic device and the storage medium provided by the invention are introduced in detail, and a specific example is applied in the text to explain the principle and the implementation mode of the invention, and the description of the embodiment is only used for helping to understand the method and the core idea of the invention; meanwhile, for a person skilled in the art, according to the idea of the present invention, there may be variations in the specific embodiments and the application scope, and in summary, the content of the present specification should not be construed as a limitation to the present invention.
Claims (13)
1. A code scanning ride method, implemented at a client, the method comprising:
under the condition that the normal riding code is not taken, displaying a pre-established abnormal riding code for code scanning, and acquiring a code scanning position and code scanning time during code scanning;
generating a riding record according to the code scanning position and the code scanning time;
and under the condition that the network connection is successful, carrying out payment operation aiming at the riding record.
2. The method of claim 1, wherein generating a ride record as a function of the code sweep location and the code sweep time comprises:
obtaining candidate riding routes and candidate riding stations contained in the candidate riding routes;
according to the code scanning position, matching the candidate bus taking stations to obtain an actual bus taking station;
and matching to obtain an actual riding route from the candidate riding routes according to the code scanning time and the actual riding station, and taking the actual riding route as the riding record.
3. The method of claim 2, wherein the obtaining the candidate ride route comprises:
calculating the running speed of the vehicle based on the code scanning position and the code scanning time, and determining the type of the vehicle corresponding to the running speed of the vehicle;
and selecting a riding route corresponding to the vehicle type from pre-stored riding routes as the candidate riding route.
4. The method of claim 2, wherein the scanning locations comprise an entering scanning location and a leaving scanning location, and wherein the actual riding stations comprise an actual entering station and an actual leaving station; according to the code scanning position, obtaining an actual bus station from the candidate bus stations in a matching mode, wherein the actual bus station comprises the following steps:
matching the upper vehicle scanning position and the lower vehicle scanning position with the positions of the candidate riding stations respectively;
and taking the candidate riding station successfully matched with the upper vehicle scanning position as the actual vehicle loading station, and taking the candidate riding station successfully matched with the lower vehicle scanning position as the actual vehicle unloading station.
5. The method of claim 2 or 4, wherein the code scan time comprises a load scan time and a drop scan time, and the actual boarding station comprises an actual boarding station and an actual disembarking station; the step of obtaining the actual bus route from the candidate bus routes in a matching mode according to the code scanning time and the actual bus station comprises the following steps:
calculating a first time interval between the getting-on code scanning time and the getting-off code scanning time;
respectively calculating a second time interval from the actual vehicle-loading station to the actual vehicle-unloading station in the current candidate vehicle-loading route aiming at each candidate vehicle-loading route comprising the actual vehicle-loading station and the actual vehicle-unloading station;
and when the difference value between the first time interval and the second time interval is smaller than a first preset time length, taking a route from the actual getting-on station to the actual getting-off station in the current candidate riding routes as the actual riding route.
6. The method of claim 1, wherein obtaining the code scanning position during code scanning comprises:
acquiring a real-time positioning position during code scanning, and taking the real-time positioning position as a code scanning position;
when the real-time positioning position acquisition fails, acquiring the last historical positioning position within a second preset time before the code scanning time, and taking the historical positioning position as the code scanning position;
when the historical positioning position acquisition fails, acquiring a station position which has the largest riding times and exceeds a preset number in the code scanning time in a historical riding record, and taking the station position as the code scanning position;
and when the site position acquisition fails, acquiring a position input by a user, and taking the position input by the user as the code scanning position.
7. A code scanning ride method, implemented at a client, the method comprising:
under the condition that the normal riding code is not taken, displaying a pre-established abnormal riding code for code scanning, and acquiring a code scanning position and code scanning time during code scanning;
sending a riding record generation request to a server under the condition that network connection is successful, wherein the riding record generation request comprises the code scanning position and the code scanning time;
and receiving a bus taking record issued by the server and generated according to the code scanning position and the code scanning time, and performing payment operation aiming at the bus taking record.
8. A code scanning riding method is executed on a server side, and comprises the following steps:
receiving a riding record generation request sent by a client, wherein the riding record generation request comprises a code scanning position and code scanning time during code scanning; the code scanning position and the code scanning time are acquired by the client when the client displays the pre-established abnormal riding code for code scanning under the condition that the normal riding code is not taken successfully, and are sent under the condition that the network connection is successful;
generating a riding record according to the code scanning position and the code scanning time;
and issuing the riding record to the client so that the client carries out payment operation aiming at the riding record.
9. A client, the client comprising:
the system comprises an acquisition module, a code scanning module and a code scanning module, wherein the acquisition module is used for displaying a pre-established abnormal riding code to scan the code under the condition that the normal riding code is not taken, and acquiring a code scanning position and code scanning time during code scanning;
the first generation module is used for generating a riding record according to the code scanning position and the code scanning time;
and the payment module is used for carrying out payment operation aiming at the riding record under the condition that the network connection is successful.
10. A client, the client comprising:
the system comprises an acquisition module, a code scanning module and a code scanning module, wherein the acquisition module is used for displaying a pre-established abnormal riding code to scan the code under the condition that the normal riding code is not taken, and acquiring a code scanning position and code scanning time during code scanning;
the sending module is used for sending a taking record generating request to a server under the condition that network connection is successful, wherein the taking record generating request comprises the code scanning position and the code scanning time;
and the first receiving module is used for receiving a riding record which is issued by the server and generated according to the code scanning position and the code scanning time, and carrying out payment operation aiming at the riding record.
11. A server, characterized in that the server comprises:
the second receiving module is used for receiving a riding record generation request sent by a client, wherein the riding record generation request comprises a code scanning position and code scanning time during code scanning; the code scanning position and the code scanning time are acquired by the client when the client displays the pre-established abnormal riding code for code scanning under the condition that the normal riding code is not taken successfully, and are sent under the condition that the network connection is successful;
the second generation module is used for generating a riding record according to the code scanning position and the code scanning time;
and the issuing module is used for issuing the riding record to the client so that the client performs payment operation aiming at the riding record.
12. An electronic device, comprising:
one or more processors; and
one or more machine-readable media having instructions stored thereon;
the instructions, when executed by the one or more processors, cause the processors to perform the method of any one of claims 1 to 6, or perform the method of claim 7, or perform the method of claim 8.
13. A computer-readable storage medium, on which a computer program is stored which, when being executed by a processor, carries out the method of any one of claims 1 to 6, or carries out the method of claim 7, or carries out the method of claim 8.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010828195.4A CN112184208A (en) | 2020-08-17 | 2020-08-17 | Code scanning riding method, client, server, electronic equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010828195.4A CN112184208A (en) | 2020-08-17 | 2020-08-17 | Code scanning riding method, client, server, electronic equipment and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN112184208A true CN112184208A (en) | 2021-01-05 |
Family
ID=73919604
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010828195.4A Withdrawn CN112184208A (en) | 2020-08-17 | 2020-08-17 | Code scanning riding method, client, server, electronic equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112184208A (en) |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106779678A (en) * | 2016-11-24 | 2017-05-31 | 深圳市久通物联科技股份有限公司 | A kind of public transport ticket checking method and terminal based on Quick Response Code Yu high in the clouds wallet |
| CN108257226A (en) * | 2018-01-12 | 2018-07-06 | 深圳市海东青软件科技股份有限公司 | Barcode scanning ticket checking method, system, device, computer equipment and storage medium |
| KR20180114302A (en) * | 2017-04-10 | 2018-10-18 | 주식회사 콜버스랩 | Method and system for selecting a stop for traffic demand service |
| CN109299928A (en) * | 2018-08-31 | 2019-02-01 | 阿里巴巴集团控股有限公司 | Charging method and device by bus |
| CN109996188A (en) * | 2019-03-29 | 2019-07-09 | 广东小天才科技有限公司 | A kind of based reminding method, device and the equipment of trip information exception |
| CN111104990A (en) * | 2018-10-25 | 2020-05-05 | 腾讯科技（深圳）有限公司 | Method, device, server and storage medium for determining traffic route |
-
2020
- 2020-08-17 CN CN202010828195.4A patent/CN112184208A/en not_active Withdrawn
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106779678A (en) * | 2016-11-24 | 2017-05-31 | 深圳市久通物联科技股份有限公司 | A kind of public transport ticket checking method and terminal based on Quick Response Code Yu high in the clouds wallet |
| KR20180114302A (en) * | 2017-04-10 | 2018-10-18 | 주식회사 콜버스랩 | Method and system for selecting a stop for traffic demand service |
| CN108257226A (en) * | 2018-01-12 | 2018-07-06 | 深圳市海东青软件科技股份有限公司 | Barcode scanning ticket checking method, system, device, computer equipment and storage medium |
| CN109299928A (en) * | 2018-08-31 | 2019-02-01 | 阿里巴巴集团控股有限公司 | Charging method and device by bus |
| CN111104990A (en) * | 2018-10-25 | 2020-05-05 | 腾讯科技（深圳）有限公司 | Method, device, server and storage medium for determining traffic route |
| CN109996188A (en) * | 2019-03-29 | 2019-07-09 | 广东小天才科技有限公司 | A kind of based reminding method, device and the equipment of trip information exception |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105869424B (en) | A kind of bus scheduling method and apparatus | |
| JP5438111B2 (en) | Method and system for automatically and directly contacting a driver with at least one passenger | |
| CN108027906A (en) | Multiply the system and method for scheduling and route altogether for adjusting | |
| CN107111792B (en) | Method and system for selling and checking tickets in traffic network | |
| EP3172708B1 (en) | Ticketing method and system | |
| CN111104990B (en) | Method, device, server and storage medium for determining traffic route | |
| RU2718974C2 (en) | Passive payments system and method based on location determination | |
| CN111080048A (en) | Order dispatching method and device for reserving order of taxi taking, electronic equipment and storage medium | |
| CN110118567B (en) | Travel mode recommendation method and device | |
| JP6675860B2 (en) | Data processing method and data processing system | |
| JP7245441B2 (en) | Management system, management method and management program | |
| JP2009199290A (en) | Ride confirmation apparatus and fare calculation system | |
| CN112084824B (en) | Passenger reminding method and device, electronic equipment and storage medium | |
| JP2009244960A (en) | Parking lot management apparatus, parking lot information providing system | |
| CN108230720A (en) | Parking management method and device | |
| JPWO2019235253A1 (en) | Information processing equipment, information processing methods, and programs | |
| US20190360824A1 (en) | Information processing apparatus, information processing method, and information processing system | |
| CN111858806A (en) | Passenger travel track detection method, device, equipment and storage medium | |
| CN111311950A (en) | Intelligent dispatching method and system for bus in peak period | |
| CN112184208A (en) | Code scanning riding method, client, server, electronic equipment and storage medium | |
| CN105608921B (en) | The method and apparatus for prompting public transport line in an electronic | |
| CN108205888B (en) | Method and device for judging passenger entering and exiting station | |
| US20140180775A1 (en) | Method and device for determining usage of a transportation facility by a user | |
| JP2011081608A (en) | Device and method for estimating dangerous place | |
| JP7425680B2 (en) | Navigation device and navigation method |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| WW01 | Invention patent application withdrawn after publication | ||
| WW01 | Invention patent application withdrawn after publication |
Application publication date: 20210105 |