Claims:
1. A computer implemented method for automatic vehicle maintenance scheduling, the method comprising:
• obtaining acceleration data at a fixed sampling rate of a moving vehicle when the moving vehicle attains at least a pre-determined speed for a pre-determined time from start of the moving vehicle;
• processing the obtained acceleration data to generate jerk energy values at predetermined intervals;
• computing speed normalized jerk energy based on an average of the generated jerk energy values and average speed of the moving vehicle;
• computing a relationship between journey number and the computed speed normalized jerk energy; and
• computing a vehicle maintenance indicator based on the computed relationship between the journey number and the computed speed normalized jerk energy.
2. The computer implemented method of claim 1, wherein the relationship between the journey number and the computed speed normalized jerk energy forms a fitted quadratic polynomial.
3. The computer implemented method of claim 1, wherein the step of computing the vehicle maintenance indicator comprises computing a ratio of:
• an initial slope of the computed speed normalized jerk energy for a first and a second journey number of the moving vehicle wherein the slope is greater than a pre-determined value; and
• a current slope of the computed speed normalized jerk energy for a current journey number and an immediate preceding journey number.
4. The computer implemented method of claim 1 further comprising the step of scheduling vehicle maintenance when the computed vehicle maintenance indicator is greater than a pre-determined threshold.
5. The computer implemented method of claim 1, wherein computing speed normalized jerk energy is based on median of the generated jerk energy values and average speed of the moving vehicle.
6. A system for automatic vehicle maintenance scheduling, the system comprising:
• one or more processors;
• a communication interface device;
• one or more internal data storage devices operatively coupled to the one or more processors for storing;
? a data obtaining module, configured to obtain an acceleration data at a fixed sampling rate of a moving vehicle;
? a data processing module, configured to process the obtained acceleration data to generate jerk energy values at predetermined intervals when the moving vehicle attains at least a pre-determined speed for a pre-determined time from start of the moving vehicle;
? a data computation module, configured to:
• compute speed normalized jerk energy based on an average of the generated jerk energy values and average speed of the moving vehicle;
• compute a relationship between journey number and the computed speed normalized jerk energy; and
• compute a vehicle maintenance indicator based on the computed relationship between the journey number and the computed speed normalized jerk energy;
7. The system of claim 6, further comprising a storage module for storing the value of average jerk energy and average speed.
8. The system of claim 6 further comprising a vehicle maintenance scheduler configured to schedule vehicle maintenance when the computed vehicle maintenance indicator is greater than a pre-determined threshold.
, Description:
FORM 2

THE PATENTS ACT, 1970
(39 of 1970)
&
THE PATENT RULES, 2003

COMPLETE SPECIFICATION
(See Section 10 and Rule 13)

Title of invention:
METHODS AND SYSTEMS FOR AUTOMATIC VEHICLE MAINTAINANCE SCHEDULING

Applicant:
Tata Consultancy Services Limited
A company Incorporated in India under the Companies Act, 1956
Having address:
Nirmal Building, 9th floor,
Nariman point, Mumbai 400021,
Maharashtra, India

The following specification particularly describes the embodiments and the manner in which it is to be performed.

TECHNICAL FIELD
[0001] The embodiments herein generally relate to vehicle maintenance and more particularly to methods and systems for automatic vehicle maintenance scheduling.

BACKGROUND
[0002] A vehicle owner with limited knowledge on vehicle diagnosis has to depend solely on experience or intuition in order to predict probable maintenance requirement for her/his vehicle. In order to track progressive degradation of a vehicle especially in absence of multitude of sensors present in various locations of the vehicle, regular visits to a service center or seeking professional help is inevitable. Currently for tracking progressive vehicle degradation, a vehicle is fitted with a multitude of sensors at various locations for example pressure sensors in tires. However, such sensors may only be available in expensive high end cars and may not be available in less expensive low end cars. Further to that, a true inference on the state of the vehicle can be made only by an experienced engineer. It is a challenge to track the progressive degradation of a vehicle and predict maintenance schedules well ahead of time without the implementation of a multitude of sensors at various locations of the vehicle.

