KR102474990B1 - Method, device, and program for matching pat-taxi at desired time of user using ai and big data - Google Patents

Abstract

Provided are a method, apparatus, and program for matching a pet taxi at a desired time of a user by using artificial intelligence and big data. The method, performed by the apparatus providing a pet taxi reservation service at a reservation-available time matched with a desired time of a user, comprises the following steps of: receiving pet taxi service use request information including a desired departure time of a preset time unit, a departure point, and a destination from a user terminal; predicting future driving information including a future travel distance and a future travel time from the pet taxi service use request information by using artificial intelligence; based on a new minimum reservation driving time acquired by adding up a regular allocation interval time to each of the times before and after the future travel time, performing a primary matching algorithm for filtering an allocable time slot list from the desired departure time; based on the time slot list reserved for pet taxis, the future travel time, the departure point and the destination point, performing a secondary matching algorithm for filtering a reservation-available time slot list from the allocable time slot list; and providing the reservation-available time slot list to the user terminal. Therefore, the present invention is capable of providing convenience to a pet owner (user) by helping the pet owner to quickly and conveniently get on a pet taxi with the pet at a desired time.

Description

Method, device, and program for matching pet taxi at user's desired time using artificial intelligence and big data

The present disclosure relates to electronic devices and methods thereof. More specifically, the present disclosure relates to a method, apparatus, and program for matching a pet taxi at a user's desired time using artificial intelligence and big data.

A companion animal is an animal that lives with humans. Companion animals are living beings, not toys for people. In recent years, the population raising companion animals is also rapidly increasing in line with the trend of deepening nuclear families due to low birth rates, aging, single-person households, and an increase in non-marriage. Furthermore, these social changes have developed into a companion animal culture that lives in harmony with humans, such as 'Petmillie' and 'Petfam', as another family member or life partner, moving away from pet dogs that humans have simply bred for enjoyment. It became.

Recently, the size of households has been reduced due to nuclear families, low birth rates, and aging, while the population raising companion animals is increasing. In addition, the population raising a companion animal as a member of another family is also increasing. In the case of taxis, customers are decreasing and sales are decreasing.

As a companion animal guardian, it is difficult to ride public transportation with your pet, so you must use transportation such as a taxi. When a companion animal guardian wants to board a taxi with a pet, the taxi driver sometimes refuses to board. If you want to board a pet-only taxi (ie, pet taxi), the usage fee is expensive and you must make a reservation, which is inconvenient.

Therefore, research is needed to provide a pet taxi reservation service so that the user can conveniently use the pet taxi at a time that matches the desired time.

Republic of Korea Patent Registration No. 10-2296356 (2021.08.26)

Embodiments disclosed in the present disclosure are aimed at allowing a guardian to quickly and conveniently board a pet taxi and move to a destination with a companion animal at a desired time.

The problems to be solved by the present disclosure are not limited to the problems mentioned above, and other problems not mentioned will be clearly understood by those skilled in the art from the description below.

According to an aspect of the present disclosure for achieving the above object, a method performed by an apparatus for providing a pet taxi reservation service at a reservationable time matching a user's desired time includes a desired departure time from a user terminal, a departure point, and Receiving pet taxi service use request information including a destination, predicting future operation information including future travel distance and future travel time from the pet taxi service use request information using artificial intelligence, the future Based on the minimum time for new reserved operation, which is the sum of the times before and after the required operation time, and between certain dispatches, respectively, performing a primary matching algorithm filtering a list of available time slots from the desired departure time, for pet taxis Performing a secondary matching algorithm for filtering a list of time slots available for reservation from the list of time slots available for dispatch based on a list of previously reserved time slots, the required future travel time, the departure point, and the destination; It may include providing a list to the user terminal.

According to another aspect of the present disclosure, an apparatus for providing a pet taxi reservation service at a reservable time matching a user's desired time includes a communication module configured to communicate with a user terminal, and a control configured to control the operation of the communication module module, wherein the control module receives pet taxi service use request information including a desired departure time, departure point, and destination from the user terminal through the communication module, and uses artificial intelligence to control the pet taxi service Predicting future driving information, including future driving distance and future driving time, from the usage request information, and based on the new reserved driving minimum time, which is the sum of the time between each dispatch before and after the future driving time, based on the desired driving time. Performs a primary matching algorithm that filters the list of time slots available for dispatch from the departure time, and based on the new reservation minimum operation time calculated from the new reservation minimum time and based on the list of time slots previously reserved for pet taxis , It is possible to perform a secondary matching algorithm for filtering a list of time slots available for reservation in the list of time slots available for dispatch, and provide the list of time slots available for reservation to the user terminal.

In addition to this, a computer program stored in a computer readable recording medium for execution to implement the present disclosure may be further provided.

In addition to this, a computer readable recording medium recording a computer program for executing a method for implementing the present disclosure may be further provided.

According to the above-mentioned problem solving means of the present disclosure, there is an effect of providing convenience to the guardian (user) by enabling the guardian to quickly and conveniently board the pet taxi at a desired time together with the companion animal and move to the destination.

The effects of the present disclosure are not limited to the effects mentioned above, and other effects not mentioned will be clearly understood by those skilled in the art from the description below.

