A VEHICLE ROUTE PLANNING SYSTEM

Abstract: A vehicle route planning system takes a trip origin location and a trip destination location provided by the driver then considers alternative routes, taken from a map (107), between the trip origin location and trip destination location. Certain attributes, such as traffic congestion and concentration intensity, and driver preferences are considered in a fuzzy inferencing device for planning a preferred route.

Description: A VEHICLE ROUTE PLANNING SYSTEM Field of the Invention This invention is directed generally to the field of navigation, and more particularly to a system for vehicle route planning. The present invention is related to U. S. Patent Application No. 07/786500 AN IMPROVED ACCURACY SENSORY SYSTEM FOR VEHICLE NAVIGATION, Seymour et. al. and to U. S. Patent Application No. 07/786450, A VEHICLE ROUTE GUIDANCE SYSTEM, Seymour et. al., both of which were filed on the same date herewith and are assigned to the assignee of the present invention. Background of the Invention Modern vehicular navigation systems combine map databases and dead-reckoning navigation methods with various vehicle route planning schemes in order to route the driver from an initial location to a desired destination location. The vehicle route planning scheme typically has access to a network of road segments in a map database. The initial vehicle location and destination vehicle location are specified before the commencement of each trip. The vehicle route planning scheme plans the route by concatenating road segments to complete a route. Contemporary systems are crisp in nature and do not compensate vehicle route planning for driver preferences such as avoidance of undesired route congestion or the demand for concentration, or concentration intensity, on the driver's part. Also while a route may be the shortest possible, in the case of an emergency, the driver may be better served by taking a longer, faster route. Furthermore, a driver may not like to turn left at any intersection on Friday afternoon when traffic is intense. If the driver wanted to take the scenic route there is no provision in contemporary systems to do so. Although these preferences are important to the driver, analytical or crisp methods of route planning are resource prohibitive for a complete solution to be implemented. Summary of the Invention A vehicle route planning system includes a provided trip origin location and a trip destination location and considers first and second routes, taken from a map, between the trip origin location and the trip destination location and includes first and second attributes and determined driver preferences in a model free selection of a preferred route. Brief Description of the Drawings The present invention will be effectively comprehended when read with the aid of the accompanying drawings in which: FIG. 1 illustrates a block diagram of a navigation computer with fuzzy inferendng providing a physical platform, as described in a preferred embodiment. HG.2 illustrates a fuzzy set describing Congestion as described in a preferred embodiment. FIG. 3 illustrates a fuzzy set describing Concentration Intensity, as described in a preferred embodiment. HG. 4 illustrates a fuzzy set describing Travel Time difference, as described in a preferred embodiment. FIG. 5 illustrates a table of driver preferences, or tolerances, for a variety of trip scenarios, as described in a preferred embodiment. FIG. 6 illustrates a table of truth values, for a variety of route scenarios, as described in a preferred embodiment. FIG. 7 illustrates an inference table for Rule A from TABLE 1, for a variety of route scenarios, as described in a preferred embodiment. FIG. 8 illustrates an inference table for Rule B from TABLE 1, for a variety of route scenarios, as described in a preferred embodiment. FIG. 9 illustrates an inference table for Rule C from TABLE 1, for a variety of route scenarios, as described in a preferred embodiment. FIG. 10 illustrates an inference table for Rule D from TABLE 1, for a variety of route scenarios, as described in a preferred embodiment. FIG. 11 illustrates a table for final blending and Selection or Exclusion of routes based on truth values, as described in a preferred embodiment. Detailed Description of a Preferred Embodiment In a preferred embodiment we disclose a system for considering route attribute and driver preferences in order to improve the convenience of the route planned by the route planning mechanism in an on-vehicle navigation system. The route attributes are represented in a digital map database that includes congested travel time and uncongested travel time and can include historical route congestion, and concentration intensity. The driver preferences are defined by the vehicle driver and include, driver tolerance to congestion, driver tolerance to concentration intensity and a parameter describing a trip's emergency. Alternatively these driver preferences can be provided by historical data, or derived from past driving habits, or defined by other people. The route attributes and driver preferences are all coupled to a navigation computer with a model free mechanism, in this case a fuzzy inferendng engine, designed to select a most convenient, or preferred, route. Of course, it would be obvious to one with ordinary skill in the art to substitute another model free means such as a neural network, genetic learning method, or other model derivable from observations directly rather than by analytical methods. A model free means, as it applies here, is a technique for estimating input-output functions, or stimulus- response assodations based on a non-analytic means. The preferred embodiment applies fuzzy inferendng, based on fuzzy sets, as described by Lotfi Zadah in his landmark treatise "Fuzzy Sets", published in Information and Control, Vol. 8, pages 338 - 353, by the Academic Press, 1965. Referring to FIG. 1 we illustrate a physical platform for the navigation computer with fuzzy inferendng 101, by applying a MVME147SA-2 VME computer board, available from Motorola Inc., Microcomputer Division Marketing Department, MS DW283, 2900 South Diablo Way, Te pe, AZ 850282. This single board computer, or CPU 103 has a 32 MHz 68030 with a 68882 floating point coprocessor, 32 Mb of DRAM, and a battery backed real time dock calendar. A VME bus 105 is a conduit applied to couple various other functions to the CPU 103. Other microprocessor types and platforms are suitable for this task as well. We couple the SCSI bus interface 121 from the CPU 103 to the CDROM 107, a CDU-541 available from Sony, Computer Peripheral Produds Company, Sony Corporation of America 12337 Jones Road Suite 200-17 Houston, TX 77070. The CDROM 107 reads a map database from an optical disk. Henceforth the combination of the CDROM and the map database will be referred to as a map database and by denoted by 107. We then couple a data radio 135 to the CPU 103, via an RS- 232C link 133, as an alternative, or additional mechanism for receiving route attribute information such as active traffic information. This radio 135 is the Coverage Plus Simplex 35 Watt Radio, Model Number D45AHA5GB1AK, available from Motorola, Inc. Communications Sector 1303 Algonquin Road, Schaumburg, IL 60196. This radio 135 communicates with the base station system 139, via airwaves 137. The base station system 139 broadcasts relevant route attribute information, such as traffic congestion to the data radio 135. Of course, other data radio's and systems such as the European Radio Data Service, and other Traffic Information Center infrastructures can be applied. And finally a portable PC, or laptop computer 131 is coupled to the CPU 103 through an RS-232C port, 129. This laptop computer 131 is applied to receive input from the vehide operator, or driver, and display relevant navigation information. An Apple Macintosh PowerBook 170, available from Apple Computer Inc., 20525 Mariani Avenue, Cupertino, CA 95014 is applied. It's interesting to note that given the laptop computer as an input mechanism, the driver can receive traffic congestion information from a voice radio, or observation, and enter it into the system to augment other route attribute information. The CPU 103 runs the compiled inferendng software developed on an IBM PC host computer using software available from Togai Infralogic, Inc. 30 Corporate Park, Suite 107 Irvine, CA 92714. This software is titled the Fuzzy C development system. Once the fuzzy sets, defined by membership functions, and fuzzy rules are derived using the IBM PC host, the output of the Fuzzy C development system is a standard ANSI C source code. This source code is then compiled by using the M68NNTBGHC SYSTEM V/68 GREEN HILLS C-68000 Compiler, available from Motorola Inc., Microcomputer Division Marketing Department, MS DW283, 2900 South Diablo Way, Tempe, AZ 850282. The output of the compiler is then loaded onto the CPU 103 for application execution. Of course, other embedded software emulations can be used. Alternative fuzzy inferendng system platforms include fuzzy microcontroller circuits, fuzzy coprocessors, analog computational circuits, digital computer circuits, optical computers, spatial light modulators and holograms to name a few. In the preferred embodiment the laptop computer 131 is the mechanism by which the driver inputs the trip origin and trip destination information as well as driver preference information. Of course, a wide variety of input mechanisms, induding a voice input mechanism or other spedalized devices, meeting the intent of the laptop computer 131, can be deployed. The navigation computer with fuzzy inferendng 101 reads the trip origin location and trip destination location from the laptop computer 131. The navigation computer with fuzzy inferendng 101 next queries the map database 107 seeking out all the possible routes between the trip origin and the trip destination. As described earlier, the route attributes are represented in a digital map database that indudes congested travel time and uncongested travel time and can indude historical route congestion, and concentration intensity. Of course, other attributes can be assigned to the routes in the map database 107. For instance, if the routes are hilly, during indement weather, the driver can prefer to avoid those routes. Another example of a route attribute, is that of a bad neighborhood, or a route with a restaurants spedalizing in Lebanese cuisine, or a route with a difficult left turn on a Friday afternoon at 5 PM, or a route with sports bars. Some, or all of these route attributes can be important to the preferences selerted by a specific driver. Of course, as an alternative driver operates the vehide she can choose to input alternative preferences. Note that route attributes such as congestion and or concentration intensity have historically pre- estimated values stored in the map database. Alternatively these attributes can be updated at run time through the data radio 135 and base station 139. Viewing FIG. 5, we see three different trips illustrated with different driver preferences. These can be input by the same driver preparing for three different trips with a variety of preferences, or input by different drivers with different preferences. As previously mentioned, the driver inputs his preferences on the laptop computer 131 for the various categories illustrated including tolerance to congestion, tolerance to concentration intensity and emergency trip. Of course, other attributes as described before can be of interest to the driver and input at this time. In the preferred embodiment, the driver inputs a number between zero and 10 indicating his preference. For the case of Trip 1 501, the driver has seleded a congestion tolerance of 10, 503. This means that the driver has a high tolerance to congestion. The driver has selected a zero tolerance to concentration intensity 505, and a zero value for emergency trip 507. These preferences indicate that the driver is not interested in a route that requires a great deal of concentration to traverse and also that this trip is not an emergency. From this profile of preferences, we can see that the driver prefers no distraction, other than a bumper-to-bumper traffic jam and has plenty of time to drive. In Trip 2 509, the driver has selected a congestion tolerance of 5 511, a concentration intensity tolerance of 5 513, and an emergency trip preference of zero, 515. We can see from this profile that the driver has average tolerance to Congestion and Concentration Intensity and has plenty of time to drive. In Trip 3 517, the driver has selected a congested tolerance of zero 519, a concentration intensity tolerance of 10 521, and an emergency trip preference of 10, 523. We can see from Trip 3 517 profile, that the driver is in a hurry to get from his trip origin to his trip destination, does not want to drive on a congested route, and doesn't mind a concentration intensive route. As we continue our description, we will employ Trip 2 509 and its attendant driver preferences while considering our example of route selection. In HG. 6 we illustrate various attributes for the three routes found in the map database 107 for our trip example. Some of these attributes are truth values from fuzzy sets and some are computed. Considering Route 1 601, when the map database 107 is queried, it returns an average vehide density attribute of 1.5, 603. Turning to FIG. 2, we find a fuzzy set describing the universe of discourse for all congestion attributes. While considering our vehide density attribute 1.5 201 we find a truth, value of 0.6 203 in the Congested fuzzy set, a truth value of 0.4205 in the Not Congested fuzzy set, a truth value of zero 207 in the Very Congested fuzzy set, and a truth value of 1.0 209 in the Not Very Congested fuzzy set. Referring to FIG. 6 we see these truth values in table form. When queried, the map database 107 also provided a historically average value for uncongested travel time of 8 minutes 605 and the historically average congested travel time 16 minutes, 611. The truth, values and travel times for Route 2 613 and Route 3 615 are derived in the same manner as described for Route 1, 601. With the aid of TABLE 1, which shows a descriptive form of the fuzzy rule set employed in the preferred embodiment, we can further understand which fuzzy rules are seleded in this case. Note that the items highlighted by italics are references to truth values used in preceding antecedents of the same rule, the items Capitalized are membership functions representing fuzzy sets and the items in UPPERCASE are formal linguistic operators for describing rules. TABLE 1 A. IF none of the routes are Congested THEN selert the route with the lowest uncongested travel time B. IF some of the routes are Very Congested AND IF there are routes that are Not Very Congested THEN exclude the very congested routes from the selection C. IF a route IS Congested AND IF an alternate route IS Not Congested AND IF the derived travel time of the congested route IS Shorter AND IF the driver has a tolerance to Congestion THEN select the congested route D. IF a route IS Congested AND IF an alternate route IS Not Congested AND IF the trip IS not an emergency trip AND IF the driver has no tolerance To Congestion THEN seled the not congested route After dassifying the route attributes and the driver preferences into the fuzzy sets, yielding the truth values illustrated in FIG. 6, the navigation computer with fuzzy inferendng 101 next seleds at least one fuzzy rule from TABLE 1. Starting with Rule A of TABLE 1, further illustrated in the form of a fuzzy inferendng table in FIG. 7, we consider the first antecedent dause 701, and whether or not the compared routes 703 select this clause 701. As we denoted in FIG. 6 column 617, no two routes are not fully Congested, and therefore, this dause does not fire, resulting in zero truth values 705. As the antecedent dause 1 701 resulted in zero truth values 705 the consequence clause 707 also yields zero truth values 709. We next consider Rule B, illustrated in fuzzy inferendng table in FIG. 8. We again consider the comparison of routes against the antecedent clauses. We find that antecedent dause 2 of Rule B 801 has a truth value of 0.8, 803. This truth value 803 is retrieved from the table in FIG. 6 as the Not Very Congested truth value of Route 2 0.8, 621. While comparing Route 1 versus Route 2, antecedent dause 1 805 yields a zero value from the table in FIG. 6 as a Very Congested truth value for Route 1. Applying the simplest fuzzy AND operator the consequence dause 807 also has a zero truth value as the minimum of zero 813, and 0.8 803, is zero, 809. The fuzzy inferendng table in FIG. 8 is then completed as described earlier. In HG. 9 we find Rule C from TABLE 1 illustrated in fuzzy inferendng table form. This table is filled out with the same procedure as described for the table illustrated in HG. 8. It's interesting to note here the indusion of driver preferences in antecedent dause number 4, 901. The truth value 903 for driver tolerance to congestion of 0.5 903 is derived by normalizing the driver congestion tolerance selection of 511, between a value from zero to 1, in this case, by dividing by 10. While deriving the truth values for antecedent dause 3 905, we need to invoke a crisp calculation then a fuzzification by a table look-up process. The crisp calculation is as follows. where: CTT X is the Congested Travel Time for the not congested route in the antecedent dause 2 in Rule C UCTTx is the Uncongested Travel Time for the not congested route in the antecedent dause 2 in Rule C C x is the Congestion truth value for the not congested route in the antecedent dause 2 in Rule C CTTy is the Congested Travel Time for the congested route in the antecedent dause 1 in Rule C UCTTy is the is the Uncongested Travel Time the congested route in the antecedent clause 1 in Rule C Cy is the Congestion truth value for the congested route in the antecedent dause 1 in Rule C For the case of Route 2 versus Route 1 906, we calculate a 21.88% savings. Referring to HG. 4, we see that a 21.88% savings 401 interseds with a shorter travel time difference fuzzy set to a truth value of 0.8, 403. We then insert this truth value of 0.8 403 into our fuzzy inferendng table HG. 9 as a truth value of 0.8, 907. This crisp calculation then a fuzzification by a table look-up is repeated for the other cases in order to complete the fuzzy inferendng table for Rule C in HG. 9. In HG. 10 we find fuzzy Rule D from TABLE 1 illustrated in fuzzy inferendng table format. This table was filled out in the same manner as the tables illustrated in HG's. 7, 8, and 9, by dassifying the fuzzy variable into the appropriate fuzzy set. The table in HG. 11, illustrates the blending process chosen for the preferred embodiment. Of course, it would be obvious to one of ordinary skill in the art to use other blending processes that satisfy the intent of this discussion. We blend, by first considering Route 1 1101 and the Select Consequences from the fuzzy rules. Rule A in HG. 7 yielded a zero truth value for Seleding Route 1 711 713. Rule B in Fig. 8 also yielded a zero truth value for Selecting Route 1 809 811. Fuzzy Rule C also yielded zero truth values for Route 1 911 913. Fuzzy Rule D yields a Seled Consequence truth value of 0.4 1001, and a Seled Consequence truth value of 0.4, 1003. These values are entered in the Seled Consequence column in HG. 11, 1103. Both the Seled Consequence column 1103 and the Exclude Consequence column 1105 are completed in the same manner for Route 1 1101, Route 21107, and Route 3, 1109. We then blend by selecting a maximum Seled Consequence truth value and subtracting the maximum Exdude Consequence truth value yielding a final truth value. Therefore, for Route 3 1109, we find a maximum Seled Consequence value of 0.3 1111 and subtrad a maximum Exdude Consequence truth value of 0.8 1113 yielding a blended truth value of -0.5, 1115. The Blending column 1117 is completed in the same manner for Route 1 1101 and Route 2, 1107. We then complete the defuzzification process by selecting the route with the highest numeric truth value difference, in this case Route 1 1101 is seleded 1119. In this example we used the Congested attribute from the map database 107. Various driver attributes induding tolerance to congestion, tolerance to concentration intensity, and emergency trip, all provided by the driver through the laptop computer 131. Of course, we could as described earlier, combine the Congested attribute information from the data radio 135 and the base station 139, with, the map database Congested attribute. In HG. 3 we illustrate a fuzzy set describing the universe of discourse for the Concentration Intensity route attribute. In TABLE 2 we introduce a fuzzy rule set considering concentration intensity as a route attribute. Considering these rules and sets will further refine the convenience of the route selection process. TABLE 2 A. IF none of the routes are Concentration Intensive AND IF none of the routes are Congested THEN seled the route with the lowest uncongested travel time B. IF some of the routes are Very Concentration Intensive AND IF there are routes that are Not Very Concentration Intensive AND IF the very concentration intensive routes do not offer Significantly Shorter travel time AND IF the remaining routes are Not Very Congested THEN exclude the very concentration intensive routes from the selection C IF the route IS Concentration Intensive AND IF an alternate route IS Not Concentration Intensive AND IF the concentration intensive route has Shorter travel time AND IF the driver has a tolerance to concentration intensity THEN select the concentration intensive route D. IF a route IS Concentration Intensive AND IF an alternate route IS Not Concentration Intensive AND IF the trip IS not an emergency trip AND IF the driver has a no tolerance to concentration intensity THEN select the not concentration intensive route In condusion, we have illustrated a system for planning a preferred, or more convenient route by taking into account route attributes as well as driver preferences. What is daimed is:

