Adjusting insurance policies based on common driving routes and other risk factors

Information

  • Patent Grant
  • 11610270
  • Patent Number
    11,610,270
  • Date Filed
    Friday, June 18, 2021
    3 years ago
  • Date Issued
    Tuesday, March 21, 2023
    a year ago
Abstract
A computer implemented method for providing insurance comprises receiving a plurality of vehicle data including a start point, an end point and a frequency value. The method further comprises analyzing the plurality of vehicle data to determine a driving route associated with the vehicle. The method also comprises determining, based on the frequency value, that the driving route is a common driving route and a risk level of the common driving route. The method further comprises processing one or more insurance options, including pricing and underwriting, based at least in part on the risk level of the common driving route.
Description
FIELD OF THE DISCLOSURE

This disclosure generally relates to insurance premiums and, more particularly, to establishing and using common driving routes for assessing, pricing and provisioning of vehicle insurance.


BACKGROUND

The background description provided herein is for the purpose of generally presenting the context of the disclosure. Work of the presently named inventors, to the extent it is described in this background section, as well as aspects of the description that may not otherwise qualify as prior art at the time of filing, are neither expressly nor impliedly admitted as prior art against the present disclosure.


Insurance companies desire to collect vehicle and driver behavior data for use in enhancing policy holder risk assessment. Many companies employ vehicle monitoring system for a variety of purposes, including determining of insurance risk and/or premiums. These systems may monitor many vehicle attributes, such as location, speed, acceleration/deceleration, etc. The monitoring devices are integrated with the vehicle or plugged into the vehicle systems. Many of these monitoring systems require expert installation into the vehicle and further require the user to periodically withdraw the monitoring device to download the trip data.


SUMMARY

This Summary is provided to introduce a selection of concepts in a simplified form that are further described below in the Detailed Description. This Summary is not intended to identify key features or essential features of the claimed subject matter, nor is it intended to be used to limit the scope of the claimed subject matter.


In an embodiment, a computer implemented method for providing insurance comprises receiving, via a computer network, a plurality of vehicle data, wherein the plurality of vehicle data includes, for a trip of the vehicle, at least a start point, an end point and a frequency value and analyzing, at one or more processors, the plurality of vehicle data to determine a driving route associated with the vehicle including the start point and the end point. The method also includes determining, at the one or more processors, based on the frequency value, that the driving route is a common driving route and determining, at the one or more processors, a risk level of the common driving route. The method further includes processing, at the one or more processors, one or more insurance options, including pricing and underwriting, based at least in part on the risk level of the common driving route.





BRIEF DESCRIPTION OF THE DRAWINGS


FIG. 1 is a block diagram of an example computing system in which the techniques for adjusting insurance policies based on common driving routes and other risk factors can be implemented;



FIG. 2 is a flow diagram of an example method for establishing a common driving route to calculate an insurance quote.



FIG. 3 is a flow diagram of an example method for determining a risk level of a route.



FIG. 4A is a flow diagram of an example method for performing a purchase transaction for an insurance product; and



FIG. 4B is a diagram illustrating an example viewport of a client device displaying a plurality of insurance coverage products; and



FIG. 5 is an exemplary architecture of a data system of a system and method for orienting telematics data.





The figures depict a preferred embodiment of the present invention for purposes of illustration only. One skilled in the art will readily recognize from the following discussion that alternative embodiments of the structures and methods illustrated herein may be employed without departing from the principles of the invention described herein.


DETAILED DESCRIPTION


FIG. 1 illustrates various aspects of an exemplary architecture implementing a system 100 for adjusting insurance policies based on common driving routes and other risk factors. The high-level architecture includes both hardware and software applications, as well as various data communications channels for communicating data between the various hardware and software components. The system 100 for adjusting insurance policies based on common driving routes and other risk factors may include various software and hardware components or modules.


The system 100 for adjusting insurance policies based on common driving routes and other risk factors may include front end components, including a vehicle 102 and a client device 104. The vehicle may include an on board diagnostics connector 106, an odometer 108 and a GPS 110 module for communicating with one or more GPS satellites 111. The vehicle 102 may also include a local network transceiver 112 and/or a cellular network transceiver 114 for communicating with backend components 116 via the computer network 118.


The computer network 118 may be a network such as the Internet or other type of suitable network (e.g., local area network (LAN), a metropolitan area network (MAN), a wide area network (WAN), a mobile, a wired or wireless network, a private network, a virtual private network, etc.). The computer network 118 may also be one or more cellular networks such as code division multiple access (CDMA) network, GSM (Global System for Mobile Communications) network, WiMAX (Worldwide Interoperability for Microwave Access) network, Long Term Evolution (LTE) network, etc.


In some embodiments, the client device 104 may be placed in the vehicle 102. The client device 104 may be a personal computer, a smart phone, a tablet computer, a smart watch, a head mounted display, a wearable computer or other suitable client device. In some embodiments, the client device 104 may also include a GPS module 120 for communicating with the one or more GPS satellites 111. The client device 104 may also include a local network transceiver 122 and/or a cellular network transceiver 124 for communicating with the backend components 116 via the computer network 118. In an embodiment, the client device 102 may also execute one or more applications to allow a customer to manage a customer account, purchase one or more insurance products, view driving statistics, change settings, etc. In some embodiments, both the vehicle 102 and the client device 104 may include additional sensors.


The back end components 116 may include a data server 126 and a database 128. The back end components may communicate with each other through a communication network 130 such as a local area network or other type of suitable network (e.g., the Internet, a metropolitan area network (MAN), a wide area network (WAN), a mobile, a wired or wireless network, a private network, a virtual private network, etc.).


In some embodiments, the system 100 for adjusting insurance policies based on common driving routes and other risk factors in general and the data server 126 in particular may include computer-executable instructions 132. A processor of the data server 126 may execute the instructions 132 to instantiate one or more modules for retrieving and analyzing data from one or more databases 128, as discussed in further detail below. The database 128 may be a data storage device such as random-access memory (RAM), hard disk drive (HDD), flash memory, flash memory such as a solid state drive (SSD), etc.