1 is a diagram schematically illustrating a system for providing a pet taxi reservation service at a reservable time matching a user's desired time according to an embodiment of the present disclosure.
2 is a block diagram illustrating an apparatus for providing a pet taxi reservation service according to an embodiment of the present disclosure.
3 is a flowchart illustrating a method of providing a pet taxi reservation service according to an embodiment of the present disclosure.
4 is a diagram for explaining a method of providing a pet taxi reservation service according to another embodiment of the present disclosure.
5 is a diagram for explaining a method of performing a primary matching algorithm according to an embodiment of the present disclosure.
6 is a diagram for explaining a method of performing a secondary matching algorithm according to an embodiment of the present disclosure.
7 is a diagram for explaining in detail a method of performing a primary matching algorithm and a secondary matching algorithm according to embodiments of the present disclosure.
8 is a diagram for explaining a correction coefficient according to an embodiment of the present disclosure.
9 is a diagram for explaining a pet taxi dispatching order according to an embodiment of the present disclosure.

Like reference numbers designate like elements throughout this disclosure. The present disclosure does not describe all elements of the embodiments, and general content or overlapping content between the embodiments in the technical field to which the present disclosure belongs is omitted. The term 'unit, module, member, or block' used in the specification may be implemented as software or hardware, and according to embodiments, a plurality of 'units, modules, members, or blocks' may be implemented as one component, It is also possible that one 'part, module, member, block' includes a plurality of components.

Throughout the specification, when a part is said to be "connected" to another part, this includes not only the case of being directly connected but also the case of being indirectly connected, and indirect connection includes being connected through a wireless communication network. do.

In addition, when a certain component is said to "include", this means that it may further include other components without excluding other components unless otherwise stated.

Throughout the specification, when a member is said to be located “on” another member, this includes not only a case where a member is in contact with another member, but also a case where another member exists between the two members.

Terms such as first and second are used to distinguish one component from another, and the components are not limited by the aforementioned terms.

Expressions in the singular number include plural expressions unless the context clearly dictates otherwise.

In each step, the identification code is used for convenience of description, and the identification code does not explain the order of each step, and each step may be performed in a different order from the specified order unless a specific order is clearly described in context. have.

Hereinafter, the working principle and embodiments of the present disclosure will be described with reference to the accompanying drawings.

In this specification, the 'apparatus for providing a pet taxi reservation service at a reservable time matching a user's desired time according to the present disclosure' includes all various devices that can perform calculation processing and provide results to the user. For example, an apparatus for providing a pet taxi reservation service at a reservable time matching a user's desired time according to the present disclosure may include a computer, a server device, and a portable terminal, or may take any one form. have.

Here, the computer may include, for example, a laptop, a desktop, a laptop, a tablet PC, a slate PC, and the like equipped with a web browser.

A server device is a server that processes information by communicating with an external device, and may include an application server, a computing server, a database server, a file server, a game server, a mail server, a proxy server, and a web server.

A portable terminal is, for example, a wireless communication device that ensures portability and mobility, and includes a Personal Communication System (PCS), Global System for Mobile communications (GSM), Personal Digital Cellular (PDC), Personal Handyphone System (PHS), and PDA (Personal Handyphone System). Personal Digital Assistant), IMT (International Mobile Telecommunication)-2000, CDMA (Code Division Multiple Access)-2000, W-CDMA (W-Code Division Multiple Access), WiBro (Wireless Broadband Internet) terminal, smart phone All kinds of handheld-based wireless communication devices such as watches, rings, bracelets, anklets, necklaces, glasses, contact lenses, or wearable devices such as head-mounted-devices (HMDs) can include

Hereinafter, embodiments of the present disclosure will be described in detail with reference to the accompanying drawings.

1 is a diagram schematically illustrating a system for providing a pet taxi reservation service at a reservable time matching a user's desired time according to an embodiment of the present disclosure.

Referring to FIG. 1 , the system may include an apparatus 100 providing a pet taxi reservation service, a first user terminal 101 , a second user terminal 102 , and a network 103 .

The apparatus 100 for providing a pet taxi reservation service may provide, to a user who wants to use the pet taxi reservation service, a time available for reservation that matches a time desired by the user. In addition, the apparatus 100 for providing a pet taxi reservation service may provide a service for calling an available pet taxi to a user using the pet taxi reservation service. The device 100 providing the pet taxi reservation service may communicate with the first user terminal 101 and/or the second user terminal 102 through the network 103 . In one embodiment, the device 100 providing a pet taxi reservation service may correspond to a server that receives a request from a client and processes information. The pet taxi reservation service provided by the device 100 for providing the pet taxi reservation service may be implemented through a plurality of running application programs (or applications).

Each of the first user terminal 101 and the second user terminal 102 may include at least one of a computer, a server, a mobile terminal, a smart phone, and the like. For example, each of the first user terminal 101 and the second user terminal 102 may be in the form of a computer. More specifically, the computer may include all of various devices capable of providing results to users by performing calculation processing. For example, a computer includes not only a desktop PC and a notebook (Note Book) but also a smart phone, a tablet PC, a cellular phone, a PCS phone (Personal Communication Service phone), synchronous/asynchronous A mobile terminal of IMT-2000 (International Mobile Telecommunication-2000), a Palm Personal Computer (Palm PC), and a Personal Digital Assistant (PDA) may also be applicable. In addition, when a Head Mounted Display (HMD) device includes a computing function, the HMD device may become a computer. Also, a computer can be a client device.

