Method for requesting transportation services

Information

  • Patent Grant
  • 11070944
  • Patent Number
    11,070,944
  • Date Filed
    Tuesday, January 28, 2020
    4 years ago
  • Date Issued
    Tuesday, July 20, 2021
    2 years ago
Abstract
A method for safely and efficiently requesting transportation services through the use of mobile communications devices capable of geographic location is described. Individual and package transportation may be provided. New customers may be efficiently serviced, and the requester and transportation provider locations may be viewed in real time on the mobile devices.
Description
FIELD OF THE INVENTION

The present invention relates generally to on-demand transportation of individuals and goods and, more particularly, to a method for requesting transportation using mobile or fixed communication devices capable of geographical location.


BACKGROUND OF THE INVENTION

The efficiency of on-demand transportation services is often limited by the time required to acquire a new customer. For example, taxicabs, on average, are “down” 50% of the time with no passenger to transport. During this down time, taxicab drivers are typically searching for their next passenger by simply looking for a “hailing” signal. In addition to being inefficient, both the driver and passenger are anonymous when a taxicab is “hailed” on the street, and drivers are robbed or killed by unknown passengers. The U.S. State Department has issued warnings to travelers in some foreign countries not to hail taxis in the street; rather, it is recommended that a cab be called from a hotel.


The use of a cell phone by a passenger to request a taxi and by a driver to confirm a pickup allows both to be identified by their cell phone numbers, thereby improving security for both passenger and driver. The use of cell phones that can be identified also permits improved service and management features; for example, a passenger leaving an item in a taxicab can later identify the taxi and recover the item.


The delivery of service information to a mobile device where a person is notified of a personalized service based on previously stored subscriber profile information has been d scribed, an example being hotel selection based on subscriber room requirements. However, the user must already be registered as a subscriber, and must enter subscriber preferences for storage prior to the provision of service information, thereby limiting the usefulness and availability of this service. Location-dependent matching of mobile communication devices where mobile devices are automatically matched by a central server based on user profiles has also been described. Applications of this procedure include a central server matching a passenger requesting taxi service to a nearby available taxi and dispatching a taxi thereto. However, central dispatching of taxi service may not include independently operating taxi drivers. Steps of confirming, canceling, or completing such transactions are not described.


The availability of transportation services that are provided by units operating with a predetermined schedule and route, such as city buses, are limited by the lack of real-time information concerning their actual location.


SUMMARY OF THE INVENTION

Accordingly, it is an object of the present invention to provide a method for requesting transportation services having improved efficiency and security.


Another object of the invention is to provide a method for requesting transportation services from multiple transportation service companies.


Still another object of the invention is to provide a method for communicating real-time location information of a transportation service provider to a potential passengers mobile phone.


Additional objects, advantages and novel features of the invention will be set forth in part in the description that follows, and in part will become apparent to those skilled in the art upon examination of the following or may be learned by practice of the invention. The objects and advantages of the invention may be realized and attained by means of the instrumentalities and combinations particularly pointed out in the appended claims.


To achieve the foregoing and other objects, and in accordance with the purposes of the present invention, as embodied and broadly described herein, the method for requesting transportation services, hereof, includes: providing a wireless communications network for routing messages; providing a computer for processing information in cooperation with the wireless communications network; sending a request for transportation services to the computer through the communications network using a first communications device having geographic location; sending the geographic location of the first communications device to the computer through the wireless communications network; storing the request and the determined location on the computer; transmitting the stored request and location of the first communications device to at least one transportation provider having a wireless communications device through the wireless communications network; generating a confirmation signal on the wireless communications network from the at least one transportation provider; selecting one transportation provider from the at least one transportation provider; and generating a second confirmation signal from the computer to the transportation requester using the wireless communications network notifying the transportation requester that transportation service has been arranged.


In another aspect of the present invention, and in accordance with its objects and purposes, the method for obtaining time-of-arrival information for at least one transportation vehicle following a predetermined route at a chosen location on the route, hereof, includes: providing a wireless communications network for routing messages; providing a computer for processing information in cooperation with the wireless communications network; sending the geographic location of the chosen location on the route using a first communications device; sending the geographic location for each vehicle of the at least one transportation vehicle at selected time intervals using a wireless mobile communications device located thereon to the computer through the wireless communications network; analyzing the geographic location information at the selected time intervals u ng the computer; comparing the analyzed location information with the scheduled location of the at least one vehicle along the predetermined route; and calculating the time-of-arrival of the at least one vehicle at the chosen location.


Benefits and advantages of the present invention include, but are not limited to, providing a method for safely and efficiently requesting transportation services, whereby new customers may be serviced, requester and transportation provider locations may be viewed in real time on the mobile devices, requesters may be presented with a consolidated view of transportation providers since the transportation providers may be associated with multiple companies, the process may be automated, there is no requirement that the requester subscribes to or otherwise be known to the system in advance of the request, and there is no requirement that the requester provides preference or profile information,





BRIEF DESCRIPTION OF THE DRAWINGS

The accompanying drawings, which are incorporated in and form a part of the specification, illustrate an embodiment of the present invention and, together with the description, serve to explain the principles of the invention. In the drawings:



FIG. 1 is a schematic representation of an embodiment of apparatus effective for performing the method of the present invention.



