CN110895724A - Vehicle ride sharing - Google Patents

Vehicle ride sharing Download PDF

Info

Publication number
CN110895724A
CN110895724A CN201910840345.0A CN201910840345A CN110895724A CN 110895724 A CN110895724 A CN 110895724A CN 201910840345 A CN201910840345 A CN 201910840345A CN 110895724 A CN110895724 A CN 110895724A
Authority
CN
China
Prior art keywords
occupant
driver
ride
rider
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.)
Withdrawn
Application number
CN201910840345.0A
Other languages
Chinese (zh)
Inventor
凡西克利须那·拉维占陀罗
尚卡尔·拉奥
桑托吉·卡塔尔
斯瓦特·波尔
莫汉·班达里
加金德拉·库马尔·加内桑
拉扎·卡里姆·艾哈迈德
斯拉博尼·班纳吉
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.)
Ford Global Technologies LLC
Original Assignee
Ford Global Technologies LLC
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Ford Global Technologies LLC filed Critical Ford Global Technologies LLC
Publication of CN110895724A publication Critical patent/CN110895724A/en
Withdrawn legal-status Critical Current

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION 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/00Administration; Management
    • G06Q10/04Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION 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/00Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
    • G06Q50/40Business processes related to the transportation industry

Landscapes

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

Abstract

The present subject matter relates to methods and systems for organizing vehicle ride sharing. In one example, a ride request associated with an occupant is received and a virtual mapping zone having a predetermined radial distance around an occupant pick-up location is determined. Further, a target driver of the occupant is dynamically determined from the list of potential drivers until the target driver is within the virtual mapping zone. A potential driver is a driver with a commute route that is compatible with the rider pick-up location and destination. The target driver is the driver among the potential drivers whose estimated arrival time to the point where the occupant gets on the vehicle is the shortest. The target driver within the virtual mapping zone is mapped with the occupant.

Description