The first user terminal 101 and the second user terminal 102 may be electronic devices that perform voice or data communication via the network 103 according to a user's key manipulation. The first user terminal 101 and the second user terminal 102 may be terminals of users of an application providing a pet taxi reservation service. The first user terminal 101 and the second user terminal 102, via the network 103, a memory for storing a program or protocol for communication with the device 100 providing the pet taxi reservation service, corresponding A microprocessor or the like for calculating and controlling by executing a program may be provided. Here, users may include a person scheduled to board (or a passenger) who wants to reserve a pet taxi, a driver who operates the pet taxi, and the like. In an embodiment, the first user terminal 101 may be a terminal of a prospective boarding person who wishes to reserve a pet taxi, and the second user terminal 102 may be a terminal of a driver who operates the pet taxi. However, it is not limited thereto. In FIG. 1 , each of the first user terminal 101 and the second user terminal 102 is illustrated as one, but is not limited thereto and may be two or more.

Hereinafter, embodiments of the present disclosure will be described on the assumption that the first user terminal 101 is a terminal of a prospective boarding person and the second user terminal 102 is a terminal of a driver.

The first user terminal 101 may load a passenger application. The first user terminal 101 may access the device 100 providing the pet taxi reservation service by using the passenger application. The first user terminal 101 may transmit a passenger call signal including departure point, destination, and pet information to the device 100 that provides the pet taxi reservation service by using the passenger application. After arriving at the destination, the first user terminal 101 may transmit driver evaluation information to the pet taxi reservation service 100 using the passenger application.

The second user terminal 102 may load the driver application. The second user terminal 102 may access the device 100 providing a pet taxi reservation service by using a driver application. The second user terminal 102 may receive vehicle dispatch information and the like from the device 100 that provides a pet taxi reservation service using a driver application.

The passenger application and the driver application may be included in a number of applications for providing a pet taxi reservation service. The application may be implemented with a mobile application platform (eg FireBase). A mobile application platform (eg, FireBase) may provide all of the back-end server infrastructure such as storage, database, and hosting functions. The mobile application platform provides storage and database (real-time DB), and automatic capacity expansion is possible, and the DB has a NoSQL structure in the form of Key-value (Keyword - document structure). The application can manage services using the console supported by the mobile application platform. Data stored in the DB can be displayed on the manager screen.

The network 103 may use various types of communication networks, for example, WLAN (Wireless LAN), Wi-Fi (Wi-Fi), Wibro (Wibro), Wimax (Wimax), HSDPA (High Speed Downlink Packet Access), etc. A wired communication method such as a wireless communication method or Ethernet, xDSL (ADSL, VDSL), HFC (Hybrid Fiber Coax), FTTC (Fiber to The Curb), FTTH (Fiber To The Home) may be used. The network 103 is not limited to the presented communication method, and may include all types of communication methods that are widely known or will be developed in the future, in addition to the above-described communication method.

2 is a block diagram illustrating an apparatus for providing a pet taxi reservation service according to an embodiment of the present disclosure.

Referring to FIG. 2 , an apparatus 100 providing a pet taxi reservation service may include a communication module 110, a storage module 130, and a control module 150.

The communication module 110 may perform communication with at least one user terminal. In one embodiment, the communication module 110 may perform wired/wireless communication with the first user terminal 101 and/or the second user terminal 102 . The communication module 110 may include a transmitter and a receiver.

Wireless Internet technologies include, for example, WLAN (Wireless LAN), Wi-Fi (Wireless-Fidelity), Wi-Fi (Wireless Fidelity) Direct, DLNA (Digital Living Network Alliance), WiBro (Wireless Broadband), WiMAX (World Interoperability for Microwave Access), HSDPA (High Speed Downlink Packet Access), HSUPA (High Speed Uplink Packet Access), LTE (Long Term Evolution), LTE-A (Long Term Evolution-Advanced), etc., diagnostic device 100 transmits and receives data according to at least one wireless Internet technology within a range including Internet technologies not listed above.

As for short range communication, Bluetooth™, RFID (Radio Frequency Identification), Infrared Data Association (IrDA), UWB (Ultra Wideband), ZigBee, NFC (Near Field Communication), Wi -Local communication may be supported using at least one of wireless-fidelity (Fi), Wi-Fi Direct, and wireless universal serial bus (USB) technologies. These wireless area networks may support wireless communication between the diagnosis device 100 and the photographing device 200 and between the diagnosis device 100 and the user terminal 300 . At this time, the local area wireless communication network may be a local area wireless personal area network (Wireless Personal Area Networks).

The storage module 130 may store data supporting various functions of the device 100 providing a pet taxi reservation service. The storage module 130 includes a plurality of applications (application programs or applications) running in the device 100 providing the pet taxi reservation service, and data for the operation of the device 100 providing the pet taxi reservation service. , commands can be stored. The storage module 130 may be implemented as a memory.

The control module 150 may be referred to as a processor. The control module 150 may process or control various functions performed by the device 100 providing the pet taxi reservation service. The control module 150 may control the operation of the communication module 110 and/or the operation of the storage module 130 .

The control module 150 may control at least some of the components discussed in conjunction with FIG. 2 in order to drive an application program stored in the memory 132 . Furthermore, the control module 150 may combine and operate at least two or more of the components included in the device 100 for providing the pet taxi reservation service to run the application program.

