WO2019223745A1 - Procédés et systèmes pour informer un utilisateur d'informations de covoiturage - Google Patents

Procédés et systèmes pour informer un utilisateur d'informations de covoiturage Download PDF

Info

Publication number
WO2019223745A1
WO2019223745A1 PCT/CN2019/088066 CN2019088066W WO2019223745A1 WO 2019223745 A1 WO2019223745 A1 WO 2019223745A1 CN 2019088066 W CN2019088066 W CN 2019088066W WO 2019223745 A1 WO2019223745 A1 WO 2019223745A1
Authority
WO
WIPO (PCT)
Prior art keywords
carpooling
carpooling request
request
information
service
Prior art date
Application number
PCT/CN2019/088066
Other languages
English (en)
Inventor
Baotong Yang
Original Assignee
Beijing Didi Infinity Technology And Development Co., Ltd.
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Beijing Didi Infinity Technology And Development Co., Ltd. filed Critical Beijing Didi Infinity Technology And Development Co., Ltd.
Publication of WO2019223745A1 publication Critical patent/WO2019223745A1/fr

Links

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
    • G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
    • G06Q50/40—Business processes related to the transportation industry
    • 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
    • G06Q10/00—Administration; Management
    • G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063—Operations research, analysis or management
    • G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
    • G06Q10/06311—Scheduling, planning or task assignment for a person or group
    • 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
    • G06Q10/00—Administration; Management
    • G06Q10/02—Reservations, e.g. for tickets, services or events
    • 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
    • G06Q10/00—Administration; Management
    • G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063—Operations research, analysis or management
    • G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
    • G06Q10/06312—Adjustment or analysis of established resource schedule, e.g. resource or task levelling, or dynamic rescheduling
    • 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
    • G06Q10/00—Administration; Management
    • G06Q10/10—Office automation; Time management
    • G06Q10/109—Time management, e.g. calendars, reminders, meetings or time accounting

