US20210073934A1 - Systems and methods for providing cost-sharing transportation services - Google Patents

Systems and methods for providing cost-sharing transportation services Download PDF

Info

Publication number
US20210073934A1
US20210073934A1 US16/950,961 US202016950961A US2021073934A1 US 20210073934 A1 US20210073934 A1 US 20210073934A1 US 202016950961 A US202016950961 A US 202016950961A US 2021073934 A1 US2021073934 A1 US 2021073934A1
Authority
US
United States
Prior art keywords
service
requests
users
fulfill
location
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Abandoned
Application number
US16/950,961
Other languages
English (en)
Inventor
Aijing BAI
Yang Li
Bin Pan
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beijing Didi Infinity Technology and Development Co Ltd
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
Priority claimed from PCT/CN2018/116068 external-priority patent/WO2019109794A1/en
Application filed by Beijing Didi Infinity Technology and Development Co Ltd filed Critical Beijing Didi Infinity Technology and Development Co Ltd
Publication of US20210073934A1 publication Critical patent/US20210073934A1/en
Abandoned legal-status Critical Current

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
    • G06Q50/30—
    • 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
    • G06Q30/00—Commerce
    • G06Q30/02—Marketing; Price estimation or determination; Fundraising
    • G06Q30/0201—Market modelling; Market analysis; Collecting market data
    • 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/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
    • G06Q10/047—Optimisation of routes or paths, e.g. travelling salesman problem
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q20/00—Payment architectures, schemes or protocols
    • G06Q20/30—Payment architectures, schemes or protocols characterised by the use of specific devices or networks
    • G06Q20/32—Payment architectures, schemes or protocols characterised by the use of specific devices or networks using wireless devices
    • G06Q20/325—Payment architectures, schemes or protocols characterised by the use of specific devices or networks using wireless devices using wireless networks
    • G—PHYSICS
    • G08—SIGNALLING
    • G08G—TRAFFIC CONTROL SYSTEMS
    • G08G1/00—Traffic control systems for road vehicles
    • G08G1/20—Monitoring the location of vehicles belonging to a group, e.g. fleet of vehicles, countable or determined number of vehicles
    • G08G1/202—Dispatching vehicles on the basis of a location, e.g. taxi dispatching
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
    • H04W4/02—Services making use of location information
    • H04W4/023—Services making use of location information using mutual or relative location information between multiple location based services [LBS] targets or of distance thresholds
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
    • H04W4/02—Services making use of location information
    • H04W4/025—Services making use of location information using location based information parameters
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
    • H04W4/02—Services making use of location information
    • H04W4/029—Location-based management or tracking services