In addition to operations related to applications, the control module 150 may control overall operations of the device 100 that normally provides a pet taxi reservation service. The control module 150 may provide or process appropriate information or functions to the user by processing signals, data, information, etc. input or output through the components described above or by driving an application program stored in the storage module 130. have.

The control module 150 receives pet taxi service request information including the desired departure time, departure point, and destination from the user terminal (eg, the first user terminal 101) through the communication module 110. can

The control module 150 may predict future driving information including future driving distance and future driving time from pet taxi service use request information using artificial intelligence.

The control module 150 may perform a primary matching algorithm for filtering a list of time zones available for dispatch from the desired departure time based on the minimum time for new reserved trips, which is the sum of the time between dispatches before and after the required future trip time. have.

The control module 150 filters the list of time slots available for dispatch from the list of time slots available for dispatch based on the minimum calculation time for the newly reserved operation calculated from the minimum time for the newly reserved operation and based on the list of previously reserved time slots for pet taxis It is possible to perform a secondary matching algorithm that

The control module 150 may provide a list of time slots available for reservation to the user terminal.

As described above, there is an effect of providing convenience to the user so that the user can quickly and conveniently board the pet taxi at a desired time together with the companion animal and move to the destination.

3 is a flowchart illustrating a method of providing a pet taxi reservation service according to an embodiment of the present disclosure.

Referring to FIG. 3 , the method shown in FIG. 3 may be performed by the device 100 for providing a pet taxi reservation service at a reservable time that matches a user's desired time.

A step of receiving pet taxi service use request information is performed (S100). Specifically, for example, the apparatus 100 for providing a pet taxi reservation service includes a desired departure time of a preset time unit from a user terminal (eg, the first user terminal 101), a departure point, and a destination. Pet taxi service use request information may be received.

Next, a step of predicting future driving information is performed (S110). Specifically, for example, the device 100 providing a pet taxi reservation service may predict future driving information including future driving distance and future driving time from pet taxi service use request information using artificial intelligence. The artificial intelligence may be, for example, artificial intelligence learning models such as an artificial neural network (ANN), a deep neural network (DNN), a convolution neural network (CNN), and a recurrent neural network (RNN), but is not limited thereto.

Then, a step of performing a primary matching algorithm is performed (S120). Specifically, for example, the device 100 for providing a pet taxi reservation service is based on the minimum new reserved operation time by adding the time between predetermined dispatches before and after the required future operation time, the time zone available for dispatch from the desired departure time You can perform a first-order matching algorithm filtering the list. At this time, the primary matching algorithm is an algorithm that preliminarily or primarily filters the reservationable time zone by calculating the time between dispatch before the future demand time and the time between dispatch after the future demand time, respectively, for accurate calculation. can be

Then, a step of performing a secondary matching algorithm is performed (S130). Specifically, for example, the apparatus 100 for providing a pet taxi reservation service includes a list of pre-reserved time zones for pet taxis, a time required for future operation, a departure point, and a destination, based on a list of time slots available for dispatch. A second-order matching algorithm can be performed to filter the list of time zones. The secondary matching algorithm may be an algorithm that accurately filters reservation-available time zones by collectively adding predefined interval times before and after future demand times for fast operation.

Then, a step of providing a list of time zones available for reservation to the user terminal is performed (S140). Specifically, for example, the apparatus 100 providing a pet taxi reservation service may transmit a list of time slots available for reservation to the first user terminal 101 through the network 103 .

As described above, there is an effect of providing convenience to the user so that the user can quickly and conveniently board the pet taxi at a desired time together with the companion animal and move to the destination.

In addition, according to the foregoing, by using the primary matching algorithm and the secondary matching algorithm, the list of time zones available for reservation is quickly and accurately matched to the user's desired boarding time, thereby improving user convenience and reliability of the device.

4 is a diagram for explaining a method of providing a pet taxi reservation service according to another embodiment of the present disclosure.

Referring to FIG. 4 , it is assumed that a first user terminal 101 is a terminal of a prospective boarding person and a second user terminal 102 is a terminal of a driver.

The first user terminal 101 executes the pettash reservation service through the application (S200).

A person scheduled to board can select (or input) a starting point and a destination through the application. At this time, the first user terminal 101 provides information on the departure location and destination location to the device 100 providing the pet taxi reservation service (S210).

A person scheduled to board can select (or input) a desired date and desired departure time through the application. , The first user terminal 101 provides the information on the desired date of reservation and the desired departure time to the device 100 providing the pet taxi reservation service (S220). The reservation desired date based on the reservation desired date information may include year/month/day, such as August 31, 2022, for example. In one embodiment, the desired departure time according to the desired departure time information may include a desired departure time in preset time units. "Time" may be clock information defined as an hour of a preset time unit, such as "11 o'clock" or "12 o'clock". In this case, the preset time unit may be 1 hour unit. Alternatively, in this specification, "time" may be clock information defined by hours and minutes, such as "11:30 or 11:30" or "11:50 or 11:50".

Departure information, destination information, desired reservation date information, and desired departure time information may be included in pet taxi service use request information.

The device 100 providing a pet taxi reservation service predicts future driving information through artificial intelligence (S300).

The device 100 providing the pet taxi reservation service performs a first matching algorithm (S310), and after the first matching algorithm is performed, the device 100 providing the pet taxi reservation service performs the second matching algorithm Do (S320).