Definitions

  • the present disclosure generally relates to an online to offline service, and more specifically, relates to methods and systems for informing a user of carpooling information.
  • Carpooling allows a plurality of individuals to share one transportation service, which makes full use of the passenger capacity of a vehicle, reducing the travel cost, air pollution, and energy consumption.
  • a user e.g., a passenger
  • a carpooling request through a taxi-hailing application installed in a user terminal (e.g., a smartphone)
  • a user terminal e.g., a smartphone
  • a system for informing a user of carpool information in an online to offline service may include one or more storage devices and one or more processors configured to communicate with the one or more storage devices.
  • the one or more storage devices may include a set of instructions.
  • the one or more processors may be directed to perform one or more of the following operations.
  • the one or more processors may receive a first carpooling request from a terminal associated with a first service requester.
  • the one or more processors may determine at least one second carpooling request from a second service requester carpooling with the first carpooling request.
  • the one or more processors may transmit signals including processing information and state information of the first carpooling request to the terminal associated with the first service requester in real time.
  • the signals may direct the terminal to dynamically display and update the processing information and the state information.
  • the processing information may include at least one estimated waiting time for the first carpooling request, and the state information related to a state of determining the at least one second carpooling request.
  • the state information may include at least one of a count of times for identifying at least one candidate carpooling request used to determine the at least one second carpooling request, a count of identified candidate carpooling requests, identification information of the identified candidate carpooling requests, and a matching degree between the at least one identified candidate carpooling request and the first carpooling request, wherein the matching degree reflects route compatibility between the first carpooling request and the at least one identified candidate carpooling request for carpooling.
  • the estimated waiting time may include at least one of a first estimated time of waiting for determining a service provider for the first carpooling request, and a second estimated time of waiting for departure.
  • the at least one second carpooling request may be determined in the second estimated time.
  • the one or more processors may determine that the first estimated time is over.
  • the one or more processors may determine a service provider for the first carpooling request in response to the determination that the first estimated time is over.
  • the one or more processors may determine that the at least one second carpooling request has been determined in the first estimated time.
  • the one or more processors may determine a service provider for the first carpooling request and the at least one second carpooling request after the at least one second carpooling request is determined in response to the determination of the at least one second carpooling request.
  • the one or more processors may transmit signals including provider information and location information of the service provider to the terminal associated with the first service requester.
  • the one or more processors may obtain a location of the service provider.
  • the one or more processors may determine that the service provider is located at a pick-up location of the first carpooling request.
  • the one or more processors may determine that the at least one second carpooling request is determined or it is time to depart from the pick-up location of the first carpooling request according to the processing information.
  • the one or more processors may transmit signals including an instruction for departing from the pick-up location of the first carpooling request to a terminal associated with the service provider.
  • the first estimated time may be a constant value, or the first estimated time may relate to a pick-up location of the first carpooling request.
  • the second estimated time may be a constant value, or the second estimated time may relate to at least one of a distance between a pick-up location and an origin of the first carpooling request or a supply-demand ratio related to the pick-up location of the first carpooling request.
  • the supply-demand ratio may be a ratio of a count of current available service providers in an area including the pick-up location to a count of current pending carpooling requests related to the area.
  • a method for informing a user of carpool information in an online to offline service may include one or more of the following operations.
  • One or more processors may receive a first carpooling request from a terminal associated with a first service requester.
  • the one or more processors may determine at least one second carpooling request from a second service requester carpooling with the first carpooling request.
  • the one or more processors may transmit signals including processing information and state information of the first carpooling request to the terminal associated with the first service requester in real time.
  • the signals may direct the terminal to dynamically display and update the processing information and the state information.
  • the processing information may include at least one estimated waiting time for the first carpooling request, and the state information related to a state of determining the at least one second carpooling request.
  • a system for informing a user of carpool information in an online to offline service may include an obtaining module configured to receive a first carpooling request from a terminal associated with a first service requester.
  • the system may also include a matching module configured to determine at least one second carpooling request from a second service requester carpooling with the first carpooling request.
  • the system may also include a transmission module configured to transmit signals including processing information and state information of the first carpooling request to the terminal associated with the first service requester in real time.
  • the signals may direct the terminal to dynamically display and update the processing information and the state information.
  • the processing information may include at least one estimated waiting time for the first carpooling request, and the state information related to a state of determining the at least one second carpooling request.
  • a non-transitory computer readable medium may comprise at least one set of instructions.
  • the at least one set of instructions may be executed by one or more processors of a computer server.
  • the one or more processors may receive a first carpooling request from a terminal associated with a first service requester.
  • the one or more processors may determine at least one second carpooling request from a second service requester carpooling with the first carpooling request.
  • the one or more processors may transmit signals including processing information and state information of the first carpooling request to the terminal associated with the first service requester in real time.
  • the signals may direct the terminal to dynamically display and update the processing information and the state information.
  • the processing information may include at least one estimated waiting time for the first carpooling request, and the state information related to a state of determining the at least one second carpooling request.
  • a system for informing of carpool information in an online to offline service may include one or more storage devices and one or more processors configured to communicate with the one or more storage devices.
  • the one or more storage devices may include a set of instructions.
  • the one or more processors may be directed to perform one or more of the following operations.
  • the one or more processors may obtain a first carpooling request from a first service receiver.
  • the one or more processors may transmit the first carpooling request to a server related to the online to offline service.
  • the one or more processors may receive signals including processing information and state information of the first carpooling request from the server in real time.
  • the processing information may include at least one estimated waiting time for the first carpooling request.
  • the state information may be related to a state of determining at least one second carpooling request from a second service requester carpooling with the first carpooling request.
  • the one or more processors may dynamically display and update the processing information and the state information.
  • the state information may include at least one of a count of times for identifying at least one candidate carpooling request used to determine the at least one second carpooling request, a count of identified candidate carpooling requests, identification information of the identified candidate carpooling requests, and a matching degree between the at least one identified candidate carpooling request and the first carpooling request, wherein the matching degree reflects route compatibility between the first carpooling request and the at least one identified candidate carpooling request for carpooling.
  • the estimated waiting time may include at least one of a first estimated time of waiting for determining a service provider for the first carpooling request, and a second estimated time of waiting for departure.
  • the one or more processors may dynamically display the processing information by counting down the processing information.
  • the one or more processors may receive, from the server, and display provider information and location information of a service provider that accepts the first carpooling request.
  • a method for informing of carpool information in an online to offline service may include one or more of the following operations.
  • One or more processors may obtain a first carpooling request from a first service receiver.
  • the one or more processors may transmit the first carpooling request to a server related to the online to offline service.
  • the one or more processors may receive signals including processing information and state information of the first carpooling request from the server in real time.
  • the processing information may include at least one estimated waiting time for the first carpooling request.
  • the state information may be related to a state of determining at least one second carpooling request from a second service requester carpooling with the first carpooling request.
  • the one or more processors may dynamically display and update the processing information and the state information.
  • a system for informing of carpool information in an online to offline service may include an obtaining module configured to obtain a first carpooling request from a first service receiver.
  • the system may also include a transmission module configured to transmit the first carpooling request to a server related to the online to offline service.
  • the system may also include a receiving module configured to receive signals including processing information and state information of the first carpooling request from the server in real time.
  • the processing information may include at least one estimated waiting time for the first carpooling request.
  • the state information may relate to a state of determining at least one second carpooling request from a second service requester carpooling with the first carpooling request.
  • the system may also include a display module configured to dynamically display and update the processing information and the state information.
  • a non-transitory computer readable medium may comprise at least one set of instructions.
  • the at least one set of instructions may be executed by one or more processors of a computer server.
  • the one or more processors may obtain a first carpooling request from a first service receiver.
  • the one or more processors may transmit the first carpooling request to a server related to the online to offline service.
  • the one or more processors may receive signals including processing information and state information of the first carpooling request from the server in real time.
  • the processing information may include at least one estimated waiting time for the first carpooling request.
  • the state information may be related to a state of determining at least one second carpooling request from a second service requester carpooling with the first carpooling request.
  • the one or more processors may dynamically display and update the processing information and the state information.
  • FIG. 1 is a schematic diagram illustrating an exemplary online to offline service system according to some embodiments of the present disclosure
  • FIG. 2 is a schematic diagram illustrating exemplary hardware and/or software components of a computing device according to some embodiments of the present disclosure
  • FIG. 3 is a schematic diagram illustrating exemplary hardware and/or software components of a mobile device according to some embodiments of the present disclosure
  • FIG. 4 is a flowchart illustrating an exemplary process for informing a service requester of carpooling information according to some embodiments of the present disclosure
  • FIG. 5 is a schematic block diagram illustrating an exemplary device for informing a service requester of carpooling information according to some embodiments of the present disclosure
  • FIG. 6 is a flowchart illustrating another exemplary process for informing a service requester of carpooling information according to some embodiments of the present disclosure
  • FIG. 7 is a schematic block diagram illustrating another exemplary device for informing a service requester of carpooling information according to some embodiments of the present disclosure
  • FIG. 8 is a flowchart illustrating an exemplary process for determining an estimated waiting time for departure according to some embodiments of the present disclosure.
  • FIG. 9 is a schematic block diagram illustrating an exemplary device for determining an estimated waiting time for departure.
  • the flowcharts used in the present disclosure illustrate operations that systems implement according to some embodiments of the present disclosure. It is to be expressly understood, the operations of the flowchart may be implemented not in order. Conversely, the operations may be implemented in inverted order, or simultaneously. Moreover, one or more other operations may be added to the flowcharts. One or more operations may be removed from the flowcharts.
  • system or method of the present disclosure may be applied to any other kind of online to offline service.
  • system or method of the present disclosure may be applied to different transportation systems including land, ocean, aerospace, or the like, or any combination thereof.
  • Those transportation systems may provide transportation services transporting a subject from one location to another location using a vehicle.
  • the subject may include passengers and/or goods.
  • the vehicle of the transportation service may include a taxi, a private car, a hitch, a bus, a train, a bullet train, a high speed rail, a subway, a vessel, an aircraft, a spaceship, a hot-air balloon, a driverless vehicle, a bicycle, a tricycle, a motorcycle, or the like, or any combination thereof.
  • the transportation services may include a taxi hailing service, a chauffeur service, a delivery service, a carpooling service, a bus service, a take-out service, a driver hiring service, a shuttle service, or the like, or any combination thereof.
  • the application scenarios of the system or method of the present disclosure may include a web page, a plug-in of a browser, a client terminal, a custom system, an internal analysis system, an artificial intelligence robot, or the like, or any combination thereof.
  • the carpooling service in the present disclosure may refer to an arrangement that combines two or more transportation services into a new transportation service.
  • two taxi services may be combined into a new transportation service so that passengers related to the two taxi services travels in a vehicle.
  • two delivery services may be combined into a new transportation services so that goods related to the two delivery services are delivered in a vehicle.
  • a taxi service and a delivery service may be combined into a new transportation service so that the passenger (s) related to the taxi service and goods related to the delivery service share a vehicle.
  • passenger ” “requester, ” “service requester, ” “requester terminal, ” “passenger terminal, ” and “customer” in the present disclosure are used interchangeably to refer to an individual, an entity or a tool that may request or order a service.
  • driver ” “provider, ” “service provider, ” “provider terminal, ” “driver terminal, ” and “supplier” in the present disclosure are used interchangeably to refer to an individual, an entity, or a tool that may provide a service or facilitate the providing of the service.
  • the term “user” in the present disclosure may refer to an individual, an entity, or a tool that may request a service, order a service, provide a service, or facilitate the providing of the service.
  • the user may be a passenger, a driver, an operator, or the like, or any combination thereof.
  • the term “request, ” “service request, ” “order, ” “carpooling order, ” “carpooling request, ” “vanpooling order” and “vanpooling request” in the present disclosure refers to a request that initiated by a passenger, a requester, a service requester, a customer, a driver, a provider, a service provider, a supplier, or the like, or any combination thereof.
  • the service request may be accepted by any one of a passenger, a requester, a service requester, a customer, a driver, a provider, a service provider, or a supplier.
  • the service request may be chargeable, or free.
  • the positioning technology used in the present disclosure may include a global positioning system (GPS) , a global navigation satellite system (GLONASS) , a compass navigation system (COMPASS) , a Galileo positioning system, a quasi-zenith satellite system (QZSS) , a wireless fidelity (WiFi) positioning technology, or the like, or any combination thereof.
  • GPS global positioning system
  • GLONASS global navigation satellite system
  • COMPASS compass navigation system
  • Galileo positioning system Galileo positioning system
  • QZSS quasi-zenith satellite system
  • WiFi wireless fidelity positioning technology
  • the present disclosure relates to methods and systems for informing a user of carpooling information.
  • the methods and systems may receive a carpooling request from a terminal (e.g., smartphone) of a user (e.g., a passenger) .
  • the methods and systems may determine another passenger carpooling with the user.
  • the methods and systems may transmit signals including processing information and state information of the carpooling request to the terminal in real time, directing the terminal to dynamically display and update the processing information and the state information.
  • the state information may be related to a state of determining another passenger carpooling with the user.
  • the processing information may indicate an estimated waiting time of the user.
  • the purpose for transmitting the state information and the processing information to the user in real time is to inform the user of the process for determining another passenger carpooling with the user, which enables the user to monitor the process for determining another passenger, and makes the user willing to wait longer to allow the system to find another passenger carpooling with the user, thereby improving the carpooling success rate.
  • online to offline service such as online carpooling service
  • online carpooling service is a new form of service rooted only in post-Internet era. It provides technical solutions to service requesters and service providers that could raise only in post-Internet era.
  • pre-Internet era when a passenger hails a taxi on street, the service request and acceptance occur only between the passenger and one taxi driver that sees the passenger. If the passenger hails a taxi through telephone call, the service request and acceptance may occur only between the passenger and one service provider (e.g., one taxi company or agent) .
  • one service provider e.g., one taxi company or agent
  • a driver wants to provide a carpooling service the driver has to ask a passenger face to face and determine whether the carpooling service is possible to be provided to the passenger by experience of the driver.
  • Online carpooling service obtains service requests through Internet and finds combinative service requests in real-time and automatically.
  • the carpooling service also allows a service request initiated by a service requester (e.g., a passenger) to be distributed in real-time and automatically to a vast number of individual service providers (e.g., taxi drivers) distance away from the service requester and allows a plurality of service provides to respond to the service request simultaneously and in real-time. Therefore, through Internet, the online to offline service systems may provide a much more efficient transaction platform for the service requesters and the service providers that may never met in a traditional pre-Internet transportation service system.
  • a service requester e.g., a passenger
  • individual service providers e.g., taxi drivers
  • the description below takes a carpooling service of combining taxi services into a new transportation service for example.
  • the carpooling service of combining taxi services into a new transportation service is merely provided for the purposes of illustration, and not intended to limit the scope of the present disclosure.
  • this disclosure may be applied to a carpooling service of combining other transportation services, for example, other services of taking people (e.g., bus services) , delivery services, etc.
  • FIG. 1 is a schematic diagram illustrating an exemplary online to offline service system according to some embodiments of the present disclosure.
  • the online to offline service system 100 may include a server 110, a network 120, a requester terminal 130, a provider terminal 140, and a storage device 150.
  • the server 110 may be a single server or a server group.
  • the server group may be centralized, or distributed (e.g., server 110 may be a distributed system) .
  • the server 110 may be local or remote.
  • the server 110 may access information and/or data stored in the requester terminal 130, the provider terminal 140, and/or the storage device 150 via the network 120.
  • the server 110 may be directly connected to the requester terminal 130, the provider terminal 140, and/or the storage device 150 to access stored information and/or data.
  • the server 110 may be implemented on a cloud platform.
  • the cloud platform may include a private cloud, a public cloud, a hybrid cloud, a community cloud, a distributed cloud, an inter-cloud, a multi-cloud, or the like, or any combination thereof.
  • the server 110 may be implemented on a computing device 200 having one or more components illustrated in FIG. 2 in the present disclosure.
  • the server 110 may process information and/or data to perform one or more functions described in the present disclosure. For example, the server 110 may transmit signals including processing information and state information of a first carpooling request to the requester terminal 130 in real time, directing the requester terminal 130 to dynamically display and update the processing information and the state information. As another example, the server 110 may determine at least one second carpooling request carpooling with the first carpooling request. As a further example, the server 110 may determine an estimated waiting time for departure. In some embodiments, the server 110 may include one or more processing engines (e.g., single-core processing engine (s) or multi-core processor (s) ) .
  • processing engines e.g., single-core processing engine (s) or multi-core processor (s)
  • the server 110 may include one or more hardware processors, such as a central processing unit (CPU) , an application-specific integrated circuit (ASIC) , an application-specific instruction-set processor (ASIP) , a graphics processing unit (GPU) , a physics processing unit (PPU) , a digital signal processor (DSP) , a field-programmable gate array (FPGA) , a programmable logic device (PLD) , a controller, a microcontroller unit, a reduced instruction-set computer (RISC) , a microprocessor, or the like, or any combination thereof.
  • CPU central processing unit
  • ASIC application-specific integrated circuit
  • ASIP application-specific instruction-set processor
  • GPU graphics processing unit
  • PPU physics processing unit
  • DSP digital signal processor
  • FPGA field-programmable gate array
  • PLD programmable logic device
  • controller a microcontroller unit, a reduced instruction-set computer (RISC) , a microprocessor, or the like, or any combination thereof
  • the network 120 may facilitate the exchange of information and/or data.
  • one or more components in the online to offline service system 100 e.g., the server 110, the requester terminal 130, the provider terminal 140, and the storage device 150
  • the server 110 may obtain a first carpooling request from the requester terminal 130 via the network 120.
  • the server 110 may transmit signals including processing information and state information of the first carpooling request to the requester terminal 130 in real time via the network 120.
  • the network 120 may be any type of wired or wireless network, or a combination thereof.
  • the network 120 may include a cable network, a wireline network, an optical fiber network, a telecommunications network, an intranet, the Internet, a local area network (LAN) , a wide area network (WAN) , a wireless local area network (WLAN) , a metropolitan area network (MAN) , a wide area network (WAN) , a public telephone switched network (PSTN) , a Bluetooth TM network, a ZigBee network, a near field communication (NFC) network, or the like, or any combination thereof.
  • the network 120 may include one or more network access points.
  • the network 120 may include wired or wireless network access points such as base stations and/or internet exchange points 120-1, 120-2, ..., through which one or more components of the online to offline service system 100 may be connected to the network 120 to exchange data and/or information.
  • a requester may be a user of the requester terminal 130. In some embodiments, the user of the requester terminal 130 may be someone other than the requester. For example, a user A of the requester terminal 130 may use the requester terminal 130 to send a service request for a user B, or receive service and/or information or instructions from the server 110.
  • a provider may be a user of the provider terminal 140. In some embodiments, the user of the provider terminal 140 may be someone other than the provider. For example, a user C of the provider terminal 140 may use the provider terminal 140 to receive a service request for a user D, and/or information or instructions from the server 110.
  • the requester terminal 130 may include a mobile device 130-1, a tablet computer 130-2, a laptop computer 130-3, a built-in device in a motor vehicle 130-4, or the like, or any combination thereof.
  • the mobile device 130-1 may include a smart home device, a wearable device, a mobile device, a virtual reality device, an augmented reality device, or the like, or any combination thereof.
  • the smart home device may include a smart lighting device, a control device of an intelligent electrical apparatus, a smart monitoring device, a smart television, a smart video camera, an interphone, or the like, or any combination thereof.
  • the wearable device may include a bracelet, footgear, glasses, a helmet, a watch, clothing, a backpack, a smart accessory, or the like, or any combination thereof.
  • the mobile device may include a mobile phone, a personal digital assistance (PDA) , a gaming device, a navigation device, a point of sale (POS) device, a laptop, a desktop, or the like, or any combination thereof.
  • the virtual reality device and/or the augmented reality device may include a virtual reality helmet, a virtual reality glass, a virtual reality patch, an augmented reality helmet, augmented reality glasses, an augmented reality patch, or the like, or any combination thereof.
  • the virtual reality device and/or the augmented reality device may include a Google Glass TM , a RiftCon TM , a Fragments TM , a Gear VR TM , etc.
  • the built-in device in the motor vehicle 130-4 may include an onboard computer, an onboard television, etc.
  • the requester terminal 130 may be a device with positioning technology for locating the position of a user of the requester terminal 130 (e.g., a service requester) and/or the requester terminal 130.
  • the provider terminal 140 may be a device that is similar to, or the same as the requester terminal 130. In some embodiments, the provider terminal 140 may be a device utilizing positioning technology for locating the position of a user of the provider terminal 140 (e.g., a service provider) and/or the provider terminal 140. In some embodiments, the requester terminal 130 and/or the provider terminal 140 may communicate with one or more other positioning devices to determine the position of the requester, the requester terminal 130, the provider, and/or the provider terminal 140. In some embodiments, the requester terminal 130 and/or the provider terminal 140 may send positioning information to the server 110.
  • the server 110 may be a device that is similar to, or the same as the requester terminal 130. In some embodiments, the provider terminal 140 may be a device utilizing positioning technology for locating the position of a user of the provider terminal 140 (e.g., a service provider) and/or the provider terminal 140. In some embodiments, the requester terminal 130 and/or the provider terminal 140 may communicate with one or more other positioning
  • the storage device 150 may store data and/or instructions.
  • the storage device 150 may store data obtained from the requester terminal 130, the provider terminal 140, and/or the server 110.
  • the storage device 150 may store service requests obtained from the requester terminal 130.
  • the storage device 150 may store data and/or instructions that the server 110 may execute or use to perform exemplary methods described in the present disclosure.
  • the storage device 150 may store instructions that the server 110 may execute to determine at least one second carpooling request carpooling with a first carpooling request and/or determine processing information of the first carpooling request.
  • the storage device 150 may include a mass storage, a removable storage, a volatile read-and-write memory, a read-only memory (ROM) , or the like, or any combination thereof.
  • Exemplary mass storage may include a magnetic disk, an optical disk, a solid-state drive, etc.
  • Exemplary removable storage may include a flash drive, a floppy disk, an optical disk, a memory card, a zip disk, a magnetic tape, etc.
  • Exemplary volatile read-and-write memory may include a random access memory (RAM) .
  • Exemplary RAM may include a dynamic RAM (DRAM) , a double date rate synchronous dynamic RAM (DDR SDRAM) , a static RAM (SRAM) , a thyrisor RAM (T-RAM) , and a zero-capacitor RAM (Z-RAM) , etc.
  • Exemplary ROM may include a mask ROM (MROM) , a programmable ROM (PROM) , an erasable programmable ROM (EPROM) , an electrically-erasable programmable ROM (EEPROM) , a compact disk ROM (CD-ROM) , and a digital versatile disk ROM, etc.
  • the storage device 150 may be implemented on a cloud platform.
  • the cloud platform may include a private cloud, a public cloud, a hybrid cloud, a community cloud, a distributed cloud, an inter-cloud, a multi-cloud, or the like, or any combination thereof.
  • the storage device 150 may be connected to the network 120 to communicate with one or more components in the online to offline service system 100 (e.g., the server 110, the requester terminal 130, the provider terminal 140) .
  • One or more components in the online to offline service system 100 may access the data or instructions stored in the storage device 150 via the network 120.
  • the storage device 150 may be directly connected to or communicate with one or more components in the online to offline service system 100 (e.g., the server 110, the requester terminal 130, the provider terminal 140) .
  • the storage device 150 may be part of the server 110.
  • the online to offline service system 100 may further include a positioning system (not shown in FIG. 1) .
  • the positioning system may determine information associated with an object, for example, the requester terminal 130 and/or the provider terminal 140.
  • the positioning system may be a global positioning system (GPS) , a global navigation satellite system (GLONASS) , a compass navigation system (COMPASS) , a BeiDou navigation satellite system, a Galileo positioning system, a quasi-zenith satellite system (QZSS) , etc.
  • the location may be in the form of coordinates, such as, latitude coordinate and longitude coordinate, etc.
  • the positioning system may include one or more satellites. The satellites may determine the information mentioned above independently or jointly.
  • the positioning system may send the information mentioned above to the network 120, the requester terminal 130, or the provider terminal 140 via wireless connections.
  • FIG. 2 is a schematic diagram illustrating exemplary hardware and/or software components of a computing device on which the server 110 may be implemented according to some embodiments of the present disclosure.
  • the computing device 200 may include a processor 210, a storage 220, an input/output (I/O) 230, and a communication port 240.
  • I/O input/output
  • the processor 210 may execute computer instructions (e.g., program code) and perform functions of the server 110 in accordance with techniques described herein.
  • the processor 210 may include interface circuits and processing circuits (not shown in FIG. 2) therein.
  • the interface circuits may be configured to receive electronic signals from a bus (not shown in FIG. 2) , wherein the electronic signals encode/include structured data and/or instructions for the processing circuits to process.
  • the processing circuits may conduct logic calculations, and then determine a conclusion, a result, and/or an instruction encoded as electronic signals. Then the interface circuits may send out the electronic signals from the processing circuits via the bus.
  • the computer instructions may include, for example, routines, programs, objects, components, data structures, procedures, modules, and functions, which perform particular functions described herein.
  • the processor 210 may determine at least one second carpooling request carpooling with a first carpooling request and/or determine processing information of the first carpooling request.
  • the processor 210 may include one or more hardware processors, such as a microcontroller, a microprocessor, a reduced instruction set computer (RISC) , an application specific integrated circuits (ASICs) , an application-specific instruction-set processor (ASIP) , a central processing unit (CPU) , a graphics processing unit (GPU) , a physics processing unit (PPU) , a microcontroller unit, a digital signal processor (DSP) , a field programmable gate array (FPGA) , an advanced RISC machine (ARM) , a programmable logic device (PLD) , any circuit or processor capable of executing one or more functions, or the like, or any combinations thereof.
  • RISC reduced instruction set computer
  • ASICs application specific integrated circuits
  • ASIP application-specific instruction-set processor
  • CPU central processing unit
  • GPU graphics processing unit
  • PPU physics processing unit
  • DSP digital signal processor
  • FPGA field programmable gate array
  • ARM advanced RISC machine
  • processors of the computing device 200 may also include multiple processors, thus operations and/or method steps that are performed by one processor as described in the present disclosure may also be jointly or separately performed by the multiple processors.
  • the processor of the computing device 200 executes both step A and step B, it should be understood that step A and step B may also be performed by two or more different processors jointly or separately in the computing device 200 (e.g., a first processor executes step A and a second processor executes step B, or the first and second processors jointly execute steps A and B) .
  • the storage 220 may store data/information obtained from the requester terminal 130, the provider terminal 140, the storage device 150, and/or any other component of the online to offline service system 100.
  • the storage device 150 may store service requests obtained from the requester terminal 130.
  • the storage 220 may include a mass storage, a removable storage, a volatile read-and-write memory, a read-only memory (ROM) , or the like, or any combination thereof.
  • the mass storage may include a magnetic disk, an optical disk, a solid-state drives, etc.
  • the removable storage may include a flash drive, a floppy disk, an optical disk, a memory card, a zip disk, a magnetic tape, etc.
  • the volatile read-and-write memory may include a random access memory (RAM) .
  • the RAM may include a dynamic RAM (DRAM) , a double date rate synchronous dynamic RAM (DDR SDRAM) , a static RAM (SRAM) , a thyristor RAM (T-RAM) , and a zero-capacitor RAM (Z-RAM) , etc.
  • the ROM may include a mask ROM (MROM) , a programmable ROM (PROM) , an erasable programmable ROM (EPROM) , an electrically erasable programmable ROM (EEPROM) , a compact disk ROM (CD-ROM) , and a digital versatile disk ROM, etc.
  • the storage 220 may store one or more programs and/or instructions to perform exemplary methods described in the present disclosure.
  • the storage 220 may store a program for the server 110 to determine at least one second carpooling request carpooling with a first carpooling request and/or determine processing information of the first carpooling request.
  • the I/O 230 may input and/or output signals, data, information, etc. In some embodiments, the I/O 230 may enable a user interaction with the server 110. In some embodiments, the I/O 230 may include an input device and an output device. Examples of the input device may include a keyboard, a mouse, a touch screen, a microphone, or the like, or a combination thereof. Examples of the output device may include a display device, a loudspeaker, a printer, a projector, or the like, or a combination thereof.
  • Examples of the display device may include a liquid crystal display (LCD) , a light-emitting diode (LED) -based display, a flat panel display, a curved screen, a television device, a cathode ray tube (CRT) , a touch screen, or the like, or a combination thereof.
  • LCD liquid crystal display
  • LED light-emitting diode
  • CRT cathode ray tube
  • the communication port 240 may be connected to a network (e.g., the network 120) to facilitate data communications.
  • the communication port 240 may establish connections between the server 110 and the requester terminal 130, the provider terminal 140, the positioning system, or the storage device 150.
  • the connection may be a wired connection, a wireless connection, any other communication connection that can enable data transmission and/or reception, and/or any combination of these connections.
  • the wired connection may include, for example, an electrical cable, an optical cable, a telephone wire, or the like, or any combination thereof.
  • the wireless connection may include, for example, a Bluetooth TM link, a Wi-Fi TM link, a WiMax TM link, a WLAN link, a ZigBee link, a mobile network link (e.g., 3G, 4G, 5G, etc. ) , or the like, or a combination thereof.
  • the communication port 240 may be and/or include a standardized communication port, such as RS232, RS485, etc.
  • FIG. 3 is a schematic diagram illustrating exemplary hardware and/or software components of a mobile device on which the requester terminal 130 and/or the provider terminal 140 may be implemented according to some embodiments of the present disclosure.
  • the mobile device 300 may include a communication platform 310, a display 320, a graphic processing unit (GPU) 330, a central processing unit (CPU) 340, an I/O 350, a memory 360, and a storage 370.
  • any other suitable component including but not limited to a system bus or a controller (not shown) , may also be included in the mobile device 300.
  • a mobile operating system 361 e.g., iOS TM , Android TM , Windows Phone TM , etc.
  • the applications 362 may include a browser or any other suitable mobile apps for receiving and rendering information relating to transportation services or other information from the server 110.
  • User interactions with the information stream may be achieved via the I/O 350 and provided to the server 110 and/or other components of the online to offline service system 100 via the network 120.
  • processing information and state information of a carpooling request may be displayed in the requester terminal 130 through the display 320.
  • a service requester may input a carpooling request through the I/O 350.
  • computer hardware platforms may be used as the hardware platform (s) for one or more of the elements described herein.
  • a computer with user interface elements may be used to implement a personal computer (PC) or any other type of work station or terminal device.
  • PC personal computer
  • a computer may also act as a server if appropriately programmed.
  • the element may perform through electrical signals and/or electromagnetic signals.
  • the server 110 may operate logic circuits in its processor to process such task.
  • data e.g., a carpooling request
  • a processor of the server 110 may receive electrical signals encoding/including the data.
  • the processor of the server 110 may receive the electrical signals through one or more information exchange ports. If the requester terminal 130 communicates with the server 110 via a wired network, the information exchange port may be physically connected to a cable.
  • the information exchange port of the server 110 may be one or more antennas, which may convert the electrical signals to electromagnetic signals.
  • an electronic device such as the requester terminal 130, the provider terminal 140, and/or the server 110, when a processor thereof processes an instruction, sends out an instruction, and/or performs an action, the instruction and/or action is conducted via electrical signals.
  • the processor retrieves or saves data from a storage medium (e.g., the storage device 150) , it may send out electrical signals to a read/write device of the storage medium, which may read or write structured data in the storage medium.
  • the structured data may be transmitted to the processor in the form of electrical signals via a bus of the electronic device.
  • an electrical signal may refer to one electrical signal, a series of electrical signals, and/or a plurality of discrete electrical signals.
  • FIG. 4 is a flowchart illustrating an exemplary process for informing a service requester of carpooling information according to some embodiments of the present disclosure.
  • the process 400 may be implemented in the online to offline service system 100 illustrated in FIG. 1.
  • the process 400 may be stored in a storage medium (e.g., the storage device 150, or the storage 370 of the requester terminal 130) as a form of instructions, and can be invoked and/or executed by the requester terminal 130 (e.g., the CPU 340 of the requester terminal 130, or one or more modules in the requester terminal 130 illustrated in FIG. 5) .
  • the operations of the illustrated process 400 presented below are intended to be illustrative. In some embodiments, the process 400 may be accomplished with one or more additional operations not described, and/or without one or more of the operations discussed. Additionally, the order in which the operations of the process 400 as illustrated in FIG. 4 and described below is not intended to be limiting.
  • the requester terminal 130 may obtain a first carpooling request from a first service requester (e.g., a passenger and/or a user) .
  • the first carpooling request may include an origin, a destination, a request time, a request location, a count of passengers, or the like, or any combination thereof.
  • the request time refers to a time when the first carpooling request is transmitted from the requester terminal 130.
  • the request location refers to a real-time location of the first service requester (also the requester terminal 130) at the request time.
  • the first carpooling request may further include a departure time, an arrival time, or the like, or any combination thereof.
  • the requester terminal 130 and/or the provider terminal 140 may establish a communication (e.g., wireless communication) with the server 110, through an application (e.g., the application 362 in FIG. 3) installed in the requester terminal 130 and/or the provider terminal 140 via the network 120.
  • the application may associate with the online to offline service system 100.
  • the application may be a taxi-hailing application associated with the online to offline service system 100.
  • the origin, the destination, the number of passengers, the departure time, and/or the arrival time may be input by the first service requester in an interface of an application (e.g., the taxi-hailing application) installed in the requester terminal 130 through, for example, the I/O 350 in FIG. 3.
  • the requester terminal 130 may automatically obtain the origin, the departure time, the arrival time, the number of passenger, and/or the destination. For example, an event such as “Attending a meeting at location A from location B at 10:00 a. m. on Wednesday” is recorded in a calendar in the requester terminal 130.
  • the requester terminal 130 may automatically determine location A as the destination and determine location B as the origin based on the event in the calendar.
  • the requester terminal 130 may obtain its location (which is referred to as the location of the first service requester) herein through a positioning technology in the requester terminal 130, for example, the GPS, GLONASS, COMPASS, QZSS, BDS, WiFi positioning technology, or the like, or any combination thereof.
  • the requester terminal 130 may determine its real-time location as the origin.
  • the server 110 may analyze history requests of the requester terminal 130 using, for example, machine learning, and estimate the origin, the destination, the arrival time, or the number of passengers based on the departure time or the current time.
  • the server 110 may transmit the estimated result to the requester terminal 130 for the first service requester’s choice.
  • the requester terminal 130 may automatically record the request time and the request location when the first carpooling request is sent out. For example, when the first service requester presses a button in the interface of the application in the requester terminal 130 to send out the first carpooling request, the requester terminal 130 may automatically record the current time as the request time and record its real-time location as the request location.
  • the first carpooling request may relate to a real-time transportation service or a transportation service that needs to make an appointment.
  • the real-time transportation service may be a service that the requester wishes to receive the transportation service at the present moment or at a defined time reasonably close to the present moment for an ordinary requestor (e.g., so that a service provider is required to depart immediately or substantially immediately after the online to offline service system 100 receives the carpooling request.
  • a taxi carpooling service may be a real-time service if the defined time is shorter than a threshold value, such as 1 minute, 5 minutes, or 10 minutes.
  • the transportation service that needs an appointment may refer to a service that the requester wishes to receive at a time reasonably long from the present moment for an ordinary requestor, so that a service provider is not required to depart immediately or substantially immediately after the online to offline service system 100 receives the carpooling request.
  • a passenger may need to reserve a taxi carpooling service if the interval between the current time and the service time (e.g., the departure time) is longer than a threshold value, such as 20 minutes, 2 hours, or 1 day.
  • the origin and the request location may be same or different.
  • the first service requester may use the requester terminal 130 to send the first carpooling request for another person (e.g., a passenger) far away from the first service requester.
  • the origin may be the location of the passenger
  • the request location may be the location of the first service requester.
  • the origin and the request location may be different.
  • the first carpooling request may relate to a transportation service that needs to make an appointment.
  • the origin may be a departure location at the departure time of the reserved request
  • the request location may be the location of the first service requester at the current time.
  • the origin and the request location may be different.
  • the requester terminal 130 may transmit the first carpooling request to the server 110 via the network 120.
  • the server 110 may determine a pick-up location based on the origin.
  • the pick-up location may be a location where a service provider arrives to pick-up the passenger (s) of the first carpooling request.
  • the origin and the pick-up location may be same or different.
  • the server 110 may transmit the pick-up location to the requester terminal 130.
  • the requester terminal 130 may receive signals including state information and processing information of the first carpooling request from the server 110.
  • the signals may direct the requester terminal 130 to dynamically display and update the processing information and the state information.
  • the state information may be related to a state of determining at least one second carpooling request from a second service requester for carpooling with the first carpooling request.
  • the processing information may indicate an estimated waiting time of the first carpooling request. Dynamically displaying and updating the processing information of the first carpooling request may include displaying the processing information by counting down the processing information.
  • the estimated waiting time of the first carpooling request may include a first estimated time of waiting for determining a service provider for the first carpooling request and/or a second estimated time of waiting for departure.
  • the estimated waiting time may also include an estimated time of waiting for other time points, for example, a time point when a driver arrives at the origin or a pick-up location of the first carpooling request.
  • the first estimated time may indicate how long it will take to wait for the server 110 to start to determine a service provider for the first carpooling request.
  • the first estimated time may be a time period from a time point when the first service requester sends out the first carpooling request to a time point when the server 110 starts to determine a service provider for the first carpooling request.
  • the server 110 may determine a service provider for the first carpooling request 1 minute after the first service requester sends out the first carpooling request.
  • the first estimated time may be a time period from a time point when the server 110 receives the first carpooling request to a time point when the server 110 starts to determine a service provider for the first carpooling request.
  • the server 110 may determine a service provider for the first carpooling request 50 seconds after the server 110 receives the first carpooling request.
  • the first estimated time may be a time period from the current time to a time point when the server 110 starts to determine a service provider for the first carpooling request.
  • the second estimated time of the first service requester may indicate how long it will take to wait for departure.
  • the second estimated time may be a time period from a time point when the first service requester sends out the first carpooling request to the departure time.
  • the first service requester sends out the first carpooling request at 8: 10 a. m.
  • the requester terminal 130 e.g., the display 320
  • the second estimated time may be a time period from a time point when the server 110 receives the first carpooling request to the departure time.
  • the second estimated time may be a time period from the current time to the departure time.
  • the requester terminal 130 may display a time duration of the first estimated time and/or the second estimated time. For example, the requester terminal 130 may display that the server 110 will determine a service provider for the first carpooling request in 1 minute. As another example, the requester terminal 130 may display that the service provider will depart in 1 minute. In some embodiments, the requester terminal 130 may dynamically display the time duration of the first estimated time and/or the second estimated time in a way of counting down.
  • the requester terminal 130 may display an end time of the first estimated time (e.g., the time point when the server 110 starts to determine a service provider for the first carpooling request) and/or the second estimated time (e.g., the departure time) .
  • the requester terminal 130 may display that the server 110 will determine a service provider for the first carpooling request at 8: 15 a. m.
  • the requester terminal 130 may display that the service provider will depart at 8: 15 a. m.
  • the server 110 may periodically or aperiodically update the processing information of the first carpooling request and transmit the updated processing information to the requester terminal 130.
  • the server 110 may modify (e.g., prolong or reduce) the first estimated time and/or the second estimated time and transmit the modified first estimated time and/or second estimated time to the requester terminal 130 in real time.
  • users e.g., service providers and/or service requester
  • the server 110 may report road condition (e.g., report a traffic accident in a specific road) to the server 110 through the provider terminal 140 and/or the requester terminal 130. If the server 110 determines that a traffic accident occurs on the service provider’s way to the pick-up location of the first carpooling request based on the users’ reports, the server 110 may prolong the second estimated time from 5 minutes to 7 minutes.
  • the requester terminal 130 may replace the currently displayed processing information with the updated processing information transmitted from the server 110.
  • the original second estimated time is 5 minutes, and the requester terminal 130 displays that the service provider will depart at 8: 15 a. m.
  • the requester terminal 130 may update the second estimated time from 5 minutes to 7 minutes, and display that the service provider will depart at 8: 17 a. m.
  • the original second estimated time is 5 minutes
  • the requester terminal 130 dynamically displays the original second estimated time by performing a count-down from 5 minutes.
  • the requester terminal 130 receives an updated second estimated time of 7 minutes from the server 110.
  • the requester terminal 130 may update the left time from 1 minute to 3 minutes, and perform the count-down from 3 minutes.
  • the state information may include a count of times for identifying at least one candidate carpooling request used to determine the at least one second carpooling request carpooling with the first carpooling request, a count of identified candidate carpooling requests, identification information of the identified candidate carpooling requests, a matching degree between the at least one identified candidate carpooling request and the first carpooling request, or the like, or any combination thereof.
  • the matching degree reflects route compatibility between the first carpooling request and the at least one identified candidate carpooling request for carpooling.
  • the identification information of the identified candidate carpooling request may include a profile photo, identity (ID) information, or the like, or any combination thereof.
  • the requester terminal 130 may display that the server 110 has identified candidate carpooling requests for 5 times. As another example, the requester terminal 130 may display that 7 candidate carpooling requests have been identified. As still another example, the requester terminal 130 may display the profile photo of an identified candidate carpooling request and the route compatibility (e.g., 55%) between the first carpooling request and the identified candidate carpooling request for carpooling.
  • the route compatibility e.g., 55%) between the first carpooling request and the identified candidate carpooling request for carpooling.
  • the requester terminal 130 may dynamically display and update the state information.
  • the requester terminal 130 may display the latest state information.
  • the requester terminal 130 may display the latest count of times that the server 110 has identified at least one candidate carpooling request.
  • the requester terminal 130 may display that the server 110 has identified candidate carpooling requests for 5 times until a first time point.
  • the server 110 may transmit signals including the latest count of times (e.g., 6 times) for identifying at least one candidate carpooling request to the requester terminal 130.
  • the requester terminal 130 may update the state information and display that the server 110 has identified candidate carpooling requests for 6 times up to now.
  • the requester terminal 130 may display the latest count of identified candidate carpooling requests.
  • the requester terminal 130 may display that the server 110 has identified 7 candidate carpooling requests until a second time point. After the server 110 identifies the eighth candidate carpooling request, the server 110 may transmit signals including the latest count (e.g., 8) of identified candidate carpooling request to the requester terminal 130.
  • the requester terminal 130 may update the state information and display that the server 110 has identified 8 candidate carpooling requests up to now.
  • the requester terminal 130 may display the identification information and location information of the latest identified candidate carpooling request.
  • the requester terminal 130 may replace the candidate carpooling request that is currently displayed with a latest candidate carpooling request transmitted from the server 110.
  • the requester terminal 130 may display the profile photo, the location information, and the matching degree of 75%of identified candidate carpooling request A at a third time point.
  • the server 110 may transmit signals including the profile photo, the location information, and the matching degree of 82%of identified candidate carpooling request B to the requester terminal 130.
  • the requester terminal 130 may display the profile photo, the location information, and the matching degree of 82%of identified candidate carpooling request B at a fourth time point after the third time point, instead of identified candidate carpooling request A.
  • the server 110 may transmit signals including the profile photo, the location information, and the matching degree of 95%of identified candidate carpooling request C to the requester terminal 130.
  • the requester terminal 130 may display the profile photo, the location information, and the matching degree of 95%of identified candidate carpooling request C at a fifth time point after the fourth time point, instead of identified candidate carpooling request B.
  • the requester terminal 130 may compare the latest candidate carpooling request with the candidate carpooling requests that have been received by the requester terminal 130. The requester terminal 130 may determine whether to replace the candidate carpooling request that is currently displayed and which candidate carpooling request to be displayed based on the compare result.
  • the requester terminal 130 may display the identified candidate carpooling requests in loops.
  • the display sequence of the identified candidate carpooling requests in a loop may be any sequence.
  • the requester terminal 130 may display the identified candidate carpooling requests according to the identification time in a loop.
  • the server 110 may successively identify candidate carpooling requests A, B, and C.
  • the requester terminal 130 may display the 3 identified candidate carpooling requests in a sequence of A-B-C in a loop.
  • the requester terminal 130 may display the identified candidate carpooling requests according to the matching degree in a loop.
  • the server 110 may identify candidate carpooling requests A, B, and C, the matching degrees of which are 75%, 82%, and 95%, respectively.
  • the requester terminal 130 may display the 3 identified candidate carpooling requests in a sequence of C-B-Ain a loop.
  • the requester terminal 130 may randomly display the identified candidate carpooling requests in a loop.
  • the display sequence of the identified candidate carpooling requests in each loop may be same or different.
  • the requester terminal 130 may display the identified candidate carpooling requests according to the identification time in each loop.
  • the requester terminal 130 may display the identified candidate carpooling requests according to the identification time in a first loop, and the identified candidate carpooling requests according to the matching degree in a second loop.
  • the requester terminal 130 may display the identified candidate carpooling request with the highest matching degree.
  • the server 110 may identify candidate carpooling requests A, B, and C, the matching degrees of which are 75%, 82%, and 95%, respectively.
  • the requester terminal 130 may display the identified candidate carpooling request C.
  • the server 110 may still display identified candidate carpooling request C.
  • the requester terminal 130 may display the identified candidate carpooling request E instead of identified candidate carpooling request C.
  • the requester terminal 130 may display identified candidate carpooling request E together with identified candidate carpooling request E.
  • the requester terminal 130 may display the at least one second carpooling request until the first carpooling request is completed or canceled.
  • the process 400 may further include receiving and displaying provider information and location information of a service provider that accepts the first carpooling request. For example, when it is time to determine a service provider for the first carpooling request or the server 110 has determined at least one second carpooling request carpooling with the first carpooling request, the server 110 may determine a service provider for the first carpooling request.
  • the server 110 may transmit signals including provider information and location information of the service provider to the requester terminal 130, directing the requester terminal 130 to display the provider information (e.g., the plate number of a vehicle of the service provider, the vehicle type, the color of the vehicle, the phone number, the profile photo, the name, the favorable rate, etc. ) and the location information (e.g., the real-time location, the route to the pick-up location, etc. ) of the service provider.
  • the provider information e.g., the plate number of a vehicle of the service provider, the vehicle type, the color of the vehicle, the phone number, the profile photo, the name,
  • FIG. 5 is a schematic block diagram illustrating an exemplary device for informing a service requester of carpooling information according to some embodiments of the present disclosure.
  • the device 500 may be implemented on the requester terminal 130.
  • the device 500 may also be referred to as a system for informing a user of carpooling information.
  • the device 500 may include an obtaining module 510, a transmission module 520, a receiving module 530, and a display module 540.
  • the obtaining module 510 may be configured to obtain a first carpooling request from a first service requester (e.g., a passenger and/or a user) .
  • a first service requester e.g., a passenger and/or a user
  • the transmission module 520 may be configured to transmit the first carpooling request to the server 110.
  • the receiving module 530 may be configured to receive information (e.g., processing information and/or state information of the first carpooling request) from the server 110.
  • information e.g., processing information and/or state information of the first carpooling request
  • the display module 540 may be configured to dynamically display and update the processing information and the state information.
  • the state information may be related to a state of determining at least one second carpooling request from a second service requester carpooling with the first carpooling request.
  • the processing information may indicate an estimated waiting time of the first carpooling request.
  • the state information may include a count of times for identifying at least one candidate carpooling request used to determine the at least one second carpooling request carpooling with the first carpooling request, a count of identified candidate carpooling requests, identification information of the identified candidate carpooling requests, a matching degree between the at least one identified candidate carpooling request and the first carpooling request, or the like, or any combination thereof.
  • the matching degree reflects route compatibility between the first carpooling request and the at least one identified candidate carpooling request for carpooling.
  • the identification information of the identified candidate carpooling request may include a profile photo, identity (ID) information, or the like, or any combination thereof.
  • the estimated waiting time of the first carpooling request may include a first estimated time of waiting for determining a service provider for the first carpooling request and/or a second estimated time of waiting for departure.
  • the display module 540 may display the processing information by counting down the processing information.
  • the display module 540 may be further configured to display provider information and location information of a service provider that accepts the first carpooling request
  • the device 500 may include at least one processor and at least one storage.
  • the at least one storage may be configured to store computer instructions.
  • the at least one processor may be configured to execute at least a portion of the computer instructions to implement the process 400 for informing a user of carpooling information described in FIG. 4.
  • the present disclosure relates to a computer readable storage medium storing computer instructions, wherein when executed by one or more processors, the computer instructions may direct the one or more processors to perform the process 400 for informing a user of carpooling information described in FIG. 4.
  • modules described above may be software modules implemented by computer instructions.
  • FIG. 6 is a flowchart illustrating an exemplary process for informing a service requester of carpooling information according to some embodiments of the present disclosure.
  • the process 600 may be implemented in the online to offline service system 100 illustrated in FIG. 1.
  • the process 600 may be stored in a storage medium (e.g., the storage device 150, or the storage 220 of the server 110) as a form of instructions, and can be invoked and/or executed by the server 110 (e.g., the processor 210 of the server 110, or one or more modules in the server 110 illustrated in FIG. 7) .
  • the operations of the illustrated process 600 presented below are intended to be illustrative. In some embodiments, the process 600 may be accomplished with one or more additional operations not described, and/or without one or more of the operations discussed. Additionally, the order in which the operations of the process 600 as illustrated in FIG. 6 and described below is not intended to be limiting.
  • the server 110 may receive a first carpooling request from a terminal (e.g., the requester terminal 130) related to a first service requester (e.g., a passenger and/or a user) .
  • the first carpooling request may include an origin, a destination, a request time, a request location, a count of passengers, or the like, or any combination thereof.
  • the first carpooling request may further include a departure time, an arrival time, or the like, or any combination thereof.
  • the server 110 may determine at least one second carpooling request carpooling with the first carpooling request. In some embodiments, the server 110 may determine a pick-up location and/or a drop-off location for each carpooling request based on the origin of the carpooling request.
  • the pick-up location may be a location where a service provider arrives to pick-up the passenger (s) of the first carpooling request.
  • the origin and the pick-up location may be the same or different.
  • the drop-off location may be a location where the service provider drops off the passenger (s) of the first carpooling request.
  • the destination and the drop-off location may be same or different.
  • the server 110 may transmit the pick-up location and/or the drop-off location to the requester terminal 130.
  • the server 110 may determine a first navigation route from the pick-up location to the drop-off location of the first carpooling request.
  • the server 110 may determine a second navigation route from the pick-up location to the drop-off location of a candidate carpooling request.
  • the server 110 may determine the route compatibility between the first navigation route and the second navigation route by determining an overlap degree between the first navigation route and the second navigation route.
  • the server 110 may determine a candidate carpooling request related to the route compatibility that is greater than a compatibility threshold (e.g., 90%) as the second carpooling request to carpool with the first carpooling request.
  • a compatibility threshold e.g. 90%
  • the operation for determining at least one second carpooling request to carpool with the first carpooling request may be any suitable technology and will not be described in detail here.
  • the server 110 may transmit processing information and state information of the first carpooling request to the requester terminal 130 in real time via the network 120.
  • the server 110 may transmit signals including the processing information and the state information of the first carpooling request to the requester terminal 130 in real time, directing the requester terminal 130 to dynamically display and update the processing information and the state information.
  • the state information may be related to a state of determining at least one second carpooling request from a second service requester carpooling with the first service requester.
  • the processing information may indicate an estimated waiting time of the first carpooling request.
  • the estimated waiting time of the first carpooling request may include a first estimated time of waiting for determining a service provider for the first carpooling request and/or a second estimated time of waiting for departure. Details regarding the processing information may be found elsewhere in the present disclosure (e.g., the description in connection with FIG. 4) .
  • the second estimated time may be a constant value, such as 6 minutes.
  • the constant second estimated time may be default of the online to offline service system 100 or be set by an operator or engineer of the online to offline service system 100.
  • the second estimated time may be set by the first service requester through the requester terminal 130.
  • the server 110 may determine the second estimated time based on the pick-up location of the first carpooling request. Details regarding determining the second estimated time may be found elsewhere in the present disclosure (e.g., the description in connection with FIG. 8) .
  • the first estimated time may be a constant value, such as 1 minute.
  • the constant first estimated time may be default of the online to offline service system 100 or be set by an operator or engineer of the online to offline service system 100.
  • the first estimated time may be set by the first service requester through the requester terminal 130.
  • the server 110 may determine the first estimated time based on a supply-demand ratio related to the pick-up location and/or a distance between the pick-up location and the origin of the first carpooling request.
  • the supply-demand ratio related to the pick-up location refers to a ratio of a count of current available service providers in an area including the pick-up location to a count of current pending requests related to the area.
  • a service provider that is providing no service at present may be a current available service provider.
  • the service requester may also be a current available service provider.
  • a current pending request may be a request that has been made but not accepted by a service provider up to now and/or a carpooling request that has been accepted by a service provider but has not been combined with other carpooling requests up to now.
  • the current pending request related to the area refers to a current pending request the pick-up location of which is in the area.
  • the smaller the count of the current available service providers in the area (e.g., the smaller the supply-demand ratio is) is, the longer the first estimated time is.
  • the server 110 may determine that the first estimated time is 2 minutes.
  • the server 110 may determine that the first estimated time is 1 minute.
  • the area is a less-popular area with a supply-demand ratio greater than a supply-demand threshold (e.g., 2, 3, 4, 5, etc. )
  • the server 110 may determine that the first estimated time is 30 seconds.
  • the longer the distance between the pick-up location and the origin of the first carpooling request is, the longer time it takes the passenger (s) of the first carpooling request to arrive at the pick-up location, and the longer the first estimated time is.
  • the server 110 may determine the first estimated time based on the supply-demand ratio and the distance using machine learning.
  • the server 110 may obtain a plurality of historical carpooling requests.
  • the server 110 may obtain features of the historical carpooling requests, such as the first estimated times of the historical carpooling requests, the supply-demand ratios relating to the pick-up locations at the request times of the historical carpooling requests, and the distance between the pick-up locations and the origins of the historical carpooling requests.
  • the server 110 may train a machine learning model using the above features of the historical carpooling requests.
  • the server 110 may input, to the trained machine learning model, the supply-demand ratio related to the pick-up location and the distance between the pick-up location and the origin of the first carpooling request.
  • the trained machine learning model may output the first estimated time based on the input information.
  • the server 110 may periodically or aperiodically update the processing information of the first carpooling request based on a state of determining the at least one second carpooling request, a location of a service provider for the first carpooling request, road condition, or the like, or any combination thereof.
  • the server 110 may transmit the updated processing information to the requester terminal 130.
  • the server 110 may modify (e.g., prolong or reduce) the first estimated time and/or the second estimated time based on a state of determining the at least one second carpooling request, a location of a service provider for the first carpooling request, road condition, or the like, or any combination thereof.
  • the server 110 may transmit the modified first estimated time and/or second estimated time to the requester terminal 130 in real time.
  • users e.g., service providers and/or service requester
  • road condition e.g., report a traffic accident in a specific road
  • the server 110 may prolong the second estimated time from 5 minutes to 7 minutes.
  • the state information may include a count of times for identifying at least one candidate carpooling request used to determine the at least one second carpooling request to carpool with the first carpooling request, a count of identified candidate carpooling requests, identification information of the identified candidate carpooling requests, a matching degree between the at least one identified candidate carpooling request and the first carpooling request.
  • the matching degree reflects route compatibility between the first carpooling request and the at least one identified candidate carpooling request for carpooling.
  • the identification information of the identified candidate carpooling request may include a profile photo, identity (ID) information, or the like, or any combination thereof.
  • the purpose for transmitting the state information to the requester terminal 130 in real time is to inform the first service provider of the process for determining the at least one second carpooling request carpooling with the first carpooling request.
  • the server 110 may obtain a plurality of pending carpooling requests.
  • the pick-up locations or the current locations of the plurality of carpooling requests may be within a predetermined distance (e.g., 500 meters) away from the pick-up location of the first carpooling request.
  • the server 110 may determine a matching degree between the first carpooling request and the pending carpooling request.
  • the server 110 may determine the pending carpooling requests related to which the matching degree is greater than a first degree threshold (e.g., 70%) as candidate carpooling requests.
  • the server 110 may determine the candidate carpooling request related to which the matching degree is greater than a second degree threshold (e.g., 95%) as the second carpooling request. If the server 110 determines at least one second carpooling request in the first time, the server 110 may carpool the first carpooling request with one or more of the determined at least one second carpooling request, and transmit the one or more of the determined at least one second carpooling request to the requester terminal 130.
  • the server 110 may transmit, to the requester terminal 130, the candidate carpooling requests or a candidate carpooling request related to which the matching degree is highest among the candidate carpooling requests. Then the server 110 may identify candidate carpooling requests for the second time, by analogy, until the server 110 determines at least one second carpooling request. In the determination for identifying the candidate carpooling requests after the first time, the server 110 may expand the search scope for the pending carpooling requests and/or wait for new pending carpooling requests in the original search scope.
  • the server 110 may transmit information (e.g., identification information and/or location information) related to all of the new identified candidate carpooling requests at one time. In some embodiments, the server 110 may transmit information (e.g., identification information and/or location information) related to at least one of the new identified candidate carpooling requests at one time, the matching degree of which is highest among the new identified candidate carpooling requests. In some embodiments, the server 110 may transmit information (e.g., identification information and/or location information) related to at least one of the new identified candidate carpooling requests at one time, the matching degree of which is highest among the identified candidate carpooling requests up to now.
  • information e.g., identification information and/or location information
  • the server 110 may identify candidate carpooling request A in the first time.
  • the server 110 may transmit, to the requester terminal 130, the profile photo (e.g., obtained from the storage device 150 or the storage 220 of the server 110) , the location information (e.g., obtained from a terminal transmitting candidate carpooling request A) , and a matching degree of 75%of candidate carpooling request A.
  • the server 110 may identify candidate carpooling request B in the second time.
  • the server 110 may transmit, to the requester terminal 130, the profile photo, the location information, and a matching degree of 82%of candidate carpooling request B.
  • the server 110 may identify candidate carpooling request C in the third time.
  • the server 110 may transmit, to the requester terminal 130, the profile photo, the location information, and a matching degree of 95%of candidate carpooling request C.
  • the server 110 may carpool the first carpooling request with one or more of the determined at least one second carpooling request, and transmit the one or more of the determined at least one second carpooling request to the requester terminal 130.
  • the server 110 may terminate the process for determining at least one second carpooling request.
  • the server 110 may determine the at least one second carpooling request within the second estimated time.
  • the second estimated time may be the maximum duration for the server 110 to determine the at least one second carpooling request.
  • the second estimated time is not over at present.
  • the server 110 has not determined at least one second carpooling request when the service provider has picked up the passenger (s) of the first carpooling request at the pick-up location of the first carpooling request. In this case, the service provider will not depart, and the server 110 may continue the process for determining at least one second carpooling request. If the second estimated time is over, the service provider may depart, taking the passenger (s) of the first carpooling request, even though the server 110 has not determined at least one second carpooling request.
  • the process 600 may further include operations 604-607.
  • the server 110 may determine a service provider for the first carpooling request before the first estimated time is over and after the server 110 determines at least one second carpooling request. Alternatively, the server 110 may determine a service provider for the first carpooling request when the first estimated time is over.
  • the server 110 may not determine a service provider for the first carpooling request, and may continue the process for determining at least one second carpooling request.
  • the server 110 may determine a service provider for the combination trip of the first carpooling request and the at least one second carpooling request.
  • the server 110 may determine a service provider for the first carpooling request if the server 110 has not determined at least one second carpooling request when the first estimated time is over.
  • the operation for determining a service provider for the first carpooling request may be any suitable technology in the prior art, and will not be described here.
  • the server 110 may transmit provider information and location information of the service provider to the requester terminal 130 via the network 120.
  • the process 600 may further include operations 606-607.
  • the server 110 may obtain the location information of the service provider from a terminal (e.g., the provider terminal 140) related to the service provider via the network 120.
  • a terminal e.g., the provider terminal 140
  • the server 110 may transmit a departure instruction to the provider terminal 140 when one or more conditions are satisfied.
  • the one or more conditions may include that the second estimated time is over and/or the server 110 has determined at least one second carpooling request.
  • the server 110 may transmit the departure instruction to the provider terminal 140.
  • the server 110 may transmit the departure instruction to the provider terminal 140.
  • FIG. 7 is a schematic block diagram illustrating another exemplary device for informing a service requester of carpooling information according to some embodiments of the present disclosure.
  • the device 700 may be implemented on the server 110.
  • the device 700 may also be referred to as a system for informing a user of carpooling information.
  • the device 700 may include an obtaining module 710, a matching module 720, and a transmission module 730.
  • the obtaining module 710 may be configured to obtain a first carpooling request from a terminal (e.g., the requester terminal 130) related to a first service requester (e.g., a passenger and/or a user) .
  • a terminal e.g., the requester terminal 130
  • a first service requester e.g., a passenger and/or a user
  • the matching module 720 may be configured to determine at least one second carpooling request carpooling with the first carpooling request.
  • the transmission module 730 may be configured to transmit processing information and state information of the first carpooling request to the requester terminal 130 in real time via the network 120.
  • the transmission module 730 may transmit signals including the processing information and the state information of the first carpooling request to the requester terminal 130 in real time, directing the requester terminal 130 to dynamically display and update the processing information and the state information.
  • the state information may be related to a state of determining at least one second carpooling request from a second service requester carpooling with the first service requester.
  • the processing information may indicate at least an estimated waiting time of the first carpooling request.
  • the state information may include a count of times for identifying at least one candidate carpooling request used to determine the at least one second carpooling request to carpool with the first carpooling request, a count of identified candidate carpooling requests, identification information of the identified candidate carpooling requests, a matching degree between the at least one identified candidate carpooling request and the first carpooling request.
  • the matching degree reflects route compatibility between the first carpooling request and the at least one identified candidate carpooling request for carpooling.
  • the identification information of the identified candidate carpooling request may include a profile photo, identity (ID) information, or the like, or any combination thereof.
  • the estimated waiting time of the first carpooling request may include a first estimated time of waiting for determining a service provider for the first carpooling request and/or a second estimated time of waiting for departure.
  • the matching module 720 may determine the at least one second carpooling request in the second estimated time.
  • the device 700 may further include an assigning module (not shown in FIG. 7) , configured to determine a service provider for the first carpooling request before the first estimated time is over and after the server 110 determines the at least one second carpooling request, or determine a service provider for the first carpooling request when the first estimated time is over.
  • an assigning module (not shown in FIG. 7) , configured to determine a service provider for the first carpooling request before the first estimated time is over and after the server 110 determines the at least one second carpooling request, or determine a service provider for the first carpooling request when the first estimated time is over.
  • the transmission module 730 may be further configured to transmit provider information and location information of the service provider to the requester terminal 130.
  • the device 700 may further include a departure control module (not shown in FIG. 7) .
  • the departure control module may obtain the location information of the service provider.
  • the departure control module may transmit a departure instruction to the provider terminal 140 related to the service provider when one or more conditions are satisfied.
  • the one or more conditions may include that the second estimated time is over and/or the server 110 has determined at least one second carpooling request.
  • the first estimated time may be a constant value. In some embodiments, the first estimated time may be related to the pick-up location of the first carpooling request.
  • the first estimated time may be related to at least one of the supply-demand ratio related to the pick-up location of the first carpooling request and a distance between the pick-up location and the origin of the first carpooling request.
  • the supply-demand ratio related to the pick-up location refers to a ratio of a count of current available service providers in an area including the pick-up location to a count of current pending requests related to the area.
  • the second estimated time may be a constant value. In some embodiments, the second estimated time may be related to a carpooling scenario of the first carpooling request. Details regarding the process for determining the second estimated time may be found elsewhere in the present disclosure (e.g., the description in connection with FIG. 8) .
  • the device 700 may include at least one processor and at least one storage.
  • the at least one storage may be configured to store computer instructions.
  • the at least one processor may be configured to execute at least a portion of the computer instructions to implement the process 600 for informing a user of carpooling information described in FIG. 6.
  • the present disclosure relates to a computer readable storage medium storing computer instructions, wherein when executed by one or more processors, the computer instructions may direct the one or more processors to perform the process 600 for informing a user of carpooling information described in FIG. 6.
  • modules described above may be software modules implemented by computer instructions.
  • FIG. 8 is a flowchart illustrating an exemplary process for determining an estimated waiting time for departure according to some embodiments of the present disclosure.
  • the process 800 may be implemented in the online to offline service system 100 illustrated in FIG. 1.
  • the process 800 may be stored in a storage medium (e.g., the storage device 150, or the storage 220 of the server 110) as a form of instructions, and can be invoked and/or executed by the server 110 (e.g., the processor 210 of the server 110, or one or more modules in the server 110 illustrated in FIG. 7 and/or FIG. 8) .
  • the operations of the illustrated process 800 presented below are intended to be illustrative.
  • the process 800 may be accomplished with one or more additional operations not described, and/or without one or more of the operations discussed. Additionally, the order in which the operations of the process 800 as illustrated in FIG. 8 and described below is not intended to be limiting. In some embodiments, at least a portion (e.g., the determining of the second estimated time) of operation 603 of the process 600 may be performed based on the process 800.
  • the server 110 may receive a first carpooling request from a terminal (e.g., the requester terminal 130) related to a first service requester (e.g., a passenger and/or a user) .
  • the first carpooling request may include an origin, a destination, a request time, a request location, a count of passengers, or the like, or any combination thereof.
  • the first carpooling request may further include a departure time, an arrival time, or the like, or any combination thereof.
  • the server 110 may determine a second estimated time of waiting for departure based on the pick-up location of the first carpooling request.
  • the second estimated time may be the maximum duration for the server 110 to determine at least one second carpooling request carpooling with the first carpooling request.
  • the present disclosure provides two exemplary operations for determining the second estimated time based on the pick-up location of the first carpooling request.
  • the first operation may include determining a region including the pick-up location (S11) .
  • the server 110 may divide a city into a plurality of regions in advance. Taking Beijing as an example, Beijing may be divided into a plurality of administrative regions, such as Haidian district, Changping district, Shunyi district, etc. As another example, according to transportation, Beijing may be divided into a subway region, a railway station region, a bus station region, an airport region, etc. As a further example, according to function, Beijing may be divided into a residential area, a school district, a commercial district, a tourist area, etc.
  • the first operation may further include determining the second estimated time based on the region (S12) .
  • the server 110 may obtain the second estimated time for each region, respectively, in advance. In some embodiments, an operator and/or an engineer of the online to offline service system 100 may manually input the second estimated time for each region. In some embodiments, the server 110 may automatically determine the second estimated time for each region using, for example, machine learning. Merely by way of example, the server 110 may obtain a plurality of historical carpooling requests of which the pick-up locations are within the region in a prior time period (e.g., in the past ten days) . The historical carpooling request refers to a carpooling request that has been completed or canceled. The server 110 may train a machine learning model using the historical carpooling requests and determine the second estimated time of the region based on the trained model. As another example, the server 110 may determine the second estimated time by determining an average of the waiting time for departure of the plurality of historical carpooling requests.
  • Beijing may be divided into a plurality of administrative regions, such as Haidian district, Changping district, Shunyi district, etc.
  • the second estimated time of Haidian district may be 6 minutes.
  • the second estimated time of Changping district may be 5 minutes.
  • the second estimated time of Shunyi district may be 7 minutes.
  • the server 110 may determine that the pick-up location is located in Haidian district.
  • the server 110 may search for the predetermined second estimated times and determine that the second estimated time of Haidian district is 6 minutes.
  • Beijing may be divided into a subway region, a railway station region, a bus station region, an airport region, etc.
  • the second estimated time of the subway region may be 6 minutes.
  • the second estimated time of the railway station region may be 9 minutes.
  • the second estimated time of the airport region may be 15 minutes.
  • the second estimated time of the bus station region may be 10 minutes.
  • the server 110 may determine that the pick-up location is located in the railway station region.
  • the server 110 may search for the predetermined second estimated times and determine that the second estimated time of the railway station is 9 minutes.
  • the second estimated time may be a fixed value in one day, or may be adjustable depending on different situations in one day. For example, in rush hour (e.g., 7: 00 a. m. -9: 00 a. m. ) , the second estimated time may be relatively long (e.g., 10 minutes) because it may take a service provider and/or a service requester longer time to arrive at the pick-up location; whereas in other hours (e.g., 10: 00 a. m. -12: 00 a. m. ) , the second estimated time may be relatively short (e.g., 5 minutes) as the service provider and/or the service requester may need shorter time to arrive at the pick-up location.
  • rush hour e.g., 7: 00 a. m. -9: 00 a. m.
  • the second estimated time may be relatively long (e.g., 10 minutes) because it may take a service provider and/or a service requester longer time to arrive
  • the second estimated time may be updated at intervals (e.g., 10 minutes, 30 minutes, 1 hour, 1 day, 1 month, etc. ) .
  • the predetermined second estimated time may be stored in a storage medium (e.g., the storage device 150 and/or the storage 220 of the server 110) .
  • the second operation may include determining a passing rate, a success rate, a supply-demand ratio, and a response rate related to the pick-up location of the first carpooling request (S21) .
  • the pick-up locations of the first historical carpooling requests may be within a predetermined distance (e.g., 500 meters) away from the pick-up location of the first carpooling request.
  • the second historical carpooling requests may be included in the first historical carpooling requests.
  • the driving routes of the second historical carpooling requests may pass through the pick-up location of the first carpooling request.
  • the pick-up locations of the third historical carpooling requests may be same as the pick-up location of the first carpooling request.
  • the fourth historical carpooling requests may be included in the third historical carpooling requests.
  • the server 110 has successfully determine carpooling requests carpooling with the fourth historical carpooling requests.
  • the fifth historical carpooling requests may be included in the third historical carpooling requests.
  • the fifth historical carpooling requests have been accepted.
  • the passing rate, the success rate, the supply-demand ratio, and the response rate may be related to a period of time form a prior time point to the current time.
  • the request times of the first historical carpooling requests may be within 10 minutes immediately before the current time.
  • the passing rate, the success rate, the supply-demand ratio, and the response rate may be related to a future time period.
  • the server 110 may estimate the passing rate, the success rate, the supply-demand ratio, and the response rate.
  • the operation for estimating the passing rate, the success rate, the supply-demand ratio, and the response rate may be any suitable technology (e.g., machine learning) in the prior art, and will not be described here.
  • the second operation may further include determining a distance (p5) between the pick-up location and the origin of the first carpooling request (S22) .
  • the second operation may further include determining the second estimated time based on at least one of the passing rate, the success rate, the supply-demand rate, the response rate, and the distance between the pick-up location and the origin of the first carpooling request (S23) .
  • the server 110 may determine the second estimated time using machine learning.
  • the server 110 may obtain a plurality of historical carpooling requests.
  • the server 110 may obtain features of the historical carpooling requests.
  • the feature of the historical carpooling request may include the pick-up location, the passing rate, the success rate, the supply-demand rate, the response rate, the distance between the pick-up location and the origin, the waiting time for departure, the time for determining a request carpooling with the historical carpooling request, or the like, or any combination thereof.
  • the server 110 may train a machine learning model using the above features of the historical carpooling requests.
  • the server 110 may input, to the trained machine learning model, the pick-up location of the first carpooling request, the passing rate, the success rate, the supply-demand ratio, the response rate, or the distance between the pick-up location and the origin of the first carpooling request.
  • the trained machine learning model may output the second estimated time based on the input information.
  • the server 110 may determine the second estimated time based on the passing rate, the success rate, and the distance between the pick-up location and the origin of the first carpooling request.
  • the passing rate, the success rate, and the distance may correspond to different weights, respectively.
  • the weight corresponding to the passing rate (p1) may be w1.
  • the weight corresponding to the success rate (p2) may be w2.
  • the weight corresponding to the distance (p5) may be w3.
  • the server 110 may determine the second estimated time based on Equation (1) below:
  • T refers to the second estimated time
  • the passing rate (p1) or the success rate (p2) is larger, the possibility of successfully determining the at least one second carpooling request may be larger. So it makes sense to invest more time in determining the at least one second carpooling request, making the carpooling more likely to be successful. As a result, the server 110 may determine a longer second estimated time.
  • the server 110 may determine the second estimated time based on the supply-demand ratio and the response rate. For example, the server 110 may predetermine a plurality of carpooling scenarios based on the supply-demand and the response rate, such as an unbalanced scenario, a highly-hot scenario, a moderately-hot scenario, a less-popular scenario, or other scenario.
  • a plurality of carpooling scenarios based on the supply-demand and the response rate, such as an unbalanced scenario, a highly-hot scenario, a moderately-hot scenario, a less-popular scenario, or other scenario.
  • the carpooling scenario of the first carpooling request may be the unbalanced scenario.
  • the carpooling scenario of the first carpooling request may be the highly-hot scenario.
  • the carpooling scenario of the first carpooling request may be the moderately-hot scenario.
  • the carpooling scenario of the first carpooling request may be the less-popular scenario.
  • the carpooling scenario of the first carpooling request may be other scenario.
  • the first threshold, the third threshold, the fifth threshold, and the seventh threshold may increase in sequence.
  • the second threshold, the fourth threshold, the sixth threshold, and the eighth threshold may increase in sequence.
  • the second estimated time for each scenario may be set by an operator or engineer of the online to offline service system 100.
  • the server 110 may determine the second estimated time of a certain scenario by determining an average of the waiting times for departure of historical carpooling requests that belong to the certain scenario.
  • the server 110 may determine the second estimated time of each scenario using machine learning.
  • different carpooling scenarios may correspond to different second estimated times.
  • the second estimated time corresponding to the unbalance scenario may be t1
  • the second estimated time corresponding to the highly-hot scenario may be t2
  • the second estimated time corresponding to the moderately-hot scenario may be t3
  • the second estimated time corresponding to the less-popular scenario may be t4
  • the second estimated time corresponding to other scenario may be t5.
  • the server 110 may determine the carpooling scenario of the first carpooling request based on the supply-demand ratio (p3) and the response rate (p4) related to the pick-up location of the first carpooling request.
  • the server 110 may determine the second estimated time based on the carpooling scenario of the pick-up location of the first carpooling request. For example, when the server 110 determines that the carpooling scenario of the first carpooling request is the moderately-hot scenario, the server 110 may determine that the second estimated time is t3.
  • FIG. 9 is a schematic block diagram illustrating an exemplary device for determining an estimated waiting time for departure.
  • the device 900 may be implemented on the server 110.
  • the device 900 may also be referred to as a system for determining an estimated waiting time for departure.
  • the device 900 may include an obtaining module 910 and a determination module 920.
  • the obtaining module 910 may be configured to receive a first carpooling request from a terminal (e.g., the requester terminal 130) related to a first service requester (e.g., a passenger and/or a user) .
  • a terminal e.g., the requester terminal 130
  • a first service requester e.g., a passenger and/or a user
  • the determination module 920 may be configured to determine a second estimated time of waiting for departure based on a pick-up location of the first carpooling request.
  • the second estimated time may be the maximum duration for the server 110 to determine at least one second carpooling request carpooling with the first carpooling request.
  • the determination 920 may be further configured to determine a region including the pick-up location and determine the second estimated time based on the region.
  • the determination module 920 may be further configured to determine a passing rate, a success rate, a supply-demand ratio, and a response rate related to the pick-up location of the first carpooling request, determine a distance (p5) between the pick-up location and the origin of the first carpooling request, and determine the second estimated time based on at least one of the passing rate, the success rate, the supply-demand rate, the response rate, and the distance between the pick-up location and the origin of the first carpooling request.
  • the pick-up locations of the first historical carpooling requests may be within a predetermined distance (e.g., 500 meters) away from the pick-up location of the first carpooling request.
  • the second historical carpooling requests may be included in the first historical carpooling requests.
  • the driving routes of the second historical carpooling requests may pass through the pick-up location of the first carpooling request.
  • the pick-up locations of the third historical carpooling requests may be same as the pick-up location of the first carpooling request.
  • the fourth historical carpooling requests may be included in the third historical carpooling requests.
  • the server 110 has successfully determine carpooling requests carpooling with the fourth historical carpooling requests.
  • the fifth historical carpooling requests may be included in the third historical carpooling requests.
  • the fifth historical carpooling requests have been accepted.
  • the passing rate, the success rate, the supply-demand ratio, and the response rate may be related to a period of time form a prior time point to the current time.
  • the request times of the first historical carpooling requests may be within 10 minutes immediately before the current time.
  • the passing rate, the success rate, the supply-demand ratio, and the response rate may be related to a future time period.
  • the server 110 may estimate the passing rate, the success rate, the supply-demand ratio, and the response rate.
  • the device 900 may include at least one processor and at least one storage.
  • the at least one storage may be configured to store computer instructions.
  • the at least one processor may be configured to execute at least a portion of the computer instructions to implement the process 800 for informing a user of carpooling information described in FIG. 8.
  • the present disclosure relates to a computer readable storage medium storing computer instructions, wherein when executed by one or more processors, the computer instructions may direct the one or more processors to perform the process 800 for informing a user of carpooling information described in FIG. 8.
  • modules described above may be software modules implemented by computer instructions.
  • aspects of the present disclosure may be illustrated and described herein in any of a number of patentable classes or context including any new and useful process, machine, manufacture, or composition of matter, or any new and useful improvement thereof. Accordingly, aspects of the present disclosure may be implemented entirely hardware, entirely software (including firmware, resident software, micro-code, etc. ) or combining software and hardware implementation that may all generally be referred to herein as a “unit, ” “module, ” or “system. ” Furthermore, aspects of the present disclosure may take the form of a computer program product embodied in one or more computer readable media having computer readable program code embodied thereon.
  • a computer readable signal medium may include a propagated data signal with computer readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated signal may take any of a variety of forms, including electro-magnetic, optical, or the like, or any suitable combination thereof.
  • a computer readable signal medium may be any computer readable medium that is not a computer readable storage medium and that may communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device.
  • Program code embodied on a computer readable signal medium may be transmitted using any appropriate medium, including wireless, wireline, optical fiber cable, RF, or the like, or any suitable combination of the foregoing.
  • Computer program code for carrying out operations for aspects of the present disclosure may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, Scala, Smalltalk, Eiffel, JADE, Emerald, C++, C#, VB. NET, Python or the like, conventional procedural programming languages, such as the "C" programming language, Visual Basic, Fortran 2003, Perl, COBOL 2002, PHP, ABAP, dynamic programming languages such as Python, Ruby and Groovy, or other programming languages.
  • the program code may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server.
  • the remote computer may be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN) , or the connection may be made to an external computer (for example, through the Internet using an Internet Service Provider) or in a cloud computing environment or offered as a service such as a Software as a Service (SaaS) .
  • LAN local area network
  • WAN wide area network
  • SaaS Software as a Service