Turning now to FIG. 2, a flow chart depicts an exemplary method 200 for establishing a common driving route to calculate an insurance quote. At block 202, a processor of a data server (such as the data server 126 illustrated in FIG. 1) may execute an instruction to transmit a plurality of survey questions to a client device (such as the client device 104 illustrated in FIG. 1). For example, the survey questions may be used to acquire common navigation routes, routine travel patterns, accident history, common driving routes, customer driving experience, frequency of activity, etc. The survey may, for example, include questions about age, place of residence and place of employment and routine travel (driving children to school, driving to a vacation home or rental property, driving to the airport, etc.). In some embodiments, instead of or in addition to the survey questions, additional information concerning common navigation routes and/or routine travel patterns may be retrieved from a global positioning system and/or other tracking device/sensors carried by a customer or placed in a vehicle.


At block 204, the data server may receive the driving data in response to the plurality of survey questions and at block 206 the data server may execute an instruction to determine a route from the driving data. At block 208, the processor may execute a further instruction to establish the determined route as a common route and associate the common route with a customer account. In some embodiments, the processor may also execute an instruction to create a customer account if one does not exist. Each route may include a starting point, end point, one or more points in between one or more parking or garaging locations, one or more route segments (such as highways, streets etc.) as well as one or more additional locations (such as a common stop made during the route). At block 210, the processor may also execute an instruction to determine a risk level of a route. The risk level may be a numerical value, such as a percentage, a weighted value, etc. At block 212, the processor may execute an instruction to determine one or more insurance premiums based at least in part on the risk level. In some embodiments, the processor may execute an instruction to calculate one or more price quotes and/or make one or more price quote adjustments.


Turning now to FIG. 3, a flow chart depicts an exemplary method 300 for determining a risk level of a route (i.e., block 210). As discussed above in reference to FIG. 2, a data server may receive a plurality of information concerning driving routes from responses to survey data and/or data received from a vehicle and/or client device. Accordingly, the data server may execute an instruction to process the data and determine a risk level of a route.


At block 302, the processor receives a common route. In some embodiments, the common route may be determined by a processor executing the method 200 as discussed above in reference to FIG. 2. At block 304, the processor may execute an instruction to determine the length of the route and at block 306 the processor may execute an instruction to assign a risk score to the route length. For example, a longer route may have a lower risk score because there is more opportunity for accidents to happen, where the longer route also includes higher traffic rates, accident rates, or similar historical data as described at block 308, below. In some embodiments, the instruction executed by the processor may also account for how often the customer uses the common route (daily, weekly, etc.). As will be discussed below, the instruction executed by the processor may also take into consideration additional risk factors throughout the route and balance the additional risk factors with the length of the route.


At block 308, the processor may execute an instruction to determine if one or more dangerous factors exist within the common route. If the processor executing the instructions determines that one or more dangerous factors exist within the common route (YES branch of block 308), then at block 310 the processor may execute an instruction to assign a risk score to each of the dangerous factors. More specifically, the processor may access one or more public or private databases and determine if one or more known dangerous locations are within the common route. For example, dangerous factors may include an intersection or street with a high accident rate, a neighborhood with a higher than average crime rate, a more dangerous type of road (for example a highway may have more accidents than a side street), the population density of the surrounding area (city, suburban, rural, etc.). Furthermore, the dangerous factor may include the customer's experience driving in certain conditions. For example, a driver may move to a new urban neighborhood and have a common route that includes driving in an urban environment, but does not have significant experience in an urban driving environment. In some embodiments, the processor may also execute an instruction to take both travel patterns and the overall risk of the common route into consideration and may consider the entire route including start/end points and one or more points in between. For example, a route taken from the suburbs to a city may be riskier than a route taken from one part of the city to another part of the city. If the processor executing the instructions determines that no dangerous factors exist within the common route (NO branch of block 308), then the processor may move directly to block 312.


In any event, at block 312 the processor may retrieve an accident history corresponding to the vehicle, route and/or customer account and at block 314 the processor may execute an instruction to determine if any relevant danger factors exist in the accident history. For example, even if the vehicle was not involved in an accident, the accident report may indicate that a particular area of a route has a certain level of accidents. The processor may retrieve the accident history by accessing one or more public or private databases and determine if one or more known dangerous locations are within the common route. If the processor executing an instruction determines that one or more relevant danger factors exist in the accident history (YES branch of block 314), at block 316, the processor may execute an instruction to assign a risk score to each danger factor in the accident history. If the processor executing the instruction determines that no danger factors exist in the accident history (NO branch of block 314), then the processor may move directly to block 318.


At block 318, the processor may determine one or more parking locations corresponding to the start point and/or the end point or one or more points in between of the common route. In some embodiments, the response to the survey questions may indicate a parking location frequently used. In some embodiments, the processor may analyze GPS data in order to determine the one or more parking locations. For example, the customer may park in a residential garage, a commercial garage, a parking lot, street parking etc. If the processor executing the instruction determines that one or more parking locations exist in the common route (YES branch of block 318), at block 320, the processor may execute an instruction to assign a risk score to each parking location. For example, a parking location of a residential garage may be considered safer than a commercial garage, which may in turn be considered safer than street parking. If the processor executing the instruction determines that no parking locations exist in the common route (NO branch of block 318), then the processor may move directly to block 322.


In some embodiments, the processor may also execute an instruction to determine if any other risk factors are present and execute an instruction to assign a risk score to the one or more other risk factors. For example, other risk factors may include sensor data received from the vehicle such as a check engine light being active, current weather patterns, etc. Other risk factors may also include, a traversed intersection, a road type, a road hilliness, a road curviness, a road shoulder access, a number of stoplights, a number of stop signs, a roadside hazard and wherein at least one of the risk factors corresponds to at least one of the start point, the end point or one or more points in between the start point and the end point of the common driving route


