System and method for providing cost-sharing transportation services

Abstract

Systems and methods for providing cost-sharing transportation services are provided. An example system can include a memory and at least one processor coupled to the memory. When executing instructions stored on the memory, the at least one processor will perform operations. The operations can include providing a cost-sharing option to a first user. The operations can also include receiving input from the first user to indicate selection of the cost-sharing option. The operations can also include providing information of a pickup area to the first user based on a starting location. The operations can also include searching for a second user associated with the cost-sharing option. The operations can also include determining a pickup location associated with the cost-sharing option. The operations can also include providing information of the pickup location to the first user.

Description

[0001] This application is a divisional application of the patent application for “System and method for providing cost-sharing transportation service” with application number 201880043912.3 and filing date 17 November 2018. TECHNICAL FIELD

[0002] The present application relates to providing transportation services, and more particularly, to a system and method for providing cost-sharing transportation services using an online platform. BACKGROUND

[0003] A ride-hailing platform (e.g., DiDiTM Online) can receive a ride service request from a passenger and then send the service request to at least one transportation service provider (e.g., a taxi driver, a private car owner, etc.). If no one receives the service request within a predetermined time period, the service request can be responded to or assigned to a service provider.

[0004] When multiple passengers are going to similar destinations or share similar routes, they can be grouped together to share the same service vehicle and cost. This cost-sharing arrangement is also known as carpooling. Current ride-hailing platforms that offer cost-sharing options do not provide passengers with sufficient information about the pickup location before matching the passengers with drivers and / or co-riders. When the platform discloses the pickup location to the passengers, the co-riders or drivers may have already been found. At this point, if the passengers choose to cancel the transportation request due to a long walking distance to the pickup location, it will adversely affect the already matched drivers or co-riders. On the other hand, if the exact pickup location is disclosed to the passengers too early, it can lead to potential exploitation or raise safety concerns. Therefore, the current system faces the dilemma of whether to disclose the pickup location information to the passengers early or late.

[0005] Embodiments of the present application provide a method and system to solve the above problems. SUMMARY

[0006] Embodiments of the present application provide a system for providing cost-sharing transportation services. The system can include a memory storing computer-readable instructions and at least one processor coupled to the memory. When the instructions are executed by the at least one processor, the instructions stored on the memory can cause the processor to perform operations. The operations can include providing a cost-sharing option for a first user. The operations can also include receiving an input from the first user indicating a selection of the cost-sharing option. The operations can also include providing information of a pickup area to the first user based on a starting location. The operations can also include searching for a second user related to the cost-sharing option. The operations can also include determining a pickup location related to the cost-sharing option. The operations can also include providing information of the pickup location to the first user.

[0007] Embodiments of the present application further disclose a computer-implemented method for providing cost-sharing transportation service. The method can include providing a cost-sharing option to a first user. The method can also include receiving an input from the first user indicating a selection of the cost-sharing option. The method can also include providing information of a pickup area to the first user based on a starting location. The method can also include searching for a second user associated with the cost-sharing option. The method can also include determining a pickup location associated with the cost-sharing option. The method can also include providing information of the pickup location to the first user.

[0008] Embodiments of the present application further disclose a non-transitory computer-readable storage medium. The non-transitory computer-readable storage medium can store a set of instructions which, when executed by at least one processor of an electronic device, will cause the electronic device to perform a method for providing cost-sharing transportation service. The method can include providing a cost-sharing option to a first user. The method can also include receiving an input from the first user indicating a selection of the cost-sharing option. The method can also include providing information of a pickup area to the first user based on a starting location. The method can also include searching for a second user associated with the cost-sharing option. The method can also include determining a pickup location associated with the cost-sharing option. The method can also include providing information of the pickup location to the first user.

[0009] It is to be understood that both the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the application as claimed. BRIEF DESCRIPTION OF DRAWINGS

[0010] Figure 1 is an exemplary system for providing cost-sharing transportation service shown in accordance with embodiments of the present application.

[0011] Figure 2 is a block diagram of an exemplary terminal device configured to provide cost-sharing transportation service shown in accordance with embodiments of the present application.

[0012] Figure 3 is a block diagram of an exemplary server configured to provide cost-sharing transportation service shown in accordance with embodiments of the present application.

[0013] Figures 4A-4B is a flowchart of an exemplary method for providing cost-sharing transportation service shown in accordance with embodiments of the present application.

[0014] Figures 5A-5E is an exemplary interface of various stages of requesting cost-sharing transportation service shown in accordance with embodiments of the present application.

[0015] Figure 6is an example interface showing matching with a rider during a cost- sharing transportation service, according to embodiments of the present application.

[0016] Figure 7 is an example interface showing seat selection during a cost- sharing transportation service, according to embodiments of the present application. DETAILED DESCRIPTION

[0017] The example embodiments will be described in detail with reference to the drawings, of which examples are shown. Wherever possible, the same reference numbers will be used throughout the drawings to refer to the same or like parts.

[0018] Embodiments of the present application provide systems and methods for providing a cost-sharing transportation service. In some embodiments, the cost-sharing transportation service can incentivize sharing of a transportation vehicle by splitting the cost among riders. In some embodiments, the cost-sharing transportation service can incentivize vehicles to share transportation, whether or not the transportation vehicle is actually shared by multiple users. In this case, the cost-sharing can be reflected in the form of a discount from the regular transportation service fare, a flat rate, or other reduced fare. In some embodiments, the cost-sharing service can be offered as an option to users in addition to regular transportation services. As used herein, the cost-sharing service can also be referred to as a cost-sharing option, a cost-saving service / option, a carpooling service / option, a ride-sharing service / option, or similar terms.

