Automatic automobile repair service scheduling based on diagnostic trouble codes and service center attributes

Information

  • Patent Grant
  • 10867285
  • Patent Number
    10,867,285
  • Date Filed
    Thursday, April 21, 2016
    8 years ago
  • Date Issued
    Tuesday, December 15, 2020
    3 years ago
Abstract
A service appointment can be mapped to an automobile. Mapping a service appointment to an automobile can include receiving the diagnostic trouble code (DTC) from the automobile, interpreting, via a computing device, a service operation that resolves the DTC, and updating, via the computing device, the plurality of attributes of the plurality of service centers. Mapping the service appointment to an automobile can also include mapping, via the computing device, the service operation to a selected service center from the plurality of service centers based on the plurality of attributes of the selected service center and scheduling an appointment with the service center.
Description
TECHNICAL FIELD

This application relates to systems and methods for service operation mapping.


SUMMARY

The present disclosure provides systems and methods for mapping a service appointment to an automobile. Mapping a service appointment to an automobile can include receiving, via a network interface, a diagnostic trouble code (DTC) from the automobile, interpreting, via a computing device, a service operation that resolves the DTC, and updating, via the computing device, the plurality of attributes of the plurality of service centers. Mapping the service appointment to an automobile can also include mapping, via the computing device, the service operation to a selected service center from the plurality of service centers based on the plurality of attributes of the selected service center and scheduling an appointment with the service center.


In another example, mapping the service appointment to an automobile can also include receiving, via a network interface, the DTC from the automobile, interpreting, via a computing device, a service operation that resolves the DTC and accessing, via the computing device, a plurality of operation attributes of the service operation. Mapping the service appointment to an automobile can also include updating, via the computing device, the plurality of center attributes of the plurality of service centers, mapping, via the computing device, the plurality of operation attributes to at least a subset of the plurality of service center attributes, and identifying a service center from the plurality of service centers that correspond to at least the subset of the plurality of service centers. Mapping the service appointment to the automobile can also include scheduling an appointment with the service center.


In yet another example, mapping the service appointment to an automobile can include receiving, at a dealership via a network interface, a diagnostic trouble code (DTC) from the automobile, interpreting, via the computing device, a service operation that resolves the DTC and accessing a plurality of operation attributes of the service operation. Mapping the service appointment to an automobile can also include mapping the plurality of operation attributes to a plurality of dealership attributes of the dealership, identifying at least a service bay, a mechanic, and a time slot that correspond to the plurality of dealership attributes and scheduling an appointment for the automobile to perform the service operation.





BRIEF DESCRIPTION OF THE DRAWINGS


FIG. 1 is a system diagram of a scheduling system according to one embodiment.



FIG. 2 is a system diagram of a scheduling system according to one embodiment.



FIG. 3 is a block diagram of an automobile according to one embodiment.



FIG. 4 is a block diagram of a communication device according to one embodiment.



FIG. 5 is a block diagram of a scheduling system according to one embodiment.



FIG. 6 is a flowchart of a method for scheduling a service appointment according to one embodiment.



FIG. 7 is a flowchart of a method for scheduling a service appointment according to one embodiment.



FIG. 8 is a flowchart of a method for scheduling a service appointment according to one embodiment.



FIG. 9 is a flowchart of a method for scheduling a service appointment according to one embodiment.





DETAILED DESCRIPTION OF PREFERRED EMBODIMENTS

In the following detailed description, reference is made to the accompanying drawings, which form a part hereof. In the drawings, similar symbols typically identify similar components, unless context dictates otherwise. The illustrative embodiments described in the detailed description, drawings, and claims are not meant to be limiting. Other embodiments may be utilized, and other changes may be made, without departing from the spirit or scope of the subject matter presented here.


Original equipment manufacturers (OEM) produced vehicles have built in diagnostic tools. The official diagnostic tools can include on-board diagnostics (OBD) systems. The diagnostic tools can determine if a service is needed. For example, the diagnostic tools can activate an engine light on an instrument panel to inform a user that a service is needed. Diagnostic tools can produce a diagnostic trouble code (DTC) based on a determination that a service is needed. The DTC can consist of a unique code and/or description that describes a reported abnormality in an automobile. The reported abnormalities are reported based on a sensor within the automobile that takes a measurement that is outside the norm. As such, the DTC can register that a service is needed without identifying the particular service that is needed.


In a number of previous approaches, a customer may present the automobile to a technician at a service center. The technician may connect a computer to the automobile via an OBD port to read the DTC. The technician would then have to inspect the automobile to determine the particular service that is needed to resolve the DTC. The technician may be unable to schedule an appointment to perform the particular service for a number of reasons. For example, the technician may not have access to a part needed to perform the particular service and/or the technician may not have available mechanics that can perform the service, among other possible reasons for being unable to schedule the appointment. In such a case, the client would have to consult a different technician at a different service center to begin the process anew. Thus, reducing the efficiency in resolving the DTC due to the constraints of having to present the automobile to a technician before a determination of whether a particular service can be made at a particular service center.


In a number of examples, the particular service needed to resolve the DTC can be determined without presenting the automobile to a technician to increase the efficiency to resolving the DTC. For example, a scheduling system can receive the DTC from an automobile and can determine a particular service, to perform on the automobile, that can resolve the DTC. The scheduling system can then determine the available service centers that have available appointments to resolve the DTC. The scheduling system can schedule the available appointment to perform the particular service on the vehicle. Determining the particular service can include mapping a DTC code to at least a particular service and mapping the particular service to a service center. The present approach can schedule a service appointment without user input. The present approach can increase efficiency in scheduling a service appointment.


Embodiments may include various steps, which may be embodied in machine-executable instructions to be executed by a computer system. A computer system includes one or more general-purpose or special-purpose computers (or other electronic devices). The computer system may include hardware components that include specific logic for performing the steps or may include a combination of hardware, software, and/or firmware.


Embodiments may also be provided as a computer program product including a computer-readable medium having stored thereon instructions that may be used to program a computer system or other electronic device to perform the processes described herein. The computer-readable medium may include, but is not limited to: hard drives, floppy diskettes, optical disks, CD-ROMs, DVD-ROMs, ROMs, RAMs, EPROMs, EEPROMs, magnetic or optical cards, solid-state memory devices, or other types of media/computer-readable media suitable for storing electronic instructions.


Computer systems and the computers in a computer system may be connected via a network. Suitable networks for configuration and/or use as described herein include one or more local area networks, wide area networks, metropolitan area networks, and/or “Internet” or IP networks, such as the World Wide Web, a private Internet, a secure Internet, a value-added network, a virtual private network, an extranet, an intranet, or even standalone machines which communicate with other machines by physical transport of media (a so-called “sneakernet”). In particular, a suitable network may be formed from parts or entireties of two or more other networks, including networks using disparate hardware and network communication technologies. The network may include a wireless network. For example, an unmanned aerial vehicle (UAV) may be connected to the World Wide Web via a wireless network such as a cellular network and/or a WiFi network.


One suitable network includes a server and several clients; other suitable networks may contain other combinations of servers, clients, and/or peer-to-peer nodes, and a given computer system may function both as a client and as a server. Each network includes at least two computers or computer systems, such as the server and/or clients. A computer system may include a workstation, laptop computer, disconnectable mobile computer, server, mainframe, cluster, so-called “network computer” or “thin client,” tablet, smart phone, personal digital assistant or other hand-held computing device, “smart” consumer electronics device or appliance, medical device, or a combination thereof.


The network may include communications or networking software, such as the software available from Novell, Microsoft, Artisoft, and other vendors, and may operate using TCP/IP, SPX, IPX, or other protocols over twisted pair, coaxial, or optical fiber cables, telephone lines, radio waves, satellites, microwave relays, modulated AC power lines, physical media transfer, and/or other data transmission “wires” and/or wireless protocols known to those of skill in the art. The network may encompass smaller networks and/or be connectable to other networks through a gateway or similar mechanism.


Each computer system includes at least a processor and a memory; computer systems may also include various input devices and/or output devices. The processor may include a general-purpose device, such as an Intel®, AMD®, or other “off-the-shelf” microprocessor. The processor may include a special-purpose processing device, such as an ASIC, a SoC, a SiP, an FPGA, a PAL, a PLA, an FPLA, a PLD, or other customized or programmable device. The memory may include static RAM, dynamic RAM, flash memory, one or more flip-flops, ROM, CD-ROM, disk, tape, magnetic, optical, or other computer storage medium. The input device(s) may include a keyboard, mouse, touch screen, light pen, tablet, microphone, sensor, or other hardware with accompanying firmware and/or software. The output device(s) may include a monitor or other display, printer, speech or text synthesizer, switch, signal line, or other hardware with accompanying firmware and/or software.


The computer systems may be capable of using a floppy drive, a tape drive, an optical drive, a magneto-optical drive, or other means to read a storage medium. A suitable storage medium includes a magnetic, optical, or other computer-readable storage device having a specific physical configuration. Suitable storage devices include floppy disks, hard disks, tape, CD-ROMs, DVDs, PROMs, random access memory, flash memory, and other computer system storage devices. The physical configuration represents data and instructions which cause the computer system to operate in a specific and predefined manner as described herein.


Suitable software to assist in implementing the invention is readily provided by those of skill in the pertinent art(s) using the teachings presented here and programming languages and tools, such as Java, Pascal, C++, C, database languages, APIs, SDKs, assembly, firmware, microcode, and/or other languages and tools. Suitable signal formats may be embodied in analog or digital form, with or without error detection and/or correction bits, packet headers, network addresses in a specific format, and/or other supporting data readily provided by those of skill in the pertinent art(s).


Several aspects of the embodiments described will be illustrated as software modules or components. As used herein, a software module or component may include any type of computer instruction or computer executable code located within a memory device. A software module may, for instance, include one or more physical or logical blocks of computer instructions, which may be organized as a routine, program, object, component, data structure, etc., that perform one or more tasks or implement particular abstract data types.


In certain embodiments, a particular software module may include disparate instructions stored in different locations of a memory device, different memory devices, or different computers, which together implement the described functionality of the module. Indeed, a module may include a single instruction or many instructions, and may be distributed over several different code segments, among different programs, and across several memory devices. Some embodiments may be practiced in a distributed computing environment where tasks are performed by a remote processing device linked through a communications network. In a distributed computing environment, software modules may be located in local and/or remote memory storage devices. In addition, data being tied or rendered together in a database record may be resident in the same memory device, or across several memory devices, and may be linked together in fields of a record in a database across a network.