SUMMARY
[0003] This summary is provided to introduce concepts related to vehicle maintenance and more particularly to methods and systems for automatic vehicle maintenance scheduling. This summary is neither intended to identify essential features of the claimed subject matter nor is it intended for use in determining or limiting the scope of the present disclosure.
[0004] In an aspect there is provided a computer implemented method for automatic vehicle maintenance scheduling, the method comprising obtaining acceleration data at a fixed sampling rate of a moving vehicle when the moving vehicle attains at least a pre-determined speed for a pre-determined time from start of the moving vehicle; processing the obtained acceleration data to generate jerk energy values at predetermined intervals; computing speed normalized jerk energy based on an average of the generated jerk energy values and average speed of the moving vehicle; computing a relationship between journey number and the computed speed normalized jerk energy; and computing a vehicle maintenance indicator based on the computed relationship between the journey number and the computed speed normalized jerk energy.
[0005] In an embodiment, the relationship between the journey number and the computed speed normalized jerk energy forms a fitted quadratic polynomial.
[0006] In an embodiment, the step of computing the vehicle maintenance indicator comprises computing a ratio of: an initial slope of the computed speed normalized jerk energy for a first and a second journey number of the moving vehicle wherein the slope is greater than a pre-determined value; and a current slope of the computed speed normalized jerk energy for a current journey number and an immediate preceding journey number.
[0007] In an embodiment, the method described herein above further comprising the step of scheduling vehicle maintenance when the computed vehicle maintenance indicator is greater than a pre-determined threshold.
[0008] In an aspect, there is provided a system for automatic vehicle maintenance scheduling, the system comprising: one or more processors; a communication interface device; one or more internal data storage devices operatively coupled to the one or more processors for storing: a data obtaining module, configured to obtain an acceleration data at a fixed sampling rate of a moving vehicle when the moving vehicle attains at least a pre-determined speed for a pre-determined time from start of the moving vehicle; a data processing module, configured to process the obtained acceleration data to generate jerk energy values at predetermined intervals; and a data computation module, configured to: compute speed normalized jerk energy based on an average of the generated jerk energy values and average speed of the moving vehicle; compute a relationship between journey number and the computed speed normalized jerk energy; and compute a vehicle maintenance indicator based on the computed relationship between the journey number and the computed speed normalized jerk energy;
[0009] In an embodiment, the system described herein further comprises a storage module for storing the value of average jerk energy and average speed.
[0010] In an embodiment, the system described herein further comprises a vehicle maintenance scheduler configured to schedule vehicle maintenance when the computed vehicle maintenance indicator is greater than a pre-determined threshold.
[0011] In yet another aspect, there is provided a computer program product for processing data, comprising a non-transitory computer readable medium having program instructions embodied therein for obtaining acceleration data at a fixed sampling rate of a moving vehicle when the moving vehicle attains at least a pre-determined speed for a pre-determined time from start of the moving vehicle; processing the obtained acceleration data to generate jerk energy values at predetermined intervals; computing speed normalized jerk energy based on an average of the generated jerk energy values and average speed of the moving vehicle; computing a relationship between journey number and the computed speed normalized jerk energy; and computing a vehicle maintenance indicator based on the computed relationship between the journey number and the computed speed normalized jerk energy.

BRIEF DESCRIPTION OF THE DRAWINGS
[0012] The embodiments herein will be better understood from the following detailed description with reference to the drawings, in which:
[0013] FIG. 1 illustrates an exemplary block diagram of an automatic vehicle maintenance scheduler system with functional modules in accordance with an embodiment of the present disclosure; and
[0014] FIG. 2 is an exemplary flow diagram illustrating a computer implemented method for automatic vehicle maintenance scheduling using the system of FIG. 1 in accordance with an embodiment of the present disclosure.
[0015] It should be appreciated by those skilled in the art that any block diagram herein represent conceptual views of illustrative systems embodying the principles of the present subject matter. Similarly, it will be appreciated that any flow charts, flow diagrams, state transition diagrams, pseudo code, and the like represent various processes which may be substantially represented in computer readable medium and so executed by a computing device or processor, whether or not such computing device or processor is explicitly shown.