[0019] Embodiments of the present application provide a mechanism to provide pick-up location information for users utilizing the cost-sharing service. Unlike existing systems, where a passenger wanting to enjoy the cost-sharing service has no choice but to accept the pick-up location designated by the system or cancel the already matched ride request, embodiments of the present application allow a user to evaluate the walking distance to the pick-up location by delineating a pick-up area before the cost-sharing service request is broadcast to potential drivers and riders. The pick-up area defines the boundary of the pick-up location, which can inform the user of the upper limit of the walking distance before the user's cost-sharing transportation request is sent for matching. If the user decides not to proceed, he / she can choose other forms of transportation services without the need to cancel the ongoing order. That is, rather than revealing the exact pick-up location or hiding the pick-up location until a match is successful, embodiments of the present application balance the interests of the passenger and the service provider.

[0020] Furthermore, embodiments of the present application can provide suggested / recommended pick-up locations within the pick-up area. The user can select a pick-up location from the multiple recommended pick-up locations. The recommended pick-up locations can be determined based on historical information to balance the interests of the passenger, the driver, and / or the rider.

[0021] In some embodiments, the exemplary systems and methods can be implemented as part of an online ride-hailing service (also known as an online ride-sharing service), in which a driver uses a service vehicle to provide transportation services to one or more passengers. In this case, the driver and one or more passengers can communicate using terminal devices, such as mobile phones, wearable devices, PDAs, etc. The online ride-hailing service can be provided via a service platform that facilitates communication between terminal devices and between terminal devices and servers.

[0022] Figure 1 This is an exemplary system 100 for providing cost-sharing transportation services, as shown in embodiments of this application. Figure 1 As shown, user 102 can request transportation services using terminal device 112. For example, terminal device 112 may have a service application installed thereon to display a user interface allowing user 102 to input information related to the transportation service. The request may include information about a starting location 126 and a destination 132. As used herein, the starting location 126 may be the same as or different from user 102's current physical location 122. Further, the starting location 126 may be the same as or different from the boarding location 124. In some embodiments, cost-sharing options may be provided to user 102 before inputting the starting location / destination information. In some embodiments, the starting location may represent the location that user 102 uses as the "starting" location for the transportation service. For example, to make a transportation service request, user 102 can input the address of the starting location through a service application installed on terminal device 112. User 102 can also manipulate a map displayed on the user interface on terminal device 112 to indicate the starting location 126 on the map. In some embodiments, the starting location 126 may be depicted by an indicator on the map, such as a pointer. User 102 can "drag" the pointer or the map to change the position of the pointer on the map.

[0023] In some embodiments, a transportation service request can be sent from the terminal device 112 to the server 172 over a communication link 162. The server 172 can be provided in a cloud computing environment 170 (referred to herein as "cloud 170" for simplicity). The communication link 162 can include any suitable communication channel, such as a wireless communication channel via a suitable network. After the server 172 receives the request, based on the starting location and / or destination of the user 102, the server 172 can determine whether a cost-sharing option is available. In some embodiments, a cost-sharing transportation service can be available in a particular geographic area, such as a city, county, town, metropolitan area, etc. In these embodiments, the server 172 can determine whether the starting location and / or destination falls within a predetermined geographic area that provides the cost-sharing service. After determining that the cost-sharing service is available, the server 172 can provide the cost-sharing option to the user 102. In some embodiments, the cost-sharing option can be provided to the user 102 as a default transportation service option in an area where the cost-sharing service is available.

[0024] The cost-sharing option can be accompanied by a price. The price can include a discount compared to a regular price to reflect the cost-sharing feature. In some embodiments, the price can be fixed regardless of whether service vehicle sharing actually occurs.

[0025] The terminal device 112 can receive input from the user 102 to indicate selection of the cost-sharing option. For example, the user 102 can select the cost-sharing option through a user interface displayed on a screen of the terminal device 112. In some embodiments, the user 102 can be provided with a user interface that requests confirmation of a required number of seats. For example, a default of one seat and a maximum of two seats can be implemented.

[0026] After the user 102 selects the cost-sharing option, the user 102 can be provided with information of a pick-up area 120, where the pick-up location is bounded. For example, the pick-up area 120 can be centered at the starting location 126. In some embodiments, the user 102 can be allowed to select another location different from the starting location 126. For example, the user 102 can be provided with an option to select a location that is convenient, safe, or custom for receiving the transportation service. In some embodiments, the user 102 can be recommended one or more locations based on the user's current location 122, historical service information, local regulations and customs, or other suitable factors.

[0027] In some embodiments, the pickup area 120 can be automatically determined based on factors such as a geographic area associated with the starting location 126 (city, region, area, country, etc.), a time of day, traffic conditions associated with the starting location 126 (e.g., traffic conditions covering a predetermined area of the starting location 126), or certain predetermined parameters. The pickup area can have various shapes and coverage. For example, the pickup area 120 can be a circular area centered at the starting location 126 with a predetermined or dynamically determined radius. In another example, the pickup area 120 can be other shapes, including irregular shapes, for example, defined by a number of blocks in the starting location 126, a driving / walking time to reach the starting location 126 under current, historical, or predicted traffic conditions, etc.

[0028] The terminal device 112 can display the pickup area 120 to allow the user 102 to evaluate whether the pickup location within the pickup area 120 is acceptable before submitting a cost-sharing service request to search for a driver and a co-rider. Based on the displayed pickup area 120, if the user 102 decides not to continue with the cost-sharing option, the user 102 can select other ride options without submitting a cost-sharing service request. Thus, the pickup area 120 serves as a preview of the actual pickup location to increase the degree of certainty about where the pickup location is located. The increased certainty can significantly reduce the cancellation rate due to the user's unwillingness to travel a long distance.