At block 322, the processor may execute an instruction to calculate the total score for the common route. In some embodiments the total score may include scores for the length of the common route, frequency of use of the common route, one or more dangerous factors within the common route, accident history and parking locations, etc. At block 324 the processor may execute an instruction to adjust a price quote based on the total score. In some embodiments, the processor may first calculate a price quote and then adjust the price quote. The processor may also execute an instruction to process one or more insurance options, including pricing and underwriting, based at least in part on the risk level of the common driving route


Referring now to FIG. 4A, a flow chart depicts an exemplary method 400 for performing a purchase transaction for an insurance product. As previously discussed in reference to the method 200 and method 300, information relating to a common route of a customer may be used to determine a risk level of a route and be used to adjust a price quote associated with the customer/vehicle. The method 400 may be used to present a price quote for an insurance product to a customer and perform a purchase transaction for the insurance product.


At block 402 a processor of a data server, (such as the data server 126 described in reference to FIG. 1), may execute an instruction to transmit a plurality of insurance coverage products to a client device. After transmitting the plurality of insurance coverage products to the client device, a processor of the client device may display the plurality of insurance coverage products within a viewport of the client device. For example, turning briefly to the client device 450 illustrated in FIG. 4A, the insurance products may include different coverage types associated with vehicle insurance, such as liability coverage, medical payments coverage, collision coverage, comprehensive coverage and emergency road service. Of course, these are only example insurance products and those skilled in the art will recognize that other types of insurance products may be transmitted to the client device during operation of the method 400.


A user may make an input selection of an insurance coverage product and a processor of the client device may receive the input selection and transmit the input selection to the data server. At block 404 the processor may receive an input selection of an insurance product from the client device in response to the transmission. At block 406, the processor may execute an instruction to determine one or more insurance premiums corresponding to the received input selection based at least in part on the risk level of a route. For example, the processor may execute an instruction incorporating one or more steps from the method 300 in determining the one or more insurance premiums. The processor may also execute an instruction to transmit the one or more insurance premiums to the client device. At block 408, the processor may further execute an instruction to perform a purchase transaction for the insurance product.


Referring now to FIG. 5, a data system 500 includes a controller 502. Exemplary data systems include the vehicle 102, the client device 104 and the data server 118 as illustrated in FIG. 1. The controller 502 includes a program memory 504, a microcontroller or a microprocessor (μP) 506, a random-access memory (RAM) 508, and an input/output (I/O) circuit 510, all of which are interconnected via an address/data bus 512. The program memory 504 may store computer-executable instructions, which may be executed by the microprocessor 506. In some embodiments, the controller 502 may also include, or otherwise be communicatively connected to, a database 514 or other data storage mechanism (e.g., one or more hard disk drives, optical storage drives, solid state storage devices, etc.). It should be appreciated that although FIG. 5 depicts only one microprocessor 506, the controller 502 may include multiple microprocessors 506. Similarly, the memory 504 of the controller 502 may include multiple RAMs 516 and multiple program memories 518, 518A and 518B storing one or more corresponding server application modules, according to the controller's particular configuration.


Although FIG. 5 depicts the I/O circuit 510 as a single block, the I/O circuit 510 may include a number of different types of I/O circuits (not depicted), including but not limited to, additional load balancing equipment, firewalls, etc. The RAM(s) 516, 508 and the program memories 518, 518A and 5188 may be implemented in a known form of computer storage media, including but not limited to, semiconductor memories, magnetically readable memories, and/or optically readable memories, for example, but does not include transitory media such as carrier waves.


The following additional considerations apply to the foregoing discussion. Throughout this specification, plural instances may implement components, operations, or structures described as a single instance. Although individual operations of one or more methods are illustrated and described as separate operations, one or more of the individual operations may be performed concurrently, and nothing requires that the operations be performed in the order illustrated. Structures and functionality presented as separate components in example configurations may be implemented as a combined structure or component. Similarly, structures and functionality presented as a single component may be implemented as separate components. These and other variations, modifications, additions, and improvements fall within the scope of the subject matter of the present disclosure.


Additionally, certain embodiments are described herein as including logic or a number of components, modules, or mechanisms. Modules may constitute either software modules (e.g., code stored on a machine-readable medium) or hardware modules. A hardware module is tangible unit capable of performing certain operations and may be configured or arranged in a certain manner. In example embodiments, one or more computer systems (e.g., a standalone, client or server computer system) or one or more hardware modules of a computer system (e.g., a processor or a group of processors) may be configured by software (e.g., an application or application portion) as a hardware module that operates to perform certain operations as described herein.


A hardware module may comprise dedicated circuitry or logic that is permanently configured (e.g., as a special-purpose processor, such as a field programmable gate array (FPGA) or an application-specific integrated circuit (ASIC)) to perform certain operations. A hardware module may also comprise programmable logic or circuitry (e.g., as encompassed within a general-purpose processor or other programmable processor) that is temporarily configured by software to perform certain operations. It will be appreciated that the decision to implement a hardware module in dedicated and permanently configured circuitry or in temporarily configured circuitry (e.g., configured by software) may be driven by cost and time considerations.


Accordingly, the term hardware should be understood to encompass a tangible entity, be that an entity that is physically constructed, permanently configured (e.g., hardwired), or temporarily configured (e.g., programmed) to operate in a certain manner or to perform certain operations described herein. Considering embodiments in which hardware modules are temporarily configured (e.g., programmed), each of the hardware modules need not be configured or instantiated at any one instance in time. For example, where the hardware modules comprise a general-purpose processor configured using software, the general-purpose processor may be configured as respective different hardware modules at different times. Software may accordingly configure a processor, for example, to constitute a particular hardware module at one instance of time and to constitute a different hardware module at a different instance of time.


Hardware and software modules can provide information to, and receive information from, other hardware and/or software modules. Accordingly, the described hardware modules may be regarded as being communicatively coupled. Where multiple of such hardware or software modules exist contemporaneously, communications may be achieved through signal transmission (e.g., over appropriate circuits and buses) that connect the hardware or software modules. In embodiments in which multiple hardware modules or software are configured or instantiated at different times, communications between such hardware or software modules may be achieved, for example, through the storage and retrieval of information in memory structures to which the multiple hardware or software modules have access. For example, one hardware or software module may perform an operation and store the output of that operation in a memory device to which it is communicatively coupled. A further hardware or software module may then, at a later time, access the memory device to retrieve and process the stored output. Hardware and software modules may also initiate communications with input or output devices, and can operate on a resource (e.g., a collection of information).


