Systems, methods, and articles of manufacture for flexible...

Data processing: structural design – modeling – simulation – and em – Modeling by mathematical expression

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C703S017000, C707S793000, C701S210000

Reexamination Certificate

active

07464009

ABSTRACT:
A flexible transportation optimization approach is described that can easily be implemented on multi-tiered computer systems and that does not unnecessarily consume processing and memory resources. On a database tier a data model is defined. The data model comprises master data including a state set with a plurality of states representative of physical sites or conditions of a physical entity, wherein each state is assigned to exactly one hierarchy level and wherein to each state zero, one or a plurality of states of lower hierarchy levels are assigned and a transition set with transitions from one state to a state on the same or on a different hierarchy level. On an application tier, a processor performs for at least one given source state and at least one given destination state, repeatedly steps of generating a graph having a plurality of states as vertices, transitions and hierarchical relationships among states as edges, and a cost function, and of subjecting the graph to a path optimization mechanism outputting multiple paths from the at least one source state to the at least one destination state that heuristically influence the generation of the succeeding graph, wherein the one or more solution paths are included in the paths generated during the last repetition.

REFERENCES:
patent: 5285391 (1994-02-01), Smith, Jr. et al.
patent: 5521910 (1996-05-01), Matthews et al.
patent: 7353220 (2008-04-01), Schwarzmann
patent: 2003/0014286 (2003-01-01), Cappellini
patent: 2003/0172135 (2003-09-01), Bobick et al.
patent: 2004/0103117 (2004-05-01), Segler
patent: 2004/0249809 (2004-12-01), Ramani et al.
patent: 2005/0261828 (2005-11-01), Crowder et al.
patent: 2006/0015848 (2006-01-01), Schwarzmann
patent: 2006/0020789 (2006-01-01), Gipps et al.
patent: 1016963 (2000-07-01), None
patent: WO 97/15003 (1997-04-01), None
patent: WO 02/054332 (2002-07-01), None
EPO Communication and Search Report, dated Mar. 30, 2005, 8 pages.
Sungwon Jung et al., “HiTi Graph Model of Topographical Road Maps in Navigation Systems,” Proceedings of the Twelfth International Conference, New Orleans, LA, IEEE Computer Society, Feb. 1996, pp. 76-84.
Michel Koskas, “A hierarchical Algorithm to Solve the Shortest Path Problem in Valued Graphs,” Oct. 10, 2003, retrieved from the Internet: http://arxiv.org/PS—cache/cs/pdf/0310/0310019.pdf, pp. 1-19.
John Guzolek et al., “Real-Time Route Planning in Road Networks,” Vehicle Navigation and Information Systems Conference, Toronto, CA, IEEE, 1989, pp. 165-169.
Jochen Behrens et al., “Hierarchical Routing Using Link Vectors,” INFOCOM '98, Seventeenth Annual Joint Conference on the IEEE Comput. and Comm. Societies, San Francisco, CA, IEEE, 1998, pp. 702-710.
EPO Communication and Search Report for European Patent Application No. 04016604 (filed Jul. 14, 2004), dated Oct. 17, 2005 (12 pages).
Gamma et al., “Design Patterns: Elements of Reusable Object-Oriented Software,” Addison-Wesley Professional Computing Series, 1995, Table of Contents and pp. 331-344.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Systems, methods, and articles of manufacture for flexible... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Systems, methods, and articles of manufacture for flexible..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Systems, methods, and articles of manufacture for flexible... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-4032699

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.