Much of the infrastructure that can be used according to the present invention is already available, such as: general-purpose computers, computer programming tools and techniques, computer networks and networking technologies, digital storage media, authentication; access control, and other security tools and techniques provided by public keys, encryption, firewalls, and/or other means.



FIG. 1 is a system diagram of a scheduling system according to one embodiment. FIG. 1 includes an automobile 102, a network 104, a scheduling system 106, a network 108, and service centers 110-1 to 110-N (referred to as service centers 110).


Although FIG. 1 illustrates an automobile 102, a different type of vehicle can be implemented herein. For example, an automobile 102 can represent a motorcycle, a boat, and/or a different type of vehicle. As used herein, the term automobile represents any type of vehicle.


The networks 104 and 108 can be a same network or different networks. For example, the scheduling system can employ an intranet as the network 104 or 108 to communicate with the service centers 110 and/or an internet as the network 104 or 108 to communicate with the service centers 110.


The service centers 110 can provide services to automobiles including the automobile 102. The service centers 110 can be independently owned service centers, service centers that are part of a chain of service centers, and/or service centers of a dealership, among other types of service centers.


Each of the service centers 110 can schedule appointments to perform service operations on a vehicle 102. The service centers 110 can schedule appointments based on a service operation needed, the labor and skill needed to perform the service operation, the parts needed to perform the operation, and/or service bays available to perform the operation, among other data that can be used by the service centers 110 to schedule appointments. The service center may provide a number of available appointments to a scheduling system 106 when all or a portion of the above limitations is available. For example, the service center may inform the scheduling system 106 of an available appointment if a mechanic has the time (labor) and the skill to perform the service operation, the parts needed to perform the operation are available, and/or a service bay is available to host the service operation. An available appointment may be defined by other standards and/or limitations of a service center. For example, a some service centers from the service centers 110 may define an appointment by considering if a mechanic has the time to perform the service operation without considering the skill of the mechanic.


The scheduling system 106 can include a plurality of computing devices configured to schedule appointments for the automobile 102. For example, the scheduling system 106 can include a first computing device for mapping a DTC to a service operation to be performed on the automobile 102 and a second computing device to map the service operation to an appointment for a service center from service centers 110.


Each of the computing devices of a scheduling system 106 can include one or more processors, electronic memory, and/or a network interface, among other components used by the computing device. The electronic memory is accessible by the one or more processors. The electronic memory can store the DTC of the automobile 102, a plurality of attributes of a plurality of service centers, and/or a scheduling application, among other data that can be used to schedule a service appointment. A network interface may be enabled to provide communication with the automobile 102. At least one of the computing device may include a scheduling application stored in the electronic memory and configured by the one or more processors, to schedule a service appointment for the automobile 102.


In one example, the automobile 102 can experience an event that can lead to a DTC. The event can be a failure event, a warning event, and/or a notice event, among other types of events. A failure event can be a failure of a system of the automobile 102. For example, the failure event can be a failure of the transmission, a failure of the cooling system, and/or a failure of the pistons in an engine, among other types of failures that an automobile can experience. A warning event can provide a warning to a user of the automobile 102 that the readings from a sensor of the automobile 102 are beginning to experience readings outside the norm. For example, a warning event can occur if the pressure of a tire of the automobile 102 is below a recommended pressure. A notice event can provide a notice to a user of the automobile 102 that an action is needed. For example, a notice event can notify the user of the automobile 102 that an oil change is due, among other types of notice events.


The automobile can communicate with the scheduling system 106 via a network 104. The automobile can communicate with the scheduling system 106 to request a service appointment with one of the service centers 110. The request can include the DTC and information pertaining to the automobile 102 that may be useful in scheduling a service appointment.


The scheduling system 106 can determine which of the service centers 110 have available appointments to provide a service operation to the automobile 102. The scheduling system 106 can schedule an appointment from the available appointments and/or provide the available appointments to the automobile 102.


The automobile 102 can present the available appointments to the user of the automobile 102 and relevant information. The relevant information can include an appointment time, an appointment location, a service center from the service centers 110 where the appointment will be performed, the mechanic who will perform the service operation and/or a price for performing the service operation, among other relevant information. The user can select a service appointment from the presented service appointments and/or request additional service appointments.


The scheduling system 106 can schedule the appointment with one of the service centers 110 and inform the vehicle/user that the service appointment has been scheduled.



FIG. 2 is a system diagram of a scheduling system according to one embodiment. FIG. 2 includes an automobile 202 and a network 204 that are analogous to the automobile 102 and the network 104 in FIG. 1. FIG. 2 also includes a dealership 212, mechanics 214-1 to 214-M (referred to generally as mechanics 214), service bays 216-1 to 216-O (referred to generally as service bays 216), and/or parts 218-1 to 218-P (referred to generally as parts 218).


The dealership 212 differs from a service center (e.g., service center 110-1 in FIG. 1) in that a dealership 212 may schedule appointments for multiple service centers that are managed by the dealership 212. As such, a dealership 212 may schedule service appointments at a plurality of locations. In some examples, a dealership 212 may provide services to the automobile of a particular make and/or a plurality of makes.


The dealership 212 can include a plurality of computing devices configured to schedule appointments for the automobile 202. For example, the dealership 212 can include a first computing device for mapping a DTC to a service operation to be performed on the automobile 202 and a second computing device to map the service operation to an appointment.


Each of the computing devices of a dealership 212 can include one or more processors, electronic memory, and/or a network interface, among other components used by the computing device. The electronic memory is accessible by the one or more processors. The electronic memory can store the DTC of an automobile, a plurality of attributes of the mechanics 214, the service bays 216, the parts 218, and/or a scheduling application, among other data that can be used to schedule a service appointment. A network interface may be enabled to provide communication with the automobile 202. At least one of the computing device may include a scheduling application stored in the electronic memory and configured, by the one or more processors, to schedule a service appointment for the automobile 202.


The mechanics 214 can be employees of the dealership 212 and may work in a plurality of different sites or in a single site. The service bays 216 may be located in a plurality of different sites or at a single site. The parts 218 may be comprised of an inventory of the dealership 212.


The automobile 202 may schedule an appointment directly with the dealership 212 instead of going through an independent scheduling system 106 as shown in FIG. 1.



FIG. 3 is a block diagram of an automobile according to one embodiment. The automobile 302 includes at least an OBD system 322, a network interface 324, a communication device 326, a display 328, a graphical user interface 330, and a plurality of sensors 332.


As described above, the OBD system 322 can diagnose a problem/abnormality with an automobile. The OBD system 322 includes hardware and/or computer readable instructions. The on-board diagnostic system can produce a DTC. The DTC can be stored in an electronic memory of the automobile 302 and/or in an electronic memory of the communication device 326.


The network interface 324 can include hardware and/or computer readable instructions to communicate with a scheduling system. The network interface can include an antenna for wireless communications. The network interface can receive data and send data via a network (e.g., networks 104, 108, and 204 in FIGS. 1 and 2). The network interface can provide communication to the communication device 326. The network interface can send communication from the communication device 326.


The communication device 326 includes hardware and/or computer readable instructions to schedule a service appointment for the automobile 302. The communication device 326 is further described in FIG. 4.


The display 328 can include hardware and/or computer readable instructions to display data to a user of the vehicle 302. The display 328 can be a touch display that receives user interactions via a tactile interface. As such, the communication device 326 can display data to a user via a display 328 and can receive user input via the display 328.


The graphical user interface 330 can include hardware and/or computer readable instructions to provide and/or receive data to and/or from a user of the automobile 302. The some examples, the graphical user interface 330 can be a graphical user interface 330 to the communication device 326 which can be displayed on and/or be a part of the display 328.


The sensors 332 can include a plurality of sensors that provide data on the automobile's 302 function. The sensors 332 can be sensors that are a part of the OBD system 322 and/or sensors 332 that are not a part of the OBD system 322. The sensors 332 can provide data on the function of a plurality of systems of the automobile 302. The sensors 332 can monitor the actions taken by the vehicle. For example, the sensors 332 can monitor a vehicle's speed and/or the revolutions per minute (RPM) of the automobile 302, among other actions taken by the vehicle. The data provided by the sensors 332 can be used to map a DTC to a service operation. That is, the data provided by the sensors 332 can be used to select a service operation to perform to resolve the DTC.



FIG. 4 is a block diagram of a communication device according to one embodiment. The communication device 440 includes one or more processors 442, electronic memory 444, and a network interface 450. The electronic memory 444 includes an automobile scheduling application 446 and a DTC 448.


The one or more processors 442 can be independent of any other processors that are a part of the automobile (e.g., automobile 302 in FIG. 3). The network interface 450 can be independent of network interface 324 in FIG. 3. In a number of examples, the network interface 450 can be analogous to network interface 324 in FIG. 3. The network interface 450 enables communication with one or more computing devices including a computing device of the scheduling system (e.g., scheduling system 106 in FIG. 1). The network interface 450 may be configured to connect to the Internet (e.g., the World Wide Web) via a WiFi connection and/or a cellular connection, among other connection types.


The DTC 448 can be created by the OBD system 322 and stored in the electronic memory 444 by the OBD system 322 in FIG. 3. The automobile scheduling application 446 can be executed by the processors 442 to schedule a service operation to resolve the DTC 448. That is, the electronic memory is accessible by the one or more processors.


The automobile scheduling application 446 can be configured to read the DTC stored in the electronic memory. The automobile scheduling application 446 can also be configured to provide, via the network interface 450, the DTC to the scheduling system. The automobile scheduling application 446 can receive a potential service appointment with a service center to resolve the DTC. The automobile scheduling application 446 can acknowledge the potential service appointment to schedule the potential service appointment with the service center. That is, the automobile scheduling application 446 can accept the potential service appointment and inform the scheduling system accordingly.


In a number of examples, the service appointment can be scheduled without a customer's (e.g., user of the automobile) intervention. That is, the service appointment can be scheduled by the automobile, particularly by automobile scheduling application 446 in the communication device 440. The customer can be informed of the service appointment and the associated details after the service appointment has been scheduled.