Definitions

  • the present disclosure relates to providing transportation services, and more particularly, to systems and methods for providing cost-sharing transportation services using an online platform.
  • An online hailing platform (e.g., DiDiTM online) can receive a ride-hailing service request from a passenger and then route the service request to at least one transportation service provider (e.g., a taxi driver, a private car owner, or the like).
  • the service request can be answered by a service provider or assigned to a service provider if no one picks up the service request within a predetermined time period.
  • Embodiments of the present disclosure provide methods and systems that address the aforementioned shortcomings.
  • Embodiments of the disclosure provide a system for providing a cost-sharing transportation service.
  • the system may include a memory storing computer-readable instructions and at least one processor coupled to the memory.
  • the instructions stored on the memory when executed by the at least one processor, may cause the processor to perform operations.
  • the operations may include receiving first and second requests for a cost-sharing option of the transportation service from first and second users, respectively.
  • the operations may also include determining whether to fulfill the first and second requests using a same service vehicle shared by the first and second users.
  • the operations include combining the first and second requests into a combined request, sending the combined request to one or more service providers, and locating a service provider to fulfill the combined request.
  • Embodiments of the disclosure further disclose a computer-implemented method for providing a cost-sharing transportation service.
  • the method may include receiving first and second requests for a cost-sharing option of the transportation service from first and second users, respectively.
  • the method also includes determining whether to fulfill the first and second requests using a same service vehicle shared by the first and second users.
  • the method includes combining the first and second requests into a combined request, sending the combined request to one or more service providers, and locating a service provider to fulfill the combined request.
  • Embodiments of the disclosure further disclose a non-transitory computer-readable medium.
  • the non-transitory computer-readable medium may store a set of instructions, when executed by at least one processor of an electronic device, cause the electronic device to perform a method for providing a cost-sharing transportation service.
  • the method may include receiving first and second requests for a cost-sharing option of the transportation service from first and second users, respectively.
  • the method also includes determining whether to the first and second requests using a same service vehicle shared by the first and second users.
  • the method includes combining the first and second requests into a combined request, sending the combined request to one or more service providers, and locating a service provider to fulfill the combined request.
  • FIG. 1 illustrates an exemplary system for providing a cost-sharing transportation service, according to embodiments of the disclosure.
  • FIG. 2 illustrates a block diagram of an exemplary terminal device configured to provide a cost-sharing transportation service, according to embodiments of the disclosure.
  • FIG. 3 illustrates a block diagram of an exemplary server configured to provide a cost-sharing transportation service, according to embodiments of the disclosure.
  • FIG. 4 illustrates a flowchart of an exemplary method for provide a cost-sharing transportation service, according to embodiments of the disclosure.
  • FIGS. 5A-5G are exemplary interfaces showing various stages of providing a cost-sharing transportation service, according to embodiments of the disclosure.
  • Embodiments of the disclosure provide systems and methods for providing cost-sharing transportation services.
  • a cost-sharing transportation service may reward passengers' sharing of a transportation vehicle by splitting the cost among co-riders.
  • the cost-sharing service may be provided as an option to a user in addition to regular transportation services.
  • the cost-sharing service may also be referred to as a cost-sharing option, a cost-saving service/option, a carpooling service/option, a carpool service/option, or similar terms.
  • Embodiments of the disclosure provide a streamlined solution for a service provider (e.g., a driver) to take multiple cost-sharing orders.
  • a service provider e.g., a driver
  • embodiments of the present disclosure allow a service provider to accept multiple cost-sharing service requests from co-riders with a single acceptance action by combining the multiple service requests into a combined service request and presenting the combined service request to the driver.
  • the service provider would be able to accept multiple cost-sharing service requests as if there is a single request, significantly shortening the order acceptance time on the driver's side.
  • multiple co-riders need to be pooled together first, allowing calculation of the total ride fare the driver would expect to earn.
  • the total fare information may then be communicated to the driver before the driver accepts the combined service request, providing assurance to the driver that the cost-sharing service would be fairly compensated. Therefore, embodiments of the present disclosure may improve drivers' participant rate in the cost-sharing service.
  • exemplary systems and methods may be implemented as part of an online ride-hailing service (also referred to as an online ride-sharing service), where a driver provides transportation service to one or more passengers using a service vehicle.
  • a driver provides transportation service to one or more passengers using a service vehicle.
  • the driver and one or more passengers may communicate using terminal devices, such as mobile phones, wearable devices, PDAs, etc.
  • the online ride-hailing service may be provided via a service platform that facilitates communications among the terminal devices and between the terminal devices and a server.
  • FIG. 1 illustrates an exemplary system 100 for providing a cost-sharing transportation service.
  • a user 102 may use a terminal device 112 to request a transportation service.
  • terminal device 112 may have a service application installed thereon to display a user interface that allows user 102 to input information pertinent to the transportation service.
  • the request may include information of an origin location 126 and a destination location 132 .
  • origin location 126 may or may not be the same as user 102 's current physical location 122 . Further, origin location 126 may or may not be the same as pick-up location 124 .
  • user 102 may be provided with a cost-sharing option before inputting the origin/destination location information.
  • the origin location may indicate the location where user 102 uses as the “from” location for a transportation service.
  • user 102 may input the address of the origin location through the service application installed on terminal device 112 .
  • User 102 may also manipulate a map shown on a user interface displayed by terminal device 112 to indicate the origin location 126 on the map.
  • origin location 126 may be depicted, by an indicator, such as a pin, on the map. User 102 may “drag” the pin or the map to change the position of the pin on the map.
  • the transportation service request may be sent from terminal device 112 to a server 172 through a communication link 162 .
  • Server 172 may be provided in a cloud computing environment 170 (referred herein as “cloud 170 ” for simplicity).
  • Communication link 162 may include any suitable communication channels, such as a wireless communication channel via a suitable network.
  • server 172 may determine whether a cost-sharing option is available based on the origin and/or destination location of user 102 .
  • the cost-sharing transportation service may be available in specific geographical areas, such as cities, counties, towns, metropolitan areas, etc. In such embodiments, server 172 may determine if the origin and/or destination falls within a predetermined geographical area that offers the cost-sharing service. After determining that the cost-sharing service is available, server 172 may provide the cost-sharing option to user 102 .
  • the cost-sharing option may be provided as default transportation service option to user 102 in an area where the cost-sharing service is available.
  • the cost-sharing option may be accompanied by a price.
  • the price may include a discount compared to the regular price to reflect the cost-sharing feature.
  • the price may be fixed, regardless of whether actual sharing of service vehicle occurs.
  • Terminal device 112 may receive input from user 102 indicating a selection of the cost-sharing option. For example, user 102 may select the cost-sharing option via the user interface displayed on a screen of terminal device 112 . In some embodiments, user 102 may be provided with a user interface requesting confirmation of the number of seats needed. For example, a default number of one seat and a maximum number of two seats may be implemented.
  • server 172 may search for a second user associated with the cost-sharing option.
  • the second user may be a co-rider (e.g., user 106 ) who may share service vehicle 110 with user 102 .
  • server 172 may broadcast the transportation service request to potential co-riders close to the current location of user 102 or the origin location 126 .
  • a co-rider may join user 102 to share service vehicle 110 .
  • server 172 may search for co-riders to share service vehicle 110 with user 102 .
  • server 172 may search for co-riders that are located near the current location of user 102 and instruct the co-rider(s) to meet service provider 104 at pick-up location 124 or another pick-up location.
  • user 106 may be such a co-rider.
  • User 106 may use a terminal device 116 to request a transportation service to destination 136 . Similar to the case of user 102 , the request may be sent to server 172 via a communication link 166 .
  • Server 172 may match user 106 to user 102 based on their destinations ( 132 and 136 ), routes to the destinations, gender, available payment method(s), or other suitable factors.
  • a navigation route 146 may be provided to user 106 to meet service provider 104 and co-rider 102 .
  • information of user 106 may be provided to user 102 to indicate that an available co-rider is found.
  • server 172 may search for more than one co-rider (e.g., two or more co-riders) to share service vehicle 110 with user 102 .
  • server 172 may search for each co-rider using a similar method as described above, and may wait until a predetermined number of co-riders are found before requesting the transportation service.
  • server 172 may combine all individual requests made by all co-riders (e.g., three or more co-riders including user 102 ) into a combined request, and send the combined request to one or more service providers.
  • server 172 send the request made by user 102 to one or more service providers. In other words, even if user 102 is willing to share a service vehicle with other users, server 172 may prevent from letting user 102 to wait for a co-rider indefinitely. A maximal waiting period may be set, after which the request may be sent to service providers regardless of whether a co-rider is located.
  • server 172 may search for co-rider(s) that are on the way to one or more destinations of current rider(s) who would share the same service vehicle.
  • user 108 may be such a candidate co-rider who is not located close to the departure location of user 102 , but is near a navigation route 152 leading to user 102 's destination 132 .
  • User 108 may use a terminal device 118 to communicate with server 172 via a communication link 168 , similar to the case of user 102 .
  • System 100 may match user 108 to user 102 as a co-rider and may instruct service provider 104 to take a detour 154 to pick up user 108 on the way to user 102 's destination 132 .
  • searching for co-rider(s) may be continuous throughout the service trip, as long as there is at least one available seat on the shared service vehicle. In some embodiments, searching for co-rider(s) may be resumed after at least one seat becomes available as a result of leaving of a co-rider (e.g., arriving at the co-rider's destination). In some embodiments, there may be a maximum number of permitted stops the shared service vehicle can take during the entire service trip. For example, there may be a maximum of three stops experienced by user 102 along the way for pick-up and drop-off purposes. In some embodiments, after user 102 is within a predetermined distance to destination 132 , no additional pick-up of co-rider(s) may be permitted.
  • the ratio between the distant to destination 132 and the total distance of the ride may be used as an indicator whether picking-up a new co-rider is permitted. If the ratio is below a predetermined value (e.g., user 102 is close to arrive destination 132 ), then no additional pick-ups may be allowed.
  • a predetermined value e.g., user 102 is close to arrive destination 132
  • server 172 may provide user 102 other co-riders' destinations when such destinations are on the way to user 102 's destination 132 .
  • a co-rider's destination may be at location 136 that is along the way to user 102 's destination 132 .
  • Destination 136 may be depicted on a navigation map shown on a display of terminal device 112 .
  • destination 136 may be slightly off route 152 and service vehicle 110 may take a detour 156 to drop off a co-rider at destination 136 .
  • a co-rider's destination 138 may be beyond user 102 's destination 132 . In this case, destination 138 may not be provided to user 102 .
  • Service vehicle 110 may continue along a route 158 to drop off a co-rider after completing the service trip along route 152 .
  • multiple users may submit cost-sharing service requests individually, and system 100 may combine multiple requests into a combine request after system 100 determines that the multiple users can share a single service vehicle to their destination locations.
  • user 102 may submit a cost-sharing service request to server 172 requesting a ride to destination location 132 .
  • User 106 may also submit a cost-sharing service request to server 172 requesting a ride to destination location 136 . Both requests may contain information of the respective destination locations, origin locations, the number of requested seats, etc.
  • Server 172 may determine if users 102 and 106 can be pooled together to fulfill their requests.
  • server 172 may determine if the destination locations requested by users 102 and 106 are close to each other (e.g., if the distance between the two destination locations is below a predetermined threshold or the driving time between the two destination locations is below a predetermined threshold), or if the routes to the two destination locations are sufficiently overlapping with each other. Other methods can also be used to determine whether users 102 and 106 can be pooled together to share a single service vehicle.
  • server 172 may combine the cost-sharing requests submitted by users 102 and 104 to generate a combined request. For example, server 172 may determine a service route (e.g., 152 , 156 ) to fulfill the submitted requests using the same service vehicle. Server 172 may also determine a total ride fare to be collected from users 102 and 106 . For example, users 102 and 106 may each be provided with a discounted rate before submitting their respective requests. Server 172 may sum up these individual rates as the total ride fare to be collected from users 102 and 106 . The total ride fare, or information thereof, can be provided to service providers along with the combined request.
  • a service route e.g., 152 , 156
  • Server 172 may also determine a total ride fare to be collected from users 102 and 106 . For example, users 102 and 106 may each be provided with a discounted rate before submitting their respective requests. Server 172 may sum up these individual rates as the total ride fare to be collected from users 102 and 106
  • server 172 may determine a pick-up location (e.g. 124 ) for picking up user 102 and/or user 106 .
  • the pick-up location can be used to locate a server provider to provide the transportation service.
  • the pick-up location may be determined based on locations of the user and second users by optimizing an average distance between the locations of first and second users and the pick-up location.
  • pick-up location 124 may be selected between users 102 and 106 to allow both users meet at a middle point between their current locations.
  • Pick-up location 124 may also be determined based on historical data, traffic conditions, or other factors.
  • server 172 may determine an address or point of interest corresponding to pick-up location 124 for providing to the service provider.
  • server 172 may communicate the combined service request to one or more service providers.
  • server 172 may communicate with terminal device 114 of service provider 104 via communication link 164 , which may be similar to communication link 162 .
  • server 172 may broadcast the combined request to one or more service providers close to pick-up point 124 . Information of the pick-up location and total ride fare may also be broadcast together with the combined request.
  • a service provider 104 may accept the combined request to provide the transportation service using a service vehicle 110 .
  • Server 172 may also match the combined request to service provider 104 and assign the transportation service to service provider 104 .
  • terminal device 114 may provide information of service vehicle 110 and/or service provider 104 to server 172 , such as the current location of service vehicle 110 , whether service vehicle 110 is currently providing transportation service to other user(s), and if so, the destination or route of the current service ride.
  • Server 172 may determine pick-up location 124 based on the information of service vehicle 110 , service provider 104 , user 102 , location 122 , pick-up area 120 , etc. For example, server 172 may determine pick-up location 124 to balance the driving distance for service provider 104 and the walking distance for user 102 , In some embodiments, server 172 may recommend several candidate pick-up locations for user 102 / 106 to choose from.
  • User 102 / 106 may select a pick-up location from the candidates and send the selection to server 172 .
  • server 172 may provide information of the pick-up location to user 102 / 106 and service provider 104 ,
  • pick-up location 124 may be in a form of geographical coordinate on a map, and server 172 may determine the corresponding address, landmark, or point of interest (POT) based on the geographical coordinate, and provide the user-friendly address, landmark, or POI name to user 102 / 106 and service provider 104 .
  • POT point of interest
  • Navigation routes such as a walking route 142 from user 102 's currently location 122 to pick-up location 124 and a driving route 144 from the current location of service vehicle to pick-up location 124 may be provided to user 102 / 106 and service provider 104 , respectively.
  • FIG. 2 is a block diagram depicting an exemplary terminal device 200 , according to embodiments of the disclosure.
  • Terminal device 200 may include any suitable device that can display information to a user, e.g., a smart phone, a tablet, a wearable device, a computer, or the like.
  • terminal device 200 may be a driver terminal (e.g., terminal device 114 ) used by the transportation service provider 104 .
  • terminal device 200 may be a passenger terminal (e.g., terminal device 112 , 116 , or 118 ) used by the passenger requesting the transportation service or may be a driver terminal (e.g., terminal device 114 ) used by the driver accepting transportation service requests. Description of terminal device 200 will be made using a driver terminal as an example.
  • terminal device 200 may include a communication interface 204 , a processor 206 , a memory/storage device 208 , and a display 210 .
  • Communication interface 204 may include an integrated services digital network (ISDN) card, cable modem, satellite modem, or a modem to provide a data communication connection.
  • ISDN integrated services digital network
  • communication interface 204 may include a local area network (LAN) card to provide a data communication connection to a compatible LAN.
  • LAN local area network
  • Wireless links can also be implemented by communication interface 204 .
  • communication interface 204 can send and receive electrical, electromagnetic or optical signals that carry digital data streams representing various types of information via a network.
  • the network can typically include a cellular communication network, a Wireless Local Area Network (WLAN), a Wide Area Network (WAN), or the like.
  • WLAN Wireless Local Area Network
  • WAN Wide Area Network
  • Communication interface 204 may be configured to receive a transportation service request.
  • Transportation service request may include, among other things, passenger information, a trip origin, a trip destination, or the like. The transportation service request may be accepted by or otherwise matched with a service vehicle (e.g., service vehicle 110 ).
  • Communication interface 204 may be configured to receive passenger information from server 172 or directly from a passenger terminal (e.g., terminal device 112 ) associated with a passenger (e.g., passenger 102 ).
  • Service vehicles may include taxi cars or private cars enrolled with an online hailing platform. In some embodiments, service vehicles may also include autonomous driving vehicles.
  • Communication interface 204 may also be configured to send vehicle information and service provider information to server 172 .
  • the online hailing platform may maintain a database for storing profiles for the enrolled vehicles and the associated drivers.
  • Vehicle information may include, e.g., vehicle position, vehicle year, maker, and model, as well as other features or characteristics associated with the service vehicle.
  • Driver information may include, e.g., driver's name, picture, or other identification information, driver's license number, driving record, driver's customer reviews.
  • Communication interface 104 may also receive navigation information, e.g., current position of the passenger, pick-up location, traffic data, map data, etc.
  • communication interface 204 may be configured to receive other data from server 172 , such as map data, real-time traffic information, weather information, road blocking information, etc.
  • the updates may be received periodically, e.g., every 0.1 second, every second, every 5 seconds, or upon an update request.
  • Communication interface 204 may be configured to receive cost-sharing service information from server 172 .
  • communication interface 204 may receive pricing information, pick-up location information, rider and/or co-rider information, destination information, etc., from server 172 .
  • Processor 206 may include any appropriate type of general-purpose or special-purpose microprocessor, digital signal processor, or microcontroller. Processor 206 may be configured as a separate processor module dedicated to providing transportation service, including coordinating driver and rider(s), rendering map and providing navigation information. Alternatively, processor 206 may be configured as a shared processor module for performing other functions unrelated to transportation service. Processor 206 may include one or more hardware units (e.g., portion(s) of an integrated circuit) designed for use with other components or to execute part of a program. The program may be stored on a computer-readable medium, and when executed by processor 206 , it may perform one or more functions related to transportation service provision.
  • processor 206 may include any appropriate type of general-purpose or special-purpose microprocessor, digital signal processor, or microcontroller. Processor 206 may be configured as a separate processor module dedicated to providing transportation service, including coordinating driver and rider(s), rendering map and providing navigation information. Alternatively, processor 206 may be configured as a shared processor module for performing other functions un
  • Memory/storage device 208 may include any appropriate type of mass storage provided to store any type of information that processor 206 may process.
  • Memory/storage device 208 may be a volatile or non-volatile, magnetic, semiconductor-based, tape-based, optical, removable, non-removable, or other type of storage device or tangible (i.e., non-transitory) computer-readable medium including, but not limited to, a ROM, a flash memory, a dynamic RAM, and a static RAM.
  • Memory/storage device 208 may be configured to store one or more computer programs that may be executed by processor 206 to provide transportation service, including coordinating driver and rider(s), rending map, and providing navigation information.
  • memory/storage device 208 may be configured to store program(s) that may be executed by processor 206 to providing cost-sharing transportation services.
  • Memory/storage device 208 may be further configured to store information and data used by processor 206 .
  • memory/storage device 208 may be configured to store the various types of data (e.g., transportation service request, vehicle information, driver information, updated trip information, map data, traffic data, cost-sharing information, etc.).
  • Memory/storage device 208 may also store intermediate data such as rendered map portions, navigation routes, size and shape of the elements displayed in the display region, etc.
  • the various types of data may be stored permanently, removed periodically, or disregarded immediately after each frame of data is processed.
  • Display 110 may include a display such as a Liquid. Crystal Display (LCD), a Light Emitting Diode Display (LED), a plasma display, or any other type of display, and provide a Graphical User Interface (GUI) presented on the display for user input and data depiction.
  • the display may include a number of different types of materials, such as plastic or glass, and may be touch-sensitive to receive inputs from the user.
  • the display may include a touch-sensitive material that is substantially rigid, such as Gorilla GlassTM, or substantially pliable, such as Willow GlassTM.
  • FIG. 3 is a block diagram of an exemplary server 172 , consistent with some embodiments.
  • Server 172 may include a communication interface 304 , which may be similar to communication interface 204 , with design features focused on server usage, such as high through-put, high availability, and high reliability.
  • communication interface 304 may receive transportation service requests from terminal devices 112 , 116 , and/or 118 , and send service matching information to terminal 114 and/or cost-sharing matching information to terminal device 116 and/or 118 .
  • communication interface 304 may send pick-up location information and/or navigation route information to terminal devices 112 , 114 , 116 , and/or 118 .
  • communication interface 304 may send combined cost-sharing service requests to driver terminal 114 .
  • Server 172 may also include at least one processor 306 .
  • Processor 306 may be any suitable type of processor, and may be similar to processor 206 but with design features focused on server usage, such as high speed, multi-core, low latency, high reliability, high availability, and the ability to conduct parallel computing.
  • Processor 306 may process the service requests received by communication interface 304 and determine the matching service vehicle(s) to fulfil the requests.
  • Processor 306 may also determine co-riders to share the same service vehicle to save on cost. In some embodiments, processor 306 may determine the proper price for the cost-sharing option depending on factors such as demand-supply, historical pricing information, time of day, probability of success, etc.
  • Server 172 may further include a memory/storage device 308 , which may include any types of mass storage devices.
  • Memory/storage device 308 may be similar to memory/storage device 208 , but with design features focused on server usage, such as high capacity, high through-out, high reliability, high availability, high speed, etc.
  • FIG. 4 illustrates a flowchart of an exemplary method 400 for providing a cost-sharing transportation service.
  • Method 400 may be implemented by terminal device 114 , by server 172 , or jointly by the terminal device and server. It is contemplated that any step of method 400 can be performed by processor 206 alone, by processor 306 alone, or jointly by processors 206 and 306 . In the following, processor 306 is used as an example in describing the steps of method 400 .
  • Method 400 may include multiple steps, as described below. It is to be appreciated that some of the steps may be optional to perform the embodiments provided herein. Further, some of the steps may be performed simultaneously, or in a different order than shown in FIG. 4 .
  • processor 306 may receive first and second requests for a cost-sharing option of a transportation service from first and second users, respectively.
  • processor 306 may receive the first request from user 102 and the second request from user 106 .
  • uses 102 and 106 may individually submit their respectively cost-sharing transportation service requests to server 172 .
  • Each request may include a destination location (e.g., 132 / 136 ) and an origin location (e.g., 126 ), and may be accompanied by a price for the requested service.
  • the price may be a per-user price, discounted for each individual user to account for each user's willingness to share a service vehicle with other co-rider(s).
  • the total ride fare a service provider expects to collect may be based on the summation of all individual prices.
  • the total ride fare may be higher than, for example, the ride fare a service provider would collect for servicing any individual user for a similar ride without the cost-sharing option to encourage the service provider to participate in the cost-sharing option.
  • a service provider may receive a higher compensation if he/she accepts a cost-sharing service request to collect multiple ride fares from multiple passengers, than to provide a regular, non-cost-sharing transportation service to a single passenger (or multiple passengers paying a single ride fare) for a similar ride.
  • processor 306 may determine whether to fulfill the first and second requests using a same service vehicle shared by the first and second users. For example, processor 306 may make the determination based on one or more factors, such as the distance or driving time between the destination locations, the degree of overlapping between individual routes to the respective destination locations, gender difference between co-riders, available payment method(s), or other suitable factors. In some embodiments, processor 306 may determine to fulfill the first and second requests using the same service vehicle shared by the first and second users when a distance between the destination locations of the first and second users is below a predetermined threshold. For example, as shown in FIG.
  • processor 306 may determine the distance between destination locations 132 (user 102 's destination location) and 136 (user 106 's destination location) and compare the distance with a predetermine threshold (e.g., 1 km, 2 km, 5 km, etc.). If the distance is below the predetermined threshold, then processor 306 may determine that users 102 and 106 may share the same service vehicle.
  • a predetermine threshold e.g. 1 km, 2 km, 5 km, etc.
  • processor 306 may determine to fulfill the first and second requests using the same service vehicle shared by the first and second users when a driving time between the first and second destination locations is below a predetermined threshold. For example, as shown in FIG. 1 , processor 306 may determine the driving time from destination location 136 to destination location 132 (e.g., when destination location 132 is farther away from destination location 136 ) and compare the driving time with a predetermine threshold (e.g., 5 mins, 10 mins, 15 mins, etc.). If the driving time is below the predetermined threshold, then processor 306 may determine that users 102 and 106 may share the same service vehicle. In some embodiments, the driving time may be estimated based on the distance between the two destination locations, the driving speed of the service vehicle, the traffic conditions, and/or historical data.
  • a predetermine threshold e.g., 5 mins, 10 mins, 15 mins, etc.
  • processor 306 may determine to fulfill the first and second requests using the same service vehicle shared by the first and second users when individual routes to the respective destination locations of the first and second users are sufficiently overlapping. For example, referring to FIG. 1 , processor 306 may determine a first route to destination 132 (e.g., 152 ) and a second route to destination 136 (e.g., part of 152 and part of 156 ). Processor 306 may then determine a degree of overlapping between the two routes. In this case, the two routes overlap with each other for most of the entire length. Processor 306 may then compare the degree of overlapping with a predetermined threshold, such as 70%, 80%, 90%, etc. If the degree of overlapping is greater than the predetermined threshold, then processor 306 may determine that users 102 and 106 may share the same service vehicle.
  • a predetermined threshold such as 70%, 80%, 90%, etc.
  • processor 306 determines not to fulfill the first and second requests using the same service vehicle (the NO branch of step 404 ). If processor 306 determines not to fulfill the first and second requests using the same service vehicle (the NO branch of step 404 ), method 400 proceeds to step 406 , in which processor 306 does not combine the first and second requests. Instead, processor 306 may search for other co-rider options for user 102 / 106 . If, on the other hand, processor 306 determines to fulfill the first and second requests using the same service vehicle (the YES branch of step 404 ), then method 400 proceeds to step 408 , in which processor 306 may combine the first and second requests into a combined request. In some embodiments, processor 306 may determine a service route to fulfill the first and second requests using the same service vehicle. For example, referring to FIG. 1 , processor 306 may determine that route 152 with a detour 156 to be the service route for the combined request.
  • processor 306 may determine a pick-up location (e.g., pick-up location 124 ) for picking up at least one of the first and second user.
  • pick-up location 124 may be determined based on historical data example, pick-up location information of past transportation requests may be collected and analyzed to determine one or more optimal pick-up locations.
  • Various factors may be used to determine the pick-up location 124 . For example, the frequency of a particular place is used as a pick-up location may indicate the place is suitable for serving as a convenient pick-up place. Similarly, the number of orders, the distribution of pick-ups throughout the day, etc., can also be used as the factors.
  • pick-up location 124 may be determined based on the convenience or efficiency of picking up a passenger by a service vehicle. For example, the pick-up location 124 may be selected at one side of a road so that the service vehicle does not have to make a U-turn or other complicated or time-consuming routes to reach the pick-up location. In another example, the pick-up location may be selected at places permitting passenger pick-up, such as the entrance of a hotel, park, etc., and to avoid places such as bus stops, traffic circles, and any roadside without a pedestrian walking area.
  • pick-up location 124 may be determined to minimize a likelihood of cancellation of the transportation service. For example, a learning model may be trained based on historical data correlating pick-up locations and cancellations of service. The learning model may then be used to predict, based on factors of a current service request and available pick-up locations, a probability of cancellation for each available pick-up location. Processor 306 may select the pick-up location that is associated with the lowest probability of cancellation.
  • processor 306 may first determine the pick-up location in the form of geographical coordinates based on factors discussed above. After the geographical coordinates of the pick-up location is determined, the address or point of interest corresponding to the geographical coordinates may be determined based on, for example, map data.
  • processor 306 may determine one or more candidate pick-up locations. Processor 306 may provide the candidate pick-up locations to user 102 / 106 and may receive input from user 102 / 106 indicating a selection of a pick-up location from the candidate pick-up locations. Processor 306 may then determine the pick-up location based on the user selection.
  • processor 306 may determine the one or more candidate pick-up locations based on historical information of pick-up locations from past transportation services.
  • processor 306 may access history pick-up location data which may include relationship between past pick-up locations and user locations.
  • history pic-up location data may include information of actual pick-up locations corresponding to origin locations and a current location of a user.
  • Candidate pick-up location(s) may be selected from those actual pick-up locations (e.g., the most popular pick-up location(s)).
  • processor 306 may send the combined request to one or more service providers.
  • processor 306 may broadcast the combined request to one or more service providers within an area around pick-up location 124 .
  • service provider 104 may communicate with server 172 using terminal device 114 to provide the current location of service vehicle 110 .
  • processor 306 may select one or more service vehicles that are within a predetermine or dynamically determined area around pick-up location 124 as candidate service vehicles and broadcast the combined request for cost-sharing transportation service to the selected service vehicles (e.g., by sending the combined request to the terminal devices associated with the service vehicles).
  • each terminal device may display an interface indicating the combined request to allow the driver of the service vehicle to accept the combined request.
  • FIG. 5A illustrates an exemplary interface 510 displayed on, for example, terminal device 114 .
  • interface 510 may include an information section 520 , a map section 530 , and an acceptance indicator 540 .
  • Information section 520 may include an indicator 522 showing that the request is a cost-sharing transportation service.
  • information section 520 may include ride fare information based on the combined ride fare from available co-riders (e.g., users 102 and 106 ).
  • Information section 520 may also include information of the pick-up location, in this case the “Central Village,” as well as the estimated distance (e.g., “200 m”) and driving time (e.g., “2 mins”) to the pick-up location.
  • the entire service route may not be revealed to the driver at this stage. Rather, only the pick-up location is displayed to the driver.
  • Map section 530 may include a map showing the pick-up location 532 , current location of the service vehicle 534 , and a navigation route 536 from the current location to the pick-up location.
  • Indicator 540 may be in a form of a button, as shown in FIG. 5A , to allow the driver to click thereon to accept the combined request.
  • Indicator 540 may also display a timer indicating a time passed since the combined request is broadcast or a remaining time to accept the combined request. For example, in FIG. 5A , indicator 540 shows that 6 seconds has passed since the combined request was broadcast, or there are 6 seconds left before the drive can accept the combined request.
  • processor 306 may locate a service provider to fulfill the combined request.
  • processor 306 may locate the service provider after the service provider accepts the combined request.
  • FIG. 5B shows an exemplary interface displayed on a service provider's terminal device (e.g., terminal device 114 ) after the service provider accepts the combined request.
  • information section 520 displays information of the pick-up location “Central Village”), as well as the distance and driving time.
  • Map section 530 displays the entire service route 538 , including multiple pick-up locations 537 and drop-off locations 539 .
  • a pick-up information section 550 is also displayed, in which multiple passengers sharing the same service vehicle are listed (e.g., “Alex,” “Ben,” and “Catherine”).
  • An advisory message indicating the time period within which the driver needs to arrive at the first pick-up location is also display (“Please be at the pick-up location in 5 mins”), and the time period may count down to zero.
  • a confirmation button (“Arrive at pick up point”) shown in section 550 may be clicked by the driver to indicate that he/she has arrived at the pick-up location. Once the drive clicks the confirmation button, a pick-up confirmation interface may be displayed.
  • An exemplary implementation of the pick-up confirmation interface is shown in FIG. 5C .
  • the pick-up confirmation interface may include a pick-up confirmation tab 560 to allow the driver to confirm passenger pick-up.
  • pick-up confirmation tab 560 may include a pick-up confirmation button 562 for each passenger.
  • the number of seats 564 may be displayed under each passenger's name.
  • the driver may confirm pick-up by clicking the pick-up confirmation button 562 .
  • a confirmation dialog may be display after the driver clicks button 562 , as shown in FIG. 5D .
  • confirmation dialog 566 may include a further confirmation in case button 562 is clicked by accident.
  • the pick-up process for the first passenger may conclude.
  • An exemplary interface as shown in FIG. 5E may be displayed, in which the pick-up confirmation button 568 is changed to “Picked Up” state, indicating that passenger Alex has been picked up.
  • FIG. 5F shows an exemplary interface for dropping off a passenger, in this case Alex.
  • information section 520 now displays the destination location of Alex (“123 Main Street”), as well as the distance and driving time to the destination location.
  • Map section 530 display a navigation route from the current location of the service vehicle to Alex's destination location. It is noted that subsequent pick-up locations and drop-off locations may also be displayed.
  • a payment information block 572 may be displayed, indicating the type of payment for Alex's portion of the ride fare. For example, cash payment may be the payment type used by Alex. In this case, the driver may need to collect the payment before Alex concludes the ride.
  • a drop-off confirmation button 573 may be displayed. The driver may click button 574 to confirm dropping off a passenger, in this case, Alex.
  • FIG. 5G shows an exemplary interface displaying the final destination of the service route. Similar to FIG. 5F , the interface shown in FIG. 5G also include the information section 520 displaying the final destination information. Different from FIG. 5F , the payment block in FIG. 5G shows that the payment type is an online payment. In this case, the driver can be automatically paid upon concluding the ride.
  • the drop-off confirmation button 574 may display the ride fare to be collected automatically.
  • the computer-readable medium may include volatile or non-volatile, magnetic, semiconductor-based, tape-based, optical, removable, non-removable, or other types of computer-readable medium or computer-readable storage devices.
  • the computer-readable medium may be the storage device or the memory module having the computer instructions stored thereon, as disclosed.
  • the computer-readable medium may be a disc or a flash drive having the computer instructions stored thereon.