Claims: Claims 1. A vehide route planning system comprising: means for receiving information identifying a trip origin location and a trip destination location; map means, responsive to said received information, for identifying at least a first route and a second route between said identified trip origin location and a trip destination location; means for assigning a first attribute to said first route and a second attribute to said second route; means for determining driver preferences; and model free means, responsive to said means for assigning and said means for determining, for selecting a preferred route from said first and second routes. 2. A vehicle route planning system in accordance with daim 1 wherein said first attribute comprises traffic congestion information associated with said first route. 3. A vehide route planning system in accordance with daim 1 wherein said first attribute comprises traffic concentration intensity information associated with said first route. 4. A vehicle route planning system in accordance with daim 1 wherein said means for assigning comprises a radio ■ transmitter which transmits said first attribute. 5. A vehicle route planning system in accordance with daim 4 further comprising a radio receiver for receiving said first attribute transmitted by said radio transmitter. 6. A vehide route planning system comprising: means for receiving information identifying a trip origin location and a trip destination location; map means, responsive to said received information, for identifying at least a first route and a second route between said identified trip origin location and a trip destination location; means for assigning a first attribute to said first route and a second attribute to said second route; means for determining driver preferences; and fuzzy inferendng means, for dassifying said first attribute and said second attribute into at least one fuzzy set, for dassifying said driver preferences into at least one fuzzy set, for selecting at least one fuzzy rule corresponding to a membership of said first and said second attributes in said at least one fuzzy set, and for choosing a preferred route from said first route and said second route, responsive to said at least one fuzzy rule. 7. A vehicle route planning method comprising the steps of: receiving information identifying a trip origin location and a trip destination location; querying a map, responsive to said step of receiving, for identifying at least a first route and a second route between said identified trip origin location and a trip destination location; assigning a first attribute to said first route and a second attribute to said second route; determining driver preferences; and model free analysis, responsive to said step of assigning and said step of determining, for seleding a preferred route from said first and second routes. 8. A vehide route planning method in accordance with daim 7 wherein said step of assigning a first attribute further comprises assigning traffic congestion information assodated with said first route. 9. A vehide route planning method in accordance with daim 7 wherein said step of assigning a first attribute comprises assigning traffic concentration intensity information associated with said first route. 10. A vehide route planning method in accordance with dai 7 wherein said step of assigning a first attribute further comprises transmitting a radio signal embodying said first attribute. 11. A vehide route planning method in accordance with daim 7 wherein said step of assigning a first attribute further comprises receiving a radio signal embodying said first attribute. 12. A vehicle route planning method comprising: receiving information identifying a trip origin location and a trip destination location; querying a map, responsive to said step of receiving, for identifying at least a first route and a second route between said identified trip origin location and a trip destination location; assigning a first attribute to said first route and a second attribute to said second route; determining driver preferences; and fuzzy inferendng means, for classifying said first attribute and said second attribute into at least one fuzzy set, for dassifying said driver preferences into at least one fuzzy set, for selecting at least one fuzzy rule corresponding to a membership of said first and said second attributes in said at least one fuzzy set, and for choosing a preferred route from said first route and said second route, responsive to said at least one fuzzy rule.

Inventors: BARNEA MICHAEL, KIRSON ALLAN M, SEYMOUR LESLIE G, BARNEA, MICHAEL, KIRSON, ALLAN, M., SEYMOUR, LESLIE, G.
Applicants: MOTOROLA INC, MOTOROLA, INC.
Application year: 1992
Main classification: G06F15
IPC codes: G01C21, G08G1