DETAILED DESCRIPTION
[0016] The embodiments herein and the various features and advantageous details thereof are explained more fully with reference to the non-limiting embodiments that are illustrated in the accompanying drawings and detailed in the following description. The examples used herein are intended merely to facilitate an understanding of ways in which the embodiments herein may be practiced and to further enable those of skill in the art to practice the embodiments herein. Accordingly, the examples should not be construed as limiting the scope of the embodiments herein.
[0017] The words "comprising," "having," "containing," and "including," and other forms thereof, are intended to be equivalent in meaning and be open ended in that an item or items following any one of these words is not meant to be an exhaustive listing of such item or items, or meant to be limited to only the listed item or items.
[0018] It must also be noted that as used herein and in the appended claims, the singular forms "a," "an," and "the" include plural references unless the context clearly dictates otherwise. Although any systems and methods similar or equivalent to those described herein can be used in the practice or testing of embodiments of the present disclosure, the preferred, systems and methods are now described.
[0019] Some embodiments of this disclosure, illustrating all its features, will now be discussed in detail. The disclosed embodiments are merely exemplary of the disclosure, which may be embodied in various forms.
[0020] Before setting forth the detailed explanation, it is noted that all of the discussion below, regardless of the particular implementation being described, is exemplary in nature, rather than limiting.
[0021] Referring now to the drawings, and more particularly to FIGS. 1 and 2, where similar reference characters denote corresponding features consistently throughout the figures, there are shown preferred embodiments and these embodiments are described in the context of the following exemplary system and method.
[0022] FIG. 1 illustrates an exemplary block diagram of an automatic vehicle maintenance scheduler system 100 with functional modules in accordance with an embodiment of the present disclosure and FIG. 2 is an exemplary flow diagram illustrating a computer implemented method for automatic vehicle maintenance scheduling 200 using the system of FIG. 1 in accordance with an embodiment of the present disclosure. In an embodiment, system 100 can reside on one or more computers and include one or more processors (not shown), communication interface device or input/output (I/O) interface (not shown), and memory or one or more internal data storage devices (not shown) operatively coupled to the one or more processors. The one or more internal data storage devices may be interchangeably referred to as memory or database (client database / server database) in the context of the present disclosure. The one or more processors can be implemented as one or more microprocessors, microcomputers, microcontrollers, digital signal processors, central processing units, state machines, logic circuitries, and/or any devices that manipulate signals based on operational instructions. Among other capabilities, the processor(s) is configured to fetch and execute computer-readable instructions stored in the memory.
[0023] In an embodiment, system 100 can be implemented involving a variety of portable computing systems, such as a laptop computer, a notebook, hand-held device and the like. The I/O interface can include a variety of software and hardware interfaces, for example, a web interface, a graphical user interface, and the like and can facilitate multiple communications within a wide variety of networks and protocol types, including wired networks, for example, LAN, cable, etc., and wireless networks, such as WLAN, cellular, or satellite. In an embodiment, the I/O interface can include one or more ports for connecting a number of devices to one another or to another server. The memory may include any computer-readable medium known in the art including, for example, volatile memory, such as static random access memory (SRAM) and dynamic random access memory (DRAM), and/or non-volatile memory, such as read only memory (ROM), erasable programmable ROM, flash memories, hard disks, optical disks, and magnetic tapes. In an embodiment, the memory can include local memory employed during actual execution of program code, bulk storage, and cache memories which provide temporary storage of at least some program code in order to reduce the number of times code must be retrieved from bulk storage during execution. In an embodiment, the various modules of system 100 can be stored in the memory.
[0024] Referring now to FIG.1 and FIG. 2, at step 202 acceleration data of a moving vehicle is obtained at a fixed sampling rate by data obtaining module 112 when the moving vehicle attains at least a pre-determined speed for a pre-determined time from start of the moving vehicle. This ensures that false starts are eliminated and actual movement of the vehicle is considered. When the moving vehicle attains the pre-determined speed for the pre-determined time, the data obtaining module 112 starts functioning by capturing the acceleration data at the fixed sampling rate. In an embodiment the minimum pre-determined speed can be 3 kmph. In an embodiment, the minimum pre-determined time can be more than 300 seconds for the data obtaining module 202 to start functioning. In an embodiment, the acceleration data can be obtained at a fixed sampling rate using dedicated devices such as iDIGI gateway. In an embodiment, the data obtaining module can obtain the acceleration data using sensors / meters such as gyroscope, GPS and magnetometer. In accordance with the present disclosure, the sensors such as gyroscope, GPS and magnetometer can be either part of system 100 or as dedicated devices in the vehicle.
[0025] At step 204, data processing module 114, can process the obtained acceleration data to generate jerk energy values at predetermined intervals. In an embodiment, the pre-determined intervals can be of 10 second duration. In an embodiment, the data processing module 114 takes data from the data obtaining module 112. In an embodiment, the acceleration data is obtained at a fixed sampling frequency of 20 Hertz. Further, queuing of the acceleration data is done to form a ‘data queue’ and a data processing thread is initiated. The data processing thread internally reads values of the acceleration data from the ‘data queue’. The data processing thread corrects the orientation to calculate acceleration in a vertical axis direction in a vehicle coordinate system. The vertical acceleration is of interest for determining jerk energy values. In an embodiment, the vertical acceleration (in vehicle coordinate system) is used to compute jerk energy from acceleration samples with a window of 1 second, i.e. 20 samples with 50% overlapping. Out of these 20 samples of acceleration 1 jerk energy value is computed. Then for each 10 seconds with 50% overlapping sliding window 19 jerk energy values are computed. The average of these jerk energy values obtained for 10 second duration intervals each with average speed is used as initial micro trip level data. In an embodiment, the average of the jerk energy values is a median of the jerk energy values and the average speed is the median of speed. The values of average jerk energy obtained and average speed are stored in a storage module 116.
[0026] At step 206, data computation module 118, computes a speed normalized jerk energy based on an average of the generated jerk energy values and average speed of the moving vehicle. In an embodiment, speed normalized jerk is the ratio of average jerk energy value and average speed. The speed normalized jerk energy is computed for each completed journey of the moving vehicle and stored. A counter (not shown) counts the journey number. At step 208, data computation module 118, computes a relationship between the speed normalized jerk energy and the journey number. In an embodiment, a relationship between journey number denoted by ‘x’ and speed normalized jerk energy denoted by ‘NJ’ is obtained as a fitted quadratic polynomial equation. For example, let p(x) =NJ where p(x) is the fitted quadratic polynomial equation and p(x) is updated after each journey by the data computation module 118.
[0027] At step 210, the data computation module 118, computes a vehicle maintenance indicator based on the computed relationship between the journey number and the computed speed normalized jerk energy. In an embodiment, the journey number should be of a minimum number for example 10 journeys for the data computation module 118 to compute the vehicle maintenance indicator. The step of computing the vehicle maintenance indicator comprises computing a ratio of: an initial slope of the computed speed normalized jerk energy for a first and a second journey number of the moving vehicle wherein the slope is greater than a pre-determined value; and a current slope of the computed speed normalized jerk energy for a current journey number and an immediate preceding journey number. The initial slope of the computed speed normalized jerk energy for a first and a second journey number of the moving vehicle wherein the slope is greater than a pre-determined value can be denoted as: delPinitial = max{ (p(2) – p(1)) , .20} , where .20 is a minimum constant value. The current slope of the computed speed normalized jerk energy for a current journey number and an immediate preceding journey number can be denoted as: delPcurrent = p(Xcurrent) – p(Xcurrent - 1).
[0028] Hence the vehicle maintenance indicator can be denoted as ‘T’, where:

