ASSISTED NAVIGATION IN VIRTUAL ENVIRONMENTS

• US 20100087257A1
• Filed: 10/03/2008
• Published: 04/08/2010
• Est. Priority Date: 10/03/2008
• Status: Active Grant

• Current Assignee: Microsoft Technology Licensing LLC (Microsoft Corporation)
• Original Assignee: Microsoft Corporation
• Inventors: Deb, Soumyajit
• Granted Patent: US 8,832,599 B2
• Time in Patent Office: Days
• US Class Current: 463/43
• CPC Class Codes: A63F 13/45 Controlling the progress of the video game
• CPC Class Codes: G06F 3/04815 Interaction with a metaphor-based environment or interaction object displayed as three-dimensional, e.g. changing the user viewpoint with respect to the environment or object
• CPC Class Codes: G06N 3/006 based on simulated virtual individual or collective life forms, e.g. social simulations or particle swarm optimisation [PSO]
• CPC Class Codes: G06T 19/00 Manipulating 3D models or images for computer graphics

Abstract

Navigational data may be collected from experienced users and paths may be extracted from the navigational data. One or more points of interest may be identified in the navigational data and the points of interests may be merged into an interest region. The navigational data may be reviewed for interest paths between the interest regions. The collection of possible interest paths may be reviewed interest paths in view of statistical procedures and criteria to determine if the interest path is a preferred interest path. If the preferred interest path does not satisfy the predefined constraints, additional interest paths may be reviewed by substituting an additional interest path for the interest path and repeating the review the interest path analysis. If the preferred interest path satisfies predefined criteria, a walkthrough of the virtual world may be generated based on the preferred interest path.

Claims

1. A method of assisting navigation through a three dimensional virtual space comprising:

collecting navigational data from experienced users;

extracting paths from the navigational data;

identifying one or more points of interest in the navigational data;

merging the points of interests into interest regions

review the navigational data for interest paths between the interest regions;

reviewing interest paths in view of statistical procedures to determine if the interest path is a preferred interest path according to a statistical measure;

review the interest path comprising

determining if the preferred interest path satisfied predefined criteria;

if the preferred interest path does not satisfy the predefined criteria, reviewing additional interest paths comprising

substituting an additional interest path for the interest path and repeating the review the interest path block;

if the preferred interest path satisfies predefined criteria, generating a walkthrough of the virtual world based on the preferred interest path;

2. The method of claim 1, wherein the point of interest comprise points time-marks indicate users linger or obtain additional assistance.

3. The method of claim 1, wherein predefined constraints comprise limitations based on the geographic structure.

4. The method of claim 1, wherein the predefined constraints comprise limitations based on the mode of travel.

5. The method of claim 1, wherein the predefined constraints comprises limitations and aspirations based on the needs of a user in the application.

6. The method of claim 1, wherein statistical procedures further comprise determining a path based on a minimum time.

7. The method of claim 1, wherein statistical procedures further comprise determining a path based on a minimum distance.

8. The method of claim 1, wherein statistical procedures further comprise determining a path based on a minimum time and a maximum number of points of interest.

9. The method of claim 1, further comprising displaying a plurality of paths to a user and permitting the user to select a path.

10. The method of claim 9, further comprising displaying relevant data about the plurality of paths.

11. A computer storage medium comprising computer executable code for assisting navigation through a three dimensional virtual space, the computer executable code comprising code for:

collecting navigational data from experienced users;

extracting paths from the navigational data;

identifying one or more points of interest in the navigational data wherein the point of interest comprise points time-marks indicate users linger or obtain additional assistance;

merging the points of interests into interest regions

review the navigational data for interest paths between the interest regions;

reviewing interest paths in view of statistical procedures to determine if the interest path is a preferred interest path according to a statistical measure;

review the interest path comprising

determining if the preferred interest path satisfied predefined criteria;

if the preferred interest path does not satisfy the predefined criteria, reviewing additional interest paths comprising

substituting an additional interest path for the interest path and repeating the review the interest path block;

if the preferred interest path satisfies predefined criteria, generating a walkthrough of the virtual world based on the preferred interest path;

12. The computer storage medium of claim 11, wherein predefined constraints comprise limitations based on at least one selected from a group comprising:

the geographic structure;

the mode of travel; and

the needs of a user in the application.

13. The computer storage medium of claim 11, wherein statistical procedures further comprise determining a path based on at least one selected from a group comprising:

a minimum time;

a minimum distance;

a maximum number of points of interest.

14. The computer storage medium of claim 11, further comprising computer executable code for displaying a plurality of paths to a user and permitting the user to select a path.

15. The computer storage medium of claim 11, further comprising computer executable code for displaying relevant data about the plurality of paths.

16. A computer system comprising a processor, a memory in communication with the processor and an input output circuit;

the processor being configured in accordance with computer executable instructions for assisting navigation through a three dimensional virtual space, the computer executable instructions comprising instructions for;

collecting navigational data from experienced users;

extracting paths from the navigational data;

identifying one or more points of interest in the navigational data wherein the point of interest comprise points time-marks indicate users linger or obtain additional assistance;

merging the points of interests into interest regions review the navigational data for interest paths between the interest regions;

reviewing interest paths in view of statistical procedures to determine if the interest path is a preferred interest path according to a statistical measure;

review the interest path comprising

determining if the preferred interest path satisfied predefined criteria;

if the preferred interest path does not satisfy the predefined criteria, reviewing additional interest paths comprising

substituting an additional interest path for the interest path and repeating the review the interest path block;

if the preferred interest path satisfies predefined criteria, generating a walkthrough of the virtual world based on the preferred interest path;

17. The computer system of claim 16, wherein predefined constraints comprise limitations based on at least one selected from a group comprising:

the geographic structure;

the mode of travel; and

the needs of a user in the application.

18. The computer system of claim 16, wherein statistical procedures further comprise determining a path based on at least one selected from a group comprising:

a minimum time;

a minimum distance;

a maximum number of points of interest.

19. The computer system of claim 16, further comprising computer executable instructions for displaying a plurality of paths to a user and permitting the user to select a path.

20. The computer system of claim 16, further comprising computer executable code for displaying relevant data about the plurality of paths.