Location and event capture circuitry to facilitate remote vehicle location predictive modeling when global positioning is unavailable

Information

  • Patent Grant
  • 10223744
  • Patent Number
    10,223,744
  • Date Filed
    Monday, April 11, 2016
    8 years ago
  • Date Issued
    Tuesday, March 5, 2019
    5 years ago
Abstract
Disclosed are a device and/or a method of location and event capture circuitry to facilitate remote vehicle location predictive modeling when global positioning is unavailable. In one embodiment, a predictive circuit of a vehicle includes event detection circuitry to initiate a timer circuit of the vehicle when a wheel of the vehicle is in a stationary state beyond threshold amount of time during an event; an event categorization circuitry to monitor a telemetry data of the vehicle to assign a category to the event; a data communication circuitry to communicate the event, the category, and/or a set of other events and categories to a predictive recommendation server on a periodic basis; and a repossession detection circuitry to determine that the vehicle is pending repossession based on the event, the category, the set of other events and categories, and/or a message communicated from the predictive recommendation server to the predictive circuit.
Description
FIELD OF TECHNOLOGY

This disclosure relates generally to automotive technology and, more particularly, to a method, a device and/or a system of location and event capture circuitry to facilitate remote vehicle location predictive modeling when global positioning is unavailable.


BACKGROUND

A borrower and a lender may enter into an agreement wherein the borrower may purchase or lease a vehicle which they make payments on over a period of time. When a borrower defaults on their payments, the lender may eventually be left with no other option but repossession. Once this point has been reached, it is in the best interest of the lender to repossess the vehicle as quickly as possible, to prevent costs associated with damage to the vehicle. In many cases, by the time repossession is being considered, the lender has spent time negotiating with the borrower. This may give the borrower time to locate and disable any sort of tracking device which the lender may rely on to locate the vehicle. This may complicate locating the vehicle for repossession.


A further complication stems from the fact that repossession may be extremely difficult, if not impossible, in certain circumstances, such as when the car is in a locked garage or the secured parking lot of an employer. Not only does the repossessor have to locate the vehicle, they must locate the vehicle at a time when it is obtainable. Additionally, vehicle repossession may be a very emotionally charged situation. An ideal scenario for repossessing a vehicle is one where the borrower is unaware of the repossession, or at the very least is in an environment which may inhibit a confrontation.


SUMMARY

Disclosed are a method, a device and/or a system of location and event capture circuitry to facilitate remote vehicle location predictive modeling when global positioning is unavailable.


In one aspect, a predictive circuit of a vehicle includes an event detection circuitry to initiate a timer circuit of the vehicle when a wheel of the vehicle is in a stationary state beyond a threshold amount of time during an event; an event categorization circuitry to monitor a telemetry data of the vehicle to assign a category to the event; a data communication circuitry to communicate the event, the category, and a set of other events and categories to a predictive recommendation server on a periodic basis; and a repossession detection circuitry to determine that the vehicle is pending repossession based on the event, the category, the set of other events and categories, and/or a message communicated from the predictive recommendation server to the predictive circuit.


The event may be associated with a time of day, a day of a week, a calendar day, and/or an event type (e.g., by the predictive circuit and/or the predictive recommendation server). The event type may be a home location, a work location, a day location, an evening location, a weekend location, a night location, and/or a holiday location. A location of the vehicle may be determined through a triangulation algorithm of the data communication circuitry of the predictive circuit, and/or a mobile device associated with a user of the vehicle. The user of the vehicle may be identified as a primary user of the vehicle, and/or a secondary user of the vehicle. The triangulation algorithm may be applied to the mobile device when the mobile device is paired with the vehicle through a short range communication algorithm. The mobile device may be detected using the predictive circuit to have a latitudinal and longitudinal location change with nearby cellular towers in a pattern consistent with a movement of the vehicle. The short range communication algorithm may be Bluetooth®, BLE®, Zigbee®, and/or another personal area network (PAN).


The telemetry data may be determined based on an engine motor status, an accelerator status, a time of pause, a brake status, a park status, an occupant sensor status, a door status, a window status, a hood status, a truck status, a tailgate status, an in-car entertainment system status, an air-conditioning status, an in-car electronic system status, a neutral status and/or an other car status. The predictive circuit and the predictive recommendation server may generate a statistical probability matrix of a set of predictive potential locations of the vehicle as a function of time based on an analysis of historical data.


The predictive circuit and/or the predictive recommendation server may generate a stop report and/or a drive report. The predictive circuit and/or the predictive recommendation server may determine an accuracy of the statistical probability matrix. An artificial intelligence algorithm may be applied when generating the statistical probability matrix. The periodic basis may be 25 hours to enable an hourly cycling of the event and the set of other events from the data communication circuitry to the predictive recommendation server. The event data and the set of other events may be transmitted in real time, an active period, and/or a batch mode from a locally stored cache storing event data since a previous transmittal to the predictive recommendation server.


In other aspect, a method of predictive circuit of a vehicle includes initiating a timer circuit of the vehicle when a wheel of the vehicle is in a stationary state beyond a threshold amount of time during an event using a processor and a memory of an event detection circuitry; monitoring a telemetry data of the vehicle to assign a category to the event using an event categorization circuitry; communicating the event, the category, and a set of other events and categories to a predictive recommendation server on a periodic basis using a data communication circuitry; and determining using a repossession detection circuitry that the vehicle is pending repossession based on the event, the category, the set of other events and categories, and/or a message communicated from the predictive recommendation server to the predictive circuit.


In yet other aspect, a predictive circuit of a vehicle includes an event detection circuitry to initiate a timer circuit of the vehicle when a wheel of the vehicle is in a stationary state beyond a threshold amount of time during an event; an event categorization circuitry to monitor a telemetry data of the vehicle to assign a category to the event; a data communication circuitry to communicate the event, the category, and a set of other events and categories to a predictive recommendation server on a periodic basis; and a repossession detection circuitry to determine that the vehicle is pending repossession based on the event, the category, the set of other events and categories, and/or a message communicated from the predictive recommendation server to the predictive circuit.


The predictive circuit stops the timer circuit when the wheel of the vehicle changes to a rotating state when the vehicle is in motion in this yet another aspect. The timer circuit may calculate a total time to stop. The total time can be associated with the event in this yet another embodiment.


The method, apparatus, and system disclosed herein may be implemented in any means for achieving various aspects, and may be executed in a form of a non-transitory machine-readable medium embodying a set of instructions that, when executed by a machine, cause the machine to perform any of the operations disclosed herein. Other features will be apparent from the accompanying drawings and from the detailed description that follows.





BRIEF DESCRIPTION OF THE DRAWINGS

The embodiments of this invention are illustrated by way of example and not limitation in the Figures of the accompanying drawings, in which like references indicate similar elements and in which:



FIG. 1 is a network view illustrating a predictive recommendation server receiving data from a variety of sources to predict the location of a target vehicle, according to one embodiment.



FIG. 2 is a map view of the location data of FIG. 1, according to one embodiment.



FIG. 3 is a process flow diagram of the predictive recommendation server of FIG. 1, according to one embodiment.



FIG. 4 is a process flow diagram of the predictive model of FIG. 3, according to one embodiment.



FIG. 5 is a user interface view illustrating the presentation of the list of recommended destination zones and times of FIG. 1, according to one embodiment.



FIG. 6 is a user interface view of the predictive timeline of FIG. 5, according to one embodiment.



FIG. 7 is a user interface view of the filter of FIG. 5, according to one embodiment.



FIG. 8 is a schematic diagram of exemplary data processing devices that can be used to implement the methods and systems disclosed herein, according to one embodiment.



FIG. 9 is an event view that illustrates the vehicle at a sample event in which the vehicle is at a stop sign.



FIG. 10 is an exploded view of the predictive circuit of FIG. 9. In FIG. 10, various circuits that enable various embodiments described herein are implemented through a combination of hardware and/or software circuitry.





Other features of the present embodiments will be apparent from the accompanying drawings and from the detailed description that follows.


DETAILED DESCRIPTION

Example embodiments, as described below, may be used to provide a system, method, and/or apparatus of location and event capture circuitry to facilitate remote vehicle location predictive modeling when global positioning is unavailable.


In one embodiment, a repossession recommendation system includes a predictive recommendation server 100, which may itself include a processor 120, a memory 122, and a database 121. The repossession recommendation system also includes a network 102. The predictive recommendation server 100 may be configured to collect a set of location data 112 for a target vehicle 106 associated with a borrower 108, create a plurality of destination zones 202, and determine a geographic boundary 204 of each of the plurality of destination zones 202. The predictive recommendation server 100 may further be configured to group a set of visits 200 within each destination zone 202, determine a frequency of visits for each destination zone 202, and collect a set of non-tracking data 114.


The predictive recommendation server 100 may run a predictive model, and present to a repossessor 104 a list of recommended destination zones and times 103 to repossess the target vehicle 106. The set of location data 112 and the set of non-tracking data 114 may be collected from a tracking device 110, a commercial data server 124, a government data server 126, a social media server 128, a lender server 130, and/or a law enforcement server 132. The tracking device 110 may include a cellular modem 116, a GPS receiver 118, a processor 120 and/or a memory 122.


In another embodiment, a method of a predictive recommendation server 100 includes collecting a set of location data 112 for a target vehicle 106, creating a plurality of destination zones 202, determining a geographic boundary 204 of each of the plurality of destination zones 202, and grouping a set of visits 200 within each destination zone 202. The method further includes determining a frequency of visits for each destination zone 202, collecting a set of non-tracking data 114, and running a predictive model. Finally, the method includes presenting to a repossessor 104 a list of recommended destination zones and times 103 to repossess the target vehicle 106.


Running the predictive model may include determining a set of relevant input data for the predictive model, standardizing and/or removing incomplete data, and identifying a set of baseline control data. Running the predictive model may also include generating prediction scores associated with each baseline location, time, and/or day by detecting patterns within the baseline control data, comparing vehicle locations predicted by the detected patterns with a set of baseline control locations, and selecting a best predictive pattern for the target vehicle 106.


Running the predictive model may further include incorporating a set of supplemental location data 112 and/or non-tracking data 114, generating prediction scores for each destination zone, time, and/or day, and comparing prediction scores for each destination zone, time, and/or day. Finally, running the predictive model may include generating a set of recommendations for the best time and/or days to repossess within each destination zone, generating a set of recommendations for the best destination zones to repossess the target vehicle 106 for a particular time and/or a particular day, and generating the list of recommended destination zones and/or times to repossess the target vehicle 106.



FIG. 1 is a network view 150 illustrating a predictive recommendation server 100 receiving data from a variety of sources to predict the location of a target vehicle 106, according to one embodiment. Particularly, FIG. 1 illustrates a predictive recommendation server 100, a network 102, a list of recommended destination zones and times 103, a repossessor 104, a target vehicle 106, a borrower 108, a tracking device 110, a set of location data 112, a set of non-tracking data 114, a cellular modem 116, a GPS receiver 118, a processor 120, a database 121, a memory 122, a commercial data server 124, a government data server 126, a social media server 128, a lender server 130, and a law enforcement server 132.


The predictive recommendation server 100 may be a computer or computer program which may manage access to the predicted locations of vehicles needing to be repossessed, and/or recommended locations, days of the week, and/or time of day which represent optimal conditions of repossession for a target vehicle 106. In the context of the present description, optimal conditions for repossession may refer to conditions most conducive to a successful repossession of a vehicle, maximizing efficiency and minimizing the likelihood of confrontation or conflict with the borrower 108.


In the context of the present description, a server (e.g., the predictive recommendation server 100, the commercial data server 124, the government data server 126, the social media server 128, the lender server 130, the law enforcement server 132, etc.) may implemented in one of a variety of environments. For example, in one embodiment, a server may exist as a discrete set of physical computers. In another embodiment, a server may be a cloud-based service. In still another embodiment, a server may exist as a virtual machine, running on dedicated hardware or within a shared multi-tenant environment.


The network 102 may be a system of interconnected computers configured to communicate with each other (e.g., the internet, etc.). The list of recommended destination zones and times 103 to repossess the target vehicle 106 may be a list of locations (e.g. specific locations, a bounded geographic area, etc.) and times which are predicted to provide optimal conditions for repossessing the target vehicle 106.