In a number of examples, the customer can be presented with a plurality of potential service appointments. For example, the automobile scheduling application 446 may present one or more potential service appointments via a graphical user interface (e.g., graphical user interface 330 in FIG. 3) on a display (e.g., display 328 in FIG. 3) to a customer. The customer can then schedule a service appointment from a plurality of potential service appointments via the scheduling system. For example, the automobile scheduling application 446 may receive, via the user interface (e.g., graphical user interface 330 in FIG. 3), a customer's selection of one of the potential service appointments. The graphical user interface can be implemented via a display (e.g., display 328 in FIG. 3) of the vehicle.


In some embodiments, the communication device can be integrated into the automobile. That is, the communication device can be permanently coupled to the automobile. For example, the communication device may be an original equipment manufacturer (OEM) part of the automobile.


The communication device can also be a mobile communication device that can be coupled to the automobile via a WiFi connection. That is, the communication device can communicate with the automobile via the WiFi connection. In some embodiments, the communication device can be coupled to the automobile via an OBD port. As such, a user of the automobile may be able to plug the communication device 440 to the automobile and unplug the communication device 440 from the automobile.



FIG. 5 is a block diagram of a scheduling system according to one embodiment. The scheduling system 541 is analogous to scheduling system 106 in FIG. 1. The scheduling system 541 can include a plurality of computing devices each of which may include one or more processors 543, electronic memory 545, and a network interface 553. The electronic memory may store a DTC 547, attributes of service centers 549, and a scheduling application 551.


Although FIG. 5 shows attributes of service centers 549, it is to be understood that attributes of a dealership can be substituted in its place. That is, the scheduling system 541 has the ability to interact with different service center appointment systems and/or dealership appointment systems.


The scheduling application 551 can receive, via the network interface, the DTC from the automobile. The scheduling application 551 can store the DTC in the electronic memory 545. The scheduling application 551 can interpret, via a computing device, a service operation that resolves the DTC. The scheduling application 551 can update, via the computing device, the plurality of attributes of the plurality of service centers and map, via the computing device, the service operation to a selected service center from the plurality of service centers based on the plurality of attributes of the selected service center. The scheduling application 551 can schedule an appointment with the service center.


The plurality of attributes of the plurality of service centers describe an ability of a respective service center from the plurality of service centers to perform the service operation. The plurality of attributes of the plurality of service centers include whether each of the plurality of service centers has a mechanic who is qualified to perform the service operation. The plurality of attributes of the plurality of service centers also include a next availability of the mechanic who is qualified to perform the service operation. As such, scheduling system 541 can determine whether a service center has a mechanic who is qualified to perform the service operation and who has time to perform the service operation.


In a number of examples, the scheduling system 541 can have access to an inventory of a plurality of service centers. For example, the plurality of attributes of the plurality of service centers include whether each of the plurality of service centers' inventory includes a part required to perform the service operation. In some examples, the scheduling system 541 has to query the service center whether the service center has a particular part without knowledge of the rest of the service center's inventory.


The scheduling system 541 can determine whether a particular service center has the particular part in stock. For example, the plurality of attributes of the plurality of service centers include a date of an expected arrival of the part required to perform the service operation based on a determination that a particular service center's inventory does not include the part. The scheduling system 541 may receive a service center's parts orders and/or the scheduling system 541 may query a service center to determine when the service center will next have the particular part in stock.


The plurality of attributes of the plurality of service centers may include a next availability of a service bay for each of the plurality of service centers. The scheduling system 541 may have access to the schedules of the service bays of the service centers and/or the scheduling system 541 may query the particular service center to identify a next available service bay.


The service center may compile a list of potential appointments to perform the service operation. Each potential appointment can be created if a service center has a mechanic who is qualified to perform the service operation and is available to perform the service operation at a same time that the particular part is available and/or the service bay is available to perform the service operation.


The service center may then present the potential appointments to the automobile and/or the user of the automobile. The service center may receive a confirmation of a selected potential appointment which the service center may schedule with the corresponding service center.



FIG. 6 is a flowchart of a method for scheduling a service appointment according to one embodiment. The method includes receiving 652, via a network interface of a computing device, a DTC from an automobile and interpreting 654, via the computing device, a service operation that resolves the DTC. The method also includes querying 656, via the network interface, a plurality of service centers to determine available appointments to perform the service operation and receiving 658, via the network interface, at least one potential service appointment with a service center from the plurality of service centers. The method further includes scheduling 660 a potential service appointment from the at least one potential service appointment based on a customer's selection.


In a number of examples, a location can be associated with the DTC. The location can be used to select service centers from which the potential appointments can be identified. For example, the method can further include receiving a location of the automobile and/or a home location of the automobile.


If a user of the automobile is on vacation for an extended period of time, then a service operation performed to resolve the DTC can be performed at a location near which the automobile is currently located. In a number of examples, a user of the automobile may select a home location of the vehicle before performing the service operation, such that service centers near the home location of the vehicle are selected.


Although the location of the vehicle and/or the home location of the vehicle can be used to select service centers with which potential appointments can be complied; the service centers can be selected if the service centers' location is within a predetermined distance from the location of the vehicle and/or the home location of the vehicle. For example, service centers that are closer to a given location can be given priority over service centers that are farther away in presenting associated potential appointments to the vehicle/user. For example, the plurality of service centers can be selected to query based on a proximity of the plurality of service centers to a home location of the automobile.



FIG. 7 is a flowchart of a method for scheduling a service appointment according to one embodiment. As used herein, the method can be stored in a computer-readable storage medium that, when implemented by a computing device, can cause the computing device to perform the method.


The method can include receiving 762 at a dealership, via a network interface of a computing device comprising one or more processors, a DTC from an automobile and interpreting 764, via the computing device, a service operation that resolves the DTC. The method can also include determining 765 a next available appointment to perform the service operation in a service center of the dealership and providing 768 the next available appointment to a customer. The method can further include receiving 770 a confirmation from the customer of the next available appointment and scheduling 772 the next available appointment based on the confirmation.


Providing 768 the next available appointment to the customer can further include providing a cost of performing the service operation. A cost of performing the service operation may be of importance to a user of the automobile. The automobile scheduling application may be configured to schedule a potential appointment based on the cost of performing the service operation for the potential appointment.


Determining a service operation can include mapping a DTC to the particular service operation. To map the DTC to the particular service operation, more data than just the DTC may be needed. For example, data comprising a context associated with the DTC may be received at the dealership (e.g., and/or by the scheduling system). The context associated with the DTC may include at least one of a vehicle make, a vehicle model, driver information, and a plurality of measurements of the automobile taken at a time prior to the creation of the DTC, at the time of the creation of the DTC, and/or after the creation of the DTC. For example, a speed of the vehicle may be helpful in mapping the DTC to a particular service operation.


The service operation can be interpreted using the context associated with the DTC. For example, the service operation can be selected to resolve the DTC based on the context in which the DTC was created.



FIG. 8 is a flowchart of a method for scheduling a service appointment according to one embodiment. The method can include receiving 874, via a network interface, the DTC from a vehicle and interpreting 876, via a computing device, a service operation that resolves the DTC. The method can also include accessing 878, via the computing device, a plurality of operation attributes of the service operation. The plurality of operation attributes may be objects and/or skills needed to perform the service operation.


The method can also include updating 880, via the computing device, the plurality of center attributes of the plurality of service centers and mapping 882, via the computing device, the plurality of operation attributes to at least a subset of the plurality of service center attributes. The method can further include identifying 884 a service center from the plurality of service centers that correspond to at least the subset of the plurality of service centers and scheduling 886 an appointment with the service center.


The plurality of operation attributes define requirements to perform the service operation. For example, replacing a tire may include having a replacement tire. The attributes may also include the skill needed to perform the service operation. The skill may be defined in terms of certificates, credentials, and/or accreditations, such as school diplomas and/or certificates of accreditation to perform labor on a specific vehicle make and/or a vehicle model.


The plurality of operation can also include a duration of time to perform the service operation. For example, a particular service operation can be performed in two hours and as such the duration of time to perform the service operation may be two hours. The plurality of operation attributes may include parts needed to perform the service operation. The parts may include replacement parts and/or tools used in performing the service operation. For example, a hydraulic lift may be needed to perform a particular operation.


The plurality of operation attributes can also include whether a service bay is required to perform the service operation. Some service operations may be performed without a service bay while other service operations may be performed using a service bay. Furthermore, service bays may be different and as such the service operation performed using a respective service bay may differ. The plurality of operation attributes may include attributes of service bays.



FIG. 9 is a flowchart of a method for scheduling a service appointment according to one embodiment. The method can include receiving 988, at a dealership via a network interface, a DTC from a vehicle and interpreting 990, via the computing device, a service operation that resolves the DTC. The method can also include accessing 992 a plurality of operation attributes of the service operation and mapping 994 the plurality of operation attributes to a plurality of dealership attributes of the dealership. The method can also include identifying at least a service bay, a mechanic, and a time slot that correspond to the plurality of dealership attributes and scheduling 998 an appointment for the vehicle to perform the service operation.


The time slot can identify an unscheduled time for the mechanic. The time slot can also identify an unscheduled time for the service bay. The time slot can also identify a time in which a part needed to perform the service operation may be available.


The method further comprises identifying a part that corresponds to the plurality of dealership attributes. For example, the method further comprises identifying a part that is needed to perform the service operation and determining whether the part is available at the dealership by determining whether the part is listed in the plurality of dealership attributes.


In some examples, scheduling an appointment for the vehicle to perform the service operation includes scheduling the service bay, the mechanic, and the part based on the mapping for the time slot. That is, scheduling an appointment includes identifying a time slot in which the service bay is available, the mechanic is available, and the parts needed to perform the service operation are available.


While various aspects and embodiments have been disclosed herein, other aspects and embodiments will be apparent to those skilled in the art. The various aspects and embodiments disclosed herein are for purposes of illustration and are not intended to be limiting, with the true scope and spirit being indicated by the following claims.