Landscapes

  • Business, Economics & Management (AREA)
  • Engineering & Computer Science (AREA)
  • Strategic Management (AREA)
  • General Physics & Mathematics (AREA)
  • Physics & Mathematics (AREA)
  • Human Resources & Organizations (AREA)
  • Theoretical Computer Science (AREA)
  • Economics (AREA)
  • General Business, Economics & Management (AREA)
  • Development Economics (AREA)
  • Tourism & Hospitality (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Marketing (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Accounting & Taxation (AREA)
  • Signal Processing (AREA)
  • Finance (AREA)
  • Operations Research (AREA)
  • Quality & Reliability (AREA)
  • Game Theory and Decision Science (AREA)
  • Health & Medical Sciences (AREA)
  • Data Mining & Analysis (AREA)
  • General Health & Medical Sciences (AREA)
  • Primary Health Care (AREA)
  • Traffic Control Systems (AREA)
  • Telephonic Communication Services (AREA)
  • Navigation (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)
US16/950,961 2018-05-18 2020-11-18 Systems and methods for providing cost-sharing transportation services Abandoned US20210073934A1 (en)

Applications Claiming Priority (5)

Application Number Priority Date Filing Date Title
CNPCT/CN2018/087442 2018-05-18
PCT/CN2018/087442 WO2019218335A1 (en) 2018-05-18 2018-05-18 Systems and methods for recommending a personalized pick-up location
CNPCT/CN2018/116068 2018-11-17
PCT/CN2018/116068 WO2019109794A1 (en) 2017-12-04 2018-11-17 Systems and methods for providing cost-sharing transportation services
PCT/CN2018/122444 WO2019218672A1 (en) 2018-05-18 2018-12-20 Systems and methods for providing cost-sharing transportation services

Related Parent Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2018/122444 Continuation WO2019218672A1 (en) 2018-05-18 2018-12-20 Systems and methods for providing cost-sharing transportation services

Publications (1)

Publication Number Publication Date
US20210073934A1 true US20210073934A1 (en) 2021-03-11

Family

ID=68539333

Family Applications (2)

Application Number Title Priority Date Filing Date
US16/950,961 Abandoned US20210073934A1 (en) 2018-05-18 2020-11-18 Systems and methods for providing cost-sharing transportation services
US16/950,948 Active US11468536B2 (en) 2018-05-18 2020-11-18 Systems and methods for recommending a personalized pick-up location

Family Applications After (1)

Application Number Title Priority Date Filing Date
US16/950,948 Active US11468536B2 (en) 2018-05-18 2020-11-18 Systems and methods for recommending a personalized pick-up location

Country Status (5)

Country Link
US (2) US20210073934A1 (zh)
EP (1) EP3794546A4 (zh)
CN (2) CN112055867B (zh)
BR (1) BR112020023532A2 (zh)
WO (2) WO2019218335A1 (zh)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US11195245B2 (en) * 2017-12-29 2021-12-07 ANI Technologies Private Limited System and method for allocating vehicles in ride-sharing systems
US11403725B2 (en) * 2018-12-28 2022-08-02 Toyota Jidosha Kabushiki Kaisha Information processing apparatus and moving vehicle system
US11514796B2 (en) 2017-12-04 2022-11-29 Beijing Didi Infinity Technology And Development Co., Ltd. System and method for determining and recommending vehicle pick-up location

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2021129585A1 (zh) * 2019-12-28 2021-07-01 北京嘀嘀无限科技发展有限公司 一种为用户提供定位点推荐的方法和系统
CN112652192A (zh) * 2021-01-04 2021-04-13 北京嘀嘀无限科技发展有限公司 确定限制停靠位置的方法、装置、设备、介质和程序产品

Family Cites Families (76)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH0923063A (ja) 1995-07-07 1997-01-21 Hitachi Ltd 多層配線回路基板の製造方法
JP2004192366A (ja) * 2002-12-12 2004-07-08 Hitachi Kokusai Electric Inc 配車システム
JP4254375B2 (ja) * 2003-06-26 2009-04-15 カシオ計算機株式会社 目的地案内システムおよびプログラム
US20100153292A1 (en) 2008-12-11 2010-06-17 Microsoft Corporation Making Friend and Location Recommendations Based on Location Similarities
US8285571B2 (en) 2009-02-18 2012-10-09 Toyota Motor Engineering & Manufacturing North America (Tema) Rideshare system and associated methodology
US8275649B2 (en) 2009-09-18 2012-09-25 Microsoft Corporation Mining life pattern based on location history
US8688532B2 (en) 2009-12-11 2014-04-01 General Motors Llc Real-time ride share system
CN101799978A (zh) 2010-02-10 2010-08-11 华为终端有限公司 一种车辆调度方法、服务器、移动终端和系统
US20130054311A1 (en) 2011-08-30 2013-02-28 Miles2Share LLC Systems, methods and computer program products for ride sharing based on mileages
US8688378B2 (en) 2011-10-17 2014-04-01 GM Global Technology Operations LLC Ride-share service
CN103546515A (zh) * 2012-07-16 2014-01-29 上海博讯信息技术有限公司 一种实时拼车系统
CA2889853C (en) 2012-11-08 2017-02-21 Shalin Amin Providing on-demand services through use of portable computing devices
JP6161277B2 (ja) 2012-12-14 2017-07-12 三菱重工メカトロシステムズ株式会社 車載器、車両管理システム、プログラム、及び、車両管理方法
CN103971507B (zh) * 2013-01-30 2017-06-13 国民技术股份有限公司 一种召车方法、召车平台及系统
CN203260190U (zh) 2013-03-22 2013-10-30 蔡东海 顺风出租车拼车系统
CN103218442A (zh) 2013-04-22 2013-07-24 中山大学 一种基于移动设备传感器数据的生活模式分析方法及系统
CA2917186C (en) * 2013-07-03 2022-06-21 Uber Technologies, Inc. System and method for splitting a fee for an on-demand service
CN105917376A (zh) 2013-12-11 2016-08-31 优步技术公司 针对运输请求优化对驾驶员的选择
US20150206267A1 (en) 2014-01-22 2015-07-23 Jahan Khanna Systems and methods for providing a transportation marketplace
US9304009B2 (en) * 2014-02-04 2016-04-05 Here Global B.V. Method and apparatus for providing passenger embarkation points for points of interests
CN105094767B (zh) 2014-05-06 2019-02-12 华为技术有限公司 自动驾驶车辆调度方法、车辆调度服务器及自动驾驶车辆
WO2016019189A1 (en) 2014-07-30 2016-02-04 Uber Technologies, Inc. Arranging a transport service for multiple users
BR112017002174A2 (pt) * 2014-08-04 2017-11-21 Uber Technologies Inc determinação e fornecimento de pontos de dados de localização predeterminada a fornecedores de serviço
CN104135528B (zh) 2014-08-05 2018-05-18 浙江翼信科技有限公司 一种在拼车中使用的方法及装置
JP6416558B2 (ja) 2014-09-11 2018-10-31 株式会社駐車場綜合研究所 自動運転車管理装置、自動運転車管理システム、自動運転車管理方法、自動運転車管理プログラム
DE102014221751A1 (de) 2014-10-27 2016-04-28 Robert Bosch Gmbh Verfahren und Vorrichtung zum Führen eines Fahrzeugs auf einem Parkplatz
CN104454274B (zh) 2014-12-03 2017-09-29 中国第一汽车股份有限公司无锡油泵油嘴研究所 一种喷油器
CN109241439A (zh) * 2015-05-12 2019-01-18 北京嘀嘀无限科技发展有限公司 一种信息推送的方法及装置
US20160364823A1 (en) 2015-06-11 2016-12-15 Raymond Cao Systems and methods for on-demand transportation
CN104990559B (zh) * 2015-07-27 2018-08-21 福建工程学院 一种基于出租车经验数据的路径推荐方法、系统及客户端
US10291574B2 (en) 2015-07-30 2019-05-14 Uber Technologies, Inc. Social media integration for transport arrangement service
CN105023177A (zh) 2015-08-05 2015-11-04 四川长虹电器股份有限公司 智能导购方法
US10215574B2 (en) * 2015-08-06 2019-02-26 Uber Technologies, Inc. Facilitating rider pick-up for a transport service
CN107402931A (zh) * 2016-05-19 2017-11-28 滴滴（中国）科技有限公司 一种出行目的地推荐方法和装置
CN106469514A (zh) * 2015-08-21 2017-03-01 阿里巴巴集团控股有限公司 一种地点提示方法和装置
CN105045921A (zh) * 2015-08-26 2015-11-11 北京京东尚科信息技术有限公司 为移动终端提供推荐信息的方法及装置
US20170059347A1 (en) 2015-08-28 2017-03-02 Google Inc. Determining Improved Pick-Up Locations
CN105243836B (zh) 2015-10-14 2019-03-12 青岛众至创捷网络科技有限公司 一种拼车方法和设备
CN105279956A (zh) 2015-10-28 2016-01-27 张捷 一种拼车系统及拼车方法
CN105897821A (zh) 2015-10-29 2016-08-24 乐卡汽车智能科技（北京）有限公司 搭乘顺风车的装置和穿戴式设备
CN105489001A (zh) 2015-12-11 2016-04-13 惠州Tcl移动通信有限公司 一种出租车调度优化方法及系统
CN105575104B (zh) * 2015-12-17 2018-03-02 小米科技有限责任公司 打车软件处理方法及装置
CN105677804B (zh) * 2015-12-31 2020-08-07 百度在线网络技术（北京）有限公司 权威站点的确定以及权威站点数据库的建立方法和装置
CN105678412A (zh) 2015-12-31 2016-06-15 百度在线网络技术（北京）有限公司 面向多人乘车的路线规划方法和装置
CN105677793B (zh) * 2015-12-31 2019-10-18 百度在线网络技术（北京）有限公司 地点数据库的建立和候选乘车地点的推荐方法及装置
CN107230091B (zh) 2016-03-23 2020-10-30 滴滴（中国）科技有限公司 拼车请求订单匹配方法及装置
GB2554211A (en) 2016-02-24 2018-03-28 Beijing Didi Infinity Technology & Dev Co Ltd Methods and systems for carpooling
CN105825672B (zh) 2016-04-11 2019-06-14 中山大学 一种基于浮动车数据的城市指引区域提取方法
CN114037589A (zh) 2016-06-13 2022-02-11 北京嘀嘀无限科技发展有限公司 一种上车点推荐处理方法及系统
US20170365030A1 (en) 2016-06-21 2017-12-21 Via Transportation, Inc. Systems and Methods for Vehicle Ridesharing Management
CN106228383A (zh) * 2016-07-12 2016-12-14 百度在线网络技术（北京）有限公司 一种生成订单邀约信息的方法和装置
CN105975641A (zh) 2016-07-15 2016-09-28 合网络技术（北京）有限公司 视频推荐方法及装置
CN106295817A (zh) * 2016-07-27 2017-01-04 百度在线网络技术（北京）有限公司 一种用于在专线运输系统中进行接客调度的方法和装置
CN106157602A (zh) * 2016-07-28 2016-11-23 北京小米移动软件有限公司 呼叫车辆的方法和装置
CN106339417B (zh) 2016-08-15 2019-10-01 浙江大学 基于移动轨迹中停留点的用户群体行为规律检测方法
CN107767322B (zh) * 2016-08-22 2021-05-25 平安科技（深圳）有限公司 拼车方法和装置
CN106339456A (zh) 2016-08-26 2017-01-18 重庆科创职业学院 一种基于数据挖掘的推送方法
US10024669B2 (en) 2016-08-30 2018-07-17 Google Llc Rerouting in a navigation system based on updated information
CN107798403A (zh) * 2016-09-07 2018-03-13 北京嘀嘀无限科技发展有限公司 一种拼车订单处理方法、服务器、终端设备和系统
CN108022140A (zh) * 2016-11-02 2018-05-11 北京嘀嘀无限科技发展有限公司 一种用车订单推荐方法、装置及服务器
CN106779141B (zh) 2016-11-15 2021-04-16 百度在线网络技术（北京）有限公司 一种推荐上车地点的方法和装置
US10228257B2 (en) 2016-11-29 2019-03-12 Microsoft Technology Licensing, Llc Tool for assisting user in finding a fair meeting location
CN106709596A (zh) 2016-11-29 2017-05-24 深圳市维康宝技术有限公司 打车平台的车费预估方法及装置
US20180165731A1 (en) 2016-12-09 2018-06-14 Conduent Business Services, Llc Method and system for real time ridesharing management
CN106682686A (zh) 2016-12-09 2017-05-17 北京拓明科技有限公司 一种基于手机上网行为的用户性别预测方法
CN106779122A (zh) * 2016-12-23 2017-05-31 广东小天才科技有限公司 一种叫车方法及叫车装置
US20180209803A1 (en) 2017-01-25 2018-07-26 Via Transportation, Inc. Dynamic Route Planning
CN107085600B (zh) 2017-03-31 2021-05-14 百度在线网络技术（北京）有限公司 Poi推荐方法、装置、设备及计算机可读存储介质
US9769616B1 (en) * 2017-04-04 2017-09-19 Lyft, Inc. Geohash-related location predictions
CN106940928A (zh) 2017-04-25 2017-07-11 杭州纳戒科技有限公司 订单分配方法及装置
CN107389078B (zh) * 2017-06-23 2019-07-02 咪咕互动娱乐有限公司 一种路线推荐方法、装置及计算机可读存储介质
CN107403560B (zh) * 2017-08-17 2019-11-19 北京经纬恒润科技有限公司 一种推荐上车地点的方法及装置
US10809083B1 (en) * 2017-12-30 2020-10-20 Uber Technologies, Inc. Using sensor data for coordinate prediction
JP6988682B2 (ja) 2018-05-16 2022-01-05 トヨタ自動車株式会社 乗合支援装置、乗合支援システム及び乗合支援方法
CN110533081A (zh) * 2019-08-07 2019-12-03 北京三快在线科技有限公司 一种确定上车点信息的方法、装置、设备及存储介质
CN111860904A (zh) * 2019-09-24 2020-10-30 北京嘀嘀无限科技发展有限公司 上车点排序的方法及装置

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US11514796B2 (en) 2017-12-04 2022-11-29 Beijing Didi Infinity Technology And Development Co., Ltd. System and method for determining and recommending vehicle pick-up location
US11195245B2 (en) * 2017-12-29 2021-12-07 ANI Technologies Private Limited System and method for allocating vehicles in ride-sharing systems
US11403725B2 (en) * 2018-12-28 2022-08-02 Toyota Jidosha Kabushiki Kaisha Information processing apparatus and moving vehicle system

Also Published As

Publication number Publication date
US20210076157A1 (en) 2021-03-11
BR112020023532A2 (pt) 2021-02-09
CN112055867A (zh) 2020-12-08
EP3794546A4 (en) 2021-06-23
CN110741405B (zh) 2023-09-12
CN112055867B (zh) 2024-05-07
EP3794546A1 (en) 2021-03-24
CN110741405A (zh) 2020-01-31
WO2019218672A1 (en) 2019-11-21
WO2019218335A1 (en) 2019-11-21
US11468536B2 (en) 2022-10-11

Similar Documents

Publication Publication Date Title
US20210073934A1 (en) Systems and methods for providing cost-sharing transportation services
US11551325B2 (en) Travel coordination system implementing pick-up location optimization
US11620592B2 (en) Systems and methods for planning transportation routes
US10466059B2 (en) Providing alternative routing options to a rider of a transportation management system
US11068811B2 (en) System and method for operating a service to arrange transport amongst parties through use of mobile devices
US10648822B2 (en) Systems and methods for simultaneous electronic display of various modes of transportation for viewing and comparing
US20200134747A1 (en) Systems and methods for recommending transportation services
US11092449B2 (en) Methods and systems for providing transportation service
US20140074757A1 (en) Estimating taxi fare
US20200327516A1 (en) Systems and methods for providing cost-sharing transportation services
US20130246301A1 (en) Providing user feedback for transport services through use of mobile devices
WO2018146622A1 (en) Dynamic selection of geo-based service options in a network system
CN111651687B (zh) 上车点信息推送方法及装置、下车点信息推送方法及装置
WO2020118635A1 (en) Systems and methods for changing pickup locations in transportation services
US20240054583A1 (en) Sightseeing plan provision system and sightseeing plan provision method
EP2816318A1 (en) Method of and apparatus for enabling transport of physical assets

Legal Events

Date Code Title Description
STPP Information on status: patent application and granting procedure in general

Free format text: APPLICATION DISPATCHED FROM PREEXAM, NOT YET DOCKETED

STPP Information on status: patent application and granting procedure in general

Free format text: DOCKETED NEW CASE - READY FOR EXAMINATION

STPP Information on status: patent application and granting procedure in general

Free format text: NON FINAL ACTION MAILED

STPP Information on status: patent application and granting procedure in general

Free format text: RESPONSE TO NON-FINAL OFFICE ACTION ENTERED AND FORWARDED TO EXAMINER

STPP Information on status: patent application and granting procedure in general

Free format text: FINAL REJECTION MAILED

STCB Information on status: application discontinuation

Free format text: ABANDONED -- FAILURE TO RESPOND TO AN OFFICE ACTION