The repossessor 104 may be a person, company, or other entity with an interest in repossessing an item (e.g., the target vehicle 106, etc.) when a borrower 108 defaults on payments. In one embodiment, the repossessor 104 may be a dispatcher of a towing company. In another embodiment, the repossessor 104 may be a tow truck operator. In yet another embodiment, the repossessor 104 may be the lender, who may direct another individual or entity to repossess the target vehicle 106.


The target vehicle 106 may be a vehicle which has been selected for repossession. The borrower 108 may be an individual or entity which owes a debt to another entity, a debt which was incurred to purchase a vehicle. The tracking device 110 may be a device which may determine it's own location (e.g., using a GPS receiver 118, detecting wireless networks, etc.) and report it's own location to a server (e.g. using a cellular modem 116). In some embodiments, the tracking device 110 may be attached to the target vehicle 106 by a third party (e.g., a lender, a car dealer, an auto insurance provider, etc.). In other embodiments, the tracking device 110 may be incorporated within the vehicle by the vehicle manufacturer.


The set of location data 112 may be a set of data which describes the location of a target vehicle 106 over a period of time. In one embodiment, the set of location data 112 may be a collection of coordinate pairs describing the location of a target vehicle 106 at different points in time. In some embodiments, the set of location data 112 may be limited to a geographic location and a time. In other embodiments, the set of location data 112 may further comprise a speed, indicating whether the vehicle was in motion when the location entry was determined and recorded. According to various embodiments, the set of location data 112 may be obtained from a variety of sources including, but not limited to, a tracking device 110, a commercial data server 124, a government data server 126, a social media server 128, a lender server 130, and/or a law enforcement server 132.


The set of non-tracking data 114 may be a set of data which has at least a partial association with the operation of the target vehicle 106, yet does not indicate a specific location of the target vehicle 106. The non-tracking data 114 may be used to help determine the likelihood of a successful repossession at a particular location, according to one embodiment. For example, the nature of the parking at a location (e.g., street, driveway, garage, parking structure, gated lot, etc.) may raise or lower the chance that a target vehicle 106 could be successfully repossessed. In another embodiment, the non-tracking data 114 may be used by a predictive model to help identify patterns in the operation of the vehicle (e.g., when certain weather conditions are present, the vehicle is likely to be found near a particular beach, etc.). According to various embodiments, the set of non-tracking data 114 may be obtained from a variety of sources including, but not limited to a commercial data server 124, a government data server 126, a social media server 128, a lender server 130, and/or a law enforcement server 132.


The cellular modem 116 may be device which is able to transmit and/or receive digital information by modulating and demodulating signals transmitted over a cellular network. The GPS receiver 118 may be a device which may receive signals from one or more GPS satellites, thereby determining the geographical location of the GPS receiver 118. The processor 120 may be a central processing unit capable of executing a program. The database 121 may be an organized collection of data held in a computer. The memory 122 may be the part of a computer in which data and/or programming instructions (e.g., executables, etc.) are stored.


The commercial data server 124 may be a computer server operated by a commercial entity. In various embodiments, the commercial data server 124 may provide location data 112. For example, in one embodiment, a commercial data server 124 (e.g., a server maintained by a car manufacturer who has installed a tracking device 110 at the time of manufacture, a server provided by a third-party roadside assistance service such as OnStar, a server operated by auto insurance agency, a server provided by a fleet management company, a server associated with a mobile application which is running on a mobile device associated with the borrower 108, etc.) may provide data which identifies the location of the target vehicle 106, as determined by a GPS receiver 118 or other geolocation technology.


In other embodiments, the commercial data server 124 may provide non-tracking data 114. For example, in one embodiment, a commercial data server 124 may provide information including, but not limited to, results of previous repossession attempts (e.g., attempts made for that particular vehicle, attempts made by a particular firm, attempts made in a particular geographic area, etc.), the geographic location of the repossessor 104 and/or their agents (e.g., tow yards, tow trucks, etc.), map data, point of interest data (e.g., enabling the identification of a cluster of previous visits to an area as visits to a shopping mall, etc.), business listings, white-page directories, and/or weather reports (e.g., enabling the identification of weather-related patterns in the location of the vehicle, etc.).


In another embodiment, a commercial data server 124 may provide satellite imagery, which may be analyzed to determine the viability of a particular location for repossession. As a specific example, a commercial data server 124 may provide satellite imagery for the area near a borrower's home. An analysis performed manually (e.g., using human judgment, etc.) or programmatically (e.g., using machine vision algorithms, etc.) may identify that the borrower 108 does not have a garage, and must therefore park the target vehicle 106 on the street.


The government data server 126 may be a computer server operated by a government entity. In various embodiments, the government data server 126 may provide location data 112. For example, in one embodiment, the government data server 126 may provide information which may be used to identify previous locations of the target vehicle 106, which may then be used to identify patterns. Examples of such information may include, but are not limited to, recorded use of toll roads, parking lot cameras, and/or other license plate recognition data.


In other embodiments, the government data server 126 may provide non-tracking data 114. For example, in one embodiment, the government data server 126 may provide real-time traffic conditions and/or construction alerts, which may modify the behavior patterns identified in historical data. In another embodiment, the government data may identify the zoning type of different geographic areas, which may allow certain inferences to be made when identifying patterns.


The social media server 128 may be a computer server which enables user communication within a social network. In various embodiments, the social media server 128 may provide location data 112. Examples of such data include, but are not limited to, check-ins (e.g., Yelp, Foursquare, Waze, etc.), geotagged postings (e.g., posts to social networks which are tagged with locations, etc.), and/or reviews (e.g., reviews of specific businesses such as restaurants, etc.) In other embodiments, the social media server 128 may provide non-tracking data 114. For example, in one embodiment, a social networked traffic service (e.g., Waze, etc.) may provide real-time traffic conditions.


The lender server 130 may be a computer server operated by a lender. In various embodiments, the lender and/or their server may be a source of location data 112 (e.g., data received from a tracking device 110 required by the terms of a loan or lease, etc.) and/or non-tracking data 114 (e.g., information about the borrower 108, vehicle title history, etc.). As a specific example, a lender server 130 may provide information regarding the borrower's residence, place of employment, and nearby family members.


The law enforcement data server 132 may be a computer server operated by a law enforcement agency. In various embodiments, the law enforcement data server 132 may be a source of location data 112, identifying specific locations the vehicle has been at in the past. Examples of such data include, but are not limited to, parking tickets, traffic violations, and/or license plate recognition data.


In other embodiments, the law enforcement data server 132 may provide non-tracking data 114 which may be used to modify previously observed patterns to account for current events, or help identify optimal repossession locations and times. This non-tracking data 114 may include, but is not limited to, dispatch alerts and/or location crime indices.


As shown in FIG. 1, the predictive recommendation server 100 is communicatively coupled with the commercial data server 124, the government data server 126, the social media server 128, the lender server 130, and the law enforcement server 132 through the network 102. In some embodiments, the predictive recommendation server 100 may be communicatively coupled to the tracking device 110 within the target vehicle 106. In other embodiments, the predictive recommendation server 100 may receive location data 112 resolved by a tracking device 110 within the target vehicle 106 via a commercial data server 124 (e.g., a third party receives the location data 112 directly from the tracking device 110 and then makes it available to the predictive recommendation server 100, etc.).



FIG. 1 illustrates a communicative coupling between the predictive recommendation server 100 and a computing device associated with the repossessor 104. In some embodiments, the predictive recommendation server 100 may communicate with the repossessor 104 through a web interface or portal. In other embodiments, the predictive recommendation server 100 may communicate with the repossessor 104 through an application specific to the purpose of locating vehicles. As an option, a repossessor 104 or their agent may interact with the predictive recommendation server 100 through a mobile application on a smartphone (e.g., a tow truck driver may obtain routing information from the application while away from the tow yard, etc.).


A borrower 108 may enter into an agreement with a lender, allowing them to obtain a vehicle in exchange for agreeing to make payments over a period of time. The borrower 108 may also agree to allow the lender to monitor the location of the vehicle, perhaps even installing a tracking device 110 which reports the location of the vehicle. In one embodiment, the tracking device 110 may determine the location of the vehicle and report to a server or database on a regular schedule. As an option, the schedule may be designed to minimize the bandwidth needed to report the location data 112; the schedule may also rotate, observing the location at a different time each day.


In another embodiment, the tracking device 110 may determine and report the location upon the occurrence of one or more triggering events. One example of a triggering event is when the transmission of the target vehicle 106 is placed into park. Another example may be when an accelerometer on the tracking device 110 determines that the vehicle has stopped moving. Yet another example is when the ignition of the target vehicle 106 is turned off and/or the key is removed.


As shown in FIG. 1, the predictive recommendation server 100 collects location data 112 and non-tracking data 114 from one or more sources through the network 102. Using a predictive model, the predictive recommendation server 100 generates a list 103 of recommended destination zones 202 or specific locations, as well as times of day and days of the week, which may be optimal for the repossession of the target vehicle 106. This information (e.g., list, etc.) is provided to the repossessor, who may use it to repossess the target vehicle 106 in an efficient and safe manner.


In some embodiments, the predictive recommendation server 100 may generate a list of the best places, times, and days for a repossession attempt (e.g., the server will make the best of a bad situation and provide a list of the best scenarios, even if all discernable scenarios are less than ideal). In other embodiments, the predictive recommendation server 100 may indicate that it is unable to identify a location, time, and/or day which meets the requirements specified by the repossessor 104. As an option, a repossessor 104 may instruct the predictive recommendation server 100 to continue monitoring location data 112 and non-tracking data 114 associated with a target vehicle 106 and update the predictive model; if a location/time/day is subsequently identified which meets the criteria specified by the repossessor, the predictive recommendation server 100 may notify the repossessor 104.



FIG. 2 is a map 502 view of the location data 112 of FIG. 1, according to one embodiment. Particularly, FIG. 2 illustrates a visit 200, a destination zone 202, and a geographic boundary 204. The visit 200 may be a location which may be inferred as an intended destination of the target vehicle 106. The destination zone 202 may be an area in which the target vehicle 106 has been observed one or more times. Using destination zones 202, rather than a large set of discrete points, may allow certain inferences to be made (e.g., the borrower 108 goes shopping on certain days, etc.) when identifying patterns. The geographic boundary 204 may be the bounds defined for a destination zone 202 which groups visits 200 with a certain level of correlation.


The use of destination zones 202 may streamline the process of detecting patterns in the observed locations of the target vehicle 106. For example, if a borrower 108 makes frequent visits 200 to the nearby shopping mall, there may be numerous visits 200 detected which are scattered throughout a large parking garage next to the mall. These visits 200 are simply instances where the borrower 108 parked the target vehicle 106 in different locations while performing the same activity (i.e., going to the mall). Grouping all of these visits 200 into a single destination zone 202 means that the predictive model only needs to be applied to the zone, rather than each individual visit. As the sophistication of the predictive model increases, the size of destination zones 202 may be reduced. In other words, with increased sophistication and/or the consideration of additional location 112 and non-tracking data 114, the model may be able to predict where within the mall parking garage the target vehicle 106 is likely to be located.


In one embodiment, the geographic boundary 204 of one destination zone 202 may overlap with the geographic boundary 204 of another destination zone 202. In such a case, the time, day, and/or context of a visit 200 may be used to determine which of the two overlapping destination zones 202 the visit 200 should be grouped with. As a specific example, destination zones 202 for a secured parking garage and unsecured street parking may have overlapping geographic boundaries 204. However, it may be observed that if the borrower 108 is arriving at that location after a certain time, the garage will be full and street parking will be used, allowing the visit 200 to be grouped with the appropriate destination zone 202.



FIG. 3 is a process flow diagram of the predictive recommendation server 100 of FIG. 1, according to one embodiment. In operation 302, location data 112 for the target vehicle 106 may be collected. In operation 304, destination zones 202 may be created. In one embodiment, destination zones 202 may have overlapping geographic boundaries 204, yet may be distinct in other dimensions such as time of day or day of the week. For example, a borrower 108 may park on the street in some cases, and in a locked garage a few yards away in others, depending on variables such as time of day or whether it is the weekend or not.


