Method for generating a path in an arbitrary physical structure

• US 5,963,948 A
• Filed: 11/15/1996
• Issued: 10/05/1999
• Est. Priority Date: 11/15/1996
• Status: Expired due to Term

• Current Assignee: Esther Dina Shilcrat
• Original Assignee: Esther Dina Shilcrat
• Inventors: Shilcrat, Esther Dina
• Primary Examiner(s): Kulik, Paul V.
• Assistant Examiner(s): Corrielus, Jean M.
• Application Number:
  US08/749,528
• Time in Patent Office: 1,054 Days
• Field of Search: 364/228, 364/282.1, 364/974.6, 364/242.94, 395/12, 395/200.52, 395/52, 345/326, 380/4, 707/100, 707/4, 707/1, 707/3, 340/995, 701/200, 701/207, 701/209
• US Class Current: 1/1
• CPC Class Codes: G06F 16/748 Hypervideo linking data to content, e.g. by linking an URL to a video object in the context of video distribution systems H04N21/858
• CPC Class Codes: Y10S 707/99931 Database or file accessing
• CPC Class Codes: Y10S 707/99933 Query processing, i.e. searching
• CPC Class Codes: Y10S 707/99934 Query formulation, input preparation, or translation

Abstract

An item locating and path generating computer system creates personalized paths through structures by converting each of a set of items, objects, or locations of particular interest to a user to a corresponding set of destinations within the structure, and creating a path which includes each element in the set of destinations. The generated path may start at a structure entrance and end at a structure exit. The generated path may also reflect user desired characteristics such as least distance, least time, being at a specific point at a specific time, etc. In structures with multiple entrances or exits, multiple paths can be created and evaluated by above user criteria to find the best fit. The personalized paths can be stored, and automatically searched and queried in a variety of ways, such as aggregation. The invention includes a number of methods for creating a set of desired items, objects or locations of particular interest to a user. This includes storing elements of this set, along with a desired frequency or another condition (including price). The invention also converts between the units in which an object may be measured (as in, for example, a recipe) and the units in which that object actually occurs in the structure.

Claims

1. A method that enables an end-user to select a set of desired objects available within an arbitrary physical structure and generates a path through said structure, utilizing a digital computer equipped with memory, and input and output peripherals, wherein said path consists of a sequence of instructions that enable said end-user to physically travel through said structure, and wherein said path has been customized for said end-user such that each item in said set of desired objects is available in at least one physical location contained in said path, and wherein said path optimizes characteristics of interest to said end-user, including shortest time or distance, the method comprising the steps of:

(a) selection of a plurality of easily identifiable physical markers or other visible structural components, including doors, signs, or escalators, said markers or other visible components being referred to as lodestars,

(b) selection of a plurality of display units within said physical structure, small enough to be easily examined by a customer or client, wherein objects may be displayed, advertised or physically stored, said display units being referred to as Navigable Display Units (NDUs),

(c) construction and storage of an object description database, wherein attributes of objects available within said structure are described using a variety of different media,

(d) construction and storage of an object location database relating each NDU to a plurality of objects available at said NDU,

(e) construction and storage of a structure layout database relating each NDU to a plurality of lodestars, optionally including distance or direction information from each said lodestar to said NDU, referred to as an Orientation Hint,

(f) construction and storage of a lodestar layout database describing the adjacency relationship between lodestars,

(g) construction and storage of a lodestar instruction database containing instructions describing travel from one lodestar to another,

(h) creation of said path through said structure based on interaction with said end-user.

2. The method of claim 1, wherein the creation of said path through said structure based on interaction with said end-user, comprises the steps of:

(a) selection of a plurality of desired objects available within said structure by said end-user,

(b) generation of a plurality of corresponding lodestars within said structure, such that each said desired object may be found at least one lodestar within said plurality of corresponding lodestars,

(c) generation of said path for said corresponding plurality of lodestars, where said path comprises a sequence of adjacent lodestars as found within said structure, and where said path further contains every lodestar in said plurality of corresponding lodestars.

3. The method of claim 2, wherein the step of selection of a plurality of desired objects comprises the steps of selecting a desired object from said object description database by said end-user.

4. The method of claim 3, further comprising the step of said end-user selecting a desired object after viewing an object inventory database describing availability of objects within said structure.

5. The method of claim 4, further comprising the step of said end-user selecting a desired object after viewing a user history database describing objects said end-user has previously encountered, acquired, or visited within said structure.