Landscapes

  • Business, Economics & Management (AREA)
  • Human Resources & Organizations (AREA)
  • Engineering & Computer Science (AREA)
  • Strategic Management (AREA)
  • Economics (AREA)
  • Tourism & Hospitality (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Marketing (AREA)
  • Physics & Mathematics (AREA)
  • General Business, Economics & Management (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Operations Research (AREA)
  • Quality & Reliability (AREA)
  • Development Economics (AREA)
  • Health & Medical Sciences (AREA)
  • Educational Administration (AREA)
  • Game Theory and Decision Science (AREA)
  • General Health & Medical Sciences (AREA)
  • Primary Health Care (AREA)
  • Data Mining & Analysis (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)
  • Traffic Control Systems (AREA)

Abstract

L'invention concerne un procédé destiné à informer un utilisateur d'informations de covoiturage dans un service en ligne vers hors ligne, pouvant comprendre l'obtention d'une première demande de covoiturage de la part d'un premier récepteur de service. Le procédé peut également comprendre l'envoi de la première demande de covoiturage à un serveur lié au service en ligne vers hors ligne. Le procédé peut également comprendre la réception de signaux comprenant des informations de traitement et informations d'état de la première demande de covoiturage en provenance du serveur en temps réel. Les informations de traitement peuvent inclure au moins un temps d'attente estimé pour la première demande de covoiturage. Les informations d'état peuvent se rapporter à un état de détermination de la ou des secondes demandes de covoiturage. Le procédé peut également comprendre l'affichage et la mise à jour dynamiques des informations de traitement et des informations d'état.
PCT/CN2019/088066 2018-05-23 2019-05-23 Procédés et systèmes pour informer un utilisateur d'informations de covoiturage WO2019223745A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201810502246.7A CN108764698A (zh) 2018-05-23 2018-05-23 一种拼车信息提示的方法及系统
CN201810502246.7 2018-05-23

Publications (1)

Publication Number Publication Date
WO2019223745A1 true WO2019223745A1 (fr) 2019-11-28

Family

ID=64005108

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2019/088066 WO2019223745A1 (fr) 2018-05-23 2019-05-23 Procédés et systèmes pour informer un utilisateur d'informations de covoiturage

Country Status (2)

Country Link
CN (1) CN108764698A (fr)
WO (1) WO2019223745A1 (fr)

Families Citing this family (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108764698A (zh) * 2018-05-23 2018-11-06 北京嘀嘀无限科技发展有限公司 一种拼车信息提示的方法及系统
CN111563638A (zh) * 2019-02-13 2020-08-21 北京嘀嘀无限科技发展有限公司 网约车请求处理方法及装置、服务器与存储介质
CN109948819A (zh) * 2019-03-29 2019-06-28 徐州蓝湖信息科技有限公司 一种基于区块链的拼车方法及装置
JP7188277B2 (ja) * 2019-05-28 2022-12-13 トヨタ自動車株式会社 情報処理装置、情報処理方法、及び情報処理プログラム
CN111858788A (zh) * 2019-11-26 2020-10-30 北京嘀嘀无限科技发展有限公司 一种拼车上车点的推荐方法和系统
CN111739329B (zh) * 2020-05-29 2021-11-02 腾讯科技（深圳）有限公司 行驶路线生成方法、装置、存储介质及服务器
CN111861650B (zh) * 2020-07-09 2024-09-10 北京嘀嘀无限科技发展有限公司 信息显示方法、第一服务请求端、系统及电子设备
CN111882384A (zh) * 2020-07-09 2020-11-03 北京嘀嘀无限科技发展有限公司 一种计时控制方法和系统
CN112561164B (zh) * 2020-12-16 2024-08-23 北京嘀嘀无限科技发展有限公司 拼车服务提供方法、装置及电子设备

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107798403A (zh) * 2016-09-07 2018-03-13 北京嘀嘀无限科技发展有限公司 一种拼车订单处理方法、服务器、终端设备和系统
CN107871172A (zh) * 2016-09-26 2018-04-03 北京嘀嘀无限科技发展有限公司 一种拼车方法及装置
CN108009651A (zh) * 2017-08-16 2018-05-08 北京嘀嘀无限科技发展有限公司 订单处理方法、装置、终端设备和计算机可读存储介质
CN108764698A (zh) * 2018-05-23 2018-11-06 北京嘀嘀无限科技发展有限公司 一种拼车信息提示的方法及系统

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103685504A (zh) * 2013-12-11 2014-03-26 南京大学 基于Android平台的拼车系统及其工作方法
CN104268664B (zh) * 2014-10-22 2017-11-10 浙江翼信科技有限公司 一种推荐拼车路线的方法及装置
CN107491825B (zh) * 2016-06-13 2021-07-16 北京嘀嘀无限科技发展有限公司 一种约车处理方法及系统
CN108009650A (zh) * 2017-03-29 2018-05-08 北京嘀嘀无限科技发展有限公司 网约车服务请求处理方法、装置和服务器

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107798403A (zh) * 2016-09-07 2018-03-13 北京嘀嘀无限科技发展有限公司 一种拼车订单处理方法、服务器、终端设备和系统
CN107871172A (zh) * 2016-09-26 2018-04-03 北京嘀嘀无限科技发展有限公司 一种拼车方法及装置
CN108009651A (zh) * 2017-08-16 2018-05-08 北京嘀嘀无限科技发展有限公司 订单处理方法、装置、终端设备和计算机可读存储介质
CN108764698A (zh) * 2018-05-23 2018-11-06 北京嘀嘀无限科技发展有限公司 一种拼车信息提示的方法及系统

Also Published As

Publication number Publication date
CN108764698A (zh) 2018-11-06

Similar Documents

Publication Publication Date Title
WO2019223745A1 (fr) Procédés et systèmes pour informer un utilisateur d'informations de covoiturage
AU2017101893A4 (en) Systems and methods for monitoring an on-demand service
AU2019246799B2 (en) Systems and methods for distributing a service request for an on-demand service
US11546729B2 (en) System and method for destination predicting
US11017662B2 (en) Systems and methods for determining a path of a moving device
US20200134767A1 (en) Systems and methods for transport capacity scheduling
WO2017202112A1 (fr) Systèmes et procédés de distribution de demandes de service
US20200042885A1 (en) Systems and methods for determining an estimated time of arrival
WO2018223952A1 (fr) Systèmes et procédés de division de région
US11468374B2 (en) Methods and systems for carpool services
US20200141741A1 (en) Systems and methods for determining recommended information of a service request
US20210049523A1 (en) Systems and methods for predicting destination in online to offline service
US20200158522A1 (en) Systems and methods for determining a new route in a map
WO2019196686A1 (fr) Procédés et systèmes de détermination de temps dans un service de covoiturage
US11640763B2 (en) Systems and methods for recommending a pickup location
WO2019241928A1 (fr) Procédés et systèmes permettant de régler la capacité de transport
WO2021035577A1 (fr) Systèmes et procédés d'identification de zones d'îlot dans un réseau routier
US20200090232A1 (en) Systems and methods for vehicle value evaluation
WO2020164161A1 (fr) Systèmes et procédés de détermination de temps d'arrivée estimé (eta)
WO2022087831A1 (fr) Systèmes et procédés de recommandation de points d'intérêt
WO2021114279A1 (fr) Systèmes et procédés pour déterminer un attribut de restriction d'une zone d'intérêt

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 19807248

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 19807248

Country of ref document: EP

Kind code of ref document: A1