In operation 306, geographic boundaries 204 of destination zones 202 may be determined. In one embodiment, the geographic boundaries 204 of destination zones 202 may be modified in an iterative process, such that the predictive model is optimized. This may be accomplished using a variety of computational simulation methods, such as genetic algorithms or simulated annealing. As a simplified example, a set of geographic boundaries 204 may be defined, and a prediction score may be calculated for a set of baseline control data. Then, the geographic boundaries (and any other parameter of the model) may be perturbed in some way, and the prediction score recalculated. If the score improves, the change may be kept. The process may be repeated until no further improvements are obtained.


In other embodiments, the geographic boundaries 204 may be defined using information regarding the surrounding point of interest (e.g., business listings, addresses of parking garages, machine vision analysis of satellite images, etc.) and a statistical analysis of location data 112 associated with the target vehicle 106. In operation 308, a set of visits 200 may be grouped within the destination zones 202.


In operation 310, a frequency of visits for each destination zone 202 may be determined. In the context of the present description, the frequency of visits for each destination zone 202 may be how often the target vehicle 106 is found within a destination zone 202 within a particular period of time. In determining the frequency of visits for each destination zone 202, the relevance of the destination zones 202 with respect to the predictive model may be estimated.


In operation 312, non-tracking data 114 may be collected. Non-tracking data 114 may provide additional dimensions of information through which patterns may be detected, patterns which may be used to predict future locations of the target vehicle 106.


In operation 314, a predictive model may be run. The predictive model may be a methodology used to detect patterns in the location of the target vehicle 106 and, based on those patterns, assign probabilities to potential future locations, according to one embodiment. In some embodiments, the predictive model may be calibrated and optimized using techniques such as genetic algorithms, Monte Carlo simulation, simulated annealing, and/or any other computational optimization methodology.


Finally, in operation 316, a list of recommended destination zones and times 103 to repossess the target vehicle 106 may be presented to the repossessor 104.



FIG. 4 is a process flow diagram of the predictive model of FIG. 3, according to one embodiment. In operation 402, it may be determined what input data is relevant for the predictive model. In the context of the present description, the set of relevant input data may refer to a set of data which has been determined to be relevant to a consideration of the location of the target vehicle 106.


In certain circumstances, some collected data may be given less weight than other data. For example, in one embodiment, if it is known that the borrower 108 is unemployed and may be searching for a job, observations of the target vehicle 106 at various businesses may be given less weight than similar observations for someone who is employed (e.g., in that case, those observations may lead to a usable pattern, etc.). Another example may be that data obtained from the borrower's social network posts may be given more weight if it is determined that they are consistently posting their location.


In some embodiments, data deemed below a threshold relevancy may be removed from consideration. In other embodiments, a weight may be assigned to each type and/or item of data. The weight may reflect the degree of relevance to the prediction of future locations of the target vehicle 106.


In operation 404, the input data may be standardized and incomplete data may be removed. In some embodiments, the standardization of data may include placing all data in a similar format. For example, a tracking device 110 may provide latitude and longitude coordinates, while records of parking tickets may provide a less specific location in the form of the intersection of two nearby streets.


In the context of the present description, incomplete data may refer to location data 112 and/or non-tracking data 114 which is not usable. For example, depending on the sampling rate, there may be pieces of location data 112 where it is not clear whether the vehicle was stationary (e.g., a visit 200) or moving (e.g., en route to a potential destination zone 202, etc.). As another example, some social media posts may contain useful information regarding the behavior patterns of the borrower 108, while other posts may be incomplete, as they lack sufficient context or other information to warrant being considered when seeking patterns.


In operation 406, a set of baseline control data may be identified. The set of baseline control data may be a set of data which may be used to calibrate a predictive model. For example, in one embodiment, historical data may be used as baseline control data, such that patterns observed within the historical data may be validated based upon the degree which they are able to predict subsequent, though still historical, visits of the target vehicle 106.


In operation 408, prediction scores associated with each baseline location, time, and day may be generated by detecting patterns within the baseline control data, according to one embodiment. The detected patterns may be a regular and intelligible sequence discernible in the observed and/or inferred locations of a target vehicle 106 and/or the behavior of a borrower 108. The prediction score may be a numerical value which indicates the degree of reliability with which a particular prediction methodology and/or detected pattern may indicate future locations of the target vehicle 106.


In operation 410, the vehicle locations predicted by the detected patterns may be compared with baseline control locations. The set of baseline control locations may be a set of destination zones 202 associated with a set of baseline control data. In some embodiments, the results of this comparison may determine whether the predictive model needs to be modified and the baseline control data reevaluated. Specifically, the predictive model may be refined and optimized using an iterative process whereby one or more aspects of the model (e.g., weight given to some types or items of data, definition of destination zones, what non-tracking data is relevant, etc.) are modified; the value of this modification may be determined by comparing the resulting predictions with the baseline control locations. The process may be repeated until no further improvements are obtained after a predefined number of attempts.


In operation 412, the best predictive pattern for the target vehicle 106 may be selected. The best predictive pattern for the target vehicle 106 may be a pattern which may be used to predict the location of the target vehicle 106 in a particular set of circumstances. Sometimes the most accurate pattern may not be the best pattern. As a specific example, a pattern in the vehicle location may be detected which shows when the vehicle will be parked on the street near the borrower's place of employment with a high degree of predictability. However, this pattern may not be the best predictive pattern if the borrower 108 has been laid off; in such a case, another pattern (e.g., periodic travel to visit family, shopping, recreation, etc.) with less predictability may be the best.


In operation 414, supplemental location 112 and non-tracking data 114 may be considered and factored into the prediction. The set of supplemental location 112 and non-tracking data 114 may be data which may be considered when applying the predictive model to current circumstances. As a specific example, in the scenario where a pattern has been detected that indicates that on days of heavy traffic, a borrower 108 will park their car on the street north of their place of employment, and on days of light traffic they will park in a garage on the south side of their place of employment, supplemental traffic data for the present day may be used to identify a probable location of the vehicle, according to one embodiment.


Supplemental location 112 and/or non-tracking data 114 may be used to identify which of a number of detected patterns a borrower 108 is following on a given day; these patterns may depend on a number of variables which may be dynamic and hard to foresee. Supplemental location 112 and/or non-tracking data 114 may be data obtained in real-time, according to one embodiment.


In operation 416, prediction scores for each destination zone, time, and day may be generated. In operation 418, the prediction scores for each destination zone, time, and day may be compared. In comparing the prediction scores, one or more ideal repossession scenarios may be identified.


In operation 420, recommendations for the best time/day to repossess may be generated for each destination zone. The set of recommendations for the best time and days to repossess within each destination zone 202 may be a set of times of day and/or days of the week at which repossession may be optimal, within a given destination zone.


In operation 422, recommendations for the best locations to repossess at a particular time or day may be generated. The set of recommendations for the best locations to repossess the target vehicle 106 for at least one of a particular time and a particular day may be a set of locations which, for a specified time of day and/or day of the week, represent the locations which would be optimal for a repossession attempt.


A location may be optimal for a repossession if there is a reduced likelihood of confrontation with the borrower 108 (e.g. borrower 108 unlikely to interrupt the repossession, a scenario less socially embarrassing to the borrower 108, etc.) and/or if the repossession may be performed efficiently (e.g. the vehicle is easily accessible for a particular method of repossession, etc.). A location may be considered less than optimal for a repossession if obstacles to success are detected using non-tracking data (e.g. the location is identified as a secured and inaccessible storage garage, the location or the route to the location is inaccessible due to adverse weather and/or road construction, etc.)


In some embodiments, the recommendations may be limited to specifying a destination zone 202, leaving it to a human (e.g. tow truck driver, etc.) to locate the target vehicle 106 within the destination zone 202. In other embodiments, the recommendation may be as specific as the data allows. Finally, in operation 424, the list of recommended destination zones and times 103 to repossess target vehicle 106 may be generated.



FIG. 5 is a user interface view 550 illustrating the presentation of the list of recommended destination zones and times 103 of FIG. 1, according to one embodiment. Particularly, FIG. 5 illustrates a predictive timeline 500, a map 502, a filter 504, and real-time options 506, in addition to the list of recommended destination zones and times 103 of FIG. 1, and the destination zone 202 of FIG. 2.


A repossessor 104 may utilize user interface view 550 to plan the repossession of the target vehicle 106. The predictive timeline 500 shows the best destination zones 202 for repossession within a defined range of time. For example, FIG. 5 shows a predictive timeline 500 for Mondays, between 12:00 AM and 11:59 PM. As an option, the predictive timeline 500 may utilize graphics which indicate the confidence level of finding the target vehicle 106 at that location/time/day (e.g. the size of the data point, etc.). See, for example, the predictive timeline 500 of FIG. 6.


User interface view 550 includes the list of recommended destination zones and times 103 of FIG. 1. As shown, the list may be organized by destination zones 202, with each entry showing recommended times for repossession, in accordance with one embodiment. As an option, the list may include a ‘Details’ button, which may provide the repossessor 104 with additional information. Examples of this additional information include, but are not limited to, satellite photos of the location, links to third party images of the location (e.g. Google Street View, etc.), and details as to why this location is being recommended (e.g. visit frequency, recognized association with the borrower such as ‘place of employment’ or ‘residence’, proximity to tow yard, type of parking, etc.).


The map 502 may display the destination zones 202 described by the predictive timeline 500 and/or the list of recommended destination zones and times 103, in accordance with one embodiment. As an option, if the repossessor 104 places a cursor over an entry in the list 103 or the timeline 500, the associated destination zone 202 may be highlighted in the map 502. In another embodiment, the map 502 may display the current location of the target vehicle 106, as well as other up-to-date information such as traffic, or the location of agents of the repossessor (e.g. tow trucks, etc.). In one embodiment, the map 502 may be overlaid with a heat map displaying probabilities of successfully repossessing the target vehicle 106 for a specified range of days and/or times. As an option, the repossessor 104 may be able to view the heat map change as they scroll through the temporal range they have specified, allowing them to quickly identify an ideal repossession scenario.


User interface view 550 may also allow the repossessor 104 one or more real-time options 506, in accordance with various embodiments. For example, in one embodiment, the current location of the target vehicle 106 may be displayed on the map 502, as determined by a tracking device 110. The repossessor 104 may have the option of defining a geographic boundary (e.g. a geo-fence, etc.) which, when crossed by the target vehicle 106, notifies the repossessor 104 (e.g. within user interface 550, a text message, email, etc.). As an option, the repossessor 104 may be notified if there are signs that the tracking device 110 has been tampered with or disabled (e.g. loss of signal, continued reports from the device which drastically deviate from previous observations, activation of tampering sensors within the device, etc.).


Finally, user interface view 550 may also include a filter 504, in accordance with one embodiment. The filter 504 may allow the repossessor 104 to define the criteria required for a successful repossession. The filter 504 is discussed further in conjunction with FIG. 7.


In some embodiments, the repossessor 104 may also utilize user interface view 550 to dispatch their agents to repossess a particular target vehicle 106. As a specific example, a repossessor 104 may select an entry in the list 103 or a data point 600 in the timeline 500, and be presented with the option to assign the repossession of the target vehicle 106 within those parameters to a particular agent. As an option, the repossessor 104 may be given a recommended agent to give the assignment to, a recommendation which may be based upon the location of the agent, where the agent is based, the type of equipment needed for the repossession, and/or any other characteristic associated with the agent of the repossessor.



FIG. 6 is a user interface view 650 of the predictive timeline 500 of FIG. 5, according to one embodiment. Particularly, FIG. 6 illustrates a data point 600, a key 602, and a tooltip 604, in conjunction with the predictive timeline 500 of FIG. 5.


In the context of the present description, a data point 600 may be a visual representation of a potential repossession event, and at least some of the data associated with it (e.g. destination zone, time, confidence of repossession, “strength” of recommendation, probability of finding the target vehicle 106, equipment needed for repossession, etc.). The data points 600 shown in FIG. 6 are circles of different shading and size, representing destination zones 202 and likelihood of a successful repossession. In other embodiments, the data points 600 may be represented in other ways, such as segments of a clock or days on a calendar.


