SIMULATION OF DYNAMIC CITY ENVIRONMENTS AND A RELATED FABRICATION METHOD

• US 20090051686A1
• Filed: 08/20/2008
• Published: 02/26/2009
• Est. Priority Date: 08/20/2007
• Status: Abandoned Application

• Current Assignee: Bernard Paul Remy Legaut, Centre National De La Recherche Scientifique, Lionel Bruno Barret De Nazaris, Université Claude Bernard Lyon 1
• Original Assignee: Bernard Paul Remy Legaut, Centre National De La Recherche Scientifique, Lionel Bruno Barret De Nazaris, Université Claude Bernard Lyon 1
• Inventors: Legaut, Bernard Paul Remy, Armetta, Frederic, Brondel, Saida, Hassas, Salima, Barret de Nazaris, Lionel Bruno
• Application Number:
  US12/195,057
• Publication Number:
  US 20090051686A1
• Time in Patent Office: Days
• US Class Current: 345/419
• CPC Class Codes: A63F 13/10 Control of the course of the game, e.g. start, progess, end
• CPC Class Codes: A63F 13/45 Controlling the progress of the video game
• CPC Class Codes: A63F 13/60 Generating or modifying game content before or while executing the game program, e.g. authoring tools specially adapted for game development or game-integrated level editor
• CPC Class Codes: A63F 2300/6009 for importing or creating game content, e.g. authoring tools during game development, adapting content to different platforms, use of a scripting language to create content

Abstract

A method of dynamic generation by computer simulation of spatial elements, in particular, buildings and roads, constituting a three-dimensional city environment, the method comprising providing a supervisor subroutine responsible for overall control of the simulation; providing a spatial reorganization subroutine subordinate to the supervisor subroutine and responsible for generating the city environment on a local scale; placing a spatial element in the simulation; generating an inquiry from the supervisory subroutine which is sent to the spatial reorganization subroutine and providing spatial materialization of the inquiry by the spatial reorganization subroutine, which involves agents wherein at least some of the agents are able to negotiate with one another.

Claims

1. A method of dynamic generation by computer simulation of spatial elements constituting a three-dimensional city environment, the method, comprising:

(a) providing a supervisor subroutine responsible for overall control of the simulation;

(b) providing a spatial reorganization subroutine subordinate to the supervisor subroutine and responsible for generating the city environment on a local scale;

(c) placing a spatial element in the simulation;

(d) generating an inquiry from the supervisory subroutine which is sent to the spatial reorganization subroutine and depending on the spatial element of step (c); and

(e) providing spatial materialization of the inquiry by the spatial reorganization subroutine, which involves agents;

wherein at least some of the agents involved in the spatial reorganization subroutine are able to negotiate with one another.

2. The method of claim 1, wherein a plurality of specifications are supplied in substep (c₀) to serve as simulation input data, said specifications including one or more activities and a relief map of a world.

3. The method of claim 2, wherein the activities of substep (c₀) interact with one another.

4. The method of claim 1, wherein the city environment is divided into blocks.

5. The method of claim 1, wherein the spatial element created during step (c) is a three-dimensional agent.

6. The method of claim 5, wherein the spatial element is one of the agents that are involved in the spatial reorganization subroutine and can negotiate with one another.

7. The method of claim 1, wherein the agents involved in step (e) are mobile agents and static agents.

8. The method of claim 7, wherein the mobile agents move in the city environment and the main objective of the mobile agents is to construct a coherent transport network.

9. The method of claim 7, wherein the mobile agents are spatial reorganization messengers and locally formulate said inquiry sent by the supervisor subroutine in step (d).

10. The method of claim 7, wherein the mobile agents can interact directly with the supervisor subroutine.

11. The method of claim 7, wherein the mobile agents constitute an interface between the supervisor subroutine and the spatial reorganization subroutine.

12. The method of claim 7, wherein the static agents are three-dimensional agents able to negotiate with one another.

13. The method of claim 12, wherein each three-dimensional agent has a personal objective and its perception is limited to its near environment.

14. The method of claim 12, wherein negotiation between three-dimensional agents is operative only at block scale.

15. The method of claim 12, wherein negotiation between three-dimensional agents leads the spatial reorganization subroutine to send the supervisor subroutine a realization proposal reporting local negotiations between three-dimensional agents in respect to said inquiry sent by the supervisor subroutine for the purpose of making the city environment progress.

17. The method of claim 12, wherein roads and buildings that are three-dimensional agents are generated and can negotiate with one another.

18. The method of claim 12, wherein the roads and buildings forming three-dimensional agents can be generated at the same time in the city environment.

19. The method of claim 2, wherein spatial reorganization modifies at least part of the relief of the world in relief on which the city environment is generated.

16. The method of 15, wherein the three-dimensional agents are buildings.

20. A computer program, comprising computer program code means adapted to execute the steps of a method when said program is executed on a computer.

21. The computer program of claim 20, wherein said program is executed on a computer-readable medium.

22. A computer-readable medium, comprising storage of a computer program and computer program code means wherein said program is executed on a computer-readable medium.