System for providing big data-based artificial intelligence automatic allocation matching service using taxi demand prediction
Uloženo v:
| Název: | System for providing big data-based artificial intelligence automatic allocation matching service using taxi demand prediction |
|---|---|
| Patent Number: | 12094,344 |
| Datum vydání: | September 17, 2024 |
| Appl. No: | 17/036466 |
| Application Filed: | September 29, 2020 |
| Abstrakt: | Disclosed is a system for providing a big data-based AI automatic allocation matching service using taxi demand prediction. The system comprises a user terminal, a taxi terminal and a matching service providing server including a big datafication unit, a prediction unit, a transmission unit, a matching unit, and an alarm unit. |
| Inventors: | Nature Mobility Co., Ltd. (Jeju-si, KR) |
| Assignees: | Nature Mobility Co., Ltd. (Jeju-si, KR) |
| Claim: | 1. A system for providing a big data-based AI automatic allocation matching service using a taxi demand prediction, the system comprising: a user terminal comprising a hardware processor configured to: input a current location and a destination; transmit a taxi call, to a matching service providing server connected with the user terminal via a network; and receive a vehicle number and an expected arrival time of a called taxi, from the matching service providing server; and output the received vehicle number and expected arrival time; a taxi terminal comprising a hardware processor configured to: receive a taxi call signal, which is matched with automatic allocation in response to the taxi call transmitted from the user terminal; start, when an approval event in response to the received taxi call signal is output, a destination guidance to the current location of the user terminal; transmit an exclusion request signal, which is a GPS signal for requesting exclusion of a corresponding taxi from an empty car list, to the matching service providing server connected with the taxi terminal via the network; and the matching service providing server comprising a hardware processor configured to: map at least one taxi call signal on a location, time, and day of week; store the mapped at least one taxi call signal as an accumulated history log, and build big data; perform a verification process of the big data with machine learning or deep learning of an artificial neural network having a Convolutional neural network (CNN) structure; perform data mining on the big data to execute the taxi demand prediction based on the taxi call signal corresponding to the location, time, and day of week; estimate a kernel density of taxi rides through a taxi call signal and taxi ride data, compare and analyze the kernel density with location data of taxi ranks, to find out whether there is a dense area of taxi rides by using Moran's I analysis, and to find out areas where taxi rides are densely concentrated by using Inverse Distance Weighting and Spatial Weighted Matrix; execute the taxi demand prediction on the location, time and day of week, based on the estimated kernel density, transmit a taxi demand amount that is predicted on the location, time and day of week where the taxi demand prediction is executed, to the taxi terminal; match a single taxi terminal located at a shortest distance from a current location of the user terminal, when the taxi call is received from the user terminal; and transmit, via the network, the taxi call signal to the matched single taxi terminal, and transmit, via the network, the vehicle number and the expected arrival time to the user terminal when an approval event is received from the taxi terminal, wherein the processor of the matching service providing server is further configured to: call the taxi terminal located at the shortest distance from the current location of the user terminal, by using at least one taxi call list and the empty car list as input values to an optimal algorithm for an assignment problem through which an optimal solution for the assignment problem is obtained, wherein, to increase a speed of obtaining the optimal solution for the assignment problem, calculation of an optimized approximate solution is performed using a simulated annealing, and wherein the processor of the matching service providing server is further configured to: perform the taxi demand prediction by: establishing a prediction model with past taxi getting-on and-off data using time series prediction, by using a computer-based algorithm; predicting an expected number of passengers by place, time, and day of the week; visually displaying a predicted result on a map; and figuring out whether weather or events affect the number of passengers, using changes due to the weather or changes due to the events; perform a pattern analysis by: converting an administrative area to which an actual road name of (X,Y) coordinates belongs into a text value or a numeric code; filtering data that satisfies a specific condition; and calculating a sum of a number of rides of filtered data; and transmit results of the taxi demand prediction and the pattern analysis to the taxi terminal. |
| Claim: | 2. The system of claim 1 , wherein the processor of the matching service providing server is further configured to select and match one taxi terminal in response to one taxi call from the user terminal. |
| Claim: | 3. The system of claim 1 , further comprising a plurality of taxi terminals held by a plurality of taxi drivers, wherein the processor of the matching service providing server is further configured to: update the empty car list in real time so that the empty car list moves to a drive list, when the plurality of taxi terminals accept the call signal of the user terminal or when a meter mounted in the taxi starts counting. |
| Claim: | 4. The system of claim 1 , further comprising a plurality of taxi terminals held by a plurality of taxi drivers, wherein the processor of the matching service providing server is further configured to: figure out real-time locations of the plurality of taxi terminals, and when a difference between the taxi demand amount and a taxi supply amount, which is figured out in real time on the corresponding location, time and day of week exceeds a preset error range, and transmit an alarm to the plurality of taxi terminals so as to block an entry to the location where the taxi demand prediction is executed. |
| Claim: | 5. The system of claim 1 , wherein the processor of the matching service providing server is further configured to perform pre-processing including mapping at least one taxi call signal on a location, time, and day of week and storing of raw data corresponding to an accumulated history log in a distributed and parallel manner, cleaning of unstructured data, structured data, and semi-structured data included in the stored raw data, and classifying as meta data, and perform analysis including the data mining on the pre-processed data. |
| Patent References Cited: | 20180341276 November 2018 Kislovskiy 20180341895 November 2018 Kislovskiy 20190146508 May 2019 Dean 20220351135 November 2022 Boye H09-34863 February 1997 10-2003-0054434 July 2003 10-1655873 September 2016 10-1812775 January 2018 10-2018-0051452 May 2018 10-2018-0138194 December 2018 10-2020-0011109 February 2020 |
| Other References: | Yonggian Yang, Multiagent Reinforcement learning based taxi predispatching model to balance taxi supply and demand, Feb. 19, 2020 , https://doi.org/10.1155/2020/8674512 (Year: 2020). cited by examiner An Office Action mailed by the Korean Intellectual Property Office on Aug. 6, 2020, which corresponds to Korean Patent Application No. 10-2020-0060543 and is related to U.S. Appl. No. 17/036,466; with English language translation. cited by applicant Youbin Yoon et al., “Taxi passenger demand prediction and movement pattern analysis information provision system using big data”, Korean Institute of Industrial Engineers, pp. 2822-2836, Nov. 2018, South Korea; with English language Abstract. cited by applicant |
| Assistant Examiner: | Obioha, Mikko Okechukwu |
| Primary Examiner: | Nolan, Peter D |
| Attorney, Agent or Firm: | Studebaker & Brackett PC |
| Přístupové číslo: | edspgr.12094344 |
| Databáze: | USPTO Patent Grants |
Buďte první, kdo okomentuje tento záznam!