FIG. 2 is a flow diagram illustrating a typical request for transportation services using the apparatus illustrated in Fla 1 hereof in the absence of a dispatcher.



FIG. 3 illustrates an application of the present invention to requesting transportation services from a taxicab.



FIG. 4 illustrates an application of the present invention to a traveler interested in using a city bus system.





DETAILED DESCRIPTION OF THE INVENTION

Briefly, the present invention includes a method for safely and efficiently requesting transportation services through the use of mobile communications devices capable of geographic location. Individual or package transportation may be provided. New customers may be efficiently serviced, and the requester and transportation provider locations may be viewed in real time on the mobile devices.


Embodiments of the present method, and an embodiment of the apparatus for implementing the method, hereof, permits a request of transportation services initiated from a smart mobile device (MD) having geographical location determination capability and wireless communication, to be made using a computer and a communication network into which the MD may be connected. It should be mentioned that the request for transportation might be made from another type of communications device, such as a wired telephone or land line, or a laptop or desktop computer, as examples. In the case of the use of a wired telephone, geographic information might be provided from a description of the location by the requester or from a Global Positioning System (GPS) operated by the requester, to an operator who would enter this information into the system. The processing of such requests, and/or other MDs, by the computer system may be automated, as may be the subsequent dissemination of the request by a transportation service provider. That is, from request to completion of service, the present apparatus may be real-time, on-demand, and computer automated, with no required human action other than to perform the initiation, confirmation and service of the request. There is no requirement that the requester subscribes to or otherwise be known to the system in advance of the request. Further, there is no requirement that the requester provides preference or profile information. Requests for transportation services specify the initial pickup location, and may be unpremeditated, or spur of the moment. The requester simply makes a request to be transported (or requests an item to be transported) using a smart MD equipped with software effective for accomplishing this request.


Requesters and transporters may have MDs effective for automatically determining the MDs geographical location, these locations being periodically communicated by means of a communications network to a computer system (CS) and disseminated to both requesters and all transporters (units capable of servicing the request), whereby their movements may be tracked. Potential transporters receive the request and the location of the requester on their mobile devices in real-time (typically within a few minutes), and at least one transporter performs the request either under direction from a dispatch center or the transporter independently decides to confirm and perform the request. The computer system receiving the messages from the transporters and requesters through the CS, including request information, confirmation by the potential transporter, and locations of the MDs, may store this information and track the locations of the requesters and transporters. The computer system may acknowledge the confirmation from a first transporter of a request, by sending an acknowledgement message to both the first confirming transporter and the requester, and sending rejection messages to all other transporters (if any) who subsequently sent confirmations for the same request. Other grounds for choosing a transporter may be envisioned. For example, as will be described hereinbelow, a dispatcher may make this selection. Multiple requests for transportation by a single requester may be rejected by the computer.


In another embodiment of the present invention where transporters are not specifically requested, but rather provide services on a predetermined schedule and route, the at least one transporter MD periodically sends location information to the computer system, but neither receives nor confirms requests. The computer and wireless network system disseminates transporter location information to requester MDs which request transporter location information.


Reference will now be made in detail to the present embodiments of the present invention, examples of which are illustrated in the accompanying drawings. Similar or identical structure is identified using identical reference characters. Turning now to the FIGURES, FIG. 1 is a schematic representation of one embodiment of apparatus, 100, effective for carrying out the steps of embodiments of the method for requesting transportation hereof. Requester MD, 102, may be a wireless mobile hardware device having software capable of communicating information to other mobile devices or computer system (CS), 104, and capable of determining the location of that device. An example of a mobile device is a hand-held programmable cell phone, such as an Apple® iPhone™ or a BlackBerry® Storm™, having geographical position location capability (through the cell system itself (signal triangulation), GPS, or by location specification from the user) and capability to connect to a private computer network or a public network such as the Internet through network, 106. In particular, requests may either be sent to transportation provider (transporter) MDs, 108a or 108b, or CS 104. Requester MD 102 may be tracked in the system by a unique identifier associated with MD 102.


Transporter MDs 108a and 108b may be wireless mobile hardware devices having location determination capability and software for enabling the device to communicate information with other mobile devices and with CS 104 through wireless network 106, whereby requests for transportation may be received. Such requests may be textually listed and/or displayed on a geographical map, and CS 104 and/or the requester MD 102 may be contacted confirming for CS 104 or requester MD 102 that the transportation provider will service the request (confirmation of request). An example of this device may also be a hand-held, programmable cell phone having geographical position location capability, and the capability to connect to a private computer network or a public network such as the Internet through wireless network 106, whereby messages may be transmitted to other MDs or a CS. Transporter MDs may be tracked by system 100 using a unique identifier associated with that MD.


It should be mentioned that requester MD 102 and transporter MDs 108a and 108b, may have map or textual display capabilities.


Network 106 may be a communications network effective for interconnecting computers and permits transfer of data between computers which may be a combination of land-based and wireless connections. The network may be a private network whose nodes are effective for carrying out the steps of embodiments of the method of the present invention, or an existing public network such as the Internet. Computer System (CS) 104 may be a computer system (hardware and software) for receiving and storing all requests, receiving and storing all transportation provider locations/activities, and having the capability of routing information to requester MDs, transportation provider MDs or a system for dispatching transportation services. Computer system 104 may be a computer node of a private computer network or a public network such as the Internet, may include multiple computers connected by an internal network, separate from network 106, or include transportation provider MDs connected using a private or public network.