[0029] After the user 102 is provided with the information of the pickup area 120, the user 102 can determine whether to submit a cost-sharing service request. For example, the user 102 can click a confirmation button to submit the request. Upon receiving the request, the server 172 can search for a second user associated with the cost-sharing option. For example, the second user can be a co-rider (e.g., the user 106) who can share the service vehicle 110 with the user 102. In another example, the second user can be a service provider (e.g., the user 104) who provides the requested cost-sharing transportation service. For example, the server 172 can broadcast the transportation service request to potential co-riders and / or service providers who are close to the user's 102 current location or the starting location 126. For example, the service provider 104 can accept the request to provide the transportation service by using the service vehicle 110. The server 172 can also match the request with the service provider 104 and assign the transportation service to the service provider 104. In another example, a co-rider can join the user 102 to share the service vehicle 110. In some embodiments, the service provider 104 can communicate with the server 170 and / or the user 102 using the terminal device 114. For example, the terminal device 114 can communicate with the server 170 via the communication link 164, similar to the communication link 162.

[0030] The terminal device 114 can provide the server 172 with information of the service vehicle 110 and / or the service provider 104, such as the current location of the service vehicle 110, whether the service vehicle 110 is currently providing transportation service to other users, and if so, the destination or route of the current service. The server 172 can determine the pickup location 124 based on the information of the service vehicle 110, the service provider 104, the user 102, the location 122, the pickup area 120, etc. For example, the server 172 can determine the pickup location 124 to balance the driving distance of the service provider 104 and the walking distance of the user 102. In some embodiments, the server 172 can recommend several candidate pickup locations within the pickup area 120 for the user 102 to choose from. The user 102 can select a pickup location from the candidate locations and send the selection to the server 172. After setting the pickup location 124, the server 172 can provide the user 102 and the service provider 104 with the information of the pickup location. For example, the pickup location 124 can be in the form of geographic coordinates on a map, and the server 172 can determine the corresponding address, landmark, or point of interest (POI) based on the geographic coordinates and provide the user-friendly address, landmark, or POI name to the user 102 and the service provider 104. The user 102 and the service provider 104 can be provided with navigation routes, such as the walking route 142 from the current location 122 of the user 102 to the pickup location 124 and the driving route 144 from the current location of the service vehicle to the pickup location 124, respectively.

[0031] After or while searching for the driver, the server 172 can search for a rider to share the service vehicle 110 with the user 102. For example, the server 172 can search for a rider located near the current location of the user 102 and instruct the rider to meet the service provider 104 at the pickup location 124 or another pickup location. For example, the user 106 can be such a rider. The user 106 can use the terminal device 116 to request a transportation service to the destination 136. Similar to the case of the user 102, the request can be sent to the server 172 via the communication link 166. The server 172 can match the user 106 with the user 102 based on the destinations (132 and 136) of the users, the routes to the destinations, the gender of the users, the available payment methods, or other suitable factors. After the user 106 accepts the cost-sharing arrangement, the user 106 can be provided with a navigation route 146 to satisfy the needs of the service provider 104 and the rider 102. In some embodiments, the user 102 can be provided with information of the user 106 to indicate that a suitable rider has been found.

[0032] In another example, the server 172 can search for a rider who is on the way to one or more destinations of the current rider of the service vehicle 110. For example, the user 108 can be a candidate rider who is not located near the departure location of the user 102, but is near the navigation route 152 leading to the destination 132 of the user 102. Similar to the case of the user 102, the user 108 can communicate with the server 172 via the communication link 168 using the terminal device 118. The system can match the user 108 as a rider with the user 102, and can instruct the service provider 104 to take a detour 154 on the way to the destination 132 of the user 102 to pick up the user 108.