The device 100 providing the pet taxi reservation service provides a list of available reservation slots filtered through a second matching algorithm (S330).

The person scheduled to board the plane selects a specific time from the list of time slots available for reservation. At this time, the first user terminal 101 provides the selected reservation time information to the pet taxi reservation service providing device 100, and the pet taxi reservation service providing device 100 selects the first number from the list of time slots available for reservation. Reservation time information indicating the reservation time selected by the user terminal 101 is received (S230). Reservation time information may be information about a time selected by a person scheduled to board.

The device 100 providing a pet taxi reservation service transmits distance information representing the distance between the departure and arrival locations at the selected reservation time and expected fare information representing the expected fare for the distance to the first user terminal 101 ( S340).

The prospective boarding person fills out the request and information about the companion animal. At this time, the first user terminal 101 provides the requested information and companion animal information to the device 100 providing the pet taxi reservation service, and the device 100 providing the pet taxi reservation service provides the requested information and companion animal information. Animal information is received (S240). Request item information may be information indicating a request item from the first user terminal 101 . Companion animal information may be information about a companion animal of a prospective boarding person (or user).

The apparatus 100 providing a pet taxi reservation service transmits request information and companion animal information to a user terminal of at least one pet taxi that can be reserved among pet taxis (S350). A user terminal of at least one pet taxi that can be reserved among pet taxis may be, for example, the second user terminal 102 .

In one embodiment, the device 100 for providing a pet taxi reservation service includes expected fare information, companion animal information, passenger information indicating a passenger, time information including a departure date and departure time corresponding to the reservation time, and a departure point. Transmitting departure information and destination information indicating a destination to at least one of a user terminal (eg, the first user terminal 101) and a user terminal of at least one pet taxi (eg, the second user terminal 102) A step may be further included in the method shown in FIG. 4 . According to this step, the expected price information, companion animal information, passenger information, time information, departure point information, and destination information are checked in each user terminal.

The device 100 providing the pet taxi reservation service transmits payment information and event information to the first user terminal 101 (S360). Payment information may include, for example, card registration request information for requesting card registration for payment. Event information may include coupon information and point information.

The first user terminal 101 transmits a call request signal requesting to call a reservable pet taxi to the device 100 providing the pet taxi reservation service, and the device 100 providing the pet taxi reservation service 1 Receives a call request signal from the user terminal 101 (S250).

The apparatus 100 providing the pet taxi reservation service transmits a call signal to a user terminal (eg, the second user terminal 102) of at least one pet taxi capable of reserving a call signal in response to the call request signal (S370) .

The pet taxi user terminal responding to the call according to the call signal transmits the call response signal to the device 100 providing the pet taxi reservation service, and the device 100 providing the pet taxi reservation service makes the call according to the call signal A call response signal is received from the user terminal of the pet taxi in response (S380). Here, the user terminal of the pet taxi that responds to the call may be, for example, the second user terminal 102 .

The apparatus 100 providing the pet taxi reservation service transmits pet taxi information about the pet taxi that has responded to the call to the first user terminal 101 (S390). In this specification, "transmission" may mean the same as "provision".

5 is a diagram for explaining a method of performing a primary matching algorithm according to an embodiment of the present disclosure.

Referring to FIG. 5, it is assumed that the date and time requested by the customer who wants to use the pet taxi is 11:00 on August 31, 2022, the customer's desired departure point is Samseong Station, and the customer's desired destination is Sadang Station. is assumed to be

The hour unit of the desired departure time may be 11:00. Meanwhile, the minute of the departure time may be determined by dividing the hour unit of the departure time by the minute unit. For example, as shown in FIG. 5, by dividing one hour into 10 minute units, “10 (hour)”, “11 (hour)”, “12 (hour)”, and “1 (hour)” "0-10 (min)", "10-20 (min)", "20-30 (min)", "30-40 (min)", "40-50 (min)", "50 Minute units of ~60 (minutes)" may occur.

The future travel time from Samseong Station to Sadang Station can be predicted. In addition, the time between regular dispatches preset by the primary matching algorithm may be 20 minutes. The minimum time for new reserved operation may be calculated by the sum of the time between dispatches prior to the required future operation time, the required future operation time, and the time between dispatches after the required future operation time.

In the new reservation minimum time from Samseong Station to Sadang Station, the hour and minute of the block corresponding to Samseong Station are the departure time, and the hour and minute of the block corresponding to Sadang Station are the arrival time. can be Referring to the newly reserved operation minimum time enlarged in FIG. 5 , since the block corresponding to Samseong Station is located in the block corresponding to “20 to 30 (minutes)”, the departure time may be 11:20. Similarly, since the block corresponding to Sadang Station is located in the block corresponding to "50 to 60 (minutes)", the arrival time may be 11:50.

The new reserved operation minimum time is repeatedly delayed from the desired departure time (e.g., 11:00) by a preset constant minute unit and a preset number of repetitions, so that a plurality of time ranges each including the new reserved operation minimum time ( 210) can be created. The preset constant minute unit and the preset repetition number may be, for example, 10 minute unit and 6 times. Specifically, for example, when the block corresponding to Samseong Station is located in the block corresponding to "11 (hour)" and "0 to 10 (minute)", it is delayed by 10 minutes, so that a total of 6 new reserved operations A plurality of time ranges 210 consisting of minimum times may be created. In this case, the first range R1 among the plurality of time ranges 210 may correspond to the earliest time, and the second range R2 among the plurality of time ranges 210 may correspond to the latest time. have. The list of available time slots 200 may include time slots from the first range R1 to the second range R2.