Claims
  • 1. A system to schedule a service appointment, comprising: one or more processors;electronic memory accessible by the one or more processors, the electronic memory to store a diagnostic trouble code (DTC) of an automobile, a plurality of attributes of a plurality of service centers, and a scheduling application; anda network interface to enable communication with the automobile and with the plurality of service centers;the scheduling application configured to, by the one or more processors: receive, via the network interface, the DTC from the automobile;interpret a service operation that resolves the DTC;update, via communication with the plurality of service centers, the plurality of attributes of the plurality of service centers, the plurality of attributes including: one or more dates of expected arrival at each of the plurality of the service centers of a part required to perform the service operation that resolves the DTC;whether each of the plurality of service centers has the part required to perform the service operation that resolves the DTC in its inventory;whether each of the plurality of service centers has an associated mechanic who is qualified to perform the service operation that resolves the DTC and is available to perform the service operation; andwhether the service operation at each of the plurality of service centers requires a service bay; andif the service operation at each of the plurality of service centers requires a service bay, whether attributes of the service operation are compatible with attributes of an available service bay necessary to perform the service operation;map the service operation that resolves the DTC to a selected service center from the plurality of service centers based on the plurality of attributes of the selected service center; andschedule an appointment with the selected service center, the scheduled appointment identifying a time slot at the selected service center wherein a part, a mechanic, and a service bay according to the map are available at the selected service center.
  • 2. The system of claim 1, wherein the plurality of attributes of the plurality of service centers describe an ability of a respective service center from the plurality of service centers to perform the service operation that resolves the DTC.
  • 3. A method for scheduling a service appointment, comprising: receiving, via a network interface, a diagnostic trouble code (DTC) from an automobile;interpreting, via a computing device, a service operation that resolves the DTC;accessing, via the computing device, a plurality of operation attributes of the service operation that resolves the DTC;updating, at the computing device, a plurality of center attributes of a plurality of service centers using information received at the computing device from the plurality of service centers via the network interface, the plurality of center attributes of the plurality of service centers including: one or more dates of expected arrival at each of the plurality of the service centers of a part required to perform the service operation;whether each of the plurality of service centers has the part required to perform the service operation in its inventory;whether each of the plurality of service centers has an associated mechanic who is qualified to perform the service operation and is available to perform the service operation; andwhether the service operation at each of the plurality of service centers requires a service bay; andif the service operation at each of the plurality of service centers requires a service bay, whether attributes of the service operation are compatible with attributes of an available service bay necessary to perform the service operation;mapping, via the computing device, the plurality of operation attributes to the plurality of center attributes;identifying a service center from a subset of the plurality of service centers, each service center of the subset of the plurality of service centers including the plurality of service center attributes that is mapped to the plurality of operation attributes; andscheduling an appointment with the identified service center, the scheduled appointment identifying a time slot at the identified service center wherein a part, a mechanic, and a service bay according to the mapping are available at the identified service center.
  • 4. The method of claim 3, wherein the plurality of operation attributes define requirements to perform the service operation that resolves the DTC.
  • 5. The method of claim 4, wherein the plurality of operation attributes include a skill needed to perform the service operation that resolves the DTC.
  • 6. The method of claim 5, wherein the skill needed to perform the service operation that resolves the DTC includes an accreditation to perform the service operation that resolves the DTC.
  • 7. The method of claim 5, wherein the skill needed to perform the service operation that resolves the DTC includes the skill needed to perform the service operation that resolves the DTC on the automobile make and model.
  • 8. The method of claim 3, wherein the plurality of operation attributes include a duration of time to perform the service operation that resolves the DTC.
  • 9. The method of claim 3, wherein the plurality of operation attributes include parts needed to perform the service operation that resolves the DTC.
  • 10. The method of claim 3, wherein the plurality of operation attributes include whether a service bay is required to perform the service operation that resolves the DTC.