In operation, requester MD 102 may send a request and its location to computer system 104 through network 106, CS 104 receiving the request and all locations of transportation provider MDs 108a and 108b. Computer System 104 may forward the request to all transportation provider MDs, where one of the transportation providers decides to service the request. The request status is then updated in CS 104, and MDs 108a and 108b may be notified of the change in status.


A dispatch system may be connected to network 106 (not shown in FIG. 1 hereof), including an additional computer, software, and storage, for receiving requests, cancellations, and location information from transportation providers and requesters. In addition, the dispatch system may receive requests, cancellations, and location information input by operators receiving requests from sources including telephone call-ins. The dispatch system upon receipt of such request, and upon action by an operator, may transmit a confirmation message to the requester and to a transporter with the purpose of directing that transporter to perform the request. A plurality of dispatch components may be connected to network 106.



FIG. 2 is a flow diagram illustrating a typical request for transportation services using the apparatus illustrated in FIG. 1 hereof in the absence of a dispatcher. A request, 200, from a requester MD, which may be a cell phone, is communicated to the known network address of a computer system (CS). As an example, the CS address may be the URL of a website and the CS and MDs communicate over the Internet with IP addresses. Requests may contain information giving the geographical location and a unique MD identification which may be the MD phone number. The request may contain additional information such as the destination location of the transportation request, the method of payment, and specific characteristics of what is to be transported. Characteristics may also include the number of individuals to be transported, the size and weight of packages to be delivered, a future time for the service to be performed and/or the type of material to be transported. The identification and location may be communicated periodically.


Transporter identification and location is communicated, 202, to the known network address of computer system (CS). The identification and location may be communicated periodically.


The CS stores, 204, the request, requester location and transporter location. The CS storage may contain all requests, requester locations and transporter locations.


The CS forwards, 206, the request and the requester's location to the transporter MDs, and the transporter locations to the requester's MD.


The transporter decides to service request and sends, 208, confirmation of this to the CS. This confirmation identifies the request with the unique MD identification of the requester.


The CS sends, 210, a positive acknowledgement of the transporter confirmation to the transporter MD and a confirmation to the requester if the transporter confirmation is the first confirmation received; otherwise, a negative acknowledgement is sent to the transporter MD. That is, any confirmations for the same request arriving after the first confirmation are rejected.


The transporter MD receives, 212, acknowledgement and commences service. The requester MD receives, 214, confirmation that includes the transporter's identification. At this point, the transporter has received the requester's telephone number and the requester has received the transporter's telephone number which permits voice communication between the two.


In the situation where no transporter is available, or no transporter confirms within a chosen time limit, the requester is notified that the request has timed out.


Additional embodiments of the present invention may include, but are not limited to, the following:

    • (a) Company Dispatch: a request may be transmitted to a CS using its IP address on the Internet; CS software stores the requests, stores all transporters, and sends the request to a dispatch system which dispatches a transporter to the requester based on operation efficiency (transporter availability, transporter type, company policies, and distance/time of the transporter from the requester), as an example.
    • (b) Unilateral Service Decision: a request is sent to a CS using its IP address which forwards the request to other mobile devices held by transporters; software on the transporter's MD may display multiple requests on a geographical map so that the transporter can chose a request to satisfy without being instructed by any dispatch component.
    • (c) Distributed CS: a request is sent to an IP address which is timeshared by the active transporter mobile devices; this embodiment replaces the CS with a distributed network of transporter MDs that accomplish the functions of the CS, the mobile devices themselves carrying the addresses of the other MDs in their network and communicating and synchronizing to complete the required GS tasks in a distributed manner; and
    • (d) Public Transportation on Scheduled Routes: here the transporter is a vehicle traveling along a predetermined scheduled route (examples include subway trains, light rail trains, commuter trains, ferries, trucks, and buses). The transporter's MD may periodically send location data to the CS, the data including the location of the vehicle, a unique identifier of the MD and a time stamp. The real-time route location is disseminated by the CS to user mobile devices who wish to observe the transporter locations.


Message protocols may include message types, formats and rules that are decoded and acted upon by software supporting the computer system arid by software supporting the MDs. Each message is identified with a unique identifier and time stamp. For example, if the MDs' are cell phones, the unique identifier is the cell phone number. Sample messages types and actions are illustrated in the TABLE.










TABLE







Initial
The requester and/or transporter signals initial communication with



computer network.


Request
The requester sends service request, whereby the request and



location information are stored in the computer network; the



requester is prevented from sending another request message.


Confirm
The transporter sends confirmation and location information for a



particular request, whereby the confirmation is stored in the



computer; the transporter receive a response to this message



containing a positive or negative acknowledgement status, whereby



positive acknowledgement is sent only if the transporter is first to



confirm, there is no prior dispatch message, and there is no prior



requester Cancel; the transporter is prevented from sending another



confirm message; upon receipt of positive acknowledgment, the



sending of a pickup message is enabled.


Pickup
The transporter signals that pickup has occurred and service has



begun; enables sending of dropoff message.