In some circumstances, the repossessor 104 may wish to repossess the target vehicle 106 at a particular time, or within a particular time range, and needs to see where the best place would be for that to happen. The predictive timeline 500 displays where the recommended destination zone 202 is for repossession at a given time and day using the data points.


In various embodiments, a repossessor 104 may interact with or click on a data point 600 to see potential actions which may be taken (e.g. assign an agent of the repossessor to retrieve the target vehicle 106 at the place and time associated with that point, establish a geo-fence which will alert the repossessor 104 when the vehicle arrives at the place associated with the data point 600 on the day associated with the data point, display additional information about that data point 600 such as why it is being recommended, etc.).


In one embodiment, the key 602 may inform the repossessor 104 of what information (e.g. destination zone, equipment needed, parking type, etc.) is being represented by a characteristic (e.g. style, color, shape, etc.) of the data points 600. In another embodiment, if the repossessor 104 hovers a cursor over a data point, one or more tooltips 604 may display the specific details associated with that data point. For example, in FIG. 6, the data point 600 beneath the cursor represents a 87% likelihood of successful repossession of the target vehicle 106 at 17675 Gillette Ave at 10 AM.



FIG. 7 is a user interface view 750 of the filter 504 of FIG. 5, according to one embodiment. Particularly, FIG. 7 illustrates a set of parameters 700, a data range 702, a time parameter 704, and a day parameter 706, in the context of the filter 504 of FIG. 5.


In some embodiments, the repossessor 104 may use a filter 504 to limit the recommendations provided to those consistent with certain parameters, such as the set of parameters 700 defined within user interface view 750. In one embodiment, the repossessor 104 may specify a data range 702 of data which will be considered by the predictive recommendation server 100 when applying the predictive model. In another embodiment, the repossessor 104 may specify a time parameter 704, limiting the recommendation to a particular window of time (e.g. preferred business hours for a tow service, etc.). In still another embodiment, the repossessor 104 may specify a day parameter 706, limiting the recommendations provided to those on certain days of the week.


In other embodiments, the repossessor 104 may use a filter 504 to further define conditions necessary or desired for a repossession attempt. For example, the recommendations may be limited to locations where the target vehicle 106 may be towed using a particular type of tow truck. Other conditions which may be specified include, but are not limited to, considerations of fee rates of different towing services (e.g. the charge per mile combined with the location of the tow truck, etc.), and/or disqualification of certain types of locations.


As an option, the repossessor 104 may define the range of time to be considered when assembling the predictive timeline 500 and list of recommended destination zones and times 103. For example, if the lender has indicated that the vehicle must be repossessed within the next two weeks, the repossessor 104 may request the generation of a predictive timeline 500 restricted to the next two weeks.



FIG. 8 is a schematic diagram of generic computing device 880 that can be used to implement the methods and systems disclosed herein, according to one or more embodiments. FIG. 8 is a schematic diagram of generic computing device 880 and a mobile device 850 that can be used to perform and/or implement any of the embodiments disclosed herein. In one or more embodiments, the predictive recommendation server 100, the commercial data server 124, the government data server 126, the social media server 128, the lender server 130, and/or the law enforcement server 132 of FIG. 1 may be the generic computing device 800.


The generic computing device 800 may represent various forms of digital computers, such as laptops, desktops, workstations, personal digital assistants, servers, blade servers, mainframes, and/or other appropriate computers. The mobile device 850 may represent various forms of mobile devices, such as smartphones, camera phones, personal digital assistants, cellular telephones, and other similar mobile devices. The components shown here, their connections, couples, and relationships, and their functions, are meant to be exemplary only, and are not meant to limit the embodiments described and/or claimed, according to one embodiment.


The generic computing device 800 may include a processor 802, a memory 804, a storage device 806, a high speed interface 808 coupled to the memory 804 and a plurality of high speed expansion ports 810, and a low speed interface 812 coupled to a low speed bus 814 and a storage device 806. In one embodiment, each of the components heretofore may be inter-coupled using various buses, and may be mounted on a common motherboard and/or in other manners as appropriate. The processor 802 may process instructions for execution in the generic computing device 800, including instructions stored in the memory 804 and/or on the storage device 806 to display a graphical information for a GUI on an external input/output device, such as a display unit 816 coupled to the high speed interface 808.


In other embodiments, multiple processors and/or multiple buses may be used, as appropriate, along with multiple memories and/or types of memory. Also, a plurality of computing device 800 may be coupled with, with each device providing portions of the necessary operations (e.g., as a server bank, a group of blade servers, and/or a multi-processor system).


The memory 804 may be coupled to the generic computing device 800. In one embodiment, the memory 804 may be a volatile memory. In another embodiment, the memory 804 may be a non-volatile memory. The memory 804 may also be another form of computer-readable medium, such as a magnetic and/or an optical disk. The storage device 806 may be capable of providing mass storage for the generic computing device 800. In one embodiment, the storage device 806 may be includes a floppy disk device, a hard disk device, an optical disk device, a tape device, a flash memory and/or other similar solid state memory device. In another embodiment, the storage device 806 may be an array of the devices in a computer-readable medium previously mentioned heretofore, computer-readable medium, such as, and/or an array of devices, including devices in a storage area network and/or other configurations.


A computer program may be comprised of instructions that, when executed, perform one or more methods, such as those described above. The instructions may be stored in the memory 804, the storage device 806, a memory coupled to the processor 802, and/or a propagated signal.


The high speed interface 808 may manage bandwidth-intensive operations for the generic computing device 800, while the low speed interface 812 may manage lower bandwidth-intensive operations. Such allocation of functions is exemplary only. In one embodiment, the high speed interface 808 may be coupled to the memory 804, the display unit 816 (e.g., through a graphics processor and/or an accelerator), and to the plurality of high speed expansion ports 810, which may accept various expansion cards.


In the embodiment, the low speed interface 812 may be coupled to the storage device 806 and the low speed bus 814. The low speed bus 814 may be comprised of a wired and/or wireless communication port (e.g., a Universal Serial Bus (“USB”), a Bluetooth® port, an Ethernet port, and/or a wireless Ethernet port). The low speed bus 814 may also be coupled to the scan unit 828, a printer 826, a keyboard, a mouse 824, and a networking device (e.g., a switch and/or a router) through a network adapter.


The generic computing device 800 may be implemented in a number of different forms, as shown in the Figure. In one embodiment, the computing device 800 may be implemented as a standard server 818 and/or a group of such servers. In another embodiment, the generic computing device 800 may be implemented as part of a rack server system 822. In yet another embodiment, the generic computing device 800 may be implemented as a general computer 820 such as a laptop or desktop computer. Alternatively, a component from the generic computing device 800 may be combined with another component in a mobile device 850. In one or more embodiments, an entire system may be made up of a plurality of generic computing device 800 and/or a plurality of generic computing device 800 coupled to a plurality of mobile device 850.


In one embodiment, the mobile device 850 may include a mobile compatible processor 832, a mobile compatible memory 834, and an input/output device such as a mobile display 846, a communication interface 852, and a transceiver 838, among other components. The mobile device 850 may also be provided with a storage device, such as a microdrive or other device, to provide additional storage. In one embodiment, the components indicated heretofore are inter-coupled using various buses, and several of the components may be mounted on a common motherboard.


The mobile compatible processor 832 may execute instructions in the mobile device 850, including instructions stored in the mobile compatible memory 834. The mobile compatible processor 832 may be implemented as a chipset of chips that include separate and multiple analog and digital processors. The mobile compatible processor 832 may provide, for example, for coordination of the other components of the mobile device 850, such as control of user interfaces, applications run by the mobile device 850, and wireless communication by the mobile device 850.


The mobile compatible processor 832 may communicate with a user through the control interface 836 and the display interface 844 coupled to a mobile display 846. In one embodiment, the mobile display 846 may be a Thin-Film-Transistor Liquid Crystal Display (“TFT LCD”), an Organic Light Emitting Diode (“OLED”) display, and another appropriate display technology. The display interface 844 may comprise appropriate circuitry for driving the mobile display 846 to present graphical and other information to a user. The control interface 836 may receive commands from a user and convert them for submission to the mobile compatible processor 832.


In addition, an external interface 842 may be provide in communication with the mobile compatible processor 832, so as to enable near area communication of the mobile device 850 with other devices. External interface 842 may provide, for example, for wired communication in some embodiments, or for wireless communication in other embodiments, and multiple interfaces may also be used.


The mobile compatible memory 834 may be coupled to the mobile device 850. The mobile compatible memory 834 may be implemented as a volatile memory and a non-volatile memory. The expansion memory 858 may also be coupled to the mobile device 850 through the expansion interface 856, which may comprise, for example, a Single In Line Memory Module (“SIMM”) card interface. The expansion memory 858 may provide extra storage space for the mobile device 850, or may also store an application or other information for the mobile device 850.


Specifically, the expansion memory 858 may comprise instructions to carry out the processes described above. The expansion memory 858 may also comprise secure information. For example, the expansion memory 858 may be provided as a security module for the mobile device 850, and may be programmed with instructions that permit secure use of the mobile device 850. In addition, a secure application may be provided on the SIMM card, along with additional information, such as placing identifying information on the SIMM card in a non-hackable manner.


The mobile compatible memory may include a volatile memory (e.g., a flash memory) and a non-volatile memory (e.g., a non-volatile random-access memory (“NVRAM”)). In one embodiment, a computer program comprises a set of instructions that, when executed, perform one or more methods. The set of instructions may be stored on the mobile compatible memory 834, the expansion memory 858, a memory coupled to the mobile compatible processor 832, and a propagated signal that may be received, for example, over the transceiver 838 and/or the external interface 842.


The mobile device 850 may communicate wirelessly through the communication interface 852, which may be comprised of a digital signal processing circuitry. The communication interface 852 may provide for communications using various modes and/or protocols, such as, a Global System for Mobile Communications (“GSM”) protocol, a Short Message Service (“SMS”) protocol, an Enhanced Messaging System (“EMS”) protocol, a Multimedia Messaging Service (“MMS”) protocol, a Code Division Multiple Access (“CDMA”) protocol, Time Division Multiple Access (“TDMA”) protocol, a Personal Digital Cellular (“PDC”) protocol, a Wideband Code Division Multiple Access (“WCDMA”) protocol, a CDMA2000 protocol, and a General Packet Radio Service (“GPRS”) protocol.


Such communication may occur, for example, through the transceiver 838 (e.g., radio-frequency transceiver). In addition, short-range communication may occur, such as using a Bluetooth®, Wi-Fi, and/or other such transceiver. In addition, a GPS (“Global Positioning System”) receiver module 854 may provide additional navigation-related and location-related wireless data to the mobile device 850, which may be used as appropriate by a software application running on the mobile device 850.


The mobile device 850 may also communicate audibly using an audio codec 840, which may receive spoken information from a user and convert it to usable digital information. The audio codec 840 may likewise generate audible sound for a user, such as through a speaker (e.g., in a handset of the mobile device 850). Such a sound may comprise a sound from a voice telephone call, a recorded sound (e.g., a voice message, a music files, etc.) and may also include a sound generated by an application operating on the mobile device 850.


The mobile device 850 may be implemented in a number of different forms, as shown in the Figure. In one embodiment, the mobile device 850 may be implemented as a smartphone 848. In another embodiment, the mobile device 850 may be implemented as a personal digital assistant (“PDA”). In yet another embodiment, the mobile device, 850 may be implemented as a tablet device.



FIG. 9 is an event view 950 that illustrates the vehicle 106 at a sample event 910 in which the vehicle 106 is at a stop sign 906. While the sample event of the stop sign 906 is illustrated in FIG. 1, the event 910 may be a variety of other pause events, such as an arrive at home event, an arrive at work event—based on a time of day, day of week, and/or other characteristics. In FIG. 9, the vehicle 106 is illustrated as having a user 904, a predictive circuit 900, and a wheel 908.