6. The method of claim 5, further comprising the step of said end-user selecting a desired object after viewing an object classification database describing relationships between objects available within said structure.

7. The method of claim 2, wherein generation of a plurality of corresponding lodestars within said structure, comprises the steps of:

(a) for each object in said plurality of desired objects selecting an NDU such that said NDU is related to said object in said object location database,

(b) retrieving a lodestar id from said structure layout database, such that said NDU is related to said lodestar id,

(c ) collecting said lodestar ids to form said plurality of corresponding lodestars.

8. The method of claim 2, wherein the step of generation of said path for said plurality of corresponding lodestars, comprises the steps of:

(a) choosing an initial lodestar (lodestar id) corresponding to an entrance to said structure,

(b) choosing an final lodestar (lodestar id) corresponding to an exit from said structure,

(c) utilizing said lodestar layout database to generate said path consisting of a sequence of lodestars (lodestar ids) containing every lodestar id in said plurality of corresponding lodestars, such that said end-user can physically travel from structure entrance to structure exit by passing through each lodestar (lodestar id) listed in said path, in the order in which they appear.

9. The method of claim 7, further comprising the steps of annotating or marking each lodestar (lodestar id) occurring in said generated path with:

(a) a plurality of said desired objects available at each lodestar;

if no said desired objects are available the lodestar is labeled "alkthrough,"

(b) an orientation hint explaining how to access each said desired object in terms of said NDU related to said desired object, as retrieved from said object location database,

(c) instructions on travel to the next lodestar in said path, obtained from said lodestar instruction database.

10. The method of claim 8, wherein the step of utilizing said lodestar layout database to generate said path consisting of a sequence of lodestars, comprises the steps of

(a) pre-computation of a plurality of paths between said entrance lodestar id and said exit lodestar id,

(b) selection of said path such that said path includes every lodestar id contained in the said plurality of corresponding lodestars.

11. The method of claim 8, further comprising the generation of said path based on a plurality of different possible characteristics, as chosen by said end-user, including shortest distance, choice of specific entrance or exit, least time, passing through a specific lodestar (lodestar id) at a specific time.

12. The method of claim 10, wherein the step of pre-computation of a plurality of paths between said entrance and said exit lodestar id comprises the construction and storage of an All Path Table, listing all paths within said structure leading from said entrance lodestar id to said exit lodestar id.

13. The method of claim 12, wherein the construction and storage of an All Path Table comprises the steps of:

(a) finding all paths of length 1, beginning at said entrance lodestar id, in said lodestar layout database and adding them to said All Path Table and marking them as not visited,

(b) selecting a not visited path P from said All Path Table and marking it as visited,

(c) if said P ends in some lodestar q1;

constructing a new path P'"'"' by adding edge <

q1,q2>

to P provided;

1. Edge <

q1,q2>

can be found in said lodestar layout database,

2. Entry occurrences of q 1 in P is less than Connectivity(q1),

3. There is no essentially equivalent path to P'"'"' already present in said All Path Table,

(d) Adding P'"'"' to said All Path Table and marking it as not visited,

(e) Repeating steps (b) through (c ) until all paths in said All Path Table are marked as visited,

(f) extending each path in said All Path Table to include a final part leading to the said exit lodestar.

14. The method of claim 8, wherein the step of utilizing said lodestar layout database to generate said path consisting of a sequence of lodestars, comprises the steps of:

(a) classification of each lodestar occurring in said lodestar layout database into a plurality of lodestar sets called quadrants, such that each said quadrant corresponds to an easily navigable sub-part of said physical structure,

(b) construction and storage of a Quadrant Adjacency Matrix, wherein two quadrants are adjacent if and only if each quadrant has a lodestar within it such that said lodestars are adjacent in said lodestar layout database,

(c) computation, utilizing the Quadrant Adjacency Matrix, and storage of a plurality of paths between said quadrants in a Quadrant All Path table,

(d) selection of a quadrant path Q from said Quadrant All Path table wherein each lodestar in said plurality of corresponding lodestars is present in some quadrant within said Q,

(e) construction of a lodestar sub-path within each quadrant contained in said Q, utilizing said lodestar layout database, such that each lodestar in said plurality of corresponding lodestars is found within said lodestar sub-path within some quadrant contained in said Q,

(f) construction of a path by combining together, in sequence, said lodestar sub-paths from each quadrant contained in said Q.

15. The method of claim 2, further comprising the step of presenting said generated path to said end-user, utilizing a variety of media and technologies, including print, CD-ROM, audio and video-tape, or remotely over the World Wide Web.