[0029] In an embodiment, for scheduling vehicle maintenance the computed vehicle maintenance indicator has to be greater than a pre-determined threshold. The pre-determined threshold can be denoted a Tthreshold, wherein if T > Tthreshold, then a flag 1 is raised to indicate that maintenance required. If T < Tthreshold the flag 0 is raised to indicate that maintenance not required. In an embodiment, the Tthreshold value is pre-determined to be 2 for maintenance suggestion. In another embodiment, the Tthreshold value is pre-determined to be 3 for indicating a major breakdown warning of the vehicle. In accordance with the present disclosure, the value of Tthreshold is a configurable parameter. Once maintenance warning is given the system will continue to stay in maintenance required mode. It is required to reset the system once maintenance is done on the vehicle. In yet another embodiment, the driver of the vehicle is given a maintenance warning as well as an alert stating that the journey was rough enough to hasten breakdown of the vehicle.
[0030] In an embodiment, the system 100 can be associated with a vehicle identification number for identifying the vehicle for which automatic vehicle maintenance is to be scheduled.
[0031] The methods and systems of the present disclosure provide a minimal sensor based approach for progressive degradation of a vehicle. This system is a standalone application which uses on-board diagnostic (OBD) or a dedicated device attached to a vehicle. The sensor as well as computational platform is the same as the OBD or dedicated device. The driver of the vehicle can receive an automatic suggestion if the degradation state of the vehicle becomes alarming. The driver of the vehicle receives an indication of initial or first level maintenance requirement of the vehicle. The methods and systems of the present disclosure provide for a minimal generation of false alarms. The methods and systems disclosed herein is applicable to large fleet management and can be implemented easily without much additional hardware or software investments. The maintenance warning is received at an early point of time for the vehicle, depending on the number of trips so that an early action may be taken on maintaining the vehicle. The driver is given a maintenance warning and also an alert that the journey was rough enough that will hasten the breakdown of the vehicle.
[0032] The written description describes the subject matter herein to enable any person skilled in the art to make and use the embodiments of the invention. The scope of the subject matter embodiments defined here may include other modifications that occur to those skilled in the art. Such other modifications are intended to be within the scope if they have similar elements that do not differ from the literal language of the claims or if they include equivalent elements with insubstantial differences from the literal language.
[0033] It is, however to be understood that the scope of the protection is extended to such a program and in addition to a computer-readable means having a message therein; such computer-readable storage means contain program-code means for implementation of one or more steps of the method, when the program runs on a server or mobile device or any suitable programmable device. The hardware device can be any kind of device which can be programmed including e.g. any kind of computer like a server or a personal computer, or the like, or any combination thereof. The device may also include means which could be e.g. hardware means like e.g. an application-specific integrated circuit (ASIC), a field-programmable gate array (FPGA), or a combination of hardware and software means, e.g. an ASIC and an FPGA, or at least one microprocessor and at least one memory with software modules located therein. Thus, the means can include both hardware means and software means. The method embodiments described herein could be implemented in hardware and software. The device may also include software means. Alternatively, the invention may be implemented on different hardware devices, e.g. using a plurality of CPUs.
[0034] The embodiments herein can comprise hardware and software elements. The embodiments that are implemented in software include but are not limited to, firmware, resident software, microcode, etc. The functions performed by various modules comprising the system of the present disclosure and described herein may be implemented in other modules or combinations of other modules. For the purposes of this description, a computer-usable or computer readable medium can be any apparatus that can comprise, store, communicate, propagate, or transport the program for use by or in connection with the instruction execution system, apparatus, or device. The various modules described herein may be implemented as either software and/or hardware modules and may be stored in any type of non-transitory computer readable medium or other storage device. Some non-limiting examples of non-transitory computer-readable media include CDs, DVDs, BLU-RAY, flash memory, and hard disk drives.
[0035] A data processing system suitable for storing and/or executing program code will include at least one processor coupled directly or indirectly to memory elements through a system bus. The memory elements can include local memory employed during actual execution of the program code, bulk storage, and cache memories which provide temporary storage of at least some program code in order to reduce the number of times code must be retrieved from bulk storage during execution.
[0036] Further, although process steps, method steps, techniques or the like may be described in a sequential order, such processes, methods and techniques may be configured to work in alternate orders. In other words, any sequence or order of steps that may be described does not necessarily indicate a requirement that the steps be performed in that order. The steps of processes described herein may be performed in any order practical. Further, some steps may be performed simultaneously.
[0037] The preceding description has been presented with reference to various embodiments. Persons having ordinary skill in the art and technology to which this application pertains will appreciate that alterations and changes in the described structures and methods of operation can be practiced without meaningfully departing from the principle, spirit and scope.