The various operations of example methods described herein may be performed, at least partially, by one or more processors that are temporarily configured (e.g., by software) or permanently configured to perform the relevant operations. Whether temporarily or permanently configured, such processors may constitute processor-implemented modules that operate to perform one or more operations or functions. The modules referred to herein may, in some example embodiments, comprise processor-implemented modules.


Similarly, the methods or routines described herein may be at least partially processor-implemented. For example, at least some of the operations of a method may be performed by one or processors or processor-implemented hardware modules. The performance of certain of the operations may be distributed among the one or more processors, not only residing within a single machine, but deployed across a number of machines. In some example embodiments, the processor or processors may be located in a single location (e.g., within a home environment, an office environment or as a server farm), while in other embodiments the processors may be distributed across a number of locations.


The one or more processors may also operate to support performance of the relevant operations in a “cloud computing” environment or as an SaaS. For example, as indicated above, at least some of the operations may be performed by a group of computers (as examples of machines including processors), these operations being accessible via a network (e.g., the Internet) and via one or more appropriate interfaces (e.g., APIs).


The performance of certain of the operations may be distributed among the one or more processors, not only residing within a single machine, but deployed across a number of machines. In some example embodiments, the one or more processors or processor-implemented modules may be located in a single geographic location (e.g., within a home environment, an office environment, or a server farm). In other example embodiments, the one or more processors or processor-implemented modules may be distributed across a number of geographic locations.


Some portions of this specification are presented in terms of algorithms or symbolic representations of operations on data stored as bits or binary digital signals within a machine memory (e.g., a computer memory). These algorithms or symbolic representations are examples of techniques used by those of ordinary skill in the data processing arts to convey the substance of their work to others skilled in the art. As used herein, an “algorithm” or a “routine” is a self-consistent sequence of operations or similar processing leading to a desired result. In this context, algorithms, routines and operations involve physical manipulation of physical quantities. Typically, but not necessarily, such quantities may take the form of electrical, magnetic, or optical signals capable of being stored, accessed, transferred, combined, compared, or otherwise manipulated by a machine. It is convenient at times, principally for reasons of common usage, to refer to such signals using words such as “data,” “content,” “bits,” “values,” “elements,” “symbols,” “characters,” “terms,” “numbers,” “numerals,” or the like. These words, however, are merely convenient labels and are to be associated with appropriate physical quantities.


Unless specifically stated otherwise, discussions herein using words such as “processing,” “computing,” “calculating,” “determining,” “presenting,” “displaying,” or the like may refer to actions or processes of a machine (e.g., a computer) that manipulates or transforms data represented as physical (e.g., electronic, magnetic, or optical) quantities within one or more memories (e.g., volatile memory, non-volatile memory, or a combination thereof), registers, or other machine components that receive, store, transmit, or display information.


As used herein any reference to “one embodiment” or “an embodiment” means that a particular element, feature, structure, or characteristic described in connection with the embodiment is included in at least one embodiment. The appearances of the phrase “in one embodiment” in various places in the specification are not necessarily all referring to the same embodiment.


Some embodiments may be described using the expression “coupled” and “connected” along with their derivatives. For example, some embodiments may be described using the term “coupled” to indicate that two or more elements are in direct physical or electrical contact. The term “coupled,” however, may also mean that two or more elements are not in direct contact with each other, but yet still co-operate or interact with each other. The embodiments are not limited in this context.


As used herein, the terms “comprises,” “comprising,” “includes,” “including,” “has,” “having” or any other variation thereof, are intended to cover a non-exclusive inclusion. For example, a process, method, article, or apparatus that comprises a list of elements is not necessarily limited to only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Further, unless expressly stated to the contrary, “or” refers to an inclusive or and not to an exclusive or. For example, a condition A or B is satisfied by any one of the following: A is true (or present) and B is false (or not present), A is false (or not present) and B is true (or present), and both A and B are true (or present).


In addition, use of the “a” or “an” are employed to describe elements and components of the embodiments herein. This is done merely for convenience and to give a general sense of the description. This description should be read to include one or at least one and the singular also includes the plural unless it is obvious that it is meant otherwise.


Upon reading this disclosure, those of skill in the art will appreciate still additional alternative structural and functional designs for viewport-based contrast adjustment for adjusting insurance policies based on common driving routes and other risk factors. Thus, while particular embodiments and applications have been illustrated and described, it is to be understood that the disclosed embodiments are not limited to the precise construction and components disclosed herein. Various modifications, changes and variations, which will be apparent to those skilled in the art, may be made in the arrangement, operation and details of the method and apparatus disclosed herein without departing from the spirit and scope defined in the appended claims.

