US 8,046,163 B2 · Interactive pedestrian routing method

Abstract

The present invention's network-based directions-provision methodology typically features the establishment of two ranking schemes that reversely parallel each other. The “personal” ranking scheme ranks all permitted persons in terms of the degree of access permission with respect to the variously ranked regions of a facility; the lower the personal rank, the fewer the regional ranks to which the person is permitted access. The “regional” ranking scheme ranks all accessible regions in terms of the degree of access permission with respect thereto by the variously ranked permitted persons; the higher the regional rank, the fewer the personal ranks that are permitted access to the region. According to typical inventive practice, a permitted person logs in to request directions, within the facility, from an original location to a destination location; the directions given (textual and/or graphical) are the optimal directions that are consistent with the personal rank of the requestor.

A computer-network-implemented method for giving directions for traveling between locations within a facility, the method comprising:

establishing two numerical scales, said numerical scales being an individual access permission status scale and a section access permissibility status scale, said scales pertaining to authorization of individuals to enter sections into which at least a portion of a facility is divided, said individual access permission status scale describing at least three individual access permission statuses that are assignable to said individuals, each said individual being assigned one said individual access permission status, said individual access permission statuses ranging from a numerically highest said individual access permission status Pn to a numerically lowest said individual access permission status P1, said individual access permission statuses being Pn, Pn-1, . . . P1, said section access permissibility status scale describing at least three section access permissibility statuses that are assignable to said sections, each said section being assigned one said section access permissibility status, said three section access permissibility statuses ranging from a numerically highest said section access permissibility status Rn to a numerically lowest said section access permissibility status R1, said section access permit statuses being Rn, Rn-1, . . . R1, wherein in parallel fashion said individual access permission statuses range between the highest said individual access permission status Pn and the lowest said individual access permission status P1 and said section access permissibility statuses range between the highest said section access permissibility status Rn and the lowest said section access permissibility status R1, the number n of said individual access permission statuses equaling the number n of said section access permissibility statuses, said individual access permission status being defined as authorizing access by said individual to every said section to which is assigned said section access permissibility status that is numerically equal to or numerically lower than said individual access permission status, said section access permissibility status being defined as authorizing access to said section by every said individual to which is assigned said individual access permission status that is numerically equal to or numerically higher than said section access permissibility status;
maintaining two databases in a server, said databases being an individual access permission status database and a section access permissibility status database, said individual access permission status database including identifications of said individuals and said individual access permission statuses that are assigned to said identified individuals, said section access permissibility status database including identifications of said sections and said section access permissibility statuses that are assigned to the identified said sections;
receiving an inquiry input into said server, by a said individual using a client, as to how to proceed from a first location of said facility to a second location of said facility;
determining, via said server, a route for the inquiring said individual from said first location of said facility to said second location of said facility, wherein said individual access permission status that is assigned to said inquiring individual is numerically equal to or numerically higher than said section access permissibility status that is assigned to each said section that said route at least partially traverses, said route avoiding every said section to which is assigned said section access permissibility status that is numerically higher than said individual access permission status that is assigned to said inquiring individual;
and
communicating, via said client, the determined said route to said inquiring individual.

3 more elements

Interactive pedestrian routing method

Life of this patent

Interactive pedestrian routing method

Life of this patent

Abstract

Claims20