Dropoff
The transporter signals that dropoff has occurred and service has



been completed, wherein the service fare is communicated and



whereby the transporter confirm message is erased; this enables a



cash or credit information message to be sent.


Cash
The requester signals payment by cash which enables the sending of a



requester stop message.


Credit information
The requester signals payment by credit card; a message containing credit



card information is sent which effects a credit card authorization to a



merchant bank that will be returned in a subsequent requester and



transporter heartbeat message.


Requester Cancel
The requester signals cancellation of the previously sent request; a



stop message is automatically sent.


Transporter Cancel
The transporter signals cancellation of the previously sent confirmation



message.


Stop
The requester/transporter signals the end of the communication with



network, whereby any request and location information is erased from



storage.


Requester Heartbeat
Message periodically sent by requester MD with information including



requester's most recent location, whereby the location is stored in the



computer; the requester receives responses to this message type containing



information including location of transporters, the identity of the



transporter acknowledged to service request, service fare, and credit card



authorization status.


Transporter Heartbeat
Message periodically sent by transporter MD with information including



the most recent location, whereby the location is stored in the computer; the



transporter receives a response to this message type containing information



including location of requesters, payment type of cash or payment type of



credit card, and authorization status.


Dispatcher Get Information
Message periodically sent by the dispatcher; the dispatcher receives a


(optional)
response to this message type containing information including location of



requesters and transporters.


Dispatcher Request
The dispatcher sends a service request from a requester who placed the


(optional)
request from a telephone, whereby the request and location information is



stored in the computer network.


Dispatch (optional)
The dispatcher signals that the transporter is to pick up the requester,



wherein the requester and the transporter are identified; the dispatcher is



prevented from sending another dispatch message identifying the same



requester or transporter; the dispatcher receives a response to this message



type containing a positive or negative acknowledgement, whereby a



positive acknowledgement is sent only if there are no other prior dispatch



messages identifying the same requester or transporter, there are no



confirm messages of the identified requester's request, and there are no



confirm messages from the same transporter.









Having generally described embodiments of the present invention, the following EXAMPLES provide additional details thereof.


Example 1


FIG. 3 illustrates an application of the present invention to requesting transportation services from a taxicab, without the services of a dispatcher. Requester 300, located on 55th Street, wishes to acquire the services of a taxi, although no taxicab is visible to requester 300. The MDs of taxis 302 and 304 automatically and periodically wirelessly communicate their location information to CS 104 through network 106. The request for transportation services from requester 300 is achieved by the requester pushing a button on his or her programmable cell phone, and in step 306, the “hail a taxi” request is sent to computer system CS 104 which is receiving and tracking all active taxi locations. In steps 308a and 308b, the request is simultaneously forwarded to taxis 302 and 304, respectively. It should be mentioned, that all taxis in a county, city or borough, depending on the geographical size of these administrative entities, might receive the request. In step 310, taxi 302 decides to pick up requester 300 and sends a confirming signal to CS 104. In step 312, CS 104 confirms to requester 300 that a taxi is on the way. Computer system 104 also communicates the confirmation to taxi 304 in step 314. As stated hereinabove, multiple requests from requester 300 would be rejected by CS 104. Additionally, location information for taxi 302 may be provided to requester 300.



FIG. 4 illustrates an application of the present invention to a traveler interested in using a city bus system. In this application, city buses, 400, 402, 404, and 406 periodically transmit their geographic locations using MDs thereon to a computer 104 through wireless network 106. Computer 104 analyzes the time-varying geographic location data, matches the locations with bus schedules, and computes times-of-arrival and other route information. This information may be transmitted to traveler 408 where it is displayed on his or her cell phone in real time.


The foregoing description of the invention has been presented for purposes of illustration and description and is not intended to be exhaustive or to limit the invention to the precise form disclosed, and obviously many modifications and variations are possible in light of the above teaching. The embodiments were chosen and described in order to best explain the principles of the invention and its practical application to thereby enable others skilled in the art to best utilize the invention in various embodiments and with various modifications as are suited to the particular use contemplated. It is intended that the scope of the invention be defined by the claims appended hereto.