6 is a diagram for explaining a method of performing a secondary matching algorithm according to an embodiment of the present disclosure. 6 is a diagram showing a list of pre-reserved time slots for pet taxis.

Referring to FIGS. 5 and 6 , it is assumed that car numbers corresponding to each of the pet taxis are “8001”, “8002”, “8003”, “8004”, “8005”, and “8006”. Time slots pre-reserved in each of the pet taxis The pre-reserved time slots may include departure and destination locations, departure times and arrival times (or expected arrival times). "D12, D22, D32, D42, D52, D62, D41, D51, D61" indicates the starting point, and "A12, A21, A22, A32, A42, A52, A62" indicates the destination.

It is shown in FIG. 6 . For example, in the case of a pet taxi having a vehicle number of “8001”, there may be a dispatching time zone that departs from the departure point D12 at 12:30 and arrives at the destination point A12 at 13:00. Similarly, in the case of pet taxis having vehicle numbers of “8002” to “8006”, respectively, there may be a pre-reserved dispatching time slot as shown in FIG. 6 . However, it is not limited thereto.

A new new reserved travel minimum time 300 from Samseong Station to Sadang Station can be calculated by the secondary matching algorithm. The new minimum reserved travel time 300 may correspond to the sum of the future travel time from Samseong Station to Sadang Station and the time between new dispatches extended before and after the future travel time.

In the case of the new reserved operation minimum time shown in FIG. 5, the time between dispatches fixed at a constant value may be included, but in the case of the new new reserved operation minimum time 300 shown in FIG. 6, the operation time, environment, etc. times between optimal dispatches may be included.

As described above with reference to FIG. 5 , the list of available time slots filtered through the primary matching algorithm may be time slots corresponding to the first range R1 to the second range R2. At this time, if the list of pre-reserved allocation time slots overlaps with the new newly reserved minimum operation time 300, it may be determined that the pet taxi cannot be dispatched at that time.

If the list of pre-booked dispatch time zones and the newly newly reserved minimum operating time 300 in the list of available time slots 200 do not overlap, the corresponding pet taxi may be determined to be available for dispatch at that time. In accordance with this, an example of a list of time zones available for reservation can be expressed as shown in [Table 1] below.

11:00 11:10 11:20 11:30 11:40 11:50 8001 possible possible possible possible possible possible 8002 possible possible possible possible possible possible 8003 impossible possible possible possible possible possible 8004 impossible impossible possible possible possible possible 8005 impossible impossible impossible possible possible possible 8006 impossible impossible impossible impossible impossible impossible

7 is a diagram for explaining in detail how to perform a primary matching algorithm and a secondary matching algorithm according to embodiments of the present disclosure. Referring to FIG. 7, “input” shown in FIG. 7 is a user input. As , it may correspond to the aforementioned pet taxi service use request information. Specifically, “input” shown in FIG. 7 may include a departure time, a departure location, and a destination location. The departure time, departure point, and destination may be derived when the device 100 providing the pet taxi reservation service receives information on the departure date, departure time, departure location, and arrival location from the user terminal.

The “artificial intelligence” shown in FIG. 7 may be implemented by an API (Application Programming Interface) server. The API server having “artificial intelligence” shown in FIG. 7 may correspond to the device 100 providing a pet taxi reservation service. The API server equipped with the “artificial intelligence” shown in FIG. 7 can predict future driving distance and future driving time required. The future driving distance and future driving time may be derived by using the departure date, departure time, starting point, and destination for artificial intelligence calculation.

In one embodiment, the step of performing the primary matching algorithm may include calculating a speed based on a future travel distance and a future travel time required, determining an arrival time based on a desired departure time and a future travel time required. Calculating the time interval between dispatches before the desired departure time, the desired departure time, future travel time, arrival time, and the time between dispatches after the arrival time as the minimum time for new reservation operation, new reservation Generating a plurality of time ranges 210 each including a newly reserved minimum travel time by repeatedly delaying the minimum travel time from a desired departure time by a predetermined number of repetitions in a preset predetermined minute unit; and A step of filtering the list 200 of time zones available for dispatch based on the time ranges 210 of .

Referring to the “primary matching algorithm” shown in FIG. 7 , the speed may be derived by a first operation (future driving distance / future driving time required * 60). In this case, the speed may indicate an hourly speed. The arrival time may be derived through the second calculation (departure time + required future travel time). The time between dispatches is a constant and can be assumed to be 20 minutes. In this case, when data on the operation of the pet taxi is accumulated, the time between dispatches may be adjusted by the above-described artificial intelligence learning. The available departure time, that is, the list of available time slots 200 may be filtered by comparing the available departure schedule with the destination of the previous reservation.

In some embodiments, the performing of the secondary matching algorithm may include calculating a first straight line distance from a previous arrival point to a departure point included in a list of pre-reserved time slots for pet taxis, first straight line distance, speed Based on , and a correction factor (eg, "1.3") for calculating the actual travel distance, calculating the first required time required to arrive from the previous destination to the departure point, and the desired departure time, a preset delay time, and calculating a minimum arrival time required to arrive at a previous destination based on the first required time. Here, the delay time may be a cleaning time delayed in cleaning.