Claims
  • 1. A vehicle sensor based vehicular routing system for generating multi-point, user-specific risk-based vehicular routes based on vehicular sensor data received during vehicular operation, the vehicle sensor based vehicular routing system comprising: a server including one or more processors communicatively and remotely coupled, via a communications network, to one or more vehicle sensors onboard a vehicle, the one or more vehicle sensors configured to generate vehicle sensor data during operation of the vehicle as the vehicle navigates a plurality of driving routes;a computer memory communicatively coupled to the server, the computer memory configured to receive the vehicle sensor data during the operation of the vehicle, the vehicle sensor data comprising: (1) a set of points for each of the plurality of driving routes, wherein each point in the set of points defines a geographic location of the vehicle, as driven by a user; and (2) a set of risk factors defining one or more vehicle risks determined, via one or more processors, from the vehicle sensor data; anda vehicle account of the user, the vehicle account implemented on the computer memory,wherein the server is configured to: (a) determine, via the one or more processors and based on the vehicle sensor data, a common driving route of the user having a more frequent set of points from the set of points as compared with each of the plurality of driving routes,(b) associate, within the computer memory, one or more points of a common set of points with a set of risk factors, wherein at least one factor of the set of risk factors corresponds to at least one point of the more frequent set of points,(c) determine, via the one or more processors, a common driving route risk score based on the set of risk factors of the common driving route, wherein the common driving route risk score comprises a risk level specific to the common driving route,(d) associate, via the one or more processors, the vehicle account of the user with the common driving route,(e) generate, via the one or more processors, a plurality of insurance options specific to the risk level of the common driving route and a driving experience of the user,(f) transmit the plurality of insurance options for display and selection on a viewport of a client device of the user, and(g) receive from the client device viewport-based contrast adjustments for adjusting one or more of the plurality of insurance options based on the common driving route and the driving experience of the user and the set of risk factors of the common driving route of the user.
  • 2. The vehicle sensor based vehicular routing system of claim 1, wherein the one or more vehicle risks includes an activated vehicle indicator onboard the vehicle.
  • 3. The vehicle sensor based vehicular routing system of claim 2, wherein the activated vehicle indicator is a check engine light.
  • 4. The vehicle sensor based vehicular routing system of claim 1, wherein the common route risk score comprises scores for a length of the common driving route and frequency of use of the length of the common driving route.
  • 5. The vehicle sensor based vehicular routing system of claim 1, wherein the server is further configured to determine a price quote based on the common route risk score.
  • 6. The vehicle sensor based vehicular routing system of claim 1, wherein the server is further configured to: access a risk database to retrieve a second set of risk factors that correspond to the common set of points of the common driving route, wherein at least one risk factor of the second set of risk factors defines a parking risk factor of a parking location, andassociate, within the computer memory, one or more points of the common set of points with the second set of risk factors, wherein at least the parking risk factor of the second set of risk factors corresponds to at least one point in the common set of points.
  • 7. The vehicle sensor based vehicular routing system of claim 1, wherein an additional risk factor of the set of risk factors is selected from the group consisting of:a traversed intersection;a road type;a road hilliness;a road curviness;a road shoulder access;a number of stoplights;a number of stop signs; anda roadside hazard.
  • 8. The vehicle sensor based vehicular routing system of claim 1, wherein the server is further configured to: access a risk database to retrieve a third set of risk factors that correspond to the common set of points of the common driving route, wherein at least one risk factor of the third set of risk factors defines a dangerous factor for the driving experience of the user driving in an urban environment, andassociate, within the computer memory, one or more points of the common set of points with the third set of risk factors, wherein at least the dangerous factor of the third set of risk factors corresponds to at least one point in the common set of points.
  • 9. A vehicle sensor based vehicular routing method for generating multi-point, user-specific risk-based vehicular routes based on vehicular sensor data received during vehicular operation, the vehicle sensor based vehicular routing method comprising: (a) determining, by one or more processors and based on vehicle sensor data of a vehicle, a common driving route of a user having a more frequent set of points selected from a plurality of driving routes,wherein the one or more processors are communicatively and remotely coupled, via a communications network, to one or more vehicle sensors onboard the vehicle, the one or more vehicle sensors configured to generate the vehicle sensor data during operation of the vehicle as the vehicle navigates the plurality of driving routes, andwherein the vehicle sensor data comprises: (1) a set of points for each of the plurality of driving routes, wherein each point in the set of points defines a geographic location of the vehicle, as driven by a user; and (2) a set of risk factors defining one or more vehicle risks determined, via one or more processors, from the vehicle sensor data,(b) associating, within a computer memory, one or more points of the common set of points with a set of risk factors, wherein at least one factor of the set of risk factors corresponds to at least one point of the more frequent set of points,wherein the computer memory is communicatively coupled to the one or more processors and is configured to receive the vehicle sensor data during the operation of the vehicle;(c) determining, via the one or more processors, a common driving route risk score based on the set of risk factors of the common driving route, wherein the common driving route risk score comprises a risk level specific to the common driving route;(d) associating, via the one or more processors and within the computer memory, a vehicle account of the user with the common driving route;(e) generating, via the one or more processors, a plurality of insurance options specific to the risk level of the common driving route and a driving experience of the user;(f) transmitting the plurality of insurance options for display and selection on a viewport of a client device of the user; and(g) receiving viewport-based contrast adjustments from the client device for adjusting one or more of the plurality of insurance options based on the common driving route and the driving experience of the user and the set of risk factors of the common driving route of the user.
  • 10. The vehicle sensor based vehicular routing method of claim 9, wherein the one or more vehicle risks includes an activated vehicle indicator onboard the vehicle.
  • 11. The vehicle sensor based vehicular routing method of claim 10, wherein the activated vehicle indicator is a check engine light.
  • 12. The vehicle sensor based vehicular routing method of claim 9, wherein the common route risk score comprises scores for a length of the common driving route and frequency of use of the length of the common driving route.
  • 13. The vehicle sensor based vehicular routing method of claim 9 further comprising determining a price quote based on the common route risk score.
  • 14. The vehicle sensor based vehicular routing method of claim 9 further comprising: accessing a risk database to retrieve a second set of risk factors that correspond to the common set of points of the common driving route, wherein at least one risk factor of the second set of risk factors defines a parking risk factor of a parking location; andassociating, within the computer memory, one or more points of the common set of points with the second set of risk factors, wherein at least the parking risk factor of the second set of risk factors corresponds to at least one point in the common set of points.
  • 15. The vehicle sensor based vehicular routing method of claim 9, wherein an additional risk factor of the set of risk factors is selected from the group consisting of:a traversed intersection;a road type;a road hilliness;a road curviness;a road shoulder access;a number of stoplights;a number of stop signs; anda roadside hazard.
  • 16. The vehicle sensor based vehicular routing method of claim 9 further comprising: accessing a risk database to retrieve a third set of risk factors that correspond to the common set of points of the common driving route, wherein at least one risk factor of the third set of risk factors defines a dangerous factor for the driving experience of the user driving in an urban environment; andassociating, within the computer memory, one or more points of the common set of points with the third set of risk factors, wherein at least the dangerous factor of the third set of risk factors corresponds to at least one point in the common set of points.
  • 17. A tangible, non-transitory computer-readable medium storing instructions for generating multi-point, user-specific risk-based vehicular routes based on vehicular sensor data received during vehicular operation, that when executed by one or more processors cause the one or more processors to: (a) determine, based on vehicle sensor data of a vehicle, a common driving route of a user having a more frequent set of points selected from a plurality of driving routes,wherein the one or more processors are communicatively and remotely coupled, via a communications network, to one or more vehicle sensors onboard the vehicle, the one or more vehicle sensors configured to generate the vehicle sensor data during operation of the vehicle as the vehicle navigates the plurality of driving routes, andwherein the vehicle sensor data comprises: (1) a set of points for each of the plurality of driving routes, wherein each point in the set of points defines a geographic location of the vehicle, as driven by a user; and (2) a set of risk factors defining one or more vehicle risks determined from the vehicle sensor data,(b) associate, within a computer memory, one or more points of the common set of points with a set of risk factors, wherein at least one factor of the set of risk factors corresponds to at least one point of the more frequent set of points,wherein the computer memory is communicatively coupled to the one or more processors and is configured to receive the vehicle sensor data during the operation of the vehicle;(c) determine a common driving route risk score based on the set of risk factors of the common driving route, wherein the common driving route risk score comprises a risk level specific to the common driving route;(d) associate, within the computer memory, a vehicle account of the user with the common driving route;(e) generate a plurality of insurance options specific to the risk level of the common driving route and a driving experience of the user;(f) transmit the plurality of insurance options for display and selection on a viewport of a client device of the user; and(g) receive viewport-based contrast adjustments from the client device for adjusting one or more of the plurality of insurance options based on the common driving route and the driving experience of the user and the set of risk factors of the common driving route of the user.
  • 18. The tangible, non-transitory computer-readable medium of claim 17, wherein the one or more vehicle risks includes an activated vehicle indicator onboard the vehicle.
  • 19. The tangible, non-transitory computer-readable medium of claim 18, wherein the activated vehicle indicator is a check engine light.
  • 20. The tangible, non-transitory computer-readable medium of claim 17, wherein the common route risk score comprises scores for a length of the common driving route and frequency of use of the length of the common driving route.