Claims
  • 1. A method for managing transportation services, the method comprising: determining a predetermined schedule for a transportation service provider to provide transportation services at scheduled locations along a predetermined route;periodically receiving location information from a transportation provider device associated with the transportation service provider operating in accordance with the predetermined schedule;determining, based on the periodically received location information from the transportation provider device, a real-time location of the transportation provider operating in accordance with the predetermined schedule;periodically comparing the real-time location of the transportation provider with scheduled locations along the predetermined route;receiving a request for services from a requester device;determining an arrival time for the transportation service provider to perform the request for services; andperiodically updating the arrival time for the transportation service provider to perform the request for services based on periodically comparing the real-time location with the scheduled location.
  • 2. The method of claim 1, wherein determining the predetermined schedule comprises determining a time of arrival for the transportation provider device to arrive at a scheduled location along the predetermined route.
  • 3. The method of claim 1, wherein receiving the request for services comprises receiving, from the requester device, a request for transportation from a pickup location to a destination location.
  • 4. The method of claim 1, further comprising providing an indication of the request for services for display within a geographical map on the transportation provider device.
  • 5. The method of claim 1, further comprising selecting the transportation service provider from among a plurality of transportation service providers to perform the request for services based on the predetermined schedule and the real-time location of the transportation provider.
  • 6. The method of claim 1, further comprising providing, to the requester device, the real-time location of the transportation provider.
  • 7. The method of claim 1, wherein directing the transportation service provider to perform the request for services comprises providing, to the transportation provider device, a location of the requester device.
  • 8. A system for managing transportation services, the system comprising: at least one processor; anda non-transitory computer readable medium comprising instructions that, when executed by the at least one processor, cause the system to: determine a predetermined schedule for a transportation service provider to provide transportation services at scheduled locations along a predetermined route;periodically receive location information from a transportation provider device associated with the transportation service provider operating in accordance with the predetermined schedule;determine, based on the periodically received location information from the transportation provider device, a real-time location of the transportation provider operating in accordance with the predetermined schedule;periodically compare the real-time location of the transportation provider with scheduled locations along the predetermined route;receive a request for services from a requester device;determine an arrival time for the transportation service provider to perform the request for services; andperiodically update the arrival time for the transportation service provider to perform the request for services based on periodically comparing the real-time location with the scheduled location.
  • 9. The system of claim 8, wherein the instructions cause the system to determine the predetermined schedule by determining a time of arrival for the transportation provider device to arrive at a scheduled location along the predetermined route.
  • 10. The system of claim 8, further comprising instructions that, when executed by the at least one processor, cause the system to receive the request for services by receiving, from the requester device, a request for transportation from a pickup location to a destination location.
  • 11. The system of claim 8, further comprising instructions that, when executed by the at least one processor, cause the system to provide an indication of the request for services for display within a geographical map on the transportation provider device.
  • 12. The system of claim 8, further comprising instructions that, when executed by the at least one processor, cause the system to select the transportation service provider from among a plurality of transportation service providers to perform the request for services based on the predetermined schedule and the real-time location of the transportation provider.
  • 13. The system of claim 8, further comprising instructions that, when executed by the at least one processor, cause the system to further comprising instructions that, when executed by the at least one processor, cause the system to provide, to the requester device, the real-time location of the transportation provider.
  • 14. The system of claim 8, wherein the instructions cause the system to direct the transportation service provider to perform the request for services by providing, to the transportation provider device, a location of the requester device.
  • 15. A non-transitory computer readable medium comprising instructions that, when executed by at least one processor, cause a computing device to: determine, a predetermined schedule for a transportation service provider to provide transportation services at scheduled locations along a predetermined route;periodically receive location information from a transportation provider device associated with the transportation service provider operating in accordance with the predetermined schedule;determine, based on the periodically received location information from the transportation provider device, a real-time location of the transportation provider operating in accordance with the predetermined schedule;periodically compare the real-time location of the transportation provider with scheduled locations along the predetermined route;receive a request for services from a requester device;determine an arrival time for the transportation service provider to perform the request for services; andperiodically update the arrival time for the transportation service provider to perform the request for services based on periodically comparing the real-time location with the scheduled location.
  • 16. The non-transitory computer readable medium of claim 15, wherein the instructions cause the computing device to determine the predetermined schedule by determining a time of arrival for the transportation provider device to arrive at a scheduled location along the predetermined route.
  • 17. The non-transitory computer readable medium of claim 15, further comprising instructions that, when executed by the at least one processor, cause the computing device to receive the request for services by receiving, from the requester device, a request for transportation from a pickup location to a destination location.
  • 18. The non-transitory computer readable medium of claim 15, further comprising instructions that, when executed by the at least one processor, cause the computing device to provide an indication of the request for services for display within a geographical map on the transportation provider device.
  • 19. The non-transitory computer readable medium of claim 15, further comprising instructions that, when executed by the at least one processor, cause the computing device to select the transportation service provider from among a plurality of transportation service providers to perform the request for services based on the predetermined schedule and the real-time location of the transportation provider.
  • 20. The non-transitory computer readable medium of claim 15, further comprising instructions that, when executed by the at least one processor, cause the computing device to provide, to the requester device, the real-time location of the transportation provider.
CROSS REFERENCE TO OTHER APPLICATIONS

This present application is a continuation of U.S. patent application Ser. No. 15/985,436, filed on May 21, 2018, now issued as U.S. Pat. No. 10,547,972, which is a continuation of Ser. No. 15/470,553, filed Mar. 27, 2017, which is a continuation of U.S. patent application Ser. No. 15/446,991, filed Mar. 1, 2017, now issued as U.S. Pat. No. 9,826,362, which is a continuation of U.S. patent application Ser. No. 15/429,779, filed Feb. 10, 2017, now issued as U.S. Pat. No. 9,723,447, which is a continuation of U.S. patent application Ser. No. 15/177,762, filed Jun. 9, 2016, now issued as U.S. Pat. No. 9,646,500, which is a continuation of U.S. patent application Ser. No. 14/745,346, filed Jun. 19, 2015, now issued as U.S. Pat. No. 9,392,418, which is a continuation of U.S. patent application Ser. No. 13/413,492, filed Mar. 6, 2012, now issued as U.S. Pat. No. 9,094,787, which is a continuation of U.S. patent application Ser. No. 12/348,850, filed Jan. 5, 2009, now issued as U.S. Pat. No. 8,131,307, which claims priority to U.S. Provisional Patent Applications 61/027,508, filed Feb. 11, 2008 and 61/009,839, filed Jan. 3, 2008. Each of the aforementioned patents and applications are hereby incorporated by reference in their entirety.