[0033] It can be predicted that the search for a rider can be performed before, after, or simultaneously with the search for a service provider 104. In some embodiments, the search for a rider can continue throughout the service trip as long as there is at least one available seat on the service vehicle 110. In some embodiments, the search for a rider can resume after at least one seat becomes available due to the departure of a rider (e.g., arrival of the rider's destination). In some embodiments, there can be a maximum allowed number of stops that the service vehicle 110 can take during the entire service trip. For example, the user 102 can experience a maximum of three stops for the purpose of picking up and dropping off during the trip. In some embodiments, after the user 102 is within a preset distance of the destination 132, no additional riders are allowed to be picked up. In some embodiments, a ratio between the distance to the destination 132 and the total distance of the ride can be used as an indication of whether a new rider is allowed to be picked up. If the ratio is below a preset value (e.g., the user 102 is close to the destination 132), no additional riders are allowed to be picked up.

[0034] In some embodiments, the server 172 can provide the user 102 with the destinations of other riders when these destinations are on the way to the destination 132 of the user 102. For example, the destination of a rider can be at a location 136 on the way to the destination 132 of the user 102. The destination 136 can be depicted on a navigation map displayed on the display of the terminal device 112. In some cases, as shown, the destination 136 can be slightly off the route 152, and the service vehicle 110 can choose a detour 156 to drop off the rider at the destination 136. In certain cases, the destination 138 of a rider can be beyond the destination 132 of the user 102. In such cases, the destination 138 can not be provided to the user 102. The service vehicle 110 can continue to travel along the route 158 after completing the service trip along the route 152 to drop off the rider at the destination. Figure 1

[0035] Figure 2 ​is a block diagram of an exemplary terminal device 200 depicted in accordance with embodiments of the present application. The terminal device 200 can include any suitable device that can display information to a user, such as a smart phone, a tablet, a wearable device, a computer, etc. In some embodiments, the terminal device 200 can be a driver terminal (e.g., terminal device 114) used by a transportation service provider 104. In other embodiments, the terminal device 200 can be a passenger terminal (e.g., terminal device 112, 116, or 118) used by a passenger requesting a transportation service. The description of the terminal device 200 will use a passenger terminal as an example.

[0036] As shown in FIG. 2, the terminal device 200 can include a communication interface 204, a processor 206, a memory / storage device 208, and a display 210. The communication interface 204 can include an integrated services digital network (ISDN) card, a cable modem, a satellite modem, or a modem to provide a data communication connection to a corresponding type of telephone line. As another example, the communication interface 204 can include a local area network (LAN) card to provide a data communication connection to a compatible LAN. Wireless links can also be implemented by the communication interface 204. In such implementations, the communication interface 204 can send and receive electrical, electromagnetic or optical signals that carry digital data streams representing various types of information to and from the network. The network can commonly be implemented as a cellular communication network, a wireless local area network (WLAN), a wide area network (WAN), etc. Figure 2

[0037] The communication interface 204 can be configured to send a transportation service request. The transportation service request can include passenger information, a trip origin, a trip destination, etc. The transportation service request can be accepted or otherwise matched with a service vehicle (e.g., service vehicle 110). The communication interface 204 can be configured to receive driver and vehicle information from the server 172, or directly from a driver terminal (e.g., terminal device 114) associated with a service vehicle (e.g., service vehicle 110). The service vehicle can include a taxi or a private car registered with a ride-hailing platform. In some embodiments, the service vehicle can also include an autonomous vehicle. The ride-hailing platform can maintain a database to store profiles of registered vehicles and associated drivers. The vehicle information can include, for example, a vehicle location, a vehicle year, a manufacturer and a model, and other features or characteristics associated with the service vehicle. The driver information can include, for example, a driver’s name, a photo or other identification information, a driver’s license number, a driving record, a driver’s customer reviews.

[0038] ​The communication interface 204 can further receive information related to the current transportation service request that has not been completed by the service vehicle. For example, the communication interface 104 can receive a drop-off location of the current transportation service request. The communication interface 104 can also receive navigation information, such as a current location of the service vehicle, traffic data, map data, after receiving the transportation service request. In some embodiments, a navigation device on the service vehicle or the driver terminal can provide the vehicle location to the communication interface 204. In some embodiments, the communication interface 204 can be configured to receive other data from the server 172, such as map data, real-time traffic information, weather information, road congestion information, etc. The data can be received periodically, such as every 0.1 seconds, every second, every 5 seconds, or upon request for update.

[0039] The communication interface 204 can be configured to receive cost-sharing service information from the server 172. For example, the communication interface 204 can receive price information, pick-up location information, rider information, destination information of the rider, etc. from the server 172.

[0040] The processor 206 can include any suitable type of general purpose or special purpose microprocessors, digital signal processors, or microcontrollers. The processor 206 can be configured as a separate processor module dedicated to providing transportation services, including coordinating drivers and riders, presenting maps, and providing navigation information. Alternatively, the processor 206 can be configured as a shared processor module for performing other functions unrelated to transportation services. The processor 206 can include one or more hardware units (e.g., portions of integrated circuits) designed for use with other components or to perform a portion of a program. The program can be stored on a computer-readable storage medium and, when executed by the processor 206, can perform one or more functions related to transportation services.

[0041] The memory / storage device 208 can include any suitable type of mass storage for storing any type of information that the processor 206 can process. The memory / storage device 208 can be volatile or nonvolatile, magnetic, semiconductor, tape, optical, removable, non-removable, or other mass storage device or tangible (i.e., non-transitory) computer- readable storage medium, including, but not limited to, ROM, flash memory, dynamic RAM, and static RAM. The memory / storage device 208 can be configured to store one or more computer programs that can be executed by the processor 206 to provide transportation services, including coordinating drivers and riders, presenting maps, and providing navigation information. For example, the memory / storage device 208 can be configured to store a program that can be executed by the processor 206 to provide cost-sharing transportation services.

[0042] Memory / storage 208 can be further configured to store information and data used by processor 206. For example, memory / storage 208 can be configured to store various types of data received by communication interface 204 (e.g., transportation service requests, vehicle information, driver information, updated trip information, map data, traffic data, cost-sharing information, etc.). Memory / storage 208 can also store intermediate data, such as rendered map portions, navigation routes, sizes and shapes of elements displayed in a display area, etc. The various types of data can be stored permanently, removed periodically, or ignored immediately after processing each data frame.

[0043] Display 110 can include 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 description. The display can include many different types of materials, such as plastic or glass, and can be touch-sensitive to receive input from a user. For example, the display can include a substantially rigid touch-sensitive material, such as Gorilla Glass™, or a substantially flexible touch-sensitive material, such as Willow Glass™.

[0044] Figure 3 is a block diagram of an exemplary server 172, consistent with some embodiments. Server 172 can include a communication interface 304, which can be similar to communication interface 204, with design features focused on the use of a server, such as high throughput, high availability, and high reliability. In some embodiments, communication interface 304 can receive transportation service requests from terminal devices 112, 116, and / or 118, and send service matching information to terminal 114 and / or local cost-sharing matching information to terminal devices 116 and / or 118. In some embodiments, communication interface 304 can send pick-up location information and / or navigation route information to terminal devices 112, 114, 116, and / or 118.

[0045] Server 172 can also include at least one processor 306. Processor 306 can be any suitable type of processor, and can be similar to processor 206, with design features focused on the use of a server, such as high speed, multi-core, low latency, high reliability, high availability, and the ability to perform parallel computations. Processor 306 can process service requests received by communication interface 304 and determine matching service carriers to fulfill the requests. Processor 306 can also determine that riders share the same service vehicle to save costs. In some embodiments, processor 306 can determine appropriate prices for cost-sharing options based on factors such as demand-supply, historical price information, time of day, probability of success, etc.

[0046] The server 172 can also include a memory / storage device 308, which can include any type of mass storage device. The memory / storage device 308 can be similar to the memory / storage device 208, with design features focused on the use of the server, e.g., high capacity, high throughput, high reliability, high availability, high speed, etc.

[0047] Figures 4A-4B A flowchart illustrating an example method 400 for providing cost- sharing transportation services is shown. The method 400 can be implemented by the terminal device 112 / 116 / 118, the server 172, or the terminal device and the server collectively. It is contemplated that any of the steps of the method 400 can be performed by the processor 206 alone, by the processor 306 alone, or by the processors 206 and 306 collectively. Hereinafter, the processor 206 is used as an example to describe the steps of the method 400. As described below, the method 400 can include a number of steps. It should be appreciated that some of the steps provided herein for carrying out the embodiments can be optional. Furthermore, some of the steps can be performed simultaneously, or in a different order than as described below. Figures 4A-4B

[0048] At step 402, the processor 206 can provide a cost-sharing option to a first user (e.g., the user 102). In some embodiments, the cost-sharing can be provided as an option prior to receiving user input regarding origin / destination information. For example, after the user 102 launches a transportation service application installed on the terminal device 112, the user 102 can be provided with one or more transportation service options including a cost-sharing option. In some embodiments, the cost-sharing option can be provided as a default transportation service option. In some embodiments, the cost-sharing option can be provided based on a determination of whether the origin location and / or the destination is within a cost-sharing service area. For example, the processor 206 can receive a request for transportation services to a first destination (e.g., the destination 132) from the user 102. Figure 5A An example user interface 510 displayed on the display 210 of the terminal device 200 is shown, where the user 102 can enter destination information into an input field 520. After the user 102 taps the input field 520, a destination information user interface 522 can be displayed, as shown in Figure 5B where the user 102 can enter an address or description of the destination in a destination field 524 using a soft keyboard 526 or by tapping one of the suggested destinations from a list 528. Additionally, the user 102 can use his / her current location as the starting point for the transportation service or enter a different starting location in a starting information field 529.

[0049] ​In some embodiments, processor 206 may determine whether the destination and / or origin fall within a predetermined geographical area, such as a carpooling area that provides cost-saving transportation services. In some embodiments, processor 206 may determine whether both the origin and destination fall within a carpooling area. In some embodiments, processor 206 may determine whether one of the origin and destination falls within a carpooling area. If it is determined that the requested trip does not fall within a carpooling area, a standard cost option may be offered to user 102. On the other hand, if it is determined that the requested trip falls within a carpooling area, a cost-sharing option may be offered to user 102.

[0050] Figure 5C The image shows an exemplary interface that provides cost-sharing options to user 102. For example... Figure 5C As shown, a cost-sharing option is offered as carpooling option 530. The carpooling option may come with a price 532, which can be a discount on the normal price as a reward for user 102's willingness to share the service vehicle with other passengers. The price can be determined based on various factors, such as the geographic area associated with the transportation service (e.g., different cities may have different prices for similar routes), the demand for the transportation service within the geographic area (e.g., higher demand may be associated with higher prices), the supply of the transportation service within the geographic area (e.g., lower supply may be associated with higher prices), the history of the transportation service with the cost-sharing option (e.g., historical carpooling prices can be used as guidelines or benchmarks), the probability of finding at least one passenger to share the cost of the transportation service (e.g., if the probability of finding a passenger is relatively low, then the price may be relatively high), the time of day (e.g., peak hours may be associated with higher prices), etc. In some embodiments, the price may be a fixed price (e.g., as...). Figure 5C The fixed rate 538 shown does not change regardless of whether the passenger actually shares the service vehicle. In some embodiments, the price may be dynamically adjusted based on the number of passengers actually sharing the service vehicle. A waiting time 537 may also be provided to user 102, indicating the estimated time required to locate the passenger and / or driver.

[0051] In step 404, processor 206 may receive input from user 102 instructing them to select a cost-sharing option. For example, such as Figure 5C As shown, user 102 can click button 538 to request transportation services using the cost-sharing option. Otherwise, user 102 can choose other options, such as regular transportation or taking a taxi.

[0052] In step 406, information about the boarding area 120 can be provided to user 102. Figure 5DAn example interface 540 depicting an example pick-up area 120 is shown. In some embodiments, the pick-up area 120 can be centered around the starting location 126. As mentioned above, the shape of the pick-up area 120 can vary. Thus, although Figure 5D A circular pick-up area is shown, but other shapes can also be used. Additionally, the boundaries of the pick-up area 120 relative to the location 126 can be predetermined (e.g., 50 meters, 100 meters, 200 meters, 5 minute walking distance, 4 blocks, etc.) or dynamically determined (e.g., smaller on rainy days, larger on sunny days, smaller when traffic is heavy and larger when traffic is light, etc.). In some embodiments, the boundaries of the pick-up area 120 can be determined based on the geographic location associated with the starting location 126. For example, in cities where there is a sufficient number of potential riders and / or drivers, the pick-up area 120 can be relatively small. On the other hand, in rural areas where there are few potential riders and / or drivers, the pick-up area can be relatively large. In some embodiments, information regarding the pick-up area 120 can be provided to the user 102 in the information block 542, indicating the address or point of interest where the pick-up location will be. As Figure 5D shown, the starting location 126 can be the same or different from the current location 122 of the user 102.

[0053] In step 408, the processor 206 can receive an input from the user 102 indicating whether the user 102 decides to proceed with the request for the cost-sharing service. For example, the user 102 can click on the "Request" button 544 shown in the interface 540 to request the cost-sharing transportation service. Figure 5D

[0054] In step 410, the processor 206 can determine whether the user 102 requests the cost-sharing service trip (e.g., by clicking on the confirmation button via the interface 540). If not (e.g., the user 102 clicks on the "Back" key via the interface 540), the method 400 proceeds to step 412 in which the processor 206 can provide the user 102 with the regular cost option. On the other hand, if the user 102 does request the cost-sharing service option (e.g., by clicking on the "Request" button 544 shown in the interface 540), the method 400 proceeds to intermediate step A. Figure 5D Figure 4B An example process following step A is shown.

[0055] Turning to Figure 4B ​​From step A, the method 400 proceeds to step 420, where the processor 206 can search for a second user related to the requested cost-sharing transportation service. As described above, the second user can be a rider or a service provider. For example, the transportation request of the user 102 can be broadcasted to potential riders and / or service providers within an area close to the user 102 to wait for at least one second user to accept the request. In another example, a second user can be selected to match the request. In step 422, the processor 206 can determine whether a second user is found. If not, the method 400 proceeds to step 423, where the processor 206 can determine whether a predetermined duration (e.g., a maximum waiting period) has been exceeded. If not, the method 400 returns to step 420 to further attempt to locate a second user. However, if the predetermined duration has been exceeded in step 423, the method 400 proceeds to step 425, where the processor 206 can stop searching for a second user. For example, when the second user is a rider, the processor 206 can stop searching for a rider to share the service vehicle with the user 102. When the second user is a driver, the processor 206 can notify the user 102 that the requested transportation service with cost-sharing option is not available and can suggest other ride options.

[0056] Returning to step 422, if a suitable second user is found in step 422, the method 400 proceeds to step 424, where the processor 206 can determine a pickup location (e.g., the pickup location 124). As described above, the pickup location 124 can be within the pickup area 120.

[0057] In some embodiments, the pickup location 124 can be determined based on historical data. For example, historical information of pickup locations of transportation requests can be collected and analyzed to determine an optimal pickup location within the pickup area 120. Various factors can be used to determine the pickup location 124. For example, the frequency of use of a particular spot as a pickup location can indicate that the place is suitable as a convenient drop-off spot. Similarly, the number of orders, pickup distribution throughout the day, etc. can also be factored in.

[0058] In some embodiments, the pickup location 124 can be determined by optimizing a pickup route 144 between the location of the service vehicle and the pickup location. For example, the pickup location 124 can be selected at a place where the distance, driving time, or traffic condition from the current location of the driver 104 to the pickup location 124 is optimal. In another example, the pickup location 124 can be selected on one side of the road so that the driver 104 does not have to make a U-turn for other complex or time-consuming routes. In another example, the pickup location 124 can be selected among places that allow passengers to get on, such as the entrance of a hotel, a park, etc., and avoid places such as bus stops, roundabouts, etc.

[0059] In some embodiments, the pickup location 124 can be determined to minimize the likelihood of cancellation of the transportation service. For example, a learning model can be trained based on historical data associating pickup locations and service cancellations. Then, based on the current service request and factors of the available pickup locations, the learning model can predict a cancellation probability for each available pickup location. The processor 206 can select the pickup location associated with the lowest cancellation probability likelihood.

[0060] In some embodiments, the processor 206 can determine the pickup location in the form of geographic coordinates based on the factors discussed above. After determining the geographic coordinates of the pickup location, an address or point of interest corresponding to the geographic coordinates can be determined based on, for example, map data.

[0061] In some embodiments, the processor 206 can determine one or more candidate pickup locations. In some embodiments, the candidate pickup locations can be within the pickup area 120. The processor 206 can provide the candidate pickup locations to the user 102 and can receive input from the user 102 indicating a selection of a pickup location from the candidate pickup locations.

[0062] In some embodiments, the processor 206 can determine one or more candidate pickup locations based on historical information of pickup locations in the transportation service. In some embodiments, the processor 206 can access historical pickup location data including relationships between historical pickup locations and user locations. For example, the historical pickup location data can include information of actual pickup locations corresponding to the starting location and the current location of the user. The candidate pickup locations can be selected from the actual pickup locations (e.g., the most popular pickup locations).

[0063] In some embodiments, the processor 206 can determine one or more candidate pickup locations based on locations of service vehicles providing cost-sharing transportation services. For example, the candidate pickup locations can be selected from pickup locations having the shortest average distance or the shortest pickup and drop-off time for the service vehicles.

[0064] In step 426, the pickup location can be provided to the user 102. Figure 5E An exemplary interface 550 depicting the pickup location 124, the walking route 142, and the driving route 144 is shown. As shown, a countdown timer 552 can be provided to the user 102 indicating the remaining time for the user 102 to walk to the pickup location 124. Additionally, a suggested arrival time 554 can also be provided in the information tab 556. Figure 5E

[0065] Returning to Figure 4B , the method 400 can proceed from step 426 to step 428, in which the processor 206 can provide a navigation route to the pickup location to the user 102. As shown, the navigation route can be provided in the navigation tab 558. Figure 5E ​As shown, the interface 550 shows a navigation route 142 to the pick-up location 124.

[0066] In some embodiments, the processor 206 can search for a same-rider sharing the cost of the transportation service in step 420 and provide an indication of the availability of the same-rider to the user 102. For example, Figure 6 An exemplary interface 600 including a same-rider matching portion 602 is shown. The portion 602 can include one or more available same-riders and an indication to search for additional same-riders. In some embodiments, the processor 206 can determine the available same-rider based on the destination of the same-rider and the destination of the user 102. For example, the processor 206 can receive a transportation service request from a third user to travel to a second destination, similar to the transportation service request received from the user 102. The processor 206 can determine whether the second destination is close to the first destination, for example, by calculating the distance between the two destinations. If the distance between the two destinations is within a preset threshold, the processor 206 can determine that the third user can be a same-rider to share the service vehicle with the user 102.

[0067] In another example, the processor 206 can determine the driving time between the first destination and the second destination. If the driving time is less than a preset threshold, the processor 206 can determine that the third user can be a same-rider.

[0068] In another example, the processor 206 can determine a first driving route of the user 102 and a second driving route of the third user. If the two driving routes overlap, for example, to a degree higher than a threshold (e.g., 70% overlap, 80% overlap, etc.), the processor 206 can determine that the third user is a same-rider. In this case, the second destination does not need to be close to the first destination. As long as the first and second routes overlap sufficiently, the third user can be determined to be a same-rider.

[0069] After determining the availability of the same-rider, the same-rider can be provided with an invitation to join the user 102 to share the service vehicle 110. After the same-rider accepts the invitation, the information of the same-rider can be provided to the user 102 as updated information. For example, as shown, Figure 6 As shown, the profile photo of the same-rider can appear in the same-rider matching portion 602.

[0070] In some embodiments, the user 102 can be asked to confirm the number of seats needed for the trip. For example, Figure 7 An exemplary interface 700 depicting a seat selection tab 710 is shown. In some embodiments, one seat can be set as the default number of seats for the cost-sharing option. The user 102 can select the number of seats needed, up to a cap (e.g., a maximum of two seats).

[0071] In some embodiments, other riders can be allowed to share the service vehicle as long as there are available seats on the service vehicle. In some embodiments, to avoid frequent stops, a maximum number of stops can be set for cost-splitting trips. For example, a maximum of three stops can be set to improve the ride experience. When the maximum number of stops is reached, other cost-splitting requests can be rejected.

[0072] In some embodiments, other cost-splitting requests can also be rejected when the service vehicle is close to the destination of the user 102 or any of the riders. For example, the processor 206 can determine the distance between the current location of the service vehicle and the destination 132. If the distance is shorter than a threshold, other cost-splitting requests can be rejected. In another example, when the ratio between the distance to the destination and the total distance from the pickup location to the destination is lower than a preset value, indicating that the user is close to the destination, other rider requests can be rejected.

[0073] Another aspect of the present application relates to a non-transitory computer- readable storage medium storing instructions that, when executed, cause one or more processors to perform the method as described above. The computer-readable storage medium can include volatile or non-volatile, magnetic, semiconductor, tape, optical, removable, non-removable, or other type of computer-readable storage medium or computer-readable storage device. For example, the computer-readable storage medium of the present application can be a storage device or a storage module having computer instructions stored thereon. In some embodiments, the computer-readable storage medium can be a disk or a flash drive having computer instructions stored thereon.

[0074] Obviously, various modifications and changes can be made to the system and related methods disclosed in the present application by those of ordinary skill in the art. Other embodiments apparent to those of ordinary skill in the art are also as obvious from the description and practice of the system and related methods disclosed in the present application.

[0075] The specification and examples given herein are to be considered exemplary only, with the true scope of the application being indicated by the following claims and their equivalents.

Claims

1. A system for providing cost-sharing transportation services, comprising: Memory that stores computer-readable instructions; as well as At least one processor coupled to the memory, wherein when the instructions are executed by the at least one processor, the processor causes the processor to perform the following operations: Receive cost sharing requests from the first user via the cost sharing option; Search for a second user related to the cost-sharing request; and Based on the first user's current location and service information associated with the second user, the first user's boarding location is determined from a predetermined boarding area, wherein the predetermined boarding area is determined based on a starting location associated with the cost-sharing request, the current location being different from the starting location, and the boarding location is determined based on the walking distance from the current location to the boarding location, wherein the size of the boarding area is determined based on information associated with the starting location, the information indicating at least the number of service providers and / or demanders of the cost-sharing transportation service within the area associated with the starting location.

2. The system according to claim 1, characterized in that, The operation includes: The boarding area is determined based on at least one of the following: a preset distance from the starting location, a geographical area associated with the starting location, traffic conditions associated with the starting location, or a time of day.

3. The system according to claim 1 or 2, characterized in that: The second user is a passenger of the first user; and The operation includes: After locating the second user, the information about the boarding location is provided to the first user.

4. The system according to claim 3, characterized in that, The operation includes: Receive input from the first user, the input representing a first destination related to the cost-sharing option; and Search for the second user based on the first destination.

5. The system according to claim 4, characterized in that, The operation includes: When the distance between the second destination associated with the second user and the first destination is less than a preset threshold, it is determined that the second user has been found.

6. The system according to claim 4, characterized in that, The operation includes: The second user is identified when the driving time from the second destination associated with the second user to the first destination is less than a preset threshold, or the driving time from the first destination to the second destination is less than a preset threshold.

7. The system according to claim 4, characterized in that, The operation includes: Determine a first route from the first location within the boarding area to the first destination; and When the overlap between the second route associated with the second user and the first route is greater than a preset threshold, it is determined that the second user has been found.

8. The system according to claim 1, characterized in that, The operation includes: When at least one seat is available to provide the cost-sharing transportation service, add one or more users to the cost-sharing request.

9. The system according to claim 1, characterized in that, The operation includes: When the number of stations on the route of the cost-sharing transportation service is lower than a preset threshold, one or more users are added to the cost-sharing request.

10. The system according to claim 4, characterized in that, The operation includes: When the distance between the first user's current location and the destination associated with the first user is less than a preset threshold, or when the ratio between the distance and the total distance from the boarding location to the first destination is less than a preset value, other users are denied the right to join the cost-sharing request.

11. The system according to claim 1, characterized in that, The operation includes: The boarding location is obtained by optimizing the average distance between the locations of the first and second users and the boarding location.

12. The system according to claim 1, characterized in that, The operation includes: One or more candidate boarding locations are identified within the boarding area; and Provide the first user with one or more candidate boarding locations.

13. The system according to claim 12, characterized in that, The operation includes: Based on historical information about boarding locations for transportation services, one or more candidate boarding locations are determined.

14. The system according to claim 12, characterized in that, The operation includes: Based on the location of the service vehicle providing the cost-sharing transportation service, determine one or more candidate boarding locations.

15. The system according to claim 1, characterized in that, The operation includes: Provide the first user with instructions on the second user's drop-off location.

16. The system according to claim 1 or 2, characterized in that: The second user is a service provider offering the cost-sharing transportation service; and the operation includes: after locating the second user, providing the first user with information about the boarding location.

17. The system according to claim 1, characterized in that, The operation includes: Determine the address or point of interest corresponding to the boarding location; and The address or point of interest is provided to the first user.

18. The system according to claim 1, characterized in that, The operation includes determining a price associated with the cost-sharing option based on at least one of the following: The geographical area related to the transportation service; The demand for transportation services within the geographical area; Transportation services provided within the geographical area; The history of transportation services with the aforementioned cost-sharing options; The probability of finding at least the second user to share the cost of the transportation service; or A certain time of day.

19. The system according to claim 18, characterized in that, The operation includes: The price is determined to be a fixed price; and The fixed price is provided to the first user as part of the cost-sharing request.

20. The system according to claim 1, characterized in that, The operation includes: Provide the first user with a navigation route to the boarding location.

21. The system according to claim 1, characterized in that, The operation includes: The first user is provided with information about the boarding area so that the first user can determine whether to submit the cost-sharing request.

22. A computer-implemented method for providing cost-sharing transportation services, comprising: Receive cost sharing requests from the first user via the cost sharing option; Search for a second user related to the cost-sharing request; as well as Based on the first user's current location and service information associated with the second user, the first user's boarding location is determined from a predetermined boarding area, wherein the predetermined boarding area is determined based on a starting location associated with the cost-sharing request, the current location being different from the starting location, and the boarding location is determined based on the walking distance from the current location to the boarding location, wherein the size of the boarding area is determined based on information associated with the starting location, the information indicating at least the number of service providers and / or demanders of the cost-sharing transportation service within the area associated with the starting location.

23. The method according to claim 22, characterized in that, include: The boarding area is determined based on at least one of the following: a preset distance from the starting location, a geographical area associated with the starting location, traffic conditions associated with the starting location, or a time of day.

24. The method according to claim 22 or 23, characterized in that: The second user is a passenger of the first user; and The method includes: After locating the second user, the information about the boarding location is provided to the first user.

25. The method according to claim 24, characterized in that, include: Receive input from the first user, the input representing a first destination related to the cost-sharing option; as well as Search for the second user based on the first destination.

26. The method according to claim 25, characterized in that, include: When the distance between the second destination associated with the second user and the first destination is less than a preset threshold, it is determined that the second user has been found.

27. The method according to claim 25, characterized in that, include: The second user is identified when the driving time from the second destination associated with the second user to the first destination is less than a preset threshold, or the driving time from the first destination to the second destination is less than a preset threshold.

28. The method according to claim 25, characterized in that, include: Determine a first route from the first location within the boarding area to the first destination; as well as When the overlap between the second route associated with the second user and the first route is greater than a preset threshold, it is determined that the second user has been found.

29. The method according to claim 22, characterized in that, include: When at least one seat is available to provide the cost-sharing transportation service, add one or more users to the cost-sharing request.

30. The method according to claim 22, characterized in that, include: When the number of stations on the route of the cost-sharing transportation service is lower than a preset threshold, one or more users are added to the cost-sharing request.

31. The method according to claim 25, characterized in that, include: When the distance between the first user's current location and the destination associated with the first user is less than a preset threshold, or when the ratio between the distance and the total distance from the boarding location to the first destination is less than a preset value, other users are denied the right to join the cost-sharing request.

32. The method according to claim 22, characterized in that, include: The boarding location is obtained by optimizing the average distance between the locations of the first and second users and the boarding location.

33. The method according to claim 22, characterized in that, include: Identify one or more candidate boarding locations within the boarding area; as well as Provide the first user with one or more candidate boarding locations.

34. The method according to claim 33, characterized in that, include: Based on historical information about boarding locations for transportation services, one or more candidate boarding locations are determined.

35. The method according to claim 33, characterized in that, include: Based on the location of the service vehicle providing the cost-sharing transportation service, determine one or more candidate boarding locations.

36. The method according to claim 22, characterized in that, include: Provide the first user with instructions on the second user's drop-off location.

37. The method according to claim 22 or 23, characterized in that: The second user is the service provider that provides the cost-sharing transportation service; After locating the second user, the information about the boarding location is provided to the first user.

38. The method according to claim 22, characterized in that, include: Determine the address or point of interest corresponding to the boarding location; as well as The address or point of interest is provided to the first user.

39. The method according to claim 22, characterized in that, This includes determining the price associated with the cost-sharing option based on at least one of the following: The geographical area related to the transportation service; The demand for transportation services within the geographical area; Transportation services provided within the geographical area; The history of transportation services with the aforementioned cost-sharing options; The probability of finding at least the second user to share the cost of the transportation service; or A certain time of day.

40. The method according to claim 39, characterized in that, include: The price is determined to be a fixed price; as well as The fixed price is provided to the first user as part of the cost-sharing request.

41. The method according to claim 22, characterized in that, include: Provide the first user with a navigation route to the boarding location.

42. The method according to claim 22, characterized in that, Also includes: The first user is provided with information about the boarding area so that the first user can determine whether to submit the cost-sharing request.

43. A non-transitory computer-readable storage medium storing a set of instructions that, when executed by at least one processor of an electronic device, cause the electronic device to perform the method according to any one of claims 22 to 42.

Images