Referring to the “secondary matching algorithm” shown in FIG. 7 , the delay time or cleaning time is a constant and can be assumed to be 10 minutes. In this case, when data on the operation of the pet taxi is accumulated, the delay time or the cleaning time may be adjusted by the aforementioned artificial intelligence learning. The first straight line distance may be derived by a third operation for deriving the distance (km) between two points in latitude and/or longitude. The first required time may be derived through a fourth operation (first straight line distance * correction factor / speed * 60). The minimum arrival time may be derived through a fifth calculation (departure time - delay time - first required time). The minimum required time may be derived through a sixth calculation (time required for future travel + (time between dispatches * 2)). The foregoing example may correspond to an embodiment in which the time between optimal dispatching times prior to the required time for future travel is calculated from the minimum new scheduled travel time (300).

In one embodiment, the step of performing the secondary matching algorithm may include calculating a second straight line distance from the destination to the next starting point included in the list of time slots pre-reserved for pet taxis, the second straight line distance, speed, and calculating a second required time required to arrive from the destination to the next departure based on the correction coefficient (eg, "1.3"), to the next departure based on the arrival time, delay time, and second required time. Calculating a minimum departure time for departure, calculating a new new reserved operation minimum time based on the future required time, delay time, first required time, and second required time, and a list of time slots available for dispatch ( In 200), the process may further include filtering a list of time zones available for reservation using a new minimum scheduled operation time.

Referring to the “secondary matching algorithm” shown in FIG. 7 , the second linear distance may be derived by a seventh operation for deriving the distance (km) between two points in latitude and/or longitude. The second required time may be derived through an eighth operation (second straight line distance * correction factor / speed * 60). The minimum departure time may be derived through the ninth calculation (arrival time + delay time + second required time). If there is an available pet taxi, the departure time of the next schedule is the minimum departure time value and may correspond to the end time of the non-null schedule. The new minimum period for new reserved operation may be derived through the 10th operation (required future operation time + (delay time * 2) + required first time + second required time). The foregoing example may correspond to an embodiment in which a time between optimal dispatching after a new new reserved operation minimum time (300) and a required future operation time is calculated.

Meanwhile, in some embodiments, the apparatus 100 for providing a pet taxi reservation service uses the above-described first matching algorithm and second matching algorithm to provide available pet taxis to users using the pet taxi reservation service. You can provide a calling service. At this time, the first matching algorithm and the second matching algorithm are generally the same as those described above with reference to FIG. 7 , but in the first matching algorithm, the device 100 providing the pet taxi reservation service, instead of the destination of the previous reservation, By comparing the current location and the locations of peck taxis that can be reserved, it is possible to sequentially call pet taxis from the pet taxi closest to the current user's location. And, in the secondary matching algorithm, the device 100 providing the pet taxi reservation service may use the location of a peck taxi that can be reserved instead of the previous destination.

8 is a diagram for explaining a correction coefficient according to an embodiment of the present disclosure.

Referring to FIG. 8 , the correction coefficient may be a weight that is multiplied to calculate a movement distance considering an actual movement path. In the case of these correction coefficients, a higher or lower correction coefficient may be applied depending on the operating time (eg, peak time, premium time, weekdays, holidays, commuting time, etc.) and/or operating region. For example, a correction factor may be applied in a manner different from that in which a normal taxi charges 33 won per 10 seconds in a peak time rate system. For example, correction coefficients that can be applied differently according to weekdays, holidays, Saturdays, Sundays, and public days and times may be set as shown in FIG. 8 . As shown in FIG. 8 , a relatively high correction coefficient may be applied in the time zones from 9:00 to 11:00 and from 17:00 to 20:00, which may correspond to commuting times on weekdays. On Saturdays or Sundays/holidays, a relatively high correction factor may be applied during activity periods (eg, from 10:00 to 18:00). However, it is not limited thereto.

In other embodiments, different correction coefficients may be applied according to traffic conditions (eg, construction sites, accident sites, etc.).

In still other embodiments, the correction factor may be set based on learning of the artificial intelligence described above.

9 is a diagram for explaining a pet taxi dispatching order according to an embodiment of the present disclosure.

Referring to FIG. 9 , when a customer selects a desired time, two or more pet taxis may be dispatched at the selected time. In this case, the apparatus 100 providing the pet taxi reservation service may determine the order of dispatching the pet taxi according to the priority shown in FIG. 9 . Specifically, a pet taxi without a schedule may be dispatched in first order. A pet taxi with a previous empty car time of less than 20 minutes may be assigned second priority. If there are two or more pet taxis whose previous empty car time is less than 20 minutes, pet taxis are dispatched in the order of shorter previous empty car time. A pet taxi whose next empty car time is less than 20 minutes may be dispatched in third priority. If there are two or more pet taxis with the next empty car time within 20 minutes, the pet taxis are dispatched in the order of the previous empty car time. Pet taxis with a previous empty car time of less than 30 minutes may be assigned in 4th priority. Pet taxis may be dispatched in the order of vehicles with the smallest number of reservations, ranked 6th or lower. However, it is not limited thereto.