US Referenced Citations (133)
Number Name Date Kind
4360875 Behnke Nov 1982 A
5724243 Westerlage et al. Mar 1998 A
5945919 Trask Aug 1999 A
5953706 Patel Sep 1999 A
5973619 Paredes Oct 1999 A
6006159 Schmier et al. Dec 1999 A
6014430 Gosney Jan 2000 A
6240362 Gaspard, II May 2001 B1
6356838 Paul Mar 2002 B1
6414635 Stewart et al. Jul 2002 B1
6631322 Arthur et al. Oct 2003 B1
6697730 Dickerson Feb 2004 B2
6756913 Ayed Jun 2004 B1
6925381 Adamczyk Aug 2005 B2
6992598 Poltorak Jan 2006 B2
7064681 Horstemeyer Jun 2006 B2
7191057 Adamczyk Mar 2007 B2
7363319 Cappellini Apr 2008 B2
7394386 Nowlan Jul 2008 B2
7463879 Miller Dec 2008 B2
7479901 Horstemeyer Jan 2009 B2
7482952 Horstemeyer Jan 2009 B2
7538691 Horstemeyer May 2009 B2
7587276 Gold et al. Sep 2009 B2
7706808 Aggarwal et al. Apr 2010 B1
7751971 Chang Jul 2010 B2
7840027 Moroo et al. Nov 2010 B2
7870560 Fong et al. Jan 2011 B2
7957871 Echeruo Jun 2011 B1
8005488 Staffaroni et al. Aug 2011 B2
8131307 Lubeck et al. Mar 2012 B2
8160808 Sprigg Apr 2012 B2
8224571 Huang et al. Jul 2012 B2
8340904 Lin Dec 2012 B2
8639579 Kalevik et al. Jan 2014 B2
8798593 Haney Aug 2014 B2
8798647 Haney Aug 2014 B1
9031581 Haney May 2015 B1
9094787 Lubeck et al. Jul 2015 B2
9392418 Lubeck et al. Jul 2016 B2
9646500 Lubeck et al. May 2017 B2
9723447 Lubeck et al. Aug 2017 B2
9826362 Lubeck et al. Nov 2017 B2
9984575 Lubeck et al. May 2018 B2
9997076 Lubeck et al. Jun 2018 B2
10123173 Lubeck et al. Nov 2018 B2
10362444 Lubeck et al. Jul 2019 B2
10362445 Lubeck et al. Jul 2019 B2
20010056396 Goino Dec 2001 A1
20020004703 Gaspard, II Jan 2002 A1
20020034292 Tuoriniemi et al. Mar 2002 A1
20020080048 Choi Jun 2002 A1
20020099599 Minassian Jul 2002 A1
20020127997 Karlstedt et al. Sep 2002 A1
20030001779 Mintz et al. Jan 2003 A1
20030037110 Yamamoto Feb 2003 A1
20030046146 Westerman Mar 2003 A1
20030054837 Ennis Mar 2003 A1
20030065556 Takanashi et al. Apr 2003 A1
20030087648 Mezhvinsky May 2003 A1
20030153330 Naghian et al. Aug 2003 A1
20030177020 Okamura Sep 2003 A1
20040036622 Dukach Feb 2004 A1
20040076280 Ando et al. Apr 2004 A1
20040093280 Yamaguchi May 2004 A1
20040106399 Ki Jun 2004 A1
20040158395 Yamada et al. Aug 2004 A1
20040177109 Lee Sep 2004 A1
20040219933 Faith Nov 2004 A1
20040225600 Onodera et al. Nov 2004 A1
20040236502 Nozaki Nov 2004 A1
20040243430 Horstemeyer Dec 2004 A1
20040249818 Isaac Dec 2004 A1
20050004757 Neeman Jan 2005 A1
20050014486 Shimizu et al. Jan 2005 A1
20050032529 Akama Feb 2005 A1
20050033511 Pechatnikov et al. Feb 2005 A1
20050038696 Kalevik et al. Feb 2005 A1
20050052462 Sakamoto et al. Mar 2005 A1
20050153707 Ledyard et al. Jul 2005 A1
20050216286 Kalinichenko et al. Sep 2005 A1
20050216317 Medellin et al. Sep 2005 A1
20050227620 Morimoto Oct 2005 A1
20050227704 Ferra Oct 2005 A1
20060034201 Umeda et al. Feb 2006 A1
20060059023 Mashinsky Mar 2006 A1
20060065733 Lee et al. Mar 2006 A1
20060094447 Zellner May 2006 A1
20060133405 Fee Jun 2006 A1
20060135134 Mezhvinsky Jun 2006 A1
20060136254 Greenstein Jun 2006 A1
20060189297 Jung Aug 2006 A1
20060190276 Williamson Aug 2006 A1
20060208878 Nowlan Sep 2006 A1
20060217885 Crady et al. Sep 2006 A1
20060293835 Smith et al. Dec 2006 A1
20070010260 Zellner Jan 2007 A1
20070011034 Jones et al. Jan 2007 A1
20070073552 Hileman Mar 2007 A1
20070185744 Robertson Aug 2007 A1
20070197231 Lin Aug 2007 A1
20080068221 Park Mar 2008 A1
20080114629 Pavlov May 2008 A1
20080158016 Wang et al. Jul 2008 A1
20080189226 Wurster Aug 2008 A1
20080194260 Altberg et al. Aug 2008 A1
20080196024 Barfield et al. Aug 2008 A1
20080270204 Poykko et al. Oct 2008 A1
20090030885 DePasquale Jan 2009 A1
20090037194 Roche Feb 2009 A1
20090083111 Carr Mar 2009 A1
20100235285 Hoffberg Sep 2010 A1
20110039582 Kendall Feb 2011 A1
20110099040 Felt et al. Apr 2011 A1
20140059443 Tabe Feb 2014 A1
20140229258 Seriani Aug 2014 A1
20170086011 Neves Mar 2017 A1
20170141873 Mandeville-Clarke May 2017 A1
20170309185 Lubeck et al. Oct 2017 A1
20170345315 Lubeck et al. Nov 2017 A1
20170345316 Lubeck et al. Nov 2017 A1
20170352280 Lubeck et al. Dec 2017 A1
20180268706 Lubeck et al. Sep 2018 A1
20180268707 Lubeck et al. Sep 2018 A1
20180268708 Lubeck et al. Sep 2018 A1
20180268710 Lubeck et al. Sep 2018 A1
20180268712 Lubeck et al. Sep 2018 A1
20180268713 Lubeck et al. Sep 2018 A1
20180268714 Lubeck et al. Sep 2018 A1
20180279082 Lubeck et al. Sep 2018 A1
20180279083 Lubeck et al. Sep 2018 A1
20180279084 Lubeck et al. Sep 2018 A1
20180310132 Lubeck et al. Oct 2018 A1
Foreign Referenced Citations (6)
Number Date Country
2212330 Sep 2003 CA
2065867 Jun 2009 EP
2065867 Aug 2013 EP
2003-331394 Nov 2003 JP
2004-110758 Apr 2004 JP
2009-032136 Dec 2009 JP
Non-Patent Literature Citations (82)
Entry
International Search Report for PCT/US09/30154, International Searching Authority, dated Feb. 23, 2009, pp. 1-8.
PCT International Preliminary Report on Patentability for PCT Application No. PCT/US2009/030154, 5 pgs. (dated Jul. 6, 2010).
A PSO-GA method to solve a partial shipment and scheduling problem, Cheng Gang, 2010 International Conference on Computer Application and System Modeling (ICCASM 2010) Oct. 2010, vol. 10; pp. V10-330-V10-335.
Delivering visual pertinent information services for commuters, Wee Siong Ng; Justin Cheng, 2009 IEEE Asia-Pacific Services Computing Conference (APSCC) Dec. 2009; pp. 325-331.
U.S. Appl. No. 12/348,850, May 19, 2011, Office Action.
U.S. Appl. No. 12/348,850, Oct. 31, 2011, Notice of Allowance.
U.S. Appl. No. 13/413,492, Apr. 8, 2014, Office Action.
U.S. Appl. No. 13/413,492, Oct. 16, 2014, Office Action.
U.S. Appl. No. 13/413,492, Mar. 19, 2015, Notice of Allowance.
U.S. Appl. No. 14/745,346, Jul. 13, 2015, Office Action.
U.S. Appl. No. 14/745,346, Jan. 20, 2016, Office Action.
U.S. Appl. No. 14/745,346, Apr. 25, 2016, Notice of Allowance.
U.S. Appl. No. 14/745,346, May 12, 2016, Notice of Allowance.
U.S. Appl. No. 15/177,762, Feb. 14, 2017, Office Action.
U.S. Appl. No. 15/177,762, Mar. 29, 2017, Notice of Allowance.
U.S. Appl. No. 15/177,762, Jun. 1, 2017, Notice of Allowance.
U.S. Appl. No. 15/429,779, Apr. 10, 2017, Office Action.
U.S. Appl. No. 15/429,779, Jun. 19, 2017, Notice of Allowance.
U.S. Appl. No. 15/446,991, Apr. 13, 2017, Office Action.
U.S. Appl. No. 15/446,991, Jun. 19, 2017, Office Action.
U.S. Appl. No. 15/446,991, Jul. 26, 2017, Office Action.
U.S. Appl. No. 15/446,991, Aug. 29, 2017, Notice of Allowance.
U.S. Appl. No. 15/470,553, Sep. 1, 2017, Office Action.
U.S. Appl. No. 15/470,553, Sep. 28, 2017, Notice of Allowance.
U.S. Appl. No. 15/470,553, Jan. 24, 2018, Notice of Allowance.
U.S. Appl. No. 15/646,951, Nov. 6, 2017, Office Action.
U.S. Appl. No. 15/646,989, Dec. 7, 2017, Notice of Allowance.
U.S. Appl. No. 15/646,989, Feb. 8, 2018, Notice of Allowance.
U.S. Appl. No. 15/679,754, Feb. 26, 2018, Office Action.
U.S. Appl. No. 15/681,080, Mar. 8, 2018, Office Action.
U.S. Appl. No. 15/681,080, Oct. 4, 2018, Office Action.
U.S. Appl. No. 15/683,308, Mar. 22, 2018, Office Action.
U.S. Appl. No. 15/692,677, Nov. 27, 2017, Office Action.
U.S. Appl. No. 15/692,677, Jul. 19, 2018, Notice of Allowance.
U.S. Appl. No. 15/985,436, Jul. 9, 2018, Office Action.
U.S. Appl. No. 15/985,436, Apr. 8, 2019, Office Action.
U.S. Appl. No. 15/985,436, Sep. 17, 2019, Notice of Allowance.
U.S. Appl. No. 15/985,453, Aug. 31, 2018, Office Action.
U.S. Appl. No. 15/985,453, Apr. 10, 2019, Office Action.
U.S. Appl. No. 15/985,453, Aug. 13, 2019, Notice of Allowance.
U.S. Appl. No. 15/985,459, Sep. 18, 2018, Office Action.
U.S. Appl. No. 15/985,459, Mar. 27, 2019, Office Action.
U.S. Appl. No. 15/985,459, May 2, 2019, Office Action.
U.S. Appl. No. 15/985,459, Nov. 26, 2019, Office Action.
U.S. Appl. No. 15/986,314, Sep. 26, 2018, Office Action.
U.S. Appl. No. 15/986,314, Mar. 29, 2019, Notice of Allowance.
U.S. Appl. No. 15/986,358, Sep. 24, 2018, Office Action.
U.S. Appl. No. 15/986,358, May 7, 2019, Notice of Allowance.
U.S. Appl. No. 15/986,777, Nov. 20, 2018, Office Action.
U.S. Appl. No. 15/986,777, Apr. 24, 2019, Office Action.
U.S. Appl. No. 15/986,777, Dec. 9, 2019, Office Action.
U.S. Appl. No. 15/986,784, Oct. 22, 2018, Office Action.
U.S. Appl. No. 15/986,784, May 16, 2019, Office Action.
U.S. Appl. No. 15/986,784, Jan. 14, 2020, Office Action.
U.S. Appl. No. 15/990,175, Nov. 21, 2018, Office Action.
U.S. Appl. No. 15/990,175, May 23, 2019, Notice of Allowance.
U.S. Appl. No. 15/986,381, Nov. 2, 2018, Office Action.
U.S. Appl. No. 15/986,381, Jun. 14, 2019, Office Action.
U.S. Appl. No. 15/986,381, Nov. 29, 2019, Office Action.
U.S. Appl. No. 15/994,641, Feb. 13, 2019, Office Action.
U.S. Appl. No. 15/994,641, Jun. 12, 2019, Notice of Allowance.
U.S. Appl. No. 15/995,428, Feb. 14, 2019, Office Action.
U.S. Appl. No. 15/995,428, Apr. 25, 2019, Office Action.
U.S. Appl. No. 15/995,428, Nov. 13, 2019, Office Action.
U.S. Appl. No. 15/995,445, Mar. 4, 2019, Office Action.
U.S. Appl. No. 15/995,445, Oct. 2, 2019, Office Action.
U.S. Appl. No. 16/020,138, May 9, 2019, Office Action.
U.S. Appl. No. 16/020,138, Jan. 2, 2020, Office Action.
U.S. Appl. No. 16/518,718, Oct. 3, 2019, Office Action.
U.S. Appl. No. 15/985,459, Apr. 24, 2020, Office Action.
U.S. Appl. No. 15/986,777, Mar. 23, 2020, Notice of Allowance.
U.S. Appl. No. 15/986,784, Apr. 21, 2020, Office Action.
U.S. Appl. No. 15/995,428, May 7, 2020, Notice of Allowance.
U.S. Appl. No. 15/995,445, Feb. 25, 2020, Office Action.
U.S. Appl. No. 16/020,138, Mar. 23, 2020, Notice of Allowance.
U.S. Appl. No. 15/986,381, Jun. 22, 2020, Office Action.
U.S. Appl. No. 15/995,445, Aug. 4, 2020, Notice of Allowance.
U.S. Appl. No. 16/518,718, May 21, 2020, Office Action.
U.S. Appl. No. 15/986,784, Nov. 18, 2020, Notice of Allowance.
U.S. Appl. No. 15/986,381, Nov. 10, 2020, Notice of Allowance.
U.S. Appl. No. 16/518,718, Nov. 17, 2020, Office Action.
U.S. Appl. No. 16/518,718, dated Jun. 3, 2021, Office Action.
Related Publications (1)
Number Date Country
20200169843 A1 May 2020 US
Provisional Applications (2)
Number Date Country
61027508 Feb 2008 US
61009839 Jan 2008 US
Continuations (8)
Number Date Country
Parent 15985436 May 2018 US
Child 16775132 US
Parent 15470553 Mar 2017 US
Child 15985436 US
Parent 15446991 Mar 2017 US
Child 15470553 US
Parent 15429779 Feb 2017 US
Child 15446991 US
Parent 15177762 Jun 2016 US
Child 15429779 US
Parent 14745346 Jun 2015 US
Child 15177762 US
Parent 13413492 Mar 2012 US
Child 14745346 US
Parent 12348850 Jan 2009 US
Child 13413492 US