US Referenced Citations (456)
Number Name Date Kind
3792445 Bucks et al. Feb 1974 A
4258421 Juhasz et al. Mar 1981 A
4992940 Dworkin Feb 1991 A
5003476 Abe Mar 1991 A
5034889 Abe Jul 1991 A
5058044 Stewart et al. Oct 1991 A
5421015 Khoyi et al. May 1995 A
5442553 Parrillo Aug 1995 A
5452446 Johnson Sep 1995 A
5521815 Rose, Jr. May 1996 A
5649186 Ferguson Jul 1997 A
5694595 Jacobs et al. Dec 1997 A
5729452 Smith et al. Mar 1998 A
5787177 Leppek Jul 1998 A
5790785 Klug et al. Aug 1998 A
5835712 DuFresne Nov 1998 A
5845299 Arora et al. Dec 1998 A
5862346 Kley et al. Jan 1999 A
5911145 Arora et al. Jun 1999 A
5956720 Fernandez et al. Sep 1999 A
5974149 Leppek Oct 1999 A
5974418 Blinn et al. Oct 1999 A
5974428 Gerard et al. Oct 1999 A
5978776 Seretti et al. Nov 1999 A
5987506 Carter et al. Nov 1999 A
6003635 Bantz et al. Dec 1999 A
6006201 Berent et al. Dec 1999 A
6009410 LeMole et al. Dec 1999 A
6018748 Smith Jan 2000 A
6021416 Dauerer et al. Feb 2000 A
6021426 Douglis et al. Feb 2000 A
6026433 D'Arlach et al. Feb 2000 A
6041310 Green et al. Mar 2000 A
6041344 Bodamer et al. Mar 2000 A
6055541 Solecki et al. Apr 2000 A
6061698 Chadha et al. May 2000 A
6067559 Allard et al. May 2000 A
6070164 Vagnozzi May 2000 A
6134532 Lazarus et al. Oct 2000 A
6151609 Truong Nov 2000 A
6178432 Cook et al. Jan 2001 B1
6181994 Colson et al. Jan 2001 B1
6185614 Cuomo et al. Feb 2001 B1
6189104 Leppek Feb 2001 B1
6219667 Lu et al. Apr 2001 B1
6236994 Swartz et al. May 2001 B1
6240365 Bunn May 2001 B1
6263268 Nathanson Jul 2001 B1
6285932 de Bellefeuille Sep 2001 B1
6289382 Bowman-Amuah Sep 2001 B1
6295061 Park et al. Sep 2001 B1
6330499 Chou et al. Dec 2001 B1
6343302 Graham Jan 2002 B1
6353824 Boguraev et al. Mar 2002 B1
6356822 Diaz et al. Mar 2002 B1
6374241 Lamburt et al. Apr 2002 B1
6397226 Sage May 2002 B1
6397336 Leppek May 2002 B2
6401103 Ho et al. Jun 2002 B1
6421733 Tso et al. Jul 2002 B1
6473849 Keller et al. Oct 2002 B1
6496855 Hunt et al. Dec 2002 B1
6505106 Lawrence et al. Jan 2003 B1
6505205 Kothuri et al. Jan 2003 B1
6519617 Wanderski et al. Feb 2003 B1
6535879 Behera Mar 2003 B1
6539370 Chang et al. Mar 2003 B1
6546216 Mizoguchi et al. Apr 2003 B2
6553373 Boguraev et al. Apr 2003 B2
6556904 Larson et al. Apr 2003 B1
6564216 Waters May 2003 B2
6571253 Thompson et al. May 2003 B1
6581061 Graham Jun 2003 B2
6583794 Wattenberg Jun 2003 B1
6594664 Estrada et al. Jul 2003 B1
6606525 Muthuswamy et al. Aug 2003 B1
6629148 Ahmed et al. Sep 2003 B1
6643663 Dabney et al. Nov 2003 B1
6654726 Hanzek Nov 2003 B1
6678706 Fishel Jan 2004 B1
6697825 Underwood et al. Feb 2004 B1
6701232 Yamaki Mar 2004 B2
6721747 Lipkin Apr 2004 B2
6728685 Ahluwalia Apr 2004 B1
6738750 Stone et al. May 2004 B2
6744735 Nakaguro Jun 2004 B1
6748305 Klausner et al. Jun 2004 B1
6785864 Te et al. Aug 2004 B1
6795819 Wheeler et al. Sep 2004 B2
6823258 Ukai Nov 2004 B2
6823359 Heidingsfeld Nov 2004 B1
6826594 Pettersen Nov 2004 B1
6847988 Toyouchi et al. Jan 2005 B2
6850823 Eun et al. Feb 2005 B2
6871216 Miller et al. Mar 2005 B2
6901430 Smith Mar 2005 B1
6894601 Grunden et al. May 2005 B1
6917941 Wight et al. Jul 2005 B2
6922674 Nelson Jul 2005 B1
6941203 Chen Sep 2005 B2
6944677 Zhao Sep 2005 B1
6963854 Boyd et al. Nov 2005 B1
6965806 Eryurek Nov 2005 B2
6965968 Touboul Nov 2005 B1
6978273 Bonneau et al. Dec 2005 B1
6981028 Rawat et al. Dec 2005 B1
6990629 Heaney et al. Jan 2006 B1
6993421 Pillar Jan 2006 B2
7000184 Matveyenko et al. Feb 2006 B2
7003476 Samra et al. Feb 2006 B1
7028072 Kliger et al. Apr 2006 B1
7031554 Iwane Apr 2006 B2
7039704 Davis et al. May 2006 B2
7047318 Svedloff May 2006 B1
7062343 Ogushi et al. Jun 2006 B2
7062506 Taylor et al. Jun 2006 B2
7072943 Landesmann Jul 2006 B2
7092803 Kapolka et al. Aug 2006 B2
7107268 Zawadzki et al. Sep 2006 B1
7124116 Huyler Oct 2006 B2
7152207 Underwood et al. Dec 2006 B1
7155491 Schultz et al. Dec 2006 B1
7171418 Blessin Jan 2007 B2
7184866 Squires et al. Feb 2007 B2
7197764 Cichowlas Mar 2007 B2
7219234 Ashland et al. May 2007 B1
7240125 Fleming Jul 2007 B2
7246263 Skingle Jul 2007 B2
7281029 Rawat Oct 2007 B2
7287000 Boyd et al. Oct 2007 B2
7322007 Schowtka et al. Jan 2008 B2
7386786 Davis et al. Jun 2008 B2
7401289 Lachhwani et al. Jul 2008 B2
7406429 Salonen Jul 2008 B2
7433891 Haber et al. Oct 2008 B2
7457693 Olsen Nov 2008 B2
7477968 Lowrey Jan 2009 B1
7480551 Lowrey et al. Jan 2009 B1
7496543 Bamford et al. Feb 2009 B1
7502672 Kolls Mar 2009 B1
7536641 Rosenstein et al. May 2009 B2
7548985 Guigui Jun 2009 B2
7587504 Adams et al. Sep 2009 B2
7590476 Shumate Sep 2009 B2
7593925 Cadiz et al. Sep 2009 B2
7593999 Nathanson Sep 2009 B2
7613627 Doyle et al. Nov 2009 B2
7620484 Chen Nov 2009 B1
7624342 Matveyenko et al. Nov 2009 B2
7657594 Banga et al. Feb 2010 B2
7664667 Ruppelt Feb 2010 B1
7739007 Logsdon Jun 2010 B2
7747680 Ravikumar et al. Jun 2010 B2
7778841 Bayer et al. Aug 2010 B1
7801945 Geddes et al. Sep 2010 B1
7818380 Tamura et al. Oct 2010 B2
7861309 Spearman et al. Dec 2010 B2
7865409 Monaghan Jan 2011 B1
7870253 Muilenburg et al. Jan 2011 B2
7899701 Odom Mar 2011 B1
7908051 Oesterling Mar 2011 B2
7979506 Cole Jul 2011 B2
8010423 Bodin Aug 2011 B2
8019501 Breed Sep 2011 B2
8036788 Breed Oct 2011 B2
8051159 Muilenburg et al. Nov 2011 B2
8055544 Ullman et al. Nov 2011 B2
8060274 Boss Nov 2011 B2
8095403 Price Jan 2012 B2
8099308 Uyeki Jan 2012 B2
8135804 Uyeki Mar 2012 B2
8145379 Schwinke Mar 2012 B2
8190322 Lin May 2012 B2
8209259 Graham, Jr. et al. Jun 2012 B2
8212667 Petite et al. Jul 2012 B2
8271473 Berg Sep 2012 B2
8271547 Taylor et al. Sep 2012 B2
8275717 Ullman et al. Sep 2012 B2
8285439 Hodges Oct 2012 B2
8296007 Swaminathan et al. Oct 2012 B2
8311905 Campbell et al. Nov 2012 B1
8355950 Colson et al. Jan 2013 B2
8407664 Moosmann et al. Mar 2013 B2
8428815 Van Engelshoven et al. Apr 2013 B2
8438310 Muilenburg et al. May 2013 B2
8521654 Ford Aug 2013 B2
8538894 Ullman et al. Sep 2013 B2
8645193 Swinson et al. Feb 2014 B2
8676638 Blair et al. Mar 2014 B1
8725341 Ogasawara May 2014 B2
8849689 Jagannathan Sep 2014 B1
8886389 Edwards Nov 2014 B2
8924071 Stanek et al. Dec 2014 B2
8954222 Costantino Feb 2015 B2
8996230 Lorenz Mar 2015 B2
8996235 Singh Mar 2015 B2
9014908 Chen Apr 2015 B2
9015059 Sims, III Apr 2015 B2
9026304 Olsen, III et al. May 2015 B2
9047722 Kurnik Jun 2015 B2
9165413 Jones et al. Oct 2015 B2
9183681 Fish Nov 2015 B2
9325650 Yalavarty et al. Apr 2016 B2
9349223 Palmer May 2016 B1
9384597 Koch et al. Jul 2016 B2
9577866 Rogers et al. Feb 2017 B2
9596287 Rybak et al. Mar 2017 B2
9619945 Adderly et al. Apr 2017 B2
9659495 Modica et al. May 2017 B2
9715665 Schondorf et al. Jul 2017 B2
9754304 Taira et al. Sep 2017 B2
9778045 Bang Oct 2017 B2
9836714 Lander et al. Dec 2017 B2
10032139 Adderly Jul 2018 B2
10083411 Kinsey, II Sep 2018 B2
10229394 Davis et al. Mar 2019 B1
10475256 Chowdhury et al. Nov 2019 B2
20010005831 Lewin Jun 2001 A1
20010014868 Herz et al. Aug 2001 A1
20010037332 Miller et al. Nov 2001 A1
20010039594 Park et al. Nov 2001 A1
20010054049 Maeda et al. Dec 2001 A1
20020023111 Arora et al. Feb 2002 A1
20020024537 Jones Feb 2002 A1
20020026359 Long et al. Feb 2002 A1
20020032626 DeWolf et al. Mar 2002 A1
20020032701 Gao et al. Mar 2002 A1
20020042738 Srinivasan et al. Apr 2002 A1
20020046245 Hillar et al. Apr 2002 A1
20020049831 Platner et al. Apr 2002 A1
20020052778 Murphy et al. May 2002 A1
20020059260 Jas May 2002 A1
20020065698 Schick May 2002 A1
20020065739 Florance et al. May 2002 A1
20020069110 Sonnenberg Jun 2002 A1
20020073080 Lipkin Jun 2002 A1
20020082978 Ghouri et al. Jun 2002 A1
20020091755 Narin Jul 2002 A1
20020107739 Schlee Aug 2002 A1
20020111727 Vanstory Aug 2002 A1
20020111844 Vanstory Aug 2002 A1
20020116418 Lachhwani et al. Aug 2002 A1
20020123359 Wei et al. Sep 2002 A1
20020124053 Adams et al. Sep 2002 A1
20020128728 Murakami Sep 2002 A1
20020129054 Ferguson et al. Sep 2002 A1
20020133273 Lowrey et al. Sep 2002 A1
20020138331 Hosea et al. Sep 2002 A1
20020143646 Boyden et al. Oct 2002 A1
20020154146 Rodriquez et al. Oct 2002 A1
20020169851 Weathersby et al. Nov 2002 A1
20020173885 Lowrey et al. Nov 2002 A1
20020196273 Krause Dec 2002 A1
20020198761 Ryan et al. Dec 2002 A1
20020198878 Baxter et al. Dec 2002 A1
20030014443 Bernstein et al. Jan 2003 A1
20030023632 Ries et al. Jan 2003 A1
20030033378 Needham et al. Feb 2003 A1
20030036832 Kokes Feb 2003 A1
20030036964 Boyden et al. Feb 2003 A1
20030037263 Kamat et al. Feb 2003 A1
20030046179 Anabtawi et al. Mar 2003 A1
20030051022 Sogabe et al. Mar 2003 A1
20030055666 Roddy Mar 2003 A1
20030061263 Riddle Mar 2003 A1
20030065532 Takaoka Apr 2003 A1
20030065583 Takaoka Apr 2003 A1
20030069785 Lohse Apr 2003 A1
20030069790 Kane Apr 2003 A1
20030074392 Campbell et al. Apr 2003 A1
20030095038 Dix May 2003 A1
20030101262 Godwin May 2003 A1
20030115292 Griffin et al. Jun 2003 A1
20030120502 Robb et al. Jun 2003 A1
20030145310 Thames et al. Jul 2003 A1
20030177050 Crampton et al. Sep 2003 A1
20030177175 Worley et al. Sep 2003 A1
20030225853 Wang et al. Dec 2003 A1
20030229623 Chang et al. Dec 2003 A1
20030233246 Snapp et al. Dec 2003 A1
20040012631 Skorski Jan 2004 A1
20040039646 Hacker Feb 2004 A1
20040041818 White et al. Mar 2004 A1
20040073546 Forster et al. Apr 2004 A1
20040073564 Haber et al. Apr 2004 A1
20040088228 Mercer et al. May 2004 A1
20040093243 Bodin May 2004 A1
20040117046 Colle Jun 2004 A1
20040122735 Meshkin et al. Jun 2004 A1
20040128320 Grove et al. Jul 2004 A1
20040139203 Graham, Jr. et al. Jul 2004 A1
20040148342 Cotte Jul 2004 A1
20040156020 Edwards Aug 2004 A1
20040163047 Nagahara et al. Aug 2004 A1
20040181464 Vanker et al. Sep 2004 A1
20040199413 Hauser Oct 2004 A1
20040220778 Imai Nov 2004 A1
20040220863 Porter et al. Nov 2004 A1
20040225664 Casement Nov 2004 A1
20040230897 Latzel Nov 2004 A1
20040255233 Croney et al. Dec 2004 A1
20040267263 May Dec 2004 A1
20040268225 Walsh et al. Dec 2004 A1
20040268232 Tunning Dec 2004 A1
20050015491 Koeppel Jan 2005 A1
20050021197 Zimmerman Jan 2005 A1
20050065804 Worsham et al. Mar 2005 A1
20050096963 Myr et al. May 2005 A1
20050108112 Ellenson et al. May 2005 A1
20050114270 Hind et al. May 2005 A1
20050114764 Gudenkauf et al. May 2005 A1
20050108637 Sahota et al. Jun 2005 A1
20050149398 McKay Jul 2005 A1
20050171836 Leacy Aug 2005 A1
20050176482 Raisinghani Aug 2005 A1
20050187834 Painter Aug 2005 A1
20050228736 Norman et al. Oct 2005 A1
20050267774 Merritt et al. Dec 2005 A1
20050268282 Laird Dec 2005 A1
20050289020 Bruns et al. Dec 2005 A1
20050289599 Matsuura et al. Dec 2005 A1
20060031811 Ernst et al. Feb 2006 A1
20060059253 Goodman et al. Mar 2006 A1
20060064637 Rechterman et al. Mar 2006 A1
20060123330 Horiuchi et al. Jun 2006 A1
20060129423 Sheinson et al. Jun 2006 A1
20060129982 Doyle Jun 2006 A1
20060136105 Larson Jun 2006 A1
20060161841 Horiuchi et al. Jul 2006 A1
20060200751 Underwood et al. Sep 2006 A1
20060248442 Rosenstein et al. Nov 2006 A1
20060265355 Taylor Nov 2006 A1
20060271844 Suklikar Nov 2006 A1
20060277588 Harrington et al. Dec 2006 A1
20070005446 Fusz et al. Jan 2007 A1
20070016486 Stone et al. Jan 2007 A1
20070027754 Collins et al. Feb 2007 A1
20070033087 Combs Feb 2007 A1
20070033520 Kimzey et al. Feb 2007 A1
20070053513 Hoffberg Mar 2007 A1
20070100519 Engel May 2007 A1
20070150368 Arora et al. Jun 2007 A1
20070209011 Padmanabhuni et al. Sep 2007 A1
20070226540 Konieczny Sep 2007 A1
20070250229 Wu Oct 2007 A1
20070250327 Hedy Oct 2007 A1
20070271154 Broudy et al. Nov 2007 A1
20070271330 Mattox et al. Nov 2007 A1
20070271389 Joshi et al. Nov 2007 A1
20070282711 Ullman et al. Dec 2007 A1
20070282712 Ullman et al. Dec 2007 A1
20070282713 Ullman et al. Dec 2007 A1
20070288413 Mizuno et al. Dec 2007 A1
20070294192 Tellefsen Dec 2007 A1
20080010561 Bay et al. Jan 2008 A1
20080015929 Koeppel et al. Jan 2008 A1
20080027827 Eglen et al. Jan 2008 A1
20080119983 Inbarajan et al. May 2008 A1
20080172632 Stambaugh Jul 2008 A1
20080189143 Wurster Aug 2008 A1
20080195435 Bentley et al. Aug 2008 A1
20080195932 Oikawa et al. Aug 2008 A1
20080201163 Barker et al. Aug 2008 A1
20080255925 Vailaya et al. Oct 2008 A1
20090012887 Taub et al. Jan 2009 A1
20090024918 Silverbrook et al. Jan 2009 A1
20090043780 Hentrich, Jr. et al. Feb 2009 A1
20090070435 Abhyanker Mar 2009 A1
20090089134 Uyeki Apr 2009 A1
20090106036 Tamura Apr 2009 A1
20090112687 Blair et al. Apr 2009 A1
20090182232 Zhang et al. Jul 2009 A1
20090187939 Lajoie Jul 2009 A1
20090204454 Lagudi Aug 2009 A1
20090222532 Finlaw Sep 2009 A1
20090265607 Raz et al. Oct 2009 A1
20090313035 Esser et al. Dec 2009 A1
20100023393 Costy et al. Jan 2010 A1
20100070343 Taira et al. Mar 2010 A1
20100082778 Muilenburg et al. Apr 2010 A1
20100082780 Muilenburg et al. Apr 2010 A1
20100088158 Pollack Apr 2010 A1
20100100259 Geiter Apr 2010 A1
20100100506 Marot Apr 2010 A1
20100235219 Merrick et al. Sep 2010 A1
20100293030 Wu Nov 2010 A1
20100312608 Shan et al. Dec 2010 A1
20100318408 Sankaran et al. Dec 2010 A1
20100324777 Tominaga Dec 2010 A1
20110010432 Uyeki Jan 2011 A1
20110022525 Swinson et al. Jan 2011 A1
20110082804 Swinson et al. Apr 2011 A1
20110145064 Anderson et al. Jun 2011 A1
20110161167 Jallapuram Jun 2011 A1
20110191264 Inghelbrecht et al. Aug 2011 A1
20110196762 DuPont Aug 2011 A1
20110224864 Gellatly Sep 2011 A1
20110231055 Knight et al. Sep 2011 A1
20110307411 Bolivar et al. Dec 2011 A1
20120066010 Williams et al. Mar 2012 A1
20120089474 Xiao Apr 2012 A1
20120095804 Calabrese et al. Apr 2012 A1
20120158211 Chen et al. Jun 2012 A1
20120209714 Douglas et al. Aug 2012 A1
20120221125 Bell Aug 2012 A1
20120268294 Michaelis et al. Oct 2012 A1
20120278886 Luna Nov 2012 A1
20120316981 Hoover et al. Dec 2012 A1
20130046432 Edwards Feb 2013 A1
20130080196 Schroeder Mar 2013 A1
20130204484 Ricci Aug 2013 A1
20130325541 Capriotti Dec 2013 A1
20130332023 Bertosa Dec 2013 A1
20140026037 Garb et al. Jan 2014 A1
20140052327 Hosein Feb 2014 A1
20140088866 Knapp Mar 2014 A1
20140094992 Lambert et al. Apr 2014 A1
20140229391 East, III Aug 2014 A1
20140244110 Tharaldson et al. Aug 2014 A1
20140277906 Lowrey Sep 2014 A1
20140278805 Thompson Sep 2014 A1
20140324275 Stanek Oct 2014 A1
20140337163 Whisnant Nov 2014 A1
20140379530 Kim Dec 2014 A1
20150057875 McGinnis Feb 2015 A1
20150066781 Johnson Mar 2015 A1
20150066933 Kolodziej et al. Mar 2015 A1
20150100199 Kurnik Apr 2015 A1
20150142256 Jones May 2015 A1
20150227894 Mapes, Jr. et al. Aug 2015 A1
20150268059 Borghesani Sep 2015 A1
20150278886 Fusz Oct 2015 A1
20150286979 Ming Oct 2015 A1
20160004516 Ivanov et al. Jan 2016 A1
20160071054 Kakarala et al. Mar 2016 A1
20160092944 Taylor Mar 2016 A1
20160140622 Wang et al. May 2016 A1
20160148439 Akselrod May 2016 A1
20160180358 Battista Jun 2016 A1
20160180378 Toshida et al. Jun 2016 A1
20160180418 Jaeger Jun 2016 A1
20160267503 Zakai-Or et al. Sep 2016 A1
20160307174 Marcelle et al. Oct 2016 A1
20160357599 Glatfelter Dec 2016 A1
20170039785 Richter Feb 2017 A1
20170053460 Hauser et al. Feb 2017 A1
20170124525 Johnson May 2017 A1
20170308844 Kelley Oct 2017 A1
20170308864 Kelley Oct 2017 A1
20170316459 Strauss et al. Nov 2017 A1
20170337573 Toprak Nov 2017 A1
20180232749 Moore, Jr. et al. Aug 2018 A1
20180285901 Zackrone Oct 2018 A1
20180285925 Zackrone Oct 2018 A1
20190297162 Amar et al. Sep 2019 A1
20200038363 Kim Feb 2020 A1
Foreign Referenced Citations (2)
Number Date Country
2494350 May 2004 CA
0461888 Mar 1995 EP
Non-Patent Literature Citations (161)
Entry
How a solution found a problem of scheduling service appointments Automotive News Feb. 15, 2016 (Year: 2016).
An Appointment With Destiny—The Time for Web-Enabled Scheduling Has Arrived Link Fall 2007 (Year: 2007).
Emmanuel, Daniel, Basics to Creating an Appointment System for Automotive Service Customers AutomotiveServiceManagement.com, 2006 (Year: 2006).
Croswell, Wayne, Service Shop Optimization Modern Tire Dealer, May 21, 2013 (Year: 2013).
Service Advisor Automotive Dealership Institute, 2007 (Year: 2007).
xTime.com Web Pages Xtime, Inc., Jan. 8, 2015, Retrieved from Archive.org Jan. 24, 2019 (Year: 2015).
Xtimes in Focus xtime, vol. 7, 2013 (Year: 2013).
Final Office Action for U.S. Appl. No. 13/025,019, filed Feb. 20, 2011, and mailed from the USPTO dated Dec. 20, 2016, 16 pgs.
“NetFormx Offers Advanced Network Discovery Software”. PR Newswire. Mar. 15, 1999. Retrieved from http://www.highbeam.com/doc/1G1-54102907.html>.
Advisory Action for U.S. Appl. No. 14/208,042, filed Mar. 13, 2014, and mailed from the USPTO dated Jul. 12, 2018.
Aloisio, Giovanni et al., “Web-based access to the Grid using the Grid Resource Broker portal,” Google 2002, pp. 1145-1160.
Anonymous, “Software ready for prime time.” Automotive News. Detroit, Nov. 5, 2001. vol. 76, Issue 5996, p. 28.
Chadwick, D. W., “Understanding X.500—The Directory.” Available at <http://sec.cs.kent.ac.uk/x500book/>. 1996. Entire work cited.
Chen, Deren, “Business to Business Standard and Supply Chain System Framework in Virtual Enterprises,” Computer Supported Cooperative Work in Design, The Sixth International Conference on, 2001; Publication Year: 2001, pp. 472-476.
CNY Business Journal, “Frank La Voila named Southern Tier Small-Business Person of 1999”. Jun. 11, 1999. 2 pgs.
Dallas Morning News, “I know someone who knows Kevin Bacon”. Oct. 27, 1998. 4 pgs.
Davis, Peter T. et al., “Sams Teach Yourself Microsoft Windows NT Server 4 in 21 Days,” Sams® Publishing, © 1999. ISBN: 0-672-31555-6, 15 pgs., printed Dec. 21, 2008.
Derfler, Frank J. et al., “How Networks Work: Millennium Edition,” Que, A Division of Macmillan Computer Publishing, © 2000. ISBN: 0-7897-2445-6, 9 pgs.
Final Office Action for U.S. Appl. No. 10/350,795, filed Jan. 24, 2003, and mailed from the USPTO dated Jul. 6, 2011, 26 pgs.
Final Office Action for U.S. Appl. No. 10/350,795, filed Jan. 24, 2003, and mailed from the USPTO dated Mar. 3, 2010, 24 pgs.
Final Office Action for U.S. Appl. No. 10/350,810, filed Jan. 24, 2003, and mailed from the USPTO dated Apr. 5, 2005, 12 pgs.
Final Office Action for U.S. Appl. No. 10/350,810, filed Jan. 24, 2003, and mailed from the USPTO dated May 18, 2006, 15 pgs.
Final Office Action for U.S. Appl. No. 10/350,810, filed Jan. 24, 2003, and mailed from the USPTO dated Nov. 14, 2007, 13 pgs.
Final Office Action for U.S. Appl. No. 10/351,465, filed Jan. 24, 2003, and mailed from the USPTO dated May 5, 2005, 8 pgs.
Final Office Action for U.S. Appl. No. 10/665,899, filed Sep. 18, 2003, and mailed from the USPTO dated Feb. 24, 2010, 22 pgs.
Final Office Action for U.S. Appl. No. 10/665,899, filed Sep. 18, 2003, and mailed from the USPTO dated Jul. 7, 2008, 11 pgs.
Final Office Action for U.S. Appl. No. 10/665,899, filed Sep. 18, 2003, and mailed from the USPTO dated Mar. 8, 2011, 21 pgs.
Final Office Action for U.S. Appl. No. 10/665,899, filed Sep. 18, 2003, and mailed from the USPTO dated May 11, 2009, 14 pgs.
Final Office Action for U.S. Appl. No. 11/149,909, filed Jun. 10, 2005, and mailed from the USPTO dated Feb. 4, 2009, 14 pgs.
Final Office Action for U.S. Appl. No. 11/442,821, filed May 30, 2006, and mailed from the USPTO dated Apr. 7, 2009, 19 pgs.
Final Office Action for U.S. Appl. No. 11/442,821, filed May 30, 2006, and mailed from the USPTO dated May 21, 2010, 28 pgs.
Final Office Action for U.S. Appl. No. 11/442,821, filed May 30, 2006, and mailed from the USPTO dated Nov. 29, 2011, 26 pgs.
Final Office Action for U.S. Appl. No. 11/446,011, filed Jun. 2, 2006, and mailed from the USPTO dated Jun. 8, 2010, 12 pgs.
Final Office Action for U.S. Appl. No. 11/524,602, filed Sep. 21, 2006, and mailed from the USPTO dated Jul. 27, 2010, 13 pgs.
Final Office Action for U.S. Appl. No. 11/524,602, filed Sep. 21, 2006, and mailed from the USPTO dated Jun. 26, 2012, 11 pgs.
Final Office Action for U.S. Appl. No. 11/525,009, filed Sep. 21, 2006, and mailed from the USPTO dated Aug. 3, 2010, 16 pgs.
Final Office Action for U.S. Appl. No. 12/243,852, filed Oct. 1, 2008, and mailed from the USPTO dated Oct. 24, 2011, 13 pgs.
Final Office Action for U.S. Appl. No. 12/243,861, filed Oct. 1, 2008, and mailed from the USPTO dated Jun. 22, 2011, 5 pgs.
Final Office Action for U.S. Appl. No. 13/025,019, filed Feb. 10, 2011, and mailed from the USPTO dated Aug. 28, 2015, 25 pgs.
Final Office Action for U.S. Appl. No. 13/025,019, filed Feb. 10, 2011, and mailed from the USPTO dated Jul. 13, 2018, 11 pgs.
Final Office Action for U.S. Appl. No. 13/025,019, filed Feb. 10, 2011, and mailed from the USPTO dated Sep. 12, 2013, 13 pgs.
Final Office Action for U.S. Appl. No. 14/208,042, filed Mar. 13, 2014, and mailed from the USPTO dated Apr. 16, 2018.
Final Office Action for U.S. Appl. No. 14/208,042, filed Mar. 13, 2014, and mailed from the USPTO dated Dec. 6, 2016, 26 pgs.
Final Office Action for U.S. Appl. No. 15/602,999, filed May 23, 2017, and mailed from USPTO dated Nov. 21, 2018.
Final Office Action dated Sep. 21, 2018 in U.S. Appl. No. 15/134,820.
Hogue et al., “Thresher: Automating the Unwrapping of Semantic Content from the World Wide Web,” ACM 2005, pp. 86-95.
Housel, Barron C. et al., WebExpress: a client/intercept based system for optimizing Web browsing in a wireless environment, Google 1998, pp. 419-431.
http://web.archive.org/web/20010718130244/http://chromedata.com/maing2/about/index.asp, 1 pg.
http://web.archive.org/web/20050305055408/http://www.dealerclick.com/, 1 pg.
http://web.archive.org/web/20050528073821/http://www.kbb.com/, 1 pg.
http://web.archive.org/web/20050531000823/http://www.carfax.com/, 1 pg.
IBM Tivoli Access Manager Base Administration Guide, Version 5.1. 2003, International Business Machines Corporation. Entire book enclosed and cited. 402 pgs.
Interconnection. (2003). In Roget's II The New Thesaurus. Boston, MA: Houghton Mifflin. Retrieved Jul. 16, 2009, from http://www.credoreference.com/entry/hmrogets/interconnection, 1 pg.
Internet Archive Wayback Machine, archive of LDAP Browser.com—FAQ. Archived Dec. 11, 2000. Available at <http://web.archive.org/web/200012110152/http://www.ldapbrowser.com/faq/faq.php3?sID=fe4ae66f023d86909f35e974f3a1ce>.
Internet Archive Wayback Machine, archive of LDAP Browser.com—Product Info. Archived Dec. 11, 2000. Available at <http://web.archive.org/web/200012110541/http://www.ldapbrowser.com/prodinfo/prodinfo.php3?sID=fe4ae66f2fo23d86909f35e974f3a1ce>.
Internet Archive: Audio Archive, http://www.archive.org/audio/audio-searchresults.php?search=@start=0&limit=100&sort=ad, printed May 12, 2004, 12 pgs.
Internet Archive: Democracy Now, http://www.archive.org/audio/collection.php?collection=democracy_now, printed May 12, 2004, 2 pgs.
Java 2 Platform, Enterprise Edition (J2EE) Overview, printed Mar. 6, 2010, 3 pgs.
Java version history—Wkipedia, the free encyclopedia, printed Mar. 6, 2010, 9 pgs.
Michener, J.R., et al., “Managing System and Active-Content Integrity,” Computer; vol. 33, Issue: 7; Publication Year: 2000, pp. 108-110.
Milic-Frayling, Natasa, et al., “SmartView: Enhanced Document Viewer for Mobile Devices,” Google Nov. 15, 2002, 11 pgs.
Non-Final Office Action for U.S. Appl. No. 10/350,795, filed Jan. 24, 2003, and mailed from the USPTO dated Dec. 26, 2008, 13 pgs.
Non-Final Office Action for U.S. Appl. No. 10/350,795, filed Jan. 24, 2003, and mailed from the USPTO dated Feb. 6, 2006, 11 pgs.
Non-Final Office Action for U.S. Appl. No. 10/350,795, filed Jan. 24, 2003, and mailed from the USPTO dated Jul. 22, 2009, 22 pgs.
Non-Final Office Action for U.S. Appl. No. 10/350,795, filed Jan. 24, 2003, and mailed from the USPTO dated Jun. 29, 2006, 11 pgs.
Non-Final Office Action for U.S. Appl. No. 10/350,795, filed Jan. 24, 2003, and mailed from the USPTO dated Mar. 12, 2007, 10 pgs.
Non-Final Office Action for U.S. Appl. No. 10/350,795, filed Jan. 24, 2003, and mailed from the USPTO dated May 29, 2008, 10 pgs.
Non-Final Office Action for U.S. Appl. No. 10/350,795, filed Jan. 24, 2003, and mailed from the USPTO dated Nov. 1, 2010, 19 pgs.
Non-Final Office Action for U.S. Appl. No. 10/350,796, filed Jan. 24, 2003 and mailed from the USPTO dated May 19, 2005, 7 pgs.
Non-Final Office Action for U.S. Appl. No. 10/350,810, filed Jan. 24, 2003, and mailed from the USPTO dated Apr. 17, 2007, 12 pgs.
Non-Final Office Action for U.S. Appl. No. 10/350,810, filed Jan. 24, 2003, and mailed from the USPTO dated Dec. 9, 2005, 14 pgs.
Non-Final Office Action for U.S. Appl. No. 10/350,810, filed Jan. 24,2003, and mailed from the USPTO dated Sep. 22, 2004, 10 pgs.
Non-Final Office Action for U.S. Appl. No. 10/351,465, filed Jan. 24, 2003, and mailed from the USPTO dated Jul. 27, 2004, 9 pgs.
Non-final Office Action for U.S. Appl. No. 10/351,606, filed Jan. 24, 2003 and mailed from the USPTO dated Dec. 19, 2005, 7 pgs.
Non-final Office Action for U.S. Appl. No. 10/351,606, filed Jan. 24, 2003 and mailed from the USPTO dated May 17, 2004, 5 pgs.
Non-Final Office Action for U.S. Appl. No. 10/351,606, filed Jan. 24, 2003, and mailed from the USPTO dated May 17, 2004, 6 pgs.
Non-Final Office Action for U.S. Appl. No. 10/665,899, filed Sep. 18, 2003, and mailed from the USPTO dated Aug. 30, 2010, 23 pgs.
Non-Final Office Action for U.S. Appl. No. 10/665,899, filed Sep. 18, 2003, and mailed from the USPTO dated Nov. 13, 2008, 11 pgs.
Non-Final Office Action for U.S. Appl. No. 10/665,899, filed Sep. 18, 2003, and mailed from the USPTO dated Sep. 14, 2009, 14 pgs.
Non-Final Office Action for U.S. Appl. No. 10/665,899, filed Sep. 18, 2003, and mailed from the USPTO dated Sep. 17, 2007, 11 pgs.
Non-Final Office Action for U.S. Appl. No. 11/149,909, filed Jun. 10, 2005, and mailed from the USPTO dated May 13, 2008, 14 pgs.
Non-Final Office Action for U.S. Appl. No. 11/149,909, filed Jun. 10, 2005, and mailed from the USPTO dated May 6, 2009, 6 pgs.
Non-Final Office Action for U.S. Appl. No. 11/414,939, filed May 1, 2006, and mailed from the USPTO dated Jul. 19, 2010, 7 pgs.
Non-Final Office Action for U.S. Appl. No. 11/414,939, filed May 1, 2006, and mailed from the USPTO dated Mar. 9, 2010, 11 pgs.
Non-Final Office Action for U.S. Appl. No. 11/442,821, filed May 30, 2006, and mailed from the USPTO dated Jun. 1, 2011, 23 pgs.
Non-Final Office Action for U.S. Appl. No. 11/442,821, filed May 30, 2006, and mailed from the USPTO dated Nov. 12, 2009, 19 pgs.
Non-Final Office Action for U.S. Appl. No. 11/442,821, filed May 30, 2006, and mailed from the USPTO dated Sep. 3, 2008, 14 pgs.
Non-Final Office Action for U.S. Appl. No. 11/446,011, filed Jun. 2, 2006, and mailed from the USPTO dated Mar. 1, 2011, 15 pgs.
Non-Final Office Action for U.S. Appl. No. 11/446,011, filed Jun. 2, 2006, and mailed from the USPTO dated Nov. 27, 2009, 14 pgs.
Non-Final Office Action for U.S. Appl. No. 11/524,602, filed Sep. 21, 2006, and mailed from the USPTO dated Dec. 11, 2009, 20 pgs.
Non-Final Office Action for U.S. Appl. No. 11/524,602, filed Sep. 21, 2006, and mailed from the USPTO dated Nov. 14, 2011, 19 pgs.
Non-Final Office Action for U.S. Appl. No. 11/525,009, filed Sep. 21, 2006, and mailed from the USPTO dated Aug. 10, 2011, 18 pgs.
Non-Final Office Action for U.S. Appl. No. 11/525,009, filed Sep. 21, 2006, and mailed from the USPTO dated Dec. 16, 2009, 20 pgs.
Non-Final Office Action for U.S. Appl. No. 12/243,852, filed Oct. 1, 2008, and mailed from the USPTO dated Jan. 16, 2013, 5 pgs.
Non-Final Office Action for U.S. Appl. No. 12/243,852, filed Oct. 1, 2008, and mailed from the USPTO dated Mar. 17, 2011, 8 pgs.
Non-Final Office Action for U.S. Appl. No. 12/243,855, filed Oct. 1, 2008, and mailed from the USPTO dated Oct. 14, 2010, 6 pgs.
Non-Final Office Action for U.S. Appl. No. 12/243,861, filed Oct. 1, 2008, and mailed from the USPTO dated Nov. 8, 2010, 8 pgs.
Non-Final Office Action for U.S. Appl. No. 13/025,019, filed Feb. 10, 2011, and mailed from the USPTO dated Apr. 22, 2016, 16 pgs.
Non-Final Office Action for U.S. Appl. No. 13/025,019, filed Feb. 10, 2011, and mailed from the USPTO dated Apr. 5, 2013, 15 pgs.
Non-Final Office Action for U.S. Appl. No. 13/025,019, filed Feb. 10, 2011, and mailed from the USPTO dated Oct. 6, 2017, 17 pgs.
Non-Final Office Action for U.S. Appl. No. 13/025,019, filed Feb. 10, 2011, and mailed from the USPTO dated Sep. 18, 2014, 15 pgs.
Non-Final Office Action for U.S. Appl. No. 14/208,042, filed Mar. 13, 2014, and mailed from the USPTO dated Jun. 30, 2016, 23 pgs.
Non-Final Office Action for U.S. Appl. No. 14/208,042, filed Mar. 13, 2014, and mailed from the USPTO dated Sep. 20, 2017.
Non-Final Office Action for U.S. Appl. No. 14/208,042, filed Mar. 13, 2014, and mailed from the USPTO dated Sep. 21, 2018.
Non-Final Office Action for U.S. Appl. No. 15/134,820, filed Apr. 21, 2016, and mailed from the USPTO dated Feb. 23, 2018.
Non-Final Office Action for U.S. Appl. No. 15/602,999, filed May 23, 2017, and mailed from the USPTO dated May 3, 2018.
Notice of Allowance and Fee(s) Due for U.S. Appl. No. 10/350,795, filed Jan. 24, 2003, and mailed from the USPTO dated May 7, 2012, 15 pgs.
Notice of Allowance and Fee(s) Due for U.S. Appl. No. 10/350,796, filed Jan. 24, 2003 and mailed from the USPTO dated Feb. 1, 2006, 5 pgs.
Notice of Allowance and Fee(s) Due for U.S. Appl. No. 10/350,810, filed Jan. 24, 2003, and mailed from the USPTO dated Apr. 14, 2008, 6 pgs.
Notice of Allowance and Fee(s) Due for U.S. Appl. No. 10/351,465, filed Jan. 24, 2003, and mailed from the USPTO dated Sep. 21, 2005, 4 pgs.
Notice of Allowance and Fee(s) Due for U.S. Appl. No. 10/351,606, filed Jan. 24, 2003, and mailed from the USPTO dated Apr. 4, 2006, 12 pgs.
Notice of Allowance and Fee(s) Due for U.S. Appl. No. 11/149,909, filed Jun. 10, 2005, and mailed from the USPTO dated Sep. 16, 2009, 7 pgs.
Notice of Allowance and Fee(s) Due for U.S. Appl. No. 11/414,939, filed May 1, 2006, and mailed from the USPTO dated Nov. 2, 2010, pgs.
Notice of Allowance and Fee(s) Due for U.S. Appl. No. 11/442,821, filed May 30, 2006, and mailed from the USPTO dated Jul. 30, 2012, 6 pgs.
Notice of Allowance and Fee(s) Due for U.S. Appl. No. 11/446,011, filed Jun. 2, 2006, and mailed from the USPTO dated Aug. 9, 2011, 10 pgs.
Notice of Allowance and Fee(s) Due for U.S. Appl. No. 11/524,602, filed Sep. 21, 2006, and mailed from the USPTO dated Aug. 6, 2013, 22 pgs.
Notice of Allowance and Fee(s) Due for U.S. Appl. No. 11/525,009, filed Sep. 21, 2006, and mailed from the USPTO dated Jul. 23, 2012, 19 pgs.
Notice of Allowance and Fee(s) Due for U.S. Appl. No. 12/243,852, filed Oct. 1, 2008, and mailed from the USPTO dated Feb. 27, 2013, 6 pgs.
Notice of Allowance and Fee(s) Due for U.S. Appl. No. 12/243,855, filed Oct. 1, 2008, and mailed from the USPTO dated Nov. 22, 2010, 8 pgs.
Notice of Allowance and Fee(s) Due for U.S. Appl. No. 12/243,855, filed Oct. 1, 2008, and mailed from the USPTO dated Oct. 28, 2010, 5 pgs.
Notice of Allowance and Fee(s) Due for U.S. Appl. No. 12/243,861, filed Oct. 1, 2008, and mailed from the USPTO dated Sep. 6, 2011, 10 pgs.
Notice of Non-compliant Amendment dated Dec. 12, 2006 in U.S. Appl. No. 10/350,810.
Permissions in the Java ™ 2 SDK, printed Mar. 6, 2010, 45 pgs.
Restriction Requirement for U.S. Appl. No. 12/243,852, filed Oct. 1, 2008, and mailed from the USPTO dated Dec. 7, 2010.
Strebe, Matthew et al. MCSE: NT Server 4 Study Guide, Third Edition. 2000, SYBEX Inc. Front matter, pp. 284-293, and 308-347 are included. Entire book cited, 36 pgs.
Supplemental Notice of Allowability for U.S. Appl. No. 12/243,852, filed Oct. 1, 2008, and mailed from the USPTO dated Mar. 19, 2013, 3 pgs.
Trademark Electronic Search System record for Serial No. 76375405, Word Mark “Nitra”.
Lee, Adam J. et al., “Searching for Open Windows and Unlocked Doors: Port Scanning in Large-Scale Commodity Clusters,” Cluster Computing and the Grid, 2005. CCGrid 2005. IEEE International Symposium on vol. 1; Publication Year: 2005,, pp. 146-151 vol. 1.
Final Office Action for U.S. Appl. No. 14/208,042, filed Mar. 13, 2014, and mailed from the USPTO dated Jan. 11, 2019 , 16 pgs.
Advisory Action for U.S. Appl. No. 15/602,999, filed May 23, 2017, and mailed from the USPTO dated Jan. 31, 2019, 3 pgs.
Non-Final Office Action for U.S. Appl. No. 15/134,779, filed Apr. 21, 2016, and mailed from the USPTO dated Jan. 30, 2019, 26 pgs.
U.S. Appl. No. 15/134,820, Notice of Allowance, dated Jan. 28, 2019, 7 pages.
U.S. Appl. No. 15/602,999, Notice of Allowance, dated Apr. 18, 2019, 6 pages.
“Openbay Announces First-of-its-Kind Connected Car Repair Service”, openbay.com, Mar. 31, 2015, 14 pages.
U.S. Appl. No. 15/134,779, Final Office Action, dated May 17, 2019, 25 pages.
Chatterjee, et al., “On-board diagnostics not just for racing anymore”, EDN.com, May 6, 2013, 7 pages.
Drawbaugh, “Automatic Link Review: an expensive way to learn better driving habits”, Endgadget.com, Nov. 26, 2013, 14 pages.
Jenkins, “Real-time vehicle performance monitoring with data intergrity”, A Thesis Submitted to the Faculty of Mississippi State University, Oct. 2006, 57 pages.
Lavrinc, “First Android-powered infotainment system coming to 2012 Saab 9-3”, Autoblog.com, Mar. 2, 2011, 8 pages.
Needham, “Google Now Taking Appointments for Auto Repair Shops”, Autoshopsolutions.corn, Aug. 25, 2015, 6 pages.
Openbay.com Web Pages, Openbay.com, retrieved from archive.org May 14, 2019, Apr. 2015, 6 pages.
Openbay.com Web Pages, Openbay.com, retrieved from archive.org on May 14, 2019, Feb. 2014, 2 pages.
Openbay.com Web Pages, Openbay.com, retrieved from archive.org, May 14, 2019, Mar. 2015, 11 pages.
Phelan, “Smart phone app aims to automate car repairs”, Detroit Free Press Auto Critic, Mar. 31, 2015, 2 pages.
Pubnub Staff, “Streaming Vehicle Data in Realtime with Automatic (Pt 1)”, Pubnub.com, Aug. 17, 2015, 13 pages.
Warren, “This Device Determines What Ails Your Car and Finds a Repair Shop—Automatically”, CarAndDriver.com, Apr. 8, 2015, 7 pages.
You, et al., “Overview of Remote Diagnosis and Maintenance for Automotive Systems”, 2005 SAE World Congress, Apr. 11-14, 2015, 10 pages.
U.S. Appl. No. 15/134,779, Advisory Action, dated Jul. 29, 2019, 6 pages.
U.S. Appl. No. 13/025,019, Notice of Allowance, dated Sep. 26, 2019, 9 pages.
U.S. Appl. No. 15/478,042, Non-Final Office Action, dated Oct. 10, 2019, 26 pages.
U.S. Appl. No. 15/478,048, Non-Final Office Action, dated Sep. 30, 2019, 30 pages.
U.S. Appl. No. 15/134,779, Non-Final Office Action, dated Nov. 19, 2019, 27 pages.
U.S. Appl. No. 16/041,552, Non-Final Office Action, dated Dec. 27, 2019, 13 pages.
U.S. Appl. No. 15/478,042 , Non-Final Office Action, dated Aug. 4, 2020, 42 pages.
U.S. Appl. No. 15/134,779, Final Office Action, dated Feb. 27, 2020, 18 pages.
U.S. Appl. No. 15/478,042, Final Office Action, dated Mar. 19, 2020, 35 pages.
U.S. Appl. No. 16/041,552, Final Office Action, dated May 29, 2020, 18 pages.
U.S. Appl. No. 14/208,042 , Non-Final Office Action, dated Aug. 21, 2020, 13 pages.
U.S. Appl. No. 15/134,779 , Notice of Allowance, dated Sep. 9, 2020, 12 pages.
U.S. Appl. No. 15/478,048 , Final Office Action, dated Apr. 9, 2020, 42 pages.
U.S. Appl. No. 16/041,552 , Non-Final Office Action, dated Sep. 17, 2020, 16 pages.
Related Publications (1)
Number Date Country
20170308865 A1 Oct 2017 US