US5475387A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Travelling course searching apparatus for vehicle
Assignee: Honda Motor Co Ltd
•
Filing: 1995-01-06
•
Granted: 1995-12-12
•
Expires: 2015-01-06
Abstract
Abstract Disclosed is a vehicle travelling searching apparatus for finding an optimal course between two points preset on a road map by searching optimal partial course components on the basis of digitized road map data by use of a synthetically evaluating function including a plurality of travelling-cost-related variable parameters, changing over weight coefficients of the parameters or the function itself to adequate coefficients or function for each partial searching condition.
Inventors
- 👤 Yoshiyuki Matsumoto
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-24 03:52
CPC Classifications
G; G01; G01C; G01C21/00; G01C21/26; G01C21/34; G01C21/3453; G01C21/3446
Claims Analysis
Total Claims: 15
Claim 1
Independent Claim
219 words
A vehicular travel course searching apparatus for identifying a course connecting two selected points on a road map depicted on a display screen by using selected functions for evaluating a course of travel, said functions including parameters representing a plurality of travelling costs including at least a travelling distance cost and a road width cost, each parameter having a variable weight coefficient, said course searching apparatus comprising: a signal processing unit electronically coupled to a display, a data entry device, a travel path memory, and a memory read-out device, said memory read-out device being electronically coupled to a road map data memory; and said signal processing unit including first processing means for identifying a main course formed by a main road between two points adjacent to said selected points, said first processing means processing data of a main road map using a first selected function for evaluating a travelling course and being initialized such that increased weight is assigned to a road width cost parameter; and second processing means for identifying course components connecting, respectively, said selected points with said identified main course, said second processing means processing data representing a detailed local road map using a second selected function for evaluating a travelling course, and being initialized such that increased weight is assigned to a distance cost parameter.
Claim 2
Dependent Claim
219 words
A vehicular travel course searching apparatus for identifying a course connecting two selected points on a road map depicted on a display screen by using selected functions for evaluating a course of travel, said functions including parameters representing a plurality of travelling costs including at least a travelling distance cost and a road width cost, each parameter having a variable weight coefficient, said course searching apparatus comprising: a signal processing unit electronically coupled to a display, a data entry device, a travel path memory, and a memory read-out device, said memory read-out device being electronically coupled to a road map data memory; and said signal processing unit including first processing means for identifying a main course formed by a main road between two points adjacent to said selected points, said first processing means processing data of a main road map using a first selected function for evaluating a travelling course and being initialized such that increased weight is assigned to a road width cost parameter; and second processing means for identifying course components connecting, respectively, said selected points with said identified main course, said second processing means processing data representing a detailed local road map using a second selected function for evaluating a travelling course, and being initialized such that increased weight is assigned to a distance cost parameter.
Claim 3
Dependent Claim
207 words
A machine implemented process for identifying an optimal path of travel between two locations represented by first and second points on a road map, said process comprising the steps of: retrieving a first digital representation of said road map from a memory, said first digital representation of said road map having a first degree of detail; identifying a first hierarchical path between said first and second points using a first path evaluation algorithm, said first path evaluation algorithm comprising a first multiple variable travel evaluation function including a plurality of variables of a first weighting; storing data representative of a plurality of nodes of said first hierarchical path within said memory; retrieving a second digital representation of said road map and said data representative of said first hierarchical path from said memory, said second digital representation of said road map having a second degree of detail exceeding said first degree of detail; and identifying a second hierarchical path between said first and second points using a second path evaluation algorithm, said second hierarchical path including at least said nodes of said first hierarchical path, and said second path evaluation algorithm comprising a second multiple variable travel evaluation function including a plurality of variables of a second weighting.
Claim 4
Dependent Claim
207 words
A machine implemented process for identifying an optimal path of travel between two locations represented by first and second points on a road map, said process comprising the steps of: retrieving a first digital representation of said road map from a memory, said first digital representation of said road map having a first degree of detail; identifying a first hierarchical path between said first and second points using a first path evaluation algorithm, said first path evaluation algorithm comprising a first multiple variable travel evaluation function including a plurality of variables of a first weighting; storing data representative of a plurality of nodes of said first hierarchical path within said memory; retrieving a second digital representation of said road map and said data representative of said first hierarchical path from said memory, said second digital representation of said road map having a second degree of detail exceeding said first degree of detail; and identifying a second hierarchical path between said first and second points using a second path evaluation algorithm, said second hierarchical path including at least said nodes of said first hierarchical path, and said second path evaluation algorithm comprising a second multiple variable travel evaluation function including a plurality of variables of a second weighting.
Claim 5
Dependent Claim
32 words
The machine implemented process of claim 2, wherein said first and second multiple variable travel evaluation functions include the same variables, but wherein said variables of said respective functions have different weightings.
Claim 6
Dependent Claim
152 words
A machine implemented process for identifying a path of travel between two locations represented by first and second points on a road map, said process comprising the steps of: retrieving a first representation of said road map from a memory, said first representation of said road map having a first degree of detail; identifying a first path between said first and second points using a first path evaluation algorithm, said first path evaluation algorithm comprising a first multivariable travel evaluation function including a plurality of variables of a first weighting; dividing said first path into a plurality of contiguous path segments; retrieving local representations of said road map corresponding to each of said contiguous path segments from said memory; and identifying local paths based upon said contiguous path segments using one or more local path evaluation algorithms, each said local path evaluation algorithm including a plurality of variables of selected local weightings.
Claim 7
Dependent Claim
152 words
A machine implemented process for identifying a path of travel between two locations represented by first and second points on a road map, said process comprising the steps of: retrieving a first representation of said road map from a memory, said first representation of said road map having a first degree of detail; identifying a first path between said first and second points using a first path evaluation algorithm, said first path evaluation algorithm comprising a first multivariable travel evaluation function including a plurality of variables of a first weighting; dividing said first path into a plurality of contiguous path segments; retrieving local representations of said road map corresponding to each of said contiguous path segments from said memory; and identifying local paths based upon said contiguous path segments using one or more local path evaluation algorithms, each said local path evaluation algorithm including a plurality of variables of selected local weightings.
Claim 8
Dependent Claim
197 words
A travel path identification system comprising: a memory means for storing data representative of a road map; and a microcomputer aided signal processing unit; said microcomputer aided signal processing unit being programmed to retrieve from said memory means data of a first hierarchy representing a first node set comprising said road map; to identify first and second nodes of said first node set, said first and second nodes being the nodes of said first node set nearest to a start point and a target point, respectively, of indicated travel; to identify a first order path between said first and second nodes using a first path evaluation function; to retrieve from said memory means data of a second hierarchy representing a second node set comprising said road map; to identify first and second nodes of a second node set which are nearest to said start point and said target point respectively; and to identify second order paths between said first nodes of said first and second node sets and between said second nodes of said first and second node sets using a second path evaluation function having a weighting of variables different from said first path evaluation function.
Claim 9
Dependent Claim
197 words
A travel path identification system comprising: a memory means for storing data representative of a road map; and a microcomputer aided signal processing unit; said microcomputer aided signal processing unit being programmed to retrieve from said memory means data of a first hierarchy representing a first node set comprising said road map; to identify first and second nodes of said first node set, said first and second nodes being the nodes of said first node set nearest to a start point and a target point, respectively, of indicated travel; to identify a first order path between said first and second nodes using a first path evaluation function; to retrieve from said memory means data of a second hierarchy representing a second node set comprising said road map; to identify first and second nodes of a second node set which are nearest to said start point and said target point respectively; and to identify second order paths between said first nodes of said first and second node sets and between said second nodes of said first and second node sets using a second path evaluation function having a weighting of variables different from said first path evaluation function.
Claim 10
Dependent Claim
157 words
A course searching apparatus for identifying an optimal course connecting two selected points on a road map depicted on a display screen, said course searching apparatus processing a path evaluation function which includes at least two parameters, each parameter having a variable weighting coefficient, and said apparatus comprising: means for processing data representing said road map in a first routine, using said path evaluation function, to identify an optimal main course comprised of one or more main roads between said selected points, and for processing said data representing said road map in a second routine, using said path evaluation function, to identify an optimal local course between each of said selected points and respective end points of said main course; and means for selectively and independently adjusting said weighting coefficients of said parameters of said path evaluation function such that said weighting coefficients may differ when said optimal main course and said optimal local course are identified.
Claim 11
Dependent Claim
157 words
A course searching apparatus for identifying an optimal course connecting two selected points on a road map depicted on a display screen, said course searching apparatus processing a path evaluation function which includes at least two parameters, each parameter having a variable weighting coefficient, and said apparatus comprising: means for processing data representing said road map in a first routine, using said path evaluation function, to identify an optimal main course comprised of one or more main roads between said selected points, and for processing said data representing said road map in a second routine, using said path evaluation function, to identify an optimal local course between each of said selected points and respective end points of said main course; and means for selectively and independently adjusting said weighting coefficients of said parameters of said path evaluation function such that said weighting coefficients may differ when said optimal main course and said optimal local course are identified.
Claim 12
Dependent Claim
26 words
The course searching apparatus of claim 6 wherein said at least two parameters comprise at least a road width cost parameter and a distance cost parameter.
Claim 13
Dependent Claim
308 words
A navigational system for a vehicle comprising: a road map data memory for storing for storing digitized road map data; a memory read-out device electronically coupled to said road map data memory for selectively retrieving road map data corresponding to a selected area of travel from said road map data memory; a microcomputer-aided signal processing unit electronically coupled to said memory read-out device and being programmed to retrieve from said memory read-out device a first digital representation of said selected area of travel, said first digital representation comprising a representation of said selected area of travel having a first degree of detail; to identify a first hierarchical path between a first and second point within said selected area of travel using a first path evaluation algorithm, said first path evaluation algorithm comprising a first multiple variable travel evaluation function including a plurality of variables of a first weighting; to store data representative of said first hierarchical path within a travel path memory; to retrieve from said memory read-out device a second digital representation of said selected area of travel, said second digital representation comprising a representation of said selected area of travel having a second degree of detail exceeding said first degree of detail; to identify a second hierarchical path between said first and second points using a second path evaluation algorithm, said second hierarchical path including at least the nodes of said first hierarchical path, and said second path evaluation algorithm comprising a second multiple variable travel evaluation function including a plurality of variables of a second weighting; a display electronically coupled to said microcomputer-aided signal processing unit for displaying a graphic representation of said selected area of travel; and a data entry device electronically coupled to said microcomputer-aided signal processing unit for providing data defining said first and second points to said microcomputer-aided signal processing unit.
Claim 14
Dependent Claim
308 words
A navigational system for a vehicle comprising: a road map data memory for storing for storing digitized road map data; a memory read-out device electronically coupled to said road map data memory for selectively retrieving road map data corresponding to a selected area of travel from said road map data memory; a microcomputer-aided signal processing unit electronically coupled to said memory read-out device and being programmed to retrieve from said memory read-out device a first digital representation of said selected area of travel, said first digital representation comprising a representation of said selected area of travel having a first degree of detail; to identify a first hierarchical path between a first and second point within said selected area of travel using a first path evaluation algorithm, said first path evaluation algorithm comprising a first multiple variable travel evaluation function including a plurality of variables of a first weighting; to store data representative of said first hierarchical path within a travel path memory; to retrieve from said memory read-out device a second digital representation of said selected area of travel, said second digital representation comprising a representation of said selected area of travel having a second degree of detail exceeding said first degree of detail; to identify a second hierarchical path between said first and second points using a second path evaluation algorithm, said second hierarchical path including at least the nodes of said first hierarchical path, and said second path evaluation algorithm comprising a second multiple variable travel evaluation function including a plurality of variables of a second weighting; a display electronically coupled to said microcomputer-aided signal processing unit for displaying a graphic representation of said selected area of travel; and a data entry device electronically coupled to said microcomputer-aided signal processing unit for providing data defining said first and second points to said microcomputer-aided signal processing unit.
Claim 15
Dependent Claim
52 words
The navigational system of claim 8 wherein said first digital representation of said selected area of travel comprises a representation of highways within said selected area of travel, and wherein said second digital representation of said selected area of travel comprises a representation of local roads within said selected area of travel.
References Cited (Backward Citations)
JPS6282319A
Cited
JPS6282318A
Cited
JPS62133600A
Cited
JPH01138409A
Cited
JPH01173297A
Cited
EP0372840A2
Cited
US5173691A
Cited
US5257023A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1998-12-11 | 1999-06-12 | 1999-12-12 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2002-12-11 | 2003-06-12 | 2003-12-12 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2006-12-11 | 2007-06-12 | 2007-12-12 | $7700.00 | Window Closed / Lapsed |