FIG. 10 is an exploded view 1050 of the predictive circuit 900 of FIG. 9. In FIG. 10, various circuits that enable various embodiments described herein are implemented through a combination of hardware and/or software circuitry. In one embodiment, a predictive circuit 900 of a vehicle 106 includes an event detection circuitry 1002 to initiate a timer circuit 1004 of the vehicle 106 when a wheel 908 of the vehicle 106 is in a stationary state (using the stationary detection circuit 1006) beyond a threshold amount of time (using the threshold calculator circuit 1010) during an event 910; an event categorization circuitry 1012 to monitor a telemetry data 1014 of the vehicle 106 to assign a category to the event 910; a data communication circuitry 1016 to communicate the event 910, the category, and a set of other events and categories to a predictive recommendation server 100 on a periodic basis; and a repossession detection circuitry 1018 to determine that the vehicle 106 is pending repossession based on the event 910, the category, the set of other events and categories, and/or a message communicated from the predictive recommendation server 100 to the predictive circuit 900. The predictive circuit 900 may be a hardware and/or software set of instructions on an integrated circuit and/or firmware accessible on the integrated circuit to perform predictive modeling of the vehicle 106 in an absence of global positioning data of the vehicle.


The event 910 may be associated with a time of day, a day of a week, a calendar day, and/or an event 910 type (e.g., by the predictive circuit 900 and/or the predictive recommendation server 100). The event 910 type may be a home location, a work location, a day location, an evening location, a weekend location, a night location, and/or a holiday location. A location of the vehicle 106 may be determined through a triangulation algorithm of the data communication circuitry 1016 of the predictive circuit 900 (e.g., in absence of global position information, and/or a mobile device associated with a user 904 of the vehicle 106. The user 904 of the vehicle 106 may be identified as a primary user 904 of the vehicle 106, and/or a secondary user 904 of the vehicle 106. The triangulation algorithm may be applied to the mobile device when the mobile device is paired with the vehicle 106 through a user short range communication algorithm 1026. The mobile device may be detected using the predictive circuit 900 to have a latitudinal and longitudinal location change with nearby cellular towers in a pattern consistent with a movement of the vehicle 106. The user short range communication algorithm 1026 may be Bluetooth®, BLE®, Zigbee®, and/or another personal area network (PAN).


The telemetry data 1014 may be determined based on an engine motor status, an accelerator status, a time of pause, a brake status, a park status, an occupant sensor status, a door status, a window status, a hood status, a truck status, a tailgate status, an in-car entertainment system status, an air-conditioning status, an in-car electronic system status, a neutral status and/or an other car status. The predictive circuit 900 and the predictive recommendation server 100 may generate a statistical probability matrix 1024 of a set of predictive potential locations of the vehicle 106 as a function of time based on an analysis of historical data.


The predictive circuit 900 and/or the predictive recommendation server 100 may generate a stop report 1020 and/or a drive report 1022. The drive report 1022 may be generated using the motion detection circuit 1008. The predictive circuit 900 and/or the predictive recommendation server 100 may determine an accuracy of the statistical probability matrix 1024. An artificial intelligence algorithm may be applied when generating the statistical probability matrix 1024. The periodic basis may be 25 hours to enable an hourly cycling of the event 910 and the set of other events from the data communication circuitry 1016 to the predictive recommendation server 100. The event 910 data and the set of other events may be transmitted in real time, an active period, and/or a batch mode from a locally stored cache storing event 910 data since a previous transmittal to the predictive recommendation server 100.


In other embodiment, a method of predictive circuit 900 of a vehicle 106 includes initiating a timer circuit 1004 of the vehicle 106 when a wheel 908 of the vehicle 106 is in a stationary state (using the stationary detection circuit 1006) beyond a threshold amount of time (using the threshold calculator circuit 1010) during an event 910 using a processor and a memory of an event detection circuitry 1002; monitoring a telemetry data 1014 of the vehicle 106 to assign a category to the event 910 using an event categorization circuitry 1012; communicating the event 910, the category, and a set of other events and categories to a predictive recommendation server 100 on a periodic basis using a data communication circuitry 1016; and determining using a repossession detection circuitry 1018 that the vehicle 106 is pending repossession based on the event 910, the category, the set of other events and categories, and/or a message communicated from the predictive recommendation server 100 to the predictive circuit 900.


In yet other embodiment, a predictive circuit 900 of a vehicle 106 includes an event detection circuitry 1002 to initiate a timer circuit 1004 of the vehicle 106 when a wheel 908 of the vehicle 106 is in a stationary state (using the stationary detection circuit 1006) beyond a threshold amount of time (using the threshold calculator circuit 1010) during an event 910; an event categorization circuitry 1012 to monitor a telemetry data 1014 of the vehicle 106 to assign a category to the event 910; a data communication circuitry 1016 to communicate the event 910, the category, and a set of other events and categories to a predictive recommendation server 100 on a periodic basis; and a repossession detection circuitry 1018 to determine that the vehicle 106 is pending repossession based on the event 910, the category, the set of other events and categories, and/or a message communicated from the predictive recommendation server 100 to the predictive circuit 900.


The predictive circuit 900 stops the timer circuit 1004 when the wheel 908 of the vehicle 106 changes to a rotating state when the vehicle 106 is in motion in this yet another aspect. The timer circuit 1004 may calculate a total time to stop. The total time can be associated with the event 910 in this yet another embodiment.


Various embodiments of the systems and techniques described here can be realized in a digital electronic circuitry, an integrated circuitry, a specially designed application specific integrated circuits (“ASICs”), a piece of computer hardware, a firmware, a software application, and a combination thereof. These various embodiments can include embodiment in one or more computer programs that are executable and/or interpretable on a programmable system including one programmable processor, which may be special or general purpose, coupled to receive data and instructions from, and to transmit data and instructions to, a storage system, one input device, and one output device.


Various embodiments of the systems and techniques described here can be realized in a digital electronic circuitry, an integrated circuitry, a specially designed application specific integrated circuits (“ASICs”), a piece of computer hardware, a firmware, a software application, and a combination thereof. These various embodiments can include embodiment in one or more computer programs that are executable and/or interpretable on a programmable system includes programmable processor, which may be special or general purpose, coupled to receive data and instructions from, and to transmit data and instructions to, a storage system, input device, and output device.


These computer programs (also known as programs, software, software applications, and/or code) comprise machine-readable instructions for a programmable processor, and can be implemented in a high-level procedural and/or object-oriented programming language, and/or in assembly/machine language. As used herein, the terms “machine-readable medium” and/or “computer-readable medium” refers to any computer program product, apparatus and/or device (e.g., magnetic discs, optical disks, memory, and/or Programmable Logic Devices (“PLDs”)) used to provide machine instructions and/or data to a programmable processor, including a machine-readable medium that receives machine instructions as a machine-readable signal. The term “machine-readable signal” refers to any signal used to provide machine instructions and/or data to a programmable processor.


To provide for interaction with a user, the systems and techniques described here may be implemented on a computing device having a display device (e.g., a cathode ray tube (“CRT”) and/or liquid crystal (“LCD”) monitor) for displaying information to the user and a keyboard and a mouse 824 by which the user can provide input to the computer. Other kinds of devices can be used to provide for interaction with a user as well; for example, feedback provided to the user can be any form of sensory feedback (e.g., visual feedback, auditory feedback, and/or tactile feedback) and input from the user can be received in any form, including acoustic, speech, and/or tactile input.


The systems and techniques described here may be implemented in a computing system that includes a back end component (e.g., as a data server), a middleware component (e.g., an application server), a front end component (e.g., a client computer having a graphical user interface, and/or a Web browser through which a user can interact with an embodiment of the systems and techniques described here), and a combination thereof. The components of the system may also be coupled through a communication network.


The communication network may include a local area network (“LAN”) and a wide area network (“WAN”) (e.g., the Internet). The computing system can include a client and a server. In one embodiment, the client and the server are remote from each other and interact through the communication network.


An example embodiment will now be described.


Frank Jones enters into a loan agreement with Acme Financing Corp. to purchase a new car. As part of the loan agreement, Frank consents to Acme placing a tracking device 110 within his new car, which will periodically report the location of his car to a server operated by Acme. Mr. Jones made regular payments for a year and a half, but then stopped paying. After being warned by Acme that the car may be repossessed, Mr. Jones removed the tracking device 110 from his car and stopped parking it at his home, hoping to avoid repossession.


In an effort to quickly acquire the car, Acme Financing contracts with a repossessor 104 who has access to a predictive recommendation server 100. The server, using a year and a half of location and non-tracking data 114, determines that Mr. Jones goes surfing at a particular beach whenever the surf size is reported above a certain level. The server uses machine vision algorithms to analyze the parking near the beach, and determines that it would be easy to tow the car quickly. The server monitors the surf forecast, and when it appears the surf report may meet Frank's preference, a notification is sent to the repossessor, who sends a truck to repossess the car.


A number of embodiments have been described. Nevertheless, it will be understood that various modifications may be made without departing from the spirit and scope of the claimed invention. In addition, the logic flows depicted in the Figures do not require the particular order shown, or sequential order, to achieve desirable results. In addition, other steps may be provided, or steps may be eliminated, from the described flows, and other components may be added to, or removed from, the described systems. Accordingly, other embodiments are within the scope of the following claims.


It may be appreciated that the various systems, methods, and apparatus disclosed herein may be embodied in a machine-readable medium and/or a machine accessible medium compatible with a data processing system (e.g., a computer system), and/or may be performed in any order.


The structures and modules in the Figures may be shown as distinct and communicating with only a few specific structures and not others. The structures may be merged with each other, may perform overlapping functions, and may communicate with other structures not shown to be connected in the Figures. Accordingly, the specification and/or drawings may be regarded in an illustrative rather than a restrictive sense.

Claims
  • 1. A repossession recommendation system for providing a recommendation regarding locations and times at which a target vehicle will be parked and available for repossession, the apparatus comprising: one or more electronic devices that generate and communicate vehicle location data comprising one or more of: a tracking device in the target vehicle that generates location data based on satellite signals when satellite signals are available; anda mobile device associated with a user of the target vehicle that generates location data based on satellite signals when satellite signals are available or based on a triangulation algorithm when satellite signals are unavailable;a network through which the vehicle location data is communicated; anda predictive recommendation server for receiving the vehicle location data via the network, the predictive recommendation server comprising one or more processors that are operable to execute instructions to: create a plurality of destination zones associated with the target vehicle based on the vehicle location data, each destination zone having a geographic boundary;group a set of visits within each destination zone, wherein each visit comprises an instance during which the target vehicle was parked within the geographic boundary of the destination zone;determine a frequency of visits for one or more of the destination zones;receive non-tracking data via the network from one or more of a commercial data server, a government data server, a social media server, a lender server, and a law enforcement server, wherein the non-tracking data provides information about the operation of vehicle other than locations and times at which the target vehicle is parked; andrun a predictive model based at least in part on the frequency of visits and the non-tracking data to generate a list of recommended destination zones and times to repossess the target vehicle.
  • 2. The repossession recommendation system of claim 1 wherein the non-tracking data provides information about types of parking available to the target vehicle in each of the destination zones, wherein the types of parking include one or more of street parking, driveway parking, garage parking, and gated lot parking.
  • 3. The repossession recommendation system of claim 1 wherein the non-tracking data provides one or more of information about results of previous repossession attempts for the target vehicle, and information about a geographic location of a repossessor entity.
  • 4. The repossession recommendation system of claim 1 wherein the predictive recommendation server comprises one or more processors that are operable to execute instructions to display the recommended destination zones on a predictive timeline indicating a probability of the target vehicle being within particular recommended destination zones at particular times of day.
  • 5. A repossession recommendation system for providing a recommendation regarding locations and times at which a target vehicle will be parked and available for repossession, the apparatus comprising: a tracking device in the target vehicle that generates vehicle location data; anda network through which the vehicle location data is communicated; anda predictive recommendation server for receiving the vehicle location data via the network, the predictive recommendation server comprising one or more processors that are operable to execute instructions to: create a plurality of destination zones associated with the target vehicle based on the vehicle location data, each destination zone having a geographic boundary;group a set of visits within each destination zone, wherein each visit comprises an instance during which the target vehicle was parked within the geographic boundary of the destination zone;determine a frequency of visits for one or more of the destination zones; andrun a predictive model based at least in part on the frequency of visits to generate and display a predictive timeline as a graphical user interface comprising a plurality of graphical data points, each graphical data point corresponding to a particular time of day on a particular day of the week, each graphical data point having an appearance characteristic that indicates a confidence level of finding the target vehicle within a particular destination zone at the particular time of day on the particular day of the week.
  • 6. The repossession recommendation system of claim 5 wherein the one or more processors of the predictive recommendation server receive user input information via the network indicating a particular one of the graphical data points that was selected by a user using the graphical user interface, wherein the one or more processors execute instructions to display to the user one or more actions that may be taken with respect to the graphical data point selected by the user, wherein the one or more actions include one or more of: providing the user a recommendation of a repossessor entity to which repossession of the target vehicle may be assigned;assigning a repossessor entity to retrieve the target vehicle at the location, time of day, and day of the week associated with the graphical data point selected by the user;establishing a geofence around the location associated with the graphical data point clicked on by the user, and alerting a repossessor entity when the target vehicle arrives within the geofence around the location on the day associated with the graphical data point selected by the user; anddisplaying additional information to the user indicating a probability of successful repossession of the target vehicle within the destination zone at the particular time of day on the particular day of the week indicated by the graphical data point selected by the user.
  • 7. The repossession recommendation system of claim 5 wherein each graphical data point is displayed in a specific color indicating a specific one of the destination zones.
  • 8. The repossession recommendation system of claim 5 wherein the appearance characteristic of each graphical data point that indicates a confidence level of finding the target vehicle within a particular destination zone at the particular time of day on the particular day of the week is a size of the graphical data point, wherein the size of the graphical data point is proportional to the confidence level.
  • 9. The repossession recommendation system of claim 6 wherein the user selects a graphical data point by clicking on or hovering over the graphical data point.
CLAIM OF PRIORITY

This patent application claims priority to and hereby incorporates by reference the entirety of the disclosures of: (1) U.S. Provisional Patent Application 62/145,508 titled SYSTEM AND METHOD FOR PREDICTIVE RECOMMENDATION OF A TARGET VEHICLE'S FUTURE LOCATION FOR REPOSESSION and filed on Apr. 9, 2015; and to(2) U.S. Utility application Ser. No. 14/145,914, titled CREDITOR ALERT WHEN A VEHICLE ENTERS AN IMPOUND LOT and filed on Dec. 31, 2013.

US Referenced Citations (506)
Number Name Date Kind
4067061 Juhasz Jan 1978 A
4633407 Freienstein et al. Dec 1986 A
4654821 Lapp Mar 1987 A
4663725 Truckenbrod et al. May 1987 A
4675539 Nichol Jun 1987 A
4695946 Andreasen et al. Sep 1987 A
4701845 Andreasen et al. Oct 1987 A
4727360 Ferguson et al. Feb 1988 A
4837700 Ando et al. Jun 1989 A
4884242 Lacy et al. Nov 1989 A
4891650 Sheffer Jan 1990 A
4907150 Arroyo et al. Mar 1990 A
5119301 Shimizu et al. Jun 1992 A
5122959 Nathanson et al. Jun 1992 A
5208756 Song May 1993 A
5218367 Sheffer et al. Jun 1993 A
5223844 Mansell et al. Jun 1993 A
5276865 Thorpe Jan 1994 A
5289369 Hirshberg Feb 1994 A
5299132 Wortham Mar 1994 A
5307277 Hirano Apr 1994 A
5390125 Sennott et al. Feb 1995 A
5408411 Nakamura et al. Apr 1995 A
5424952 Asayama Jun 1995 A
5457439 Kuhn Oct 1995 A
5515419 Sheffer May 1996 A
5521579 Bernhard May 1996 A
5610815 Gudat et al. Mar 1997 A
5684474 Gilon et al. Nov 1997 A
5686888 Welles, II et al. Nov 1997 A
5708820 Park et al. Jan 1998 A
5712789 Radican Jan 1998 A
5751245 Janky et al. May 1998 A
5805103 Doi et al. Sep 1998 A
5867804 Pilley et al. Feb 1999 A
5870029 Otto et al. Feb 1999 A
5877956 Frank et al. Mar 1999 A
5917433 Keillor et al. Jun 1999 A
5923243 Bleiner Jul 1999 A
5949974 Ewing et al. Sep 1999 A
5978236 Faberman et al. Nov 1999 A
6029111 Croyle Feb 2000 A
6067044 Whelan et al. May 2000 A
6075441 Maloney Jun 2000 A
6091323 Kawai Jul 2000 A
6148291 Radican Nov 2000 A
6154152 Ito Nov 2000 A
6181029 Berglund et al. Jan 2001 B1
6202023 Hancock et al. Mar 2001 B1
6204764 Maloney Mar 2001 B1
6226389 Lemelson et al. May 2001 B1
6233563 Jefferson et al. May 2001 B1
6240365 Bunn May 2001 B1
6249217 Forbes Jun 2001 B1
6266008 Huston et al. Jul 2001 B1
6275773 Lemelson et al. Aug 2001 B1
6317693 Kodaka et al. Nov 2001 B2
6338011 Furst et al. Jan 2002 B1
6339369 Paranjpe Jan 2002 B1
6339745 Novik Jan 2002 B1
6363320 Chou Mar 2002 B1
6385539 Wilson et al. May 2002 B1
6388580 Graham May 2002 B1
6393582 Klecka et al. May 2002 B1
6393584 McLaren et al. May 2002 B1
6415227 Lin Jul 2002 B1
6483434 Umiker Nov 2002 B1
6502080 Eichorst et al. Dec 2002 B1
6510381 Grounds et al. Jan 2003 B2
6512465 Flick Jan 2003 B2
6577921 Carson Jun 2003 B1
6584403 Bunn Jun 2003 B2
6701234 Vogelsang Mar 2004 B1
6704810 Krehbiel, Jr. et al. Mar 2004 B1
6714857 Kapolka et al. Mar 2004 B2
6717527 Simon Apr 2004 B2
6720920 Breed et al. Apr 2004 B2
6737963 Gutta et al. May 2004 B2
6748320 Jones Jun 2004 B2
6771970 Dan Aug 2004 B1
6816090 Teckchandani et al. Nov 2004 B2
6832153 Thayer et al. Dec 2004 B2
6844827 Flick Jan 2005 B2
6856902 Mitchem Feb 2005 B1
6871137 Scaer et al. Mar 2005 B2
6873963 Westbury et al. Mar 2005 B1
6904359 Jones Jun 2005 B2
6930638 Lloyd et al. Aug 2005 B2
6931309 Phelan et al. Aug 2005 B2
6985087 Soliman Jan 2006 B2
7035856 Morimoto Apr 2006 B1
7039520 Draeger et al. May 2006 B2
7065445 Thayer et al. Jun 2006 B2
7072764 Donath et al. Jul 2006 B2
7091835 Boulay et al. Aug 2006 B2
7096392 Sim-Tang Aug 2006 B2
7099934 Ewing et al. Aug 2006 B1
7154390 Giermanski et al. Dec 2006 B2
7170390 Quinones et al. Jan 2007 B2
7174243 Lightner et al. Feb 2007 B1
7177738 Diaz Feb 2007 B2
7212134 Taylor May 2007 B2
7215255 Grush May 2007 B2
7242303 Patel et al. Jul 2007 B2
7253731 Joao Aug 2007 B2
7266378 Norta et al. Sep 2007 B2
7283046 Culpepper et al. Oct 2007 B2
7289019 Kertes Oct 2007 B1
7302344 Olney et al. Nov 2007 B2
7308611 Booth Dec 2007 B2
7327238 Bhogal et al. Feb 2008 B2
7339469 Braun Mar 2008 B2
7343306 Bates et al. Mar 2008 B1
7346439 Bodin Mar 2008 B2
7346790 Klein Mar 2008 B1
7405658 Richards Jul 2008 B2
7446649 Bhogal et al. Nov 2008 B2
7455225 Hadfield et al. Nov 2008 B1
7467325 Eisen et al. Dec 2008 B2
7472202 Parupudi et al. Dec 2008 B2
7479877 Mortenson et al. Jan 2009 B2
7486176 Bhogal et al. Feb 2009 B2
7489993 Coffee et al. Feb 2009 B2
7527288 Breed May 2009 B2
7552008 Newstrom et al. Jun 2009 B2
7555370 Breed et al. Jun 2009 B2
7571051 Shulman Aug 2009 B1
7574195 Krasner et al. Aug 2009 B2
7580782 Breed et al. Aug 2009 B2
7593999 Nathanson Sep 2009 B2
7600150 Wu Oct 2009 B2
7617037 Desens et al. Nov 2009 B2
7650210 Breed Jan 2010 B2
7652568 Waugh et al. Jan 2010 B2
7657354 Breed et al. Feb 2010 B2
7668931 Parupudi et al. Feb 2010 B2
7672756 Breed Mar 2010 B2
7693626 Breed et al. Apr 2010 B2
7701363 Zlojutro Apr 2010 B1
7725216 Kim May 2010 B2
7746228 Sensenig et al. Jun 2010 B2
7751944 Parupudi et al. Jul 2010 B2
7755541 Wisherd et al. Jul 2010 B2
7769499 McQuade et al. Aug 2010 B2
7774633 Harrenstien et al. Aug 2010 B1
7817033 Motoyama Oct 2010 B2
7876239 Horstemeyer Jan 2011 B2
7893818 Smoyer et al. Feb 2011 B2
7899591 Shah et al. Mar 2011 B2
7899621 Breed et al. Mar 2011 B2
7916026 Johnson et al. Mar 2011 B2
7950570 Marchasin et al. May 2011 B2
7971095 Hess et al. Jun 2011 B2
7987017 Buzzoni et al. Jul 2011 B2
8009034 Dobson et al. Aug 2011 B2
8009086 Grossnick et al. Aug 2011 B2
8095304 Blanton et al. Jan 2012 B2
8103450 Takaoka Jan 2012 B2
8103741 Frazier et al. Jan 2012 B2
8106757 Brinton et al. Jan 2012 B2
8111154 Puri et al. Feb 2012 B1
8126601 Kapp et al. Feb 2012 B2
8181868 Thomas et al. May 2012 B2
8185767 Ballou et al. May 2012 B2
8201009 Sun et al. Jun 2012 B2
8237591 Holcomb et al. Aug 2012 B2
8255144 Breed et al. Aug 2012 B2
8279067 Berger et al. Oct 2012 B2
8299920 Hamm et al. Oct 2012 B2
8306687 Chen Nov 2012 B2
8311858 Everett et al. Nov 2012 B2
8326813 Nizami et al. Dec 2012 B2
8330626 Adelson Dec 2012 B1
8330817 Foster Dec 2012 B1
8368561 Welch et al. Feb 2013 B2
8380426 Konijnendijk Feb 2013 B2
8398405 Kumar Mar 2013 B2
8407139 Palmer Mar 2013 B1
8452771 Kurciska et al. May 2013 B2
8462021 Welch et al. Jun 2013 B2
8467324 Yousefi et al. Jun 2013 B2
8489907 Wakrat et al. Jul 2013 B2
8502661 Mauro et al. Aug 2013 B2
8504233 Ferguson et al. Aug 2013 B1
8504512 Herzog et al. Aug 2013 B2
8510200 Pearlman et al. Aug 2013 B2
8527135 Lowrey et al. Sep 2013 B2
8565963 Burke, Jr. Oct 2013 B2
8587430 Ferguson et al. Nov 2013 B2
8612137 Harris et al. Dec 2013 B2
8626152 Farrell et al. Jan 2014 B2
8655544 Fletcher et al. Feb 2014 B2
8655983 Harris et al. Feb 2014 B1
8671063 Ehrman et al. Mar 2014 B2
8700249 Carrithers Apr 2014 B1
8718536 Hannon May 2014 B2
8725326 Kapp et al. May 2014 B2
8725342 Ferguson et al. May 2014 B2
8762009 Ehrman et al. Jun 2014 B2
8766797 Hamm et al. Jul 2014 B2
8770480 Gulli Jul 2014 B2
8781169 Jackson et al. Jul 2014 B2
8781958 Michael Jul 2014 B2
8799461 Herz et al. Aug 2014 B2
8839026 Kopylovitz Sep 2014 B2
8898002 Barrett Nov 2014 B2
8933802 Baade Jan 2015 B2
8970701 Lao Mar 2015 B2
9049564 Muetzel et al. Jun 2015 B2
9076276 Kator Jul 2015 B1
20010006398 Nakamura et al. Jul 2001 A1
20010018628 Jenkins et al. Aug 2001 A1
20010018639 Bunn Aug 2001 A1
20010034577 Grounds et al. Oct 2001 A1
20010037298 Ehrman et al. Nov 2001 A1
20020000916 Richards Jan 2002 A1
20020014978 Flick Feb 2002 A1
20020059126 Ricciardi May 2002 A1
20020070891 Huston et al. Jun 2002 A1
20020082025 Baese et al. Jun 2002 A1
20020184062 Diaz Dec 2002 A1
20020186144 Meunier Dec 2002 A1
20020198632 Breed et al. Dec 2002 A1
20030009361 Hancock et al. Jan 2003 A1
20030013146 Werb Jan 2003 A1
20030018428 Knockeart et al. Jan 2003 A1
20030023614 Newstrom et al. Jan 2003 A1
20030055542 Knockeart et al. Mar 2003 A1
20030055553 Knockeart et al. Mar 2003 A1
20030083060 Menendez May 2003 A1
20030125855 Breed et al. Jul 2003 A1
20030151501 Teckchandani et al. Aug 2003 A1
20030151507 Andre et al. Aug 2003 A1
20030158638 Yakes et al. Aug 2003 A1
20030158639 Nada Aug 2003 A1
20030163228 Pillar et al. Aug 2003 A1
20030163229 Pillar et al. Aug 2003 A1
20030163230 Pillar et al. Aug 2003 A1
20030171854 Pillar et al. Sep 2003 A1
20030174067 Soliman Sep 2003 A1
20030176959 Breed Sep 2003 A1
20030191567 Gentilcore Oct 2003 A1
20030191568 Breed Oct 2003 A1
20030204407 Nabors et al. Oct 2003 A1
20040006398 Bickford Jan 2004 A1
20040006413 Kane et al. Jan 2004 A1
20040049337 Knockeart et al. Mar 2004 A1
20040056797 Knockeart et al. Mar 2004 A1
20040093291 Bodin May 2004 A1
20040102895 Thayer et al. May 2004 A1
20040102896 Thayer et al. May 2004 A1
20040130440 Boulay et al. Jul 2004 A1
20040143378 Vogelsang Jul 2004 A1
20040162063 Quinones et al. Aug 2004 A1
20040199285 Berichon et al. Oct 2004 A1
20040199302 Pillar et al. Oct 2004 A1
20040204969 Wu Oct 2004 A1
20040225557 Phelan et al. Nov 2004 A1
20040246177 Lloyd et al. Dec 2004 A1
20050004748 Pinto et al. Jan 2005 A1
20050007450 Hill et al. Jan 2005 A1
20050021199 Zimmerman et al. Jan 2005 A1
20050021722 Metzger Jan 2005 A1
20050043879 Desens et al. Feb 2005 A1
20050060069 Breed et al. Mar 2005 A1
20050080565 Olney et al. Apr 2005 A1
20050114023 Williamson et al. May 2005 A1
20050131597 Raz et al. Jun 2005 A1
20050134504 Harwood et al. Jun 2005 A1
20050149251 Donath et al. Jul 2005 A1
20050171798 Croft et al. Aug 2005 A1
20050216294 Labow Sep 2005 A1
20050237166 Chen Oct 2005 A1
20060041341 Kane et al. Feb 2006 A1
20060041342 Kane et al. Feb 2006 A1
20060052913 Kane et al. Mar 2006 A1
20060053075 Roth et al. Mar 2006 A1
20060055561 Kamali et al. Mar 2006 A1
20060074558 Williamson et al. Apr 2006 A1
20060087411 Chang Apr 2006 A1
20060089786 Soehren Apr 2006 A1
20060109106 Braun May 2006 A1
20060129290 Zimmerman et al. Jun 2006 A1
20060155427 Yang Jul 2006 A1
20060155434 Kane et al. Jul 2006 A1
20060187026 Kochis Aug 2006 A1
20060253234 Kane et al. Nov 2006 A1
20060273922 Bhogal et al. Dec 2006 A1
20070005202 Breed Jan 2007 A1
20070027726 Warren et al. Feb 2007 A1
20070057781 Breed Mar 2007 A1
20070061054 Rowe et al. Mar 2007 A1
20070061076 Shulman Mar 2007 A1
20070086624 Breed et al. Apr 2007 A1
20070087756 Hoffberg Apr 2007 A1
20070096565 Breed et al. May 2007 A1
20070096899 Johnson May 2007 A1
20070115101 Creekbaum et al. May 2007 A1
20070135984 Breed et al. Jun 2007 A1
20070139216 Breed Jun 2007 A1
20070156317 Breed Jul 2007 A1
20070159354 Rosenberg Jul 2007 A1
20070162550 Rosenberg Jul 2007 A1
20070167147 Krasner et al. Jul 2007 A1
20070185625 Pillar et al. Aug 2007 A1
20070185728 Schwarz Aug 2007 A1
20070200690 Bhogal et al. Aug 2007 A1
20070239322 McQuade et al. Oct 2007 A1
20070244614 Nathanson Oct 2007 A1
20070285240 Sensenig et al. Dec 2007 A1
20070290836 Ainsworth et al. Dec 2007 A1
20070290923 Norta et al. Dec 2007 A1
20080015748 Nagy Jan 2008 A1
20080036187 Breed Feb 2008 A1
20080040004 Breed Feb 2008 A1
20080040005 Breed Feb 2008 A1
20080040023 Breed et al. Feb 2008 A1
20080040268 Corn Feb 2008 A1
20080042875 Harrington et al. Feb 2008 A1
20080046150 Breed Feb 2008 A1
20080051957 Breed et al. Feb 2008 A1
20080051995 Lokshin et al. Feb 2008 A1
20080061953 Bhogal et al. Mar 2008 A1
20080065291 Breed Mar 2008 A1
20080077285 Kumar et al. Mar 2008 A1
20080077326 Funk et al. Mar 2008 A1
20080091350 Smith et al. Apr 2008 A1
20080111546 Takahashi et al. May 2008 A1
20080119993 Breed May 2008 A1
20080147265 Breed Jun 2008 A1
20080147280 Breed Jun 2008 A1
20080157510 Breed et al. Jul 2008 A1
20080162045 Lee Jul 2008 A1
20080167821 Breed Jul 2008 A1
20080176537 Smoyer et al. Jul 2008 A1
20080183344 Doyen et al. Jul 2008 A1
20080183376 Knockeart et al. Jul 2008 A1
20080195261 Breed Aug 2008 A1
20080195432 Fell et al. Aug 2008 A1
20080215190 Pillar et al. Sep 2008 A1
20080234933 Chowdhary et al. Sep 2008 A1
20080235105 Payne et al. Sep 2008 A1
20080252431 Nigam Oct 2008 A1
20080262669 Smid et al. Oct 2008 A1
20080278314 Miller et al. Nov 2008 A1
20080294302 Basir Nov 2008 A1
20080318547 Ballou, Jr. et al. Dec 2008 A1
20090033494 Malik Feb 2009 A1
20090079591 Motoyama Mar 2009 A1
20090082918 Hendrix, Jr. Mar 2009 A1
20090112394 Lepejian et al. Apr 2009 A1
20090138497 Zavoli et al. May 2009 A1
20090140887 Breed et al. Jun 2009 A1
20090177378 Kamalski et al. Jul 2009 A1
20090261975 Ferguson et al. Oct 2009 A1
20090273489 Lu Nov 2009 A1
20090326808 Blanton et al. Dec 2009 A1
20100036793 Willis et al. Feb 2010 A1
20100049669 Mazzarolo Feb 2010 A1
20100057279 Kyllingstad Mar 2010 A1
20100057305 Breed Mar 2010 A1
20100071572 Carroll et al. Mar 2010 A1
20100076878 Burr et al. Mar 2010 A1
20100082195 Lee et al. Apr 2010 A1
20100094482 Schofield et al. Apr 2010 A1
20100094500 Jin Apr 2010 A1
20100117868 Van Wiemeersch et al. May 2010 A1
20100127867 Chien et al. May 2010 A1
20100152972 Attard et al. Jun 2010 A1
20100169009 Breed et al. Jul 2010 A1
20100174487 Soehren Jul 2010 A1
20100191412 Kim Jul 2010 A1
20100207754 Shostak et al. Aug 2010 A1
20100250411 Ogrodski Sep 2010 A1
20100265104 Zlojutro Oct 2010 A1
20100274415 Lam Oct 2010 A1
20100332080 Bae Dec 2010 A1
20100332118 Geelen et al. Dec 2010 A1
20100332363 Duddle et al. Dec 2010 A1
20110016340 Sun et al. Jan 2011 A1
20110060496 Nielsen et al. Mar 2011 A1
20110071750 Giovino et al. Mar 2011 A1
20110078089 Hamm et al. Mar 2011 A1
20110090075 Armitage et al. Apr 2011 A1
20110090399 Whitaker et al. Apr 2011 A1
20110106337 Patel et al. May 2011 A1
20110137489 Gilleland et al. Jun 2011 A1
20110140877 Gilchrist et al. Jun 2011 A1
20110143669 Farrell et al. Jun 2011 A1
20110166773 Raz et al. Jul 2011 A1
20110181391 Chu Jul 2011 A1
20110196580 Xu et al. Aug 2011 A1
20110221573 Huat Sep 2011 A1
20110257880 Watanabe et al. Oct 2011 A1
20110270772 Hall et al. Nov 2011 A1
20110275388 Haney Nov 2011 A1
20120029818 Smith et al. Feb 2012 A1
20120041618 Sun et al. Feb 2012 A1
20120075088 Marentes Aguilar Mar 2012 A1
20120077475 Holcomb et al. Mar 2012 A1
20120078497 Burke, Jr. Mar 2012 A1
20120089328 Ellanti et al. Apr 2012 A1
20120089686 Meister Apr 2012 A1
20120106446 Yousefi et al. May 2012 A1
20120106801 Jackson May 2012 A1
20120123806 Schumann, Jr. et al. May 2012 A1
20120166018 Larschan et al. Jun 2012 A1
20120191329 Roessle et al. Jul 2012 A1
20120197484 Nath et al. Aug 2012 A1
20120218129 Burns Aug 2012 A1
20120232945 Tong Sep 2012 A1
20120249326 Mostov Oct 2012 A1
20120252488 Hartmann et al. Oct 2012 A1
20120253861 Davidson et al. Oct 2012 A1
20120268260 Miller et al. Oct 2012 A1
20120289295 Murray Nov 2012 A1
20120303237 Kumar et al. Nov 2012 A1
20120323767 Michael Dec 2012 A1
20120323771 Michael Dec 2012 A1
20120323772 Michael Dec 2012 A1
20130024202 Harris Jan 2013 A1
20130031318 Chen et al. Jan 2013 A1
20130031345 Kung Jan 2013 A1
20130035827 Breed Feb 2013 A1
20130057397 Cutler et al. Mar 2013 A1
20130059607 Herz et al. Mar 2013 A1
20130061044 Pinkus et al. Mar 2013 A1
20130066757 Lovelace et al. Mar 2013 A1
20130069390 Foster Mar 2013 A1
20130097458 Sekino et al. Apr 2013 A1
20130100286 Lao Apr 2013 A1
20130113637 Sin et al. May 2013 A1
20130131928 Bolton et al. May 2013 A1
20130138251 Thogersen et al. May 2013 A1
20130144667 Ehrman et al. Jun 2013 A1
20130144770 Boling et al. Jun 2013 A1
20130144771 Boling et al. Jun 2013 A1
20130144805 Boling Jun 2013 A1
20130159214 Boling et al. Jun 2013 A1
20130166198 Funk et al. Jun 2013 A1
20130179034 Pryor Jul 2013 A1
20130185193 Boling et al. Jul 2013 A1
20130185221 Adams et al. Jul 2013 A1
20130218369 Yoshihama et al. Aug 2013 A1
20130218461 Naimark Aug 2013 A1
20130222133 Schultz et al. Aug 2013 A1
20130249713 Adelson Sep 2013 A1
20130250933 Yousefi et al. Sep 2013 A1
20130253732 Patel et al. Sep 2013 A1
20130253734 Kaap et al. Sep 2013 A1
20130253754 Ferguson et al. Sep 2013 A1
20130297199 Kapp et al. Nov 2013 A1
20130302757 Pearlman et al. Nov 2013 A1
20130311077 Ichida Nov 2013 A1
20130332070 Fleizach et al. Dec 2013 A1
20140012438 Shoppa et al. Jan 2014 A1
20140012510 Mensinger et al. Jan 2014 A1
20140012511 Mensinger et al. Jan 2014 A1
20140012634 Pearlman et al. Jan 2014 A1
20140025229 Levien et al. Jan 2014 A1
20140025230 Levien et al. Jan 2014 A1
20140025233 Levien et al. Jan 2014 A1
20140025234 Levien et al. Jan 2014 A1
20140025235 Levien et al. Jan 2014 A1
20140025236 Levien et al. Jan 2014 A1
20140025284 Roberts Jan 2014 A1
20140036072 Lyall et al. Feb 2014 A1
20140052366 Rothschild Feb 2014 A1
20140052605 Beerle et al. Feb 2014 A1
20140058622 Trombley et al. Feb 2014 A1
20140058655 Trombley et al. Feb 2014 A1
20140058668 Trombley et al. Feb 2014 A1
20140058805 Paesler et al. Feb 2014 A1
20140067160 Levien et al. Mar 2014 A1
20140067167 Levien et al. Mar 2014 A1
20140074692 Beerle et al. Mar 2014 A1
20140077285 Noda et al. Mar 2014 A1
20140077326 Koshino et al. Mar 2014 A1
20140091350 Katsuno et al. Apr 2014 A1
20140095061 Hyde Apr 2014 A1
20140111546 Utagawa Apr 2014 A1
20140119993 Rhodes May 2014 A1
20140125500 Baade May 2014 A1
20140125501 Baade May 2014 A1
20140129426 Lamb et al. May 2014 A1
20140143169 Lozito May 2014 A1
20140147280 Kowatsch May 2014 A1
20140157510 Mjelde Jun 2014 A1
20140167821 Yang et al. Jun 2014 A1
20140180567 Fetsch Jun 2014 A1
20140183376 Perkins Jul 2014 A1
20140195261 Rasquinha et al. Jul 2014 A1
20140201064 Jackson et al. Jul 2014 A1
20140210503 Tam Jul 2014 A1
20140215190 Mylius et al. Jul 2014 A1
20140220966 Muetzel et al. Aug 2014 A1
20140267688 Aich et al. Sep 2014 A1
20150006207 Jarvis et al. Jan 2015 A1
20150019270 Jarvis et al. Jan 2015 A1
20150024727 Hale-Pletka et al. Jan 2015 A1
20150032291 Lowrey et al. Jan 2015 A1
20150066362 Meyer et al. Mar 2015 A1
20150067312 Lewandowski et al. Mar 2015 A1
20150168173 Lewis-Evans et al. Jun 2015 A1
20150260529 Petersen Sep 2015 A1
20150332525 Harris et al. Nov 2015 A1
Foreign Referenced Citations (89)
Number Date Country
2609106 Oct 2008 CA
2688263 Dec 2008 CA
2709740 Jul 2009 CA
2712576 Feb 2011 CA
2828835 Apr 2014 CA
2832185 May 2014 CA
2921908 Jul 2007 CN
101192322 Jun 2008 CN
101240734 Aug 2008 CN
101734228 Jun 2010 CN
102779407 Nov 2012 CN
103813477 May 2014 CN
104931066 Sep 2015 CN
4423328 Jan 1996 DE
0096252 Dec 1983 EP
0393935 Oct 1990 EP
0451482 Oct 1991 EP
0519630 Dec 1992 EP
0744727 Nov 1996 EP
0581558 Apr 1997 EP
0795760 Apr 1999 EP
0806632 Apr 1999 EP
0660083 Sep 2000 EP
0795700 Nov 2001 EP
1191500 Mar 2002 EP
0767448 Dec 2002 EP
0785132 May 2003 EP
1324241 Jul 2003 EP
1384635 Jan 2004 EP
0763713 May 2004 EP
1752949 Feb 2007 EP
1777541 Apr 2007 EP
1785744 May 2007 EP
1791101 Feb 2008 EP
1912191 Apr 2008 EP
1944190 Jul 2008 EP
1760655 Sep 2008 EP
2000889 Dec 2008 EP
1870788 Oct 2009 EP
1894779 Nov 2009 EP
1975563 Nov 2009 EP
1975565 Nov 2009 EP
1804223 Dec 2009 EP
1927961 Jan 2010 EP
2154026 Feb 2010 EP
2339562 Jun 2011 EP
2418461 Feb 2012 EP
2528043 Nov 2012 EP
1975566 Dec 2012 EP
1742083 Jan 2013 EP
1895273 Jan 2013 EP
2747004 Jun 2014 EP
2006123891 May 2006 JP
2014170000 Sep 2014 JP
1984001823 May 1984 WO
1998034314 Aug 1998 WO
1999063357 Dec 1999 WO
2000070530 Nov 2000 WO
2001024393 Apr 2001 WO
2001059601 Aug 2001 WO
2001075472 Oct 2001 WO
2002019683 Mar 2002 WO
2002089077 Nov 2002 WO
2003012473 Feb 2003 WO
2003034089 Apr 2003 WO
2003036462 May 2003 WO
2003079717 Sep 2003 WO
2004009473 Jan 2004 WO
2004051594 Jun 2004 WO
2004075090 Sep 2004 WO
2004086076 Oct 2004 WO
2004102536 Nov 2004 WO
2005008603 Jan 2005 WO
2006053566 May 2006 WO
2008034097 Mar 2008 WO
2008118578 Oct 2008 WO
2008141456 Nov 2008 WO
2009058972 May 2009 WO
2009080070 Jul 2009 WO
2009097595 Aug 2009 WO
2009112305 Sep 2009 WO
2009158469 Dec 2009 WO
2011011544 Jan 2011 WO
2011037766 Mar 2011 WO
2011037800 Mar 2011 WO
2011070534 Jun 2011 WO
2013016581 Jan 2013 WO
2014008752 Jan 2014 WO
2014062668 Apr 2014 WO
Non-Patent Literature Citations (21)
Entry
“Dynamic Vehicle Detection Via the Use of Magnetic Field Sensors”, MDPI, Jan. 19, 2016 by Vytautas Markevicius et al. (pp. 9) http://www.mdpi.com/1424-8220/16/1/78/pdf.
“Accuracy and Resource Consumption in Tracking and Location Prediction”, 8th International Symposium, Jul. 2003 by Ouri Wolfson et al. (pp. 4) http://link.springer.com/chapter/10.1007/978-3-540-45072-6_19.
“A Heuristic Moving Vehicle Location Prediction Technique Via Optimal Paths Selection With Aid of Genetic Algorithm and Feed Forward Back Propagation Neural Network”, Journal of Computer Science, Dec. 12, 2012 by Baby Anitha, E. et al. (pp. 9) http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.687.3596&rep=rep1&type=pdf.
“Location Estimation and Trajectory Prediction of Moving Lateral Vehicle Using Two Wheel Shapes Information in 2-D Lateral Vehicle Images by 3-D Computer Vision Techniques”, IEEE Xplore, Sep. 14-19, 2003 by Chih-Chiun Lai et al. (p. 1) http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=1241704.
“Adaptive Location Prediction Strategies Based on a Hierarchical Network Model in a Cellular Mobile Environment”, The Computer Journal, May 1999 by Sajal K. Das et al. (p. 1) https://goo.gl/C27yaT.
“Automatic Transit Tracking, Mapping, and Arrival Time Prediction Using Smartphones”, ACM Digital Library, Nov. 1-4, 2011 by James Biagioni et al. (pp. 14) https://www.cs.uic.edu/˜jakob/papers/easytracker-sensys11.pdf.
“Location Prediction and Queries for Tracking Moving Objects”, IEEE Xplore, 2000 by O. Wolfson et al. (p. 1) http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=839495.
“A Novel Vehicular Location Prediction Based on Mobility Patterns for Routing In Urban VANET”, EURASIP Journal on Wireless Communications and Networking, Dec. 2012 by Guangtao Xue et al. (pp. 28) http://link.springer.com/article/10.1186/1687-1499-2012-222.
“Vision-Based Vehicle Detection System With Consideration of the Detecting Location”, IEEE Xplore, Apr. 3, 2012 by Minkyu Cheon et al. (p. 1) http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6175131.
“A Vehicle Detection Approach Based on Multi-Features Fusion in the Fisheye Images”, IEEE Xplore, Mar. 11-13, 2011 by Guangtao Cheng et al. (p. 1) http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=5763840.
“Save Money on Fleet Fueling Purchases”, Sokolis Group Fuel Managment, Jan. 26, 2011 by Sokolis (p. 1) http://www.sokolisgroup.com/blog/save-money-on-fleet-fueling-purchases/.
“Sensor-based Logistics: Monitoring Shipment Vital Signs in Real Time”, Inbound Logistics, Jun. 2013 by Chris Swearingen (pp. 2) http://www.inboundlogistics.com/cms/article/sensor-based-logistics-monitoring-shipment-vital-signs-in-real-time/.
“Electronic Cargo Tracking System and Solution, Intermodal Real-time Container Tracking and Rail Car Transport Security Tracking System for End-to-End Supply Chain Security System and Tracking Solution”, Cargo Tracking Solution & intermodal Transport Monitoring, Avante International Technology, Inc. in 2001-2015 (pp. 11) http://www.avantetech.com/products/shipping/.
“Sea Container Tracking Methods”, Moving-Australia, 2012 (pp. 3) http://www.moving-australia.co.uk/container/tracking-methods.php.
“GlobalTag for Global Visibility and Tracking”, Global Tracking Technology, in 2015 (pp. 5) http://globaltrackingtechnology.com/globaltag-for-global-visibility.html.
“The Course of the ‘Connected’ Car”, It Is Innovation, Emphasis on safety, Jan. 6, 2013 by Murray Slovick (pp. 4) http://www.ce.org/i3/Features/2013/January-February/The-Course-of-the-Connected-car.aspx.
“Cooperating Embedded Systems and Wireless Sensor Networks”, John Wiley & Sons, Inc., ISBN: 978-1-84821-000-4, Mar. 10, 2008 by Michel Banâtre et al. (pp. 2) http://as.wiley.com/WileyCDA/WileyTitle/productCd-1848210000.html.
“Mitsubishi Motors Develops New Driver Support System”, Mitsubishi Motors, Dec. 15, 1998 (pp. 5) http://www.mitsubishi-motors.com/en/corporate/pressrelease/corporate/detail429.html.
“Vehicle Tracking for an Evasive Manoeuvres Assistant Using Low-Cost Ultrasonic Sensors”, EBSCO Host Connections, 2014, vol. 14 Issue 12, p. 22689, Dec. 2014 by Jiménez, Felipe et al. (p. 1) http://connection.ebscohost.com/c/articles/100145890/vehicle-tracking-evasive-manoeuvres-assistant-using-low-cost-ultrasonic-sensors.
“The End of Demographics: How Marketers Are Going Deeper With Personal Data”, Mashable Journal, in Jul. 1, 2011 by Jamie Beckland (pp. 7) http://mashable.com/2011/06/30/psychographics-marketing/.
“Power cycling 101: Optimizing energy use in advanced sensor products”, Analog Dialogue, vol. 44, Aug. 2010 by Mark Looney (pp. 7) http://www.analog.com/library/analogdialogue/archives/44-08/power_cycling.html.
Related Publications (1)
Number Date Country
20160225072 A1 Aug 2016 US
Provisional Applications (1)
Number Date Country
62145508 Apr 2015 US
Continuations (1)
Number Date Country
Parent 14145914 Dec 2013 US
Child 15095184 US