CROSS-REFERENCE TO RELATED APPLICATIONS

This application claims the benefit of U.S. application Ser. No. 14/203,143 (filed on Mar. 10, 2014), which claims priority to U.S. Provisional Application No. 61/775,652, filed Mar. 10, 2013. The entirety of each of the foregoing applications is incorporated by reference herein.

US Referenced Citations (276)
Number Name Date Kind
4303904 Chasek Dec 1981 A
5310999 Claus et al. May 1994 A
5319611 Korba Jun 1994 A
5499182 Ousborne Mar 1996 A
5550551 Alesio Aug 1996 A
5797134 McMillan et al. Aug 1998 A
5819230 Christie et al. Oct 1998 A
5916287 Arjomand et al. Jun 1999 A
6064970 McMillan et al. May 2000 A
6313791 Klanke Nov 2001 B1
6408232 Cannon et al. Jun 2002 B1
6434510 Callaghan Aug 2002 B1
6718235 Borugian Apr 2004 B1
6741168 Webb et al. May 2004 B2
6831993 Lemelson et al. Dec 2004 B2
6832141 Skeen et al. Dec 2004 B2
6856933 Callaghan Feb 2005 B1
6868386 Henderson et al. Mar 2005 B1
7194347 Harumoto et al. Mar 2007 B2
7343306 Bates Mar 2008 B1
7343310 Stender Mar 2008 B1
7571128 Brown Aug 2009 B1
7650210 Breed Jan 2010 B2
7659827 Gunderson et al. Feb 2010 B2
7692552 Harrington et al. Apr 2010 B2
7724145 Batra et al. May 2010 B2
7725348 Allen et al. May 2010 B1
7812712 White et al. Oct 2010 B2
7860764 Alexander et al. Dec 2010 B1
7865378 Gay Jan 2011 B2
7870010 Joao Jan 2011 B2
7873455 Arshad et al. Jan 2011 B2
7890355 Gay et al. Feb 2011 B2
7930098 Huang et al. Apr 2011 B2
7937278 Cripe et al. May 2011 B1
7991629 Gay et al. Aug 2011 B2
8027853 Kazenas Sep 2011 B1
8056538 Harnack et al. Nov 2011 B2
8086523 Palmer Dec 2011 B1
8090598 Bauer et al. Jan 2012 B2
8140358 Ling et al. Mar 2012 B1
8240480 Shaw et al. Aug 2012 B2
8280752 Cripe et al. Oct 2012 B1
8311858 Everett et al. Nov 2012 B2
8332242 Medina, III Dec 2012 B1
8352118 Mittelsteadt et al. Jan 2013 B1
8359213 Berg et al. Jan 2013 B2
8359259 Berg et al. Jan 2013 B2
8407139 Palmer Mar 2013 B1
8423239 Blumer et al. Apr 2013 B2
8489433 Altieri Jul 2013 B2
8508353 Cook et al. Aug 2013 B2
8527146 Jackson et al. Sep 2013 B1
8538785 Coleman et al. Sep 2013 B2
8538789 Blank et al. Sep 2013 B1
8566126 Hopkins, III Oct 2013 B1
8569141 Huang et al. Oct 2013 B2
8605948 Mathony et al. Dec 2013 B2
8606512 Bogovich Dec 2013 B1
8606514 Rowley Dec 2013 B2
8612139 Wang Dec 2013 B2
8630768 McClellan et al. Jan 2014 B2
8635091 Amigo et al. Jan 2014 B2
8655544 Fletcher et al. Feb 2014 B2
8682699 Collins Mar 2014 B2
8686844 Wine Apr 2014 B1
8725408 Hochkirchen et al. May 2014 B2
8731768 Fernandes et al. May 2014 B2
8744642 Nemat-Nasser et al. Jun 2014 B2
8781900 Schwarz et al. Jul 2014 B2
8799035 Coleman et al. Aug 2014 B2
8799036 Christensen et al. Aug 2014 B1
8812330 Cripe et al. Aug 2014 B1
8874477 Hoffberg Oct 2014 B2
8892451 Everett et al. Nov 2014 B2
8935036 Christensen et al. Jan 2015 B1
8983677 Wright et al. Mar 2015 B2
8989914 Nemat-Nasser et al. Mar 2015 B1
9008956 Hyde et al. Apr 2015 B2
9031545 Srey et al. May 2015 B1
9053469 Bohanek et al. Jun 2015 B1
9098367 Ricci Aug 2015 B2
9105066 Gay et al. Aug 2015 B2
9141582 Brinkmann et al. Sep 2015 B1
9141995 Brinkmann Sep 2015 B1
9141996 Christensen et al. Sep 2015 B2
9164957 Hassib et al. Oct 2015 B2
9183441 Blumer et al. Nov 2015 B2
9208525 Hayward et al. Dec 2015 B2
9221428 Kote et al. Dec 2015 B2
9235750 Sutton et al. Jan 2016 B1
9256991 Crawford Feb 2016 B2
9311271 Wright Apr 2016 B2
9418383 Hayward et al. Aug 2016 B1
9454786 Srey et al. Sep 2016 B1
9633487 Wright Apr 2017 B2
9646347 Hayward et al. May 2017 B1
9665997 Morgan et al. May 2017 B2
9734537 Christensen et al. Aug 2017 B2
9779458 Hayward et al. Oct 2017 B2
10192369 Wright Jan 2019 B2
10198879 Wright Feb 2019 B2
20010044733 Lee et al. Nov 2001 A1
20020026394 Savage et al. Feb 2002 A1
20020111725 Burge Aug 2002 A1
20020128985 Greenwald Sep 2002 A1
20020198843 Wang et al. Dec 2002 A1
20030112133 Webb et al. Jun 2003 A1
20030191581 Ukai Oct 2003 A1
20030209893 Breed et al. Nov 2003 A1
20030229528 Nitao et al. Dec 2003 A1
20030236686 Matsumoto et al. Dec 2003 A1
20040039611 Hong et al. Feb 2004 A1
20040102984 Wahlbin et al. May 2004 A1
20040117358 von Kaenel et al. Jun 2004 A1
20040153362 Bauer et al. Aug 2004 A1
20040193347 Harumoto et al. Sep 2004 A1
20040225557 Phelan et al. Nov 2004 A1
20050024185 Chuey Feb 2005 A1
20050171663 Mittelsteadt et al. Aug 2005 A1
20050267784 Slen et al. Dec 2005 A1
20050283388 Eberwine et al. Dec 2005 A1
20060049925 Hara et al. Mar 2006 A1
20060053038 Warren et al. Mar 2006 A1
20060059020 Davidson Mar 2006 A1
20060075120 Smit Apr 2006 A1
20060079280 LaPerch Apr 2006 A1
20060095301 Gay May 2006 A1
20060114531 Webb et al. Jun 2006 A1
20060206415 Ross Sep 2006 A1
20060247852 Kortge et al. Nov 2006 A1
20070005404 Raz et al. Jan 2007 A1
20070061173 Gay Mar 2007 A1
20070106539 Gay May 2007 A1
20070124045 Ayoub et al. May 2007 A1
20070156312 Breed et al. Jul 2007 A1
20070156468 Gay et al. Jul 2007 A1
20070226014 Alemayehu et al. Sep 2007 A1
20070256499 Pelecanos et al. Nov 2007 A1
20070268158 Gunderson et al. Nov 2007 A1
20070282638 Surovy Dec 2007 A1
20070288270 Gay et al. Dec 2007 A1
20070299700 Gay et al. Dec 2007 A1
20080018466 Batra et al. Jan 2008 A1
20080027761 Bracha Jan 2008 A1
20080051996 Dunning et al. Feb 2008 A1
20080059019 Delia et al. Mar 2008 A1
20080065427 Helitzer et al. Mar 2008 A1
20080174451 Harrington et al. Jul 2008 A1
20080215376 Engelman Sep 2008 A1
20080243558 Gupte Oct 2008 A1
20080255888 Berkobin et al. Oct 2008 A1
20080294690 McClellan Nov 2008 A1
20090002147 Bloebaum et al. Jan 2009 A1
20090024419 McClellan et al. Jan 2009 A1
20090024458 Palmer Jan 2009 A1
20090043441 Breed Feb 2009 A1
20090094066 Freudman et al. Apr 2009 A1
20090150023 Grau et al. Jun 2009 A1
20090210257 Chalfant et al. Aug 2009 A1
20100030568 Daman Feb 2010 A1
20100066513 Bauchot et al. Mar 2010 A1
20100088123 McCall et al. Apr 2010 A1
20100131302 Collopy et al. May 2010 A1
20100131304 Collopy et al. May 2010 A1
20100138244 Basir Jun 2010 A1
20100185534 Satyavolu et al. Jul 2010 A1
20100223080 Basir et al. Sep 2010 A1
20100238009 Cook Sep 2010 A1
20110022421 Brown et al. Jan 2011 A1
20110040579 Havens Feb 2011 A1
20110106370 Duddle et al. May 2011 A1
20110112717 Resner May 2011 A1
20110125363 Blumer et al. May 2011 A1
20110137685 Tracy et al. Jun 2011 A1
20110153367 Amigo et al. Jun 2011 A1
20110161117 Busque et al. Jun 2011 A1
20110161118 Borden et al. Jun 2011 A1
20110195699 Tadayon et al. Aug 2011 A1
20110200052 Mungo et al. Aug 2011 A1
20110213628 Peak Sep 2011 A1
20110267186 Rao et al. Nov 2011 A1
20110304446 Basson et al. Dec 2011 A1
20110307188 Peng et al. Dec 2011 A1
20120004933 Foladare et al. Jan 2012 A1
20120021386 Anderson et al. Jan 2012 A1
20120029945 Altieri et al. Feb 2012 A1
20120065834 Senart et al. Mar 2012 A1
20120069979 Henry, Jr. et al. Mar 2012 A1
20120072243 Collins et al. Mar 2012 A1
20120072244 Collins et al. Mar 2012 A1
20120089423 Tamir et al. Apr 2012 A1
20120089701 Goel Apr 2012 A1
20120101855 Collins et al. Apr 2012 A1
20120109418 Lorber May 2012 A1
20120109692 Collins et al. May 2012 A1
20120130752 Moskal May 2012 A1
20120158436 Bauer et al. Jun 2012 A1
20120190386 Anderson Jul 2012 A1
20120197669 Kote et al. Aug 2012 A1
20120209632 Kaminski et al. Aug 2012 A1
20120209634 Ling et al. Aug 2012 A1
20120214472 Tadayon et al. Aug 2012 A1
20120226421 Kote et al. Sep 2012 A1
20120259665 Pandhi et al. Oct 2012 A1
20120271661 Reynolds et al. Oct 2012 A1
20120283893 Lee et al. Nov 2012 A1
20120323531 Pascu et al. Dec 2012 A1
20120323772 Michael Dec 2012 A1
20120330499 Scheid et al. Dec 2012 A1
20130006675 Bowne et al. Jan 2013 A1
20130013347 Ling et al. Jan 2013 A1
20130013348 Ling et al. Jan 2013 A1
20130018677 Chevrette Jan 2013 A1
20130035964 Roscoe et al. Feb 2013 A1
20130041521 Basir et al. Feb 2013 A1
20130041621 Smith et al. Feb 2013 A1
20130046510 Bowne et al. Feb 2013 A1
20130046559 Coleman Feb 2013 A1
20130046562 Taylor et al. Feb 2013 A1
20130046646 Malan Feb 2013 A1
20130073114 Nemat-Nasser et al. Mar 2013 A1
20130084847 Tibbitts et al. Apr 2013 A1
20130110310 Young May 2013 A1
20130117050 Berg et al. May 2013 A1
20130144474 Ricci Jun 2013 A1
20130144657 Ricci Jun 2013 A1
20130151064 Becker et al. Jun 2013 A1
20130161110 Furst Jun 2013 A1
20130166098 Lavie et al. Jun 2013 A1
20130166326 Lavie et al. Jun 2013 A1
20130188794 Kawamata et al. Jul 2013 A1
20130189660 Mangum et al. Jul 2013 A1
20130211662 Blumer et al. Aug 2013 A1
20130226624 Blessman et al. Aug 2013 A1
20130244210 Nath et al. Sep 2013 A1
20130262530 Collins et al. Oct 2013 A1
20130289819 Hassib et al. Oct 2013 A1
20130297387 Michael Nov 2013 A1
20130304276 Flies Nov 2013 A1
20130304515 Gryan et al. Nov 2013 A1
20130317693 Jefferies et al. Nov 2013 A1
20130325519 Tracy et al. Dec 2013 A1
20130344856 Silver et al. Dec 2013 A1
20130345896 Blumer et al. Dec 2013 A1
20140012604 Allen, Jr. Jan 2014 A1
20140019167 Cheng et al. Jan 2014 A1
20140019170 Coleman et al. Jan 2014 A1
20140025401 Hagelstein et al. Jan 2014 A1
20140046701 Steinberg et al. Feb 2014 A1
20140052479 Kawamura Feb 2014 A1
20140058761 Freiberger et al. Feb 2014 A1
20140074345 Gabay et al. Mar 2014 A1
20140074402 Hassib Mar 2014 A1
20140089101 Meller Mar 2014 A1
20140108058 Bourne et al. Apr 2014 A1
20140111647 Atsmon et al. Apr 2014 A1
20140114696 Amigo et al. Apr 2014 A1
20140180723 Cote Jun 2014 A1
20140180727 Freiberger et al. Jun 2014 A1
20140257863 Maastricht Sep 2014 A1
20140257865 Gay et al. Sep 2014 A1
20140257866 Gay et al. Sep 2014 A1
20140257867 Gay et al. Sep 2014 A1
20140257868 Hayward et al. Sep 2014 A1
20140257869 Binion et al. Sep 2014 A1
20140257870 Cielocha et al. Sep 2014 A1
20140257871 Christensen et al. Sep 2014 A1
20140257872 Christensen et al. Sep 2014 A1
20140257873 Hayward et al. Sep 2014 A1
20140257874 Hayward et al. Sep 2014 A1
20140278574 Barber Sep 2014 A1
20140304011 Yager et al. Oct 2014 A1
20140310028 Christensen et al. Oct 2014 A1
20160086393 Collins et al. Mar 2016 A1
20160225098 Helitzer et al. Aug 2016 A1
Foreign Referenced Citations (2)
Number Date Country
WO-2008125376 Oct 2008 WO
WO-2010062899 Jun 2010 WO
Non-Patent Literature Citations (5)
Entry
Falk, T.: Ice Sensors in Cars Warns of Slippery Roads, Jan. 25, 2013, ZDNET, pp. 1-4 (Year: 2013).
Wang et al.: Understanding Road Usage Patterns in Urban Areas, Oct. 29, 2012, Scientific Reports, pp. 1-6 (Year: 2012).
Technical Reasearch Centre of Finland (VTT): Slippery Surface? Ice detector warns drivers in advance, Jan. 23, 2013, pp. 1-3 (Year: 2013).
Classic Car Feature Article “Insurance by the Mile”, Article #102504, by Jack Nerad for Driving Today, downloaded from the Internet at: <http://www.antiquecar.com/feature-insurance _by_ the_ mile.php> (Oct. 25, 2004).
Mihailescu, An assessment Charter airline benefits for Port Elizabeth and the Eastern Cape, Chinese Business Review, pp. 34-45 (Feb. 2010).
Related Publications (1)
Number Date Country
20210312565 A1 Oct 2021 US
Provisional Applications (1)
Number Date Country
61775652 Mar 2013 US
Continuations (1)
Number Date Country
Parent 14203143 Mar 2014 US
Child 17351662 US