Data processing: financial – business practice – management – or co – For cost/price
Patent
1996-11-25
1999-04-06
Cosimano, Edward R.
Data processing: financial, business practice, management, or co
For cost/price
364400, 370351, 701 25, 701201, 701202, G06F 1700
Patent
active
058930817
ABSTRACT:
A system for computing a path in a processor readable representation of a network which can minimize an identified cost. The cost can include time, distance, tolls paid, ease of turning, quality of scenery, processing time, waiting time, etc. A user of the pathfinding system can choose one or more categories of elements to avoid. For example, the user may want to avoid toll roads in a map of roads. The costs associated with the elements to avoid includes at least two levels of representation. The two levels of representation include a first level and a second level such that the second level is superior to the first level. The pathfinding system will determine a path which minimizes costs.
REFERENCES:
patent: 5031093 (1991-07-01), Hasegawa
patent: 5170353 (1992-12-01), Verstraete
patent: 5276768 (1994-01-01), Bander
patent: 5285391 (1994-02-01), Smith, Jr. et al.
patent: 5452294 (1995-09-01), Naterajan
patent: 5495479 (1996-02-01), Galaand et al.
patent: 5521910 (1996-05-01), Matthews
patent: 5523950 (1996-06-01), Petersin
patent: 5600638 (1997-02-01), Bertun et al.
Graphs, Networks, and Algorithms, Swamy, M.N.S. and K. Thulasiraman, K., Publisher: John Wiley & Sons, 1981, pp. 1-592.
Cosimano Edward R.
Etak, Inc.
LandOfFree
Using multiple levels of costs for a pathfinding computation does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Using multiple levels of costs for a pathfinding computation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Using multiple levels of costs for a pathfinding computation will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-1381341