Meanwhile, the disclosed embodiments may be implemented in the form of a recording medium storing instructions executable by a computer. Instructions may be stored in the form of program codes, and when executed by a processor, create program modules to perform operations of the disclosed embodiments. The recording medium may be implemented as a computer-readable recording medium.

Computer-readable recording media include all types of recording media in which instructions that can be decoded by a computer are stored. For example, there may be read only memory (ROM), random access memory (RAM), magnetic tape, magnetic disk, flash memory, optical data storage device, and the like.

As above, the disclosed embodiments have been described with reference to the accompanying drawings. Those skilled in the art to which the present disclosure pertains will understand that the present disclosure may be implemented in a form different from the disclosed embodiments without changing the technical spirit or essential features of the present disclosure. The disclosed embodiments are illustrative and should not be construed as limiting.

100: Device providing pet taxi reservation service
101: first user terminal
102: second user terminal
103 Network
110: communication module
130: storage module
150: control module

Claims (10)

In the method performed by the device for providing a pet taxi reservation service at a reservationable time matching the user's desired time,
Receiving pet taxi service request information including a desired departure time, place of departure, and destination from a user terminal;
predicting future driving information including a future driving distance and future driving time from the pet taxi service use request information using artificial intelligence;
performing a primary matching algorithm for filtering a list of time zones available for dispatch from the desired departure time based on a minimum time for new reserved trips, which is the sum of times between predetermined dispatches before and after the required future trip time;
Performing a secondary matching algorithm for filtering a list of available time slots from the list of time slots available for dispatch based on a list of time slots pre-reserved for pet taxis, the required future travel time, the departure point, and the destination; and
And providing a list of time slots available for reservation to the user terminal. According to claim 1,
The step of performing the first matching algorithm,
calculating a speed based on the future travel distance and the required future travel time;
calculating an arrival time based on the desired departure time and the required future travel time;
Calculating a time interval obtained by summing the time between dispatches before the desired departure time, the desired departure time, the future service required time, the arrival time, and the time between dispatches after the arrival time as the minimum new reserved operation time;
generating a plurality of time ranges each including the new minimum reserved operation time by repeatedly delaying the new reserved operation minimum time by a predetermined number of repetitions in units of predetermined minutes from the desired departure time; and
And filtering the list of available time slots based on the plurality of time ranges. According to claim 2,
The step of performing the secondary matching algorithm,
calculating a first straight line distance from a previous arrival point included in a list of pre-reserved time slots for the pet taxis to the departure point;
calculating a first required time required to arrive from the previous destination to the departure location based on the first straight-line distance, the speed, and a correction coefficient for calculating an actual travel distance; and
and calculating a minimum arrival time required to arrive at the previous destination based on the desired departure time, a preset delay time, and the first required time. According to claim 3,
The step of performing the secondary matching algorithm,
calculating a second straight-line distance from the arrival point to a next departure point included in a list of time slots pre-reserved for the pet taxis;
calculating a second required time required to arrive from the destination to the next departure based on the second straight line distance, the speed, and the correction coefficient;
calculating a minimum departure time for departure to the next departure location based on the arrival time, the delay time, and the second required time;
calculating a minimum new reserved operation time based on the future required time, the delayed time, the first required time, and the second required time; and
The method of claim 1, further comprising filtering the list of available time slots by using the new minimum scheduled operation time in the list of time slots available for dispatch. According to claim 4,
Receiving, from the user terminal, reservation time information indicating a reservation time selected by the user terminal from the list of time slots available for reservation; and
Transmitting distance information representing the distance between the departure point and the destination at the selected reservation time and expected rate information representing the expected rate for the distance to the user terminal. According to claim 5,
receiving, from the user terminal, request item information indicating a request from the user terminal and companion animal information about the user's companion animal; and
The method further comprising transmitting the request item information and the companion animal information to a user terminal of at least one pet taxi available for reservation among the pet taxis. According to claim 6,
characterized in that it further comprises the step of transmitting payment information, coupon information, and point information to the user terminal. According to claim 7,
Receiving a call request signal requesting to call a reservable pet taxi from the user terminal;
Transmitting a call signal to a user terminal of at least one pet taxi capable of being reserved in response to the call request signal;
Receiving a call response signal from a user terminal of a pet taxi that responds to a call according to the call signal; and
The method further comprising transmitting pet taxi information about the pet taxi in response to the call to the user terminal. In the device for providing a pet taxi reservation service at a reservationable time matching the user's desired time,
a communication module configured to communicate with a user terminal; and
A control module configured to control the operation of the communication module;
The control module,
Through the communication module, receiving pet taxi service use request information including a desired departure time, departure point, and destination from the user terminal,
Using artificial intelligence, predicting future driving information including future driving distance and future driving time from the pet taxi service request information,
Performing a primary matching algorithm for filtering a list of time zones available for dispatch from the desired departure time based on the minimum time for new reserved trips, which is the sum of the times between dispatches before and after the required future trip time;
A secondary matching algorithm for filtering a list of time zones available for reservation from the list of time slots available for dispatch based on the minimum calculation time for new reserved operation calculated from the minimum time for new reservation operation and based on the list of previously reserved time slots for pet taxis. do,
Characterized in that, the device provides a list of time slots available for reservation to the user terminal. A computer program, which is combined with a computer which is hardware, and stored in a computer readable recording medium to perform the method of any one of claims 1 to 8.

Images