Vehicle ride sharing
Technical Field
The inventive subject matter relates generally to vehicle ride sharing and, more particularly, to methods and systems for organizing vehicle ride sharing.
Background
Vehicle ride sharing or ride sharing is a recent transportation trend that allows a vehicle owner or driver to share a vehicle ride with other riders who need the ride. Vehicle ride sharing is considered a more environmentally friendly and sustainable means of travel because sharing vehicle rides reduces air pollution, traffic congestion on the road, and the need for parking lots. To facilitate vehicle ride sharing, many ride sharing management systems have been proposed. Typically, a ride share management system receives a ride offer from a driver and a ride request from an occupant. The ride offer is based on the driver commute route, and the ride request is based on the rider pick-up location and the rider destination. Further, a matching ride is identified by comparing the driver commute route to the rider pick-up location and the rider destination. Further, the driver and the occupant of the matching ride are mapped to each other after receiving consent from both the driver and the occupant.
An exemplary system is described in U.S. patent 8688532 (the' 532 patent). In the' 532 patent, the occupant whose occupant location or occupant destination is geographically closest to the driver is identified. Further, the occupant location and occupant destination of the selected occupant are presented to the driver, and if the driver accepts, a notification of the ride offer is sent to the selected occupant. After the rider accepts the ride offer, the driver maps with the rider. Typically, a ride share management system relies on the location of a rider computing device (e.g., a mobile phone) determined based on a global positioning system to obtain the rider boarding location. However, the location provided by the computing device may be inaccurate and may not properly represent the rider boarding location. In some cases, the driver and the occupant may not be able to position each other, which may result in cancellation of the ride request and/or the ride supply request. Further, after mapping the driver and the occupant, the estimated time for the driver to reach the boarding location of the occupant may increase due to situations such as traffic or detour of the driver. The increased estimated arrival time causes the occupant to wait more than the contracted wait time. Similarly, after a ride is requested, the rider may not be in a location previously used to determine where the rider gets on the vehicle, which causes the driver to wait for the rider.
Disclosure of Invention
The summary of the invention provides an introduction to the concept related to organizing vehicle ride sharing. These concepts are further described in the detailed description that follows. This summary is not intended to identify essential features of the claimed subject matter, nor is it intended for use in determining or limiting the scope of the claimed subject matter.
In one embodiment, a method for organizing vehicle ride sharing is described. To this end, the method includes the step of receiving a ride request associated with the occupant. The ride request includes the rider boarding location, the rider destination, and the rider seat demand amount. A virtual mapping zone is generated having a predetermined radial distance around the occupant boarding location. A determination cycle is performed to determine a list of potential drivers, an estimated time of arrival of each of the potential drivers at the rider boarding location, and a target driver in the list of potential drivers. A potential driver is a driver who has a commute route that is compatible with the occupant pick-up location and destination and has seat availability equal to or greater than the occupant seat demand amount. The target driver is the driver from the list of potential drivers who has the shortest estimated arrival time to the point where the occupant gets on the vehicle. The determination periods are performed in a loop until the target driver determined at the end of each determination period is within the virtual mapping zone. The shortest estimated arrival time of the target driver at the end of each determined period is communicated to the occupant. Further, the target driver is mapped with the occupant upon recognizing that the target driver is within the virtual mapping zone.
In another embodiment, a system for organizing vehicle ride sharing is described. The system includes a processor and a ride organization module coupled to the processor. The processor enables the ride organization module to execute the set of instructions to perform the following steps. A ride request associated with an occupant is received. The ride request includes the rider boarding location, the rider destination, and the rider seat demand amount. A virtual mapping zone having a predetermined radial distance around the occupant pick-up location is determined. A determination cycle is performed to determine a list of potential drivers. A potential driver is a driver who has a commute route that is compatible with the occupant pick-up location and destination and has seat availability equal to or greater than the occupant seat demand amount. An estimated time of arrival for each potential driver is determined and compared to identify a target driver from a list of potential drivers. The target driver is the driver from the list of potential drivers who has the shortest estimated arrival time to the point where the occupant gets on the vehicle. The determination periods are performed in a loop until the determined target driver is within the virtual mapping zone at the end of each determination period. The shortest estimated arrival time of the target driver at the end of each determined period is communicated to the occupant. Further, the target driver is mapped with the occupant upon recognizing that the target driver is within the virtual mapping zone.
Thus, with the method and system for organizing vehicle ride sharing, a target driver of an occupant is dynamically determined until the target driver is within the virtual mapping zone. Dynamically determining the target driver may reduce occupant latency. For example, it provides the opportunity for a new driver with the shortest estimated arrival time to the point where the occupant gets on the vehicle, who is unavailable during the first determination period and then becomes available, to be added to the list of potential drivers and finally becomes the target driver during the subsequent determination period. Furthermore, providing a predetermined boarding location for the occupant avoids confusion in the mutual positioning between the driver and the occupant.
Drawings
The following detailed description refers to the accompanying drawings in which:
FIG. 1 illustrates a system environment for organizing vehicle ride sharing in one example consistent with the subject matter of this disclosure;
FIG. 2 illustrates a block diagram of a system for organizing vehicle ride shares, in one example consistent with the subject matter of this disclosure;
FIG. 3 illustrates a flow chart of a method for organizing vehicle ride sharing, according to one embodiment of the present subject matter; and
fig. 4 illustrates a flow chart of a method for organizing vehicle ride sharing in another embodiment according to the inventive subject matter.
Detailed Description
Traditionally, in vehicle ride sharing, the occupant making the ride request is mapped with the driver who is willing to supply the ride. The mapping of driver and occupant occurs immediately upon identifying the driver and receiving consent from both the occupant and the driver. The rider typically gives consent based on the estimated arrival time of the driver at his location. However, due to various situations, such as traffic, driving with a route change, etc., the estimated time for the driver to reach the passenger's place increases, which results in an increase in the waiting time for the passenger to ride.
To this end, systems and methods for organizing vehicle ride sharing are described herein. Organizing vehicle ride sharing with the system and method may reduce the time a rider waits for his ride after requesting a ride. In one example, to organize vehicle ride sharing, a ride request associated with a rider is received. The ride request includes the rider boarding location, the rider destination, and the rider seat demand amount. The occupant getting-on place is a place where the occupant wants to get on, and the occupant destination is a place where the occupant wants to get off. In one example, a ride request is received based on a ride request input provided by an occupant via an occupant computing device. Examples of occupant computing devices may include smart phones, tablets, and computers. In another example, the rider boarding location may be predetermined and a ride request associated with the rider is received when the rider's current location is within a zone in which the predetermined boarding location is located. In yet another example, the rider boarding location is the current location of the rider computing device.
Once a ride request is received, a virtual mapping zone around the rider pick-up location is determined. The virtual mapping zone is a zone having a predetermined radial distance around the occupant boarding location. In one example, a virtual mapping zone having a predetermined radial distance is created around the occupant boarding location. In another example, the virtual mapping zone may be predetermined for a predetermined occupant boarding location.
Further, the determination cycle is performed to determine a list of potential drivers interested in providing the ride for the occupant, an estimated arrival time of each potential driver, a target driver in the list of potential drivers. A potential driver is a driver who has a commute route that is compatible with the occupant pick-up location and the occupant destination and has seat availability greater than or equal to the occupant seat demand amount. The list of potential drivers is determined based on a ride offer input provided via a driver computing device by a driver interested in offering a ride. Examples of driver computing devices may include smart phones, tablets, and computers. Ride supply inputs include driver commute routes and seat availability. The driver commute route is compared to the occupant pick-up location and the occupant destination, and the driver seat availability is compared to the driver seat demand quantity to determine a list of potential drivers.
Further, an estimated arrival time of each of the potential drivers to the point where the occupant gets on the vehicle is determined. In one example, the estimated time of arrival is determined based on the driver's current location, the occupant pick-up location, the average speed limit in the road en route from the driver's current location to the occupant pick-up location, and the traffic conditions in the road. Once the estimated time of arrival for each potential driver is determined, a target driver is determined from the potential drivers. The target driver is the driver in the list of potential drivers who has the shortest estimated arrival time to the point where the occupant gets on the vehicle. The target driver is determined by comparing the estimated arrival times of each potential driver and identifying the shortest arrival time from the estimated arrival times of the potential drivers.
Further, the current location of the target driver is determined and compared to the virtual mapping area to determine whether the target driver is within the virtual mapping area. Upon identifying that the target driver is not within the virtual mapping area, the determination cycle is repeated to determine the list of potential drivers, the estimated arrival time of each of the potential drivers, and the target driver of the potential drivers whose estimated arrival time is the shortest. The determination period is repeated until the target driver identified at the end of the determination period is within the virtual mapping zone. Further, at the end of each determination period, the estimated arrival time of the target driver is communicated to the occupant. Upon identifying that the target driver is within the virtual mapping zone, the target driver is mapped with the occupant.
Performing the determination cycle until the target driver is within the virtual mapping zone may reduce the occupant's waiting period. For example, it provides the opportunity for a new driver with the shortest estimated arrival time to the point where the occupant gets on the vehicle, who is unavailable during the first determination period and then becomes available, to be added to the list of potential drivers and finally becomes the target driver during the subsequent determination period. Similarly, a predetermined rider boarding location may eliminate confusion with the meeting point of the rider and the driver.
The above embodiments are further described herein with reference to the accompanying drawings. It should be noted that the description and drawings relate to exemplary embodiments and are not to be construed as limiting the inventive subject matter. It will also be appreciated that a variety of arrangements can be devised which, although not explicitly described or shown herein, embody the principles of the inventive subject matter. Moreover, all statements herein reciting principles, aspects, and embodiments, as well as specific examples thereof, are intended to encompass other embodiments that do not depart from the scope of the inventive subject matter.
Fig. 1 illustrates a system environment 100 for organizing vehicle ride sharing in one example consistent with the subject matter of this disclosure. The system environment 100 includes a rider computing device 102, a driver computing device 104, and a system 108 for organizing vehicle ride shares. The system 108 includes a ride organization module 110. The rider computing device 102 is a device used by a rider to provide a ride request input. The occupant computing device 102 may comprise a smartphone, tablet, or computer. The driver computing device 104 is a device used by the driver to provide ride offer input. The driver computing device 104 may include a smart phone, a tablet, a computer, or a vehicle infotainment system. In one example, the rider computing device 102 and the driver computing device 104 may include devices that operate based on a Global Positioning System (GPS) or similar navigation system to track the location of the devices. The rider computing device 102 and the driver computing device 104 communicate with a ride organization module 110 via a communication network 106. In one example, communication network 106 includes a Local Area Network (LAN), a Metropolitan Area Network (MAN), a Wide Area Network (WAN), wireless, and the Internet (Internet). The ride organization module is configured to receive a ride request from the rider and a ride offer from the driver and organize vehicle ride sharing such that a wait time for the rider to obtain his ride is reduced.
System 108 may be implemented as a logic-based system. In one example, the system 108 may also include processing logic for processing data obtained by the occupant computing device 102 and the driver computing device 104. In one example, system 108 may be implemented as a server application running on a smartphone. Operation and working of the provisioning system 108 is provided in connection with the detailed description provided in FIG. 2
Fig. 2 illustrates a block diagram of a system 108 for organizing vehicle ride shares, in one example consistent with the subject matter of this disclosure. As shown in fig. 2, system 108 includes interface(s) 200, processor(s) 202, and memory 204. The interface(s) 200 may include various interfaces, such as interfaces for devices for data input and output, referred to as I/O devices, storage devices, network devices, etc., for communicatively associating the ride organization module 110 with the interface 200. The interface(s) 200 may also be used to facilitate communication between the rider computing device 102, the driver computing device 104, and various other computing devices connected in a network environment.
Processor(s) 202 may also be implemented as signal processor(s), state machine(s), logic circuitry, and/or any other device or component that manipulates signals based on operational instructions. In one example, the processor(s) 202 may be implemented as a controller to control or perform various functions associated with the ride organization module 106.
Memory 204 may store one or more computer readable instructions that may be retrieved and executed to organize vehicle ride sharing. Memory 204 may include any non-transitory computer-readable medium, including, for example, volatile memory (such as RAM (random access memory)), or non-volatile memory (such as EPROM (electrically programmable read only memory), flash memory), and so forth.
System 108 may also include module 228 and data 208. The module(s) 228 include the ride organization module 110 and the other module(s) 206. Module(s) 228 may be implemented as a combination of hardware and programming (e.g., programmable instructions) to implement one or more functions of module(s) 228. On the other hand, the data 208 includes boarding location data 210, destination data 212, occupant seat demand quantity data 214, virtual mapping zone data 216, a list of driver-of-interest data 218, a list of potential drivers 220, target driver data 222, estimated time of arrival data 224, and other data 226.
In the examples described herein, such a combination of hardware and programming may be implemented in a number of different ways. For example, the program for module(s) 228 may be processor-executable instructions stored on a non-transitory machine-readable storage medium, and the hardware for module(s) 228 may include processing resources (e.g., one or more processors) to execute such instructions. In this example, the machine-readable storage medium may store instructions that, when executed by the processing resource, implement the ride organization module 110, and its associated functionality. In such examples, the ride organization module 110 may include a machine-readable storage medium storing instructions and a processing resource executing the instructions, or the machine-readable storage medium may be separate but accessible to the module(s) 228 and the processing resource. In other examples, module(s) 228 may be implemented by electronic circuitry.
In operation, the ride organization module 110 may receive a ride request associated with a rider. The interface 200 is accessed by the rider using the rider computing device 102 over the communication network 106 to issue a ride request input. The ride request includes the rider boarding location, the rider destination, and the rider seat demand amount. The boarding place of the occupant is a place where the occupant wants to board. The occupant boarding location is stored in the boarding location data 210. In one example, the occupant pick-up location is the occupant's current location and is determined based on the occupant's computing device's GPS location. In another example, the occupant pick-up location is predetermined and stored in the pick-up location data 210. In another example, the predetermined rider boarding location may be a zone such as a bus stop that may be easily recognized by the driver and rider. Further, the occupant computing device generates the ride request upon identifying that the occupant's current location is within the area in which the predetermined occupant's boarding location is located. As previously explained, the occupant computing device 102 may include, but is not limited to, a mobile phone, a tablet, or a computer. Further, the rider computing device 102 may be any other device having a GPS or similar navigation system. The occupant destination is a place where the occupant wants to get off the vehicle. The occupant destination is stored in the destination data 212. In one example, the destination may also include a location that is a short walk location of the destination selected from the occupant. The occupant seat demand number is the number of seats required by the occupant. The occupant seat demand quantity is stored in the occupant seat demand quantity data 214. In another example, the other data 226 may include a list of occupants who are booked as regular occupants, as well as details regarding where the occupants get on, the occupant destination, and the number of seats required by the occupants associated with each occupant. The interface 200 enables the occupant to create, edit, or delete reservations and details from the other data 226 via the occupant computing device 102. Further, riders who regularly commute in the same route may be included in the list of riders in the list of driver data of interest 218 and their boarding locations and destinations stored in the boarding location data 210 and destination data 212.
The ride organization module 110 further determines a virtual mapping region surrounding the rider boarding location. The virtual mapping zone is an area having a predetermined radial distance around the occupant pick-up location. In one example, after receiving a ride request, a virtual mapping area is created around the rider boarding location. In one example, the ride organization module 110 obtains a value from the ride location data 210 that corresponds to the rider pick-up location. In addition, the ride organization module 110 creates a virtual mapping area corresponding to the ride pick-up location. The virtual mapping region is stored in virtual mapping region data 216. In another example, the virtual mapping area is predetermined for a predetermined pick-up location. A predetermined virtual mapping area for a predetermined boarding location is stored in the virtual mapping area data 216. In one example, the virtual mapping zone is a zone of radial distance of 500 meters around the occupant pick-up location. In yet another example, the rider and the rider may customize the radial distance of the virtual mapping zone using the rider computing device 102 and the rider computing device 104. Further, the customized virtual mapping zone is communicated to the system 108 via the interface 200 and stored in the virtual mapping zone data 216.
The ride organization module further performs a determination cycle to determine a list of potential drivers, an estimated time of arrival of each potential driver at the rider boarding location, and a target driver for the rider. The list of potential drivers is determined based on the ride offer input provided by the driver. The driver accesses the interface 200 via the driver computing device 104 to generate the ride offer input. Ride supply inputs include driver commute routes and seat availability. To determine the list of potential drivers, the ride organization module determines a list of drivers interested in supplying a ride to the rider. The list of drivers of interest is stored in the list of driver data of interest 218. In another example, the list of driver-of-interest data 218 may include a list of drivers who are subscribed to be drivers of interest, as well as details regarding commuting routes and seat availability associated with each driver of interest. The interface 200 enables the driver to create, edit or delete reservations and details from the list 218 of driver data of interest. Further, drivers regularly commuting on the same route may be included in the list of interested drivers in the list of interested driver data 218.
The ride organization module 110 retrieves a list of drivers interested in supplying a ride to the rider from the list of interested driver data 218 to determine a list of potential drivers. The list of potential drivers is determined by comparing the driver commute route to the occupant pick-up location and destination, and the driver seat availability to the occupant seat demand quantity. The determined list of potential drivers is stored in a list of potential driver data 220. Further, an estimated time of arrival for each of the potential drivers is determined based on the driver's current location obtained from the GPS location of the driver computing device 104. Further, a target driver in the list of potential drivers is determined by comparing the estimated arrival times of the potential drivers. The target driver is the driver with the shortest estimated arrival time in the list of potential drivers. The target driver is stored in the target driver data 222.
After performing the determination period, the ride organization module 110 compares the current location of the target driver to the virtual mapping region to determine whether the target driver is within the virtual mapping region. The current location of the target driver is determined from the GPS location of the driver computing device 104. Further, if the target driver is outside the virtual mapping area, the ride organization module 110 cycles through the determination period to determine the list of drivers of interest, the list of potential drivers, and the target driver until the target driver is within the virtual mapping area. Performing the determination cycle until the target driver is within the virtual mapping zone may reduce the occupant's waiting period. For example, at the end of the first determination period, if driver "a" is identified as the target driver, the estimated arrival time of driver "a" is communicated to the occupant. Further, if the current location of the driver "a" is not within the virtual mapping area, the second determination cycle is performed. In the second determination period, another driver "B" who was unavailable at the time of the first determination period and then became available to be added to the list of interested drivers. Further, driver "B" may be added to the list of potential drivers if driver "B" has a commuting route that is compatible with the occupant pick-up location and destination, and has a number of seats that is greater than or equal to the occupant seat demand. Further, if the estimated arrival time for driver "B" to arrive at the boarding location of the occupant from the list of potential drivers is shortest, driver "B" may be given the status of the target driver. Thereafter, if the current location of the driver "B" is not within the virtual mapping area, a third determination cycle is performed. Similarly, the determination period is cyclically performed until the target driver identified at the end of the determination period is within the virtual mapping zone.
The ride organization module 110 further communicates the estimated arrival time of the target driver to the occupant. At the end of each determination period, the estimated arrival time of the target driver is stored in the estimated arrival time data 224. The estimated time of arrival of the target driver is communicated to the occupant communication device 102 via the interface 200. The estimated arrival time of the target driver is the waiting period for the rider to ride. In addition, the ride organization module 110 maps the target driver to the occupant. The target driver is mapped with the occupant if the current location of the target driver is determined to be within the virtual mapping zone. In one example, the ride organization module 100 is configured to receive consent from the occupant prior to mapping the target driver to the occupant. In another example, in mapping the target driver with the occupant, the ride organization module 110 shares the details of the target driver and the occupant to the occupant computing device 102 and the driver computing device 104, respectively, via the interface 200.
In another example, if multiple riders create a ride request input, the ride organization module 110 creates a ride request queue. In one example, the ride request queue is created in the chronological order of the ride requests such that the rider that first made the ride request is given the highest priority in the queue. In another example, a queue of ride requests is created in order of distance between the rider pick-up location and the driver's current location, such that riders with ride pick-up locations close to the driver's current location are given the highest priority in the queue. The queue of ride requests is stored in other data 226. In addition, the processor 202 controls the ride organization module 110 to identify the target driver for each rider in the queue sequence. Further, in mapping the target driver with the rider, the ride organization module 110 receives a ride share confirmation from both the target driver and the rider. The rider and driver ride share confirmation when positioned relative to each other and when initiating a shared ride. The interface 200 receives ride share confirmation from the target driver and the rider via the driver communication device 104 and the rider communication device 102, respectively. In one example, the ride organization module 110 automatically generates a ride share confirmation when it is recognized that the current locations of the driver and the rider are the same and moving in the same direction. The current locations of the driver and the occupant are obtained from the driver computing device 104 and the occupant computing device 102, respectively. The ride share confirmation data is stored in other data 226. However, if a ride share confirmation is not received, the processor 202 triggers the ride organization module 110 to determine the availability of the rider ride. In one example, the interface 200 receives an input from the target driver that the occupant is unavailable at the point where the occupant gets on the vehicle. In another example, the occupant availability at the occupant pick-up location is determined based on the current location of the occupant computing device 102. The ride organization module 110, upon determining that the rider is not available at the rider boarding location, maps the target driver to the next available rider in the queue and updates the queue accordingly. Further, if the occupant is at the occupant pick-up location, the ride organization module 110 is triggered to determine the availability of the target driver for the ride. In one example, the interface 200 receives an input from the occupant that the target driver is unavailable at the occupant pick-up location. In another example, the availability of the target driver in the occupant pick-up location is determined based on the current location of the target driver computing device 104. The processor 202, upon determining that the target driver is not available at the rider pick-up location, maps the rider to the next available target driver and updates the queue accordingly.
Fig. 3 illustrates a flow chart of a method 300 for organizing vehicle ride shares, in an embodiment consistent with the subject matter of this disclosure. The order in which the methods are described should not be construed as a limitation, and any number of the described method blocks can be combined in any order to implement the foregoing methods, or an alternate method. Further, the method 300 may be implemented by a processing resource or computing device(s) by any suitable hardware, non-transitory machine-readable instructions, or combination thereof.
It is also understood that the method 300 may be performed by a programmed computing device, such as the system 108 depicted in fig. 2. Further, as will be readily appreciated, the method 300 may be performed based on instructions stored in a non-transitory computer readable medium. The non-transitory computer readable medium may include, for example, digital memory, magnetic storage media (such as one or more magnetic disks and tape), hard disk drives, or optically readable digital data storage media. The method 300 is described below with reference to the system 108 as described above; other suitable systems for performing the method may also be utilized. Additionally, implementation of these methods is not limited to these examples.
Returning to fig. 3, at block 302, a ride request associated with the occupant is received. The ride request includes the rider boarding location, the rider destination, and the number of seating demands. The rider may issue a ride request input using the rider computing device 102. In one example, the system 108 may include a predetermined rider boarding location. In addition, the ride organization module 110 receives a ride request input at the current location of the occupant within a predetermined territory where the occupant is located. The occupant's current location is identified via the occupant's computing device's GPS location. As previously set forth, the occupant computing device 102 may include, but is not limited to, a mobile phone, a tablet, or a computer. Further, the rider computing device 102 may be any other device having a GPS or similar navigation system. In another example, the predetermined rider boarding location may be a zone such as a bus stop that may be easily recognized by the driver and rider. Further, a ride request input is generated when the rider location is within the area where the rider boarding location is located.
At block 304, a virtual mapping region is determined. The virtual mapping zone is an area having a predetermined radial distance around the occupant pick-up location. In one example, the system 108 includes a predetermined virtual mapping zone for a predetermined rider boarding location. The predetermined virtual map area is stored in the virtual boarding area data 216. In addition, the ride organization module 110 determines a predetermined virtual mapping area for a predetermined rider boarding location from the virtual boarding area data 216. In another example, the ride organization module 110 creates a virtual mapping zone having a radial distance of 500 meters around the rider boarding location. In yet another example, the driver and the rider customize the radial distance of the virtual mapping zone via the driver computing device 104 and the rider computing device 102. In addition, the interface 200 receives the customized virtual mapping zone and stores it in the virtual pick-up zone data 216.
At block 306, a list of potential drivers is determined by the determination module. To determine the list of potential drivers, a list of drivers interested in supplying a ride to the occupant is determined. In one example, the interface 200 is accessed by a driver using the driver computing device 104 over the communication network 106 to issue a ride offer input. In another example, the list of driver-of-interest data 218 may include a list of drivers who are subscribed to be drivers of interest, as well as details regarding commuting routes and seat availability associated with each driver of interest. The interface 200 enables the driver to create, edit or delete reservations and details from the list 218 of driver data of interest. Further, drivers who regularly commute on the same route may be included in the list of drivers of interest in the list of driver data of interest 218. The ride organization module 110 retrieves a list of drivers interested in supplying a ride to the rider from the list of interested driver data 218.
Once the list of drivers of interest is determined, a list of potential drivers in the list of drivers of interest is determined by comparing the driver commute route to the occupant pick-up location and destination, and comparing the available seats to the occupant seat demand quantity. A potential driver is a driver who has a commute route that is compatible with the occupant pick-up location and destination and has seat availability greater than or equal to the occupant seat demand amount.
At block 308, an estimated arrival time for each potential driver is determined. The estimated time of arrival is determined based on the driver's current location obtained from the driver computing device 104. In one example, the estimated time of arrival is determined based on the driver's current location, the occupant pick-up location, an average speed limit in a road en route from the driver's current location to the occupant pick-up location, and traffic conditions in the road. For example, the current location of the driver is determined from the location of the driver computing device. Further, en route from the driver's location to the occupant's boarding location, average speed, and traffic conditions may be determined from navigation systems known in the art.
At block 310, a target driver in a list of potential drivers is determined. The target driver is the driver among the potential drivers, and the estimated arrival time to the point where the occupant gets on the vehicle is the shortest. The ride organization module 110 compares the estimated arrival times of the potential drivers and determines the driver with the shortest estimated arrival time.
At block 312, the estimated arrival time of the target driver is communicated to the occupant. In one example, the shortest estimated time of arrival for the target driver is communicated to the occupant computing device via interface 200.
At block 314, the location of the target driver is compared to the virtual mapping zone to determine whether the target driver is within the virtual mapping zone. Upon determining that the current location of the target driver is outside of the virtual mapping zone (the "NO" branch from block 314), the determination cycle as described with respect to blocks 306, 308, 310, and 312 is performed in a loop until the current location of the target driver is within the virtual mapping zone (the "YES" branch from block 314). In the determination period, a list of potential drivers, an estimated arrival time of each potential driver at the point where the occupant gets on the vehicle, and a target driver in the list of potential drivers are determined. The waiting period for the occupant may be reduced by performing the determination cycle in a loop until the target driver is within the virtual mapping zone. For example, it provides the opportunity for a new driver with the shortest estimated arrival time to the point where the occupant gets on the vehicle, who is unavailable during the first determination period and then becomes available, to be added to the list of potential drivers and finally becomes the target driver during the subsequent determination period.
At block 316, the target driver within the virtual mapping zone is mapped with the occupant. The ride organization module 110 shares the details of the target driver and the rider to the rider computing device 102 and the driver computing device 104, respectively, via the interface 200. In one example, after communicating the estimated arrival time of the target driver to the occupant, consent is received from the occupant prior to mapping the target driver with the occupant. Driver details may include vehicle registration number, vehicle model, driver name, driver rating, and the like. Occupant details may include occupant name, occupant disembarking location, occupant rating, and the like.
Fig. 4 illustrates an example method 400 for organizing vehicle ride sharing using system 100 in an embodiment consistent with the subject matter of this disclosure. The order in which the methods are described should not be construed as a limitation, and any number of the described method blocks can be combined in any order to implement the foregoing methods, or an alternate method. Further, the method 400 may be implemented by a processing resource or computing device(s) by any suitable hardware, non-transitory machine-readable instructions, or combination thereof.
It is also understood that the method 400 may be performed by a programmed computing device, such as the system 108 depicted in fig. 2. Further, as will be readily appreciated, the method 400 may be performed based on instructions stored in a non-transitory computer readable medium. The non-transitory computer readable medium may include, for example, digital memory, magnetic storage media (such as one or more magnetic disks and tape), hard disk drives, or optically readable digital data storage media. The method 400 is described below with reference to the system 108 as described above; other suitable systems for performing the method may also be utilized. Additionally, implementation of these methods is not limited to these examples.
Returning to fig. 4, at block 402, the system 108 receives a ride request associated with each of a plurality of riders. Each occupant may issue a ride request input using the occupant computing device 102. The ride request includes a rider boarding location, a rider destination, a number of ride demands, and a ride request time. The rider may use the rider computing device 102 to issue a ride request input. In one example, the system 108 may include a predetermined rider boarding location. In addition, the ride organization module 110 receives a ride request input at the current location of the occupant within the geographic area where the predetermined occupant boarding location is located. The occupant's current location is identified via the occupant's computing device's GPS location. As previously set forth, the occupant computing device 102 may include, but is not limited to, a mobile phone, a tablet, or a computer. Further, the rider computing device 102 may be any other device having a GPS or similar navigation system. In another example, the predetermined rider boarding location may be a zone such as a bus stop that may be easily recognized by the driver and rider. Further, a ride request input is generated when the rider location is within the area where the rider boarding location is located.
At block 404, the ride requests are queued in a sequence based on the time of the ride request. The ride organization module 110 creates a queue for the ride request such that the rider that first made the ride request is given priority. In another example, the ride organization module 110 creates a queue of ride requests based on the distance between the rider pick-up location and the driver's current location in order to give the rider priority to the rider with the pick-up location closer to the driver's current location.
At block 406, a virtual mapping region having a predetermined radius around the rider boarding location is created for each rider by the ride organization module 110. The virtual mapping zone is an area having a predetermined radial distance around the occupant pick-up location. In one example, the system 108 includes a predetermined virtual mapping area for predetermined occupant boarding locations in the boarding location data 210. In addition, the ride organization module 110 receives a predetermined virtual mapping area for a predetermined rider boarding location. In another example, the ride organization module 110 creates a virtual mapping zone having a radial distance of 500 meters around the rider boarding location. In yet another example, the driver and the occupant customize the radial distance of the virtual mapping zone via the interface 200.
At block 408, a list of potential drivers for each occupant is determined. To determine the list of potential drivers, a list of drivers interested in supplying a ride to the rider is determined by the ride organization module 110. In one example, the interface 200 is accessed by a driver using the driver computing device 104 over the communication network 106 to issue a ride offer input. In another example, the list of driver-of-interest data 218 may include a list of drivers that are reserved as being of interest, as well as details regarding commuting routes and seat availability associated with each driver of interest. The interface 200 enables the driver to create, edit, or delete subscriptions and details from the list 218 of driver data of interest. Further, drivers who regularly commute on the same route may be included in the list of drivers of interest in the list of driver data of interest 218. The ride organization module 110 retrieves a list of drivers interested in supplying a ride to the rider from the list of interested driver data 218.
Once the list of interested drivers is determined, a list of potential drivers from the list of interested drivers is determined for each occupant by comparing the driver commuting route to the occupant pick-up location and destination, and comparing the available seats to the occupant seat demand quantity. A potential driver is a driver who has a commute route that is compatible with the occupant pick-up location and destination and has seat availability greater than or equal to the occupant seat demand amount.
At block 410, an estimated arrival time for each potential driver is determined. The estimated time of arrival is determined based on the driver's current location obtained from the driver computing device 104. In one example, the estimated time of arrival is determined based on the driver's current location, the occupant pick-up location, an average speed limit in a road en route from the driver's current location to the occupant pick-up location, and traffic conditions in the road. For example, the current location of the driver is determined from the location of the driver computing device. Further, en route from the driver's location to the occupant's boarding location, average speed, and traffic conditions may be determined from navigation systems known in the art.
At block 412, a target driver in the list of potential drivers is determined in priority order for each occupant in the queue such that an occupant with a high priority is first assigned the target driver. The target driver is the driver among the potential drivers, and the estimated arrival time to the point where the occupant gets on the vehicle is the shortest. The processor compares the estimated arrival times of the potential drivers and determines the driver with the shortest estimated arrival time.
At block 414, the estimated arrival time of the target driver associated with each occupant is communicated to the occupant. In one example, the shortest estimated time of arrival for the target driver is communicated to the occupant computing device 102 via the interface 200.
At block 416, the target driver's location is compared to the virtual mapping zone to determine whether the target driver is within the virtual mapping zone. Upon determining that the current location of the target driver is outside of the virtual mapping zone (the "NO" branch from block 416), the determination period as described with respect to blocks 408, 410, 412, and 414 is performed in a loop until the current location of the target driver is within the virtual mapping zone (the "YES" branch from block 416). In the determination cycle, a list of potential drivers, an estimated arrival time of each potential driver at the point where the occupant gets on the vehicle, and a target driver in the list of potential drivers are determined. The waiting period for the occupant may be reduced by performing the determination cycle in a loop until the target driver is within the virtual mapping zone. For example, it provides the opportunity for a new driver with the shortest estimated arrival time to the point where the occupant gets on the vehicle, who is unavailable during the first determination period and then becomes available, to be added to the list of potential drivers and finally becomes the target driver during the subsequent determination period.
At block 418, the target driver within the virtual mapping zone is mapped with the occupant. The ride organization module 110 shares the details of the target driver and the rider to the rider computing device 102 and the driver computing device 104, respectively, via the interface 200. Driver details may include vehicle registration number, vehicle model, driver name, driver rating, and the like. Occupant details may include occupant name, occupant disembarking location, occupant rating, and the like.
At block 420, it is determined that a ride share confirmation is received from both the target driver and the occupant. In ride share confirmation, the rider and driver confirm the arrival of the ride and initiate the shared ride. In one example, the rider and driver confirm the arrival of the ride via the rider computing device 102 and the driver computing device 104, respectively. In another example, the ride organization module 110 automatically generates a ride share confirmation when it is recognized that the current locations of the driver and the rider are the same and moving in the same direction. The current locations of the driver and the occupant are obtained from the driver computing device 104 and the occupant computing device 102, respectively. Further, the ride organization module 110 receives a ride share confirmation from the target driver and the rider via the interface 200. If a ride share confirmation is received ("yes" branch from block 420), the method 400 may stop.
If a ride share confirmation is not received ("no" branch from block 420), then the availability of the rider is determined at block 422. In one example, the ride organization module 110 receives input from the target driver via the driver computing device 104. For example, if the present location of the occupant is different from the seating location of the occupant, or the occupant rejects the seating provided by the driver, the occupant is considered to be unavailable. In another example, the determination module determines the occupant's availability at the occupant pick-up location based on a current location of the occupant computing device.
After the occupant's unavailability is determined (the "no" branch from block 422), the target driver is mapped to the next available occupant in the queue at block 424, and the queue is updated accordingly.
After confirming the occupant's availability ("yes" branch from block 422), the driver's availability is determined at block 426. In one example, the interface 200 receives input from the occupant via the occupant computing device regarding the availability of the target driver at the occupant pick-up location. For example, if the current location of the target driver is different from the riding location of the occupant, or the target driver refuses the occupant to ride, the target driver is considered to be unavailable. In another example, the determination module determines a target driver availability at the occupant pick-up location based on a current location of the driver computing device 104.
Upon determining that the target driver is not available (the "no" branch from block 426), the occupant is mapped to the next available target driver at block 428 and the queue is updated accordingly.
Although examples of the present disclosure have been described in language specific to structural features and/or methodological acts, it is to be understood that the appended claims are not necessarily limited to the specific features or acts described. Rather, the specific features and methods are disclosed and explained as examples of the disclosure.

Claims (10)

1. A method for organizing vehicle ride sharing, the method comprising:
receiving a ride request associated with a rider, wherein the ride request includes a rider boarding location, a rider destination, and a rider seat demand quantity;
determining a virtual mapping zone having a predetermined radial distance around the occupant pick-up location;
determining that the target driver is within the virtual mapping zone,
determining a list of potential drivers interested in supplying a ride to the occupant, wherein the potential drivers are drivers having a commute route compatible with the occupant pick-up location and the occupant destination and having a seat availability greater than or equal to the occupant seat demand number;
determining an estimated arrival time for each of the potential drivers to reach the occupant pick-up location based on a current location of the respective potential driver; and
determining a target driver in the list of potential drivers, wherein the target driver is the one of the potential drivers for which the estimated arrival time to the rider location is the shortest;
communicating the estimated arrival time of the target driver to the occupant; and
mapping the target driver with the occupant within the virtual mapping zone.
2. The method of claim 1, wherein the rider boarding location is a predetermined boarding location.
3. The method of claim 1, wherein the ride request is received based on a ride request input provided by the rider in a rider computing device.
4. The method of claim 2, wherein the ride request is received when the rider enters a zone in which the predetermined pick-up location is located.
5. The method of claim 1, further comprising communicating information of the target driver within the virtual mapping zone to the occupant.
6. A system for organizing vehicle ride sharing, the system comprising:
a processor; and
a ride organization module coupled to the processor, the ride organization module to:
receiving a ride request associated with a rider, wherein the ride request comprises a rider boarding location, a rider destination, and a rider seat demand quantity;
determining a virtual mapping zone having a predetermined radial distance around the occupant pick-up location;
determining the following until a target driver is within the virtual mapping zone:
determining a list of potential drivers interested in providing a ride for the rider, wherein
The potential driver is a driver having a commute route compatible with the occupant pick-up location and the occupant destination and having a seat availability greater than or equal to the occupant seat demand number;
determining an estimated arrival time for each of the interested drivers to reach the rider boarding location based on the current location of the respective potential driver; and is
Determining a target driver in the list of potential drivers, wherein the target driver is the one of the potential drivers for which the estimated arrival time to the rider location is the shortest;
communicating the estimated arrival time of the target driver to the occupant; and is
Mapping the target driver with the occupant within the virtual mapping zone.
7. The system of claim 6, wherein the ride organization module receives the ride request from a rider computing device.
8. The system of claim 6, wherein the ride organization module stores a list of predetermined pick-up locations.
9. The system of claim 8, wherein the ride organization module generates a ride request when the rider enters a zone where a predetermined pick-up location is located.
10. The system of claim 6, wherein the ride organization module determines a list of drivers interested in providing a ride for the received rider based on a ride request input provided by the driver in a driver computing device.
CN201910840345.0A 2018-09-12 2019-09-06 Vehicle ride sharing Withdrawn CN110895724A (en)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
IN201841034473 2018-09-12
IN201841034473 2018-09-12

Publications (1)

Publication Number Publication Date
CN110895724A true CN110895724A (en) 2020-03-20

Family

ID=69785904

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201910840345.0A Withdrawn CN110895724A (en) 2018-09-12 2019-09-06 Vehicle ride sharing

Country Status (1)

Country Link
CN (1) CN110895724A (en)

Similar Documents

Publication Publication Date Title
US11004343B2 (en) Ride chaining
CN108765933B (en) Method, device, equipment and storage medium for recommending boarding points
US11475490B2 (en) Method and system for vehicle allocation to customers for ride-sharing
US11062415B2 (en) Systems and methods for allocating networked vehicle resources in priority environments
US11118924B2 (en) Method and system for predicting traffic conditions
JP6851402B2 (en) Methods and systems for providing transportation services
US11378408B2 (en) Route coordination and navigation based on user proximity to points of interest
EP3228989A1 (en) Vehicle control method and apparatus, computer program and recording medium
US20180275661A1 (en) Multi-mode transportation planning and scheduling
US20180238695A1 (en) Casual driver ride sharing
CN110832561B (en) System and method for determining and recommending boarding location for vehicles
US20160018230A1 (en) Multiple destination vehicle interface
CN110956375B (en) Order processing method and device
WO2022134365A1 (en) Vehicle scheduling method, apparatus, and system, device, and storage medium
JP2021526246A (en) Systems and methods to improve the visualization of traffic conditions
US20200356911A1 (en) Dynamic routing of vehicles through established corridors
KR20180013116A (en) Method and system for processing an order for traffic demand service
CN111859180B (en) Get-on point recommendation method and system
US11481821B2 (en) Vehicle allocation for fixed rental rides
CN110741401A (en) System and method for reserving car pooling services
JP6333341B2 (en) Information processing apparatus, search area setting method, and program
CN110895724A (en) Vehicle ride sharing
KR102405473B1 (en) Method and apparatus for determining moving path of a vehicle considering movement flow of passengers
JP7359664B2 (en) charge calculation device
CN114550481B (en) Information processing device, information processing system, information processing method, and storage medium

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
WW01 Invention patent application withdrawn after publication
WW01 Invention patent application withdrawn after publication

Application publication date: 20200320