System and method for creating and evolving directed graphs
First Claim
1. A system for processing directed graphs, each directed graph comprising a plurality of nodes interconnected by directional links defining a directional relationship among said nodes, each node defining a selected attribute, said system comprising:
- A. an initial population means for providing an initial population of directed graphs, said initial population of directed graphs comprising an initial current generation during an initial iteration;
B. a subsequent generation population generating means for generating, from selected ones of said directed graphs in each of a plurality of current genres, modified directed graphs comprising a subsequent generation for use as directed graphs in a current generation during a subsequent iteration, said subsequent generation population generating means (i) selecting ones of the directed graphs in each current generation in response to ranking information, and (ii) processing said selected directed graphs in relation to mutation operations selected from a set of selected types of mutation operations to generate modified directed graphs;
C. competition simulation means for performing a processing operation in connection with attributes of said nodes of said graphs to simulate a competition among said current generation of directed graphs in connection with a selected goal, to develop said ranking information for use by the subsequent generation population generating means; and
D. iteration control means for controlling the operations of the initial population means, said subsequent generation population generating means and said competition simulation means through a series of iterations.
8 Assignments
0 Petitions
Accused Products
Abstract
A system processes directed graphs, each directed graph comprising a plurality of nodes interconnected by arrows defining a relationship among the nodes, each node defining a selected attribute. The system comprises an initial population means, a subsequent generation population generating means, and a competition simulation means. The initial population means provides an initial population of directed graphs that comprises an initial current generation during an initial iteration. The subsequent generation population generating means generates, in response to selected ones of the directed graphs in each of a plurality of current generations, modified directed graphs for use generation during a subsequent iteration. The competition simulation means performs a processing operation in connection with attributes of the nodes of the graphs to simulate a competition among the current generation of directed graphs in connection with a selected goal, to develop the ranking information for use by the subsequent generation population generating means. The operations of the initial population means, the subsequent generation population generating means and the competition simulation means are controlled through a series of iterations. In the successive iterations, the performance of the graphs in response to the selected goal is anticipated to improve, since the population of graphs for each iteration is based on the graphs determined to have the best fitness during the previous iteration.
94 Citations
16 Claims
-
1. A system for processing directed graphs, each directed graph comprising a plurality of nodes interconnected by directional links defining a directional relationship among said nodes, each node defining a selected attribute, said system comprising:
-
A. an initial population means for providing an initial population of directed graphs, said initial population of directed graphs comprising an initial current generation during an initial iteration; B. a subsequent generation population generating means for generating, from selected ones of said directed graphs in each of a plurality of current genres, modified directed graphs comprising a subsequent generation for use as directed graphs in a current generation during a subsequent iteration, said subsequent generation population generating means (i) selecting ones of the directed graphs in each current generation in response to ranking information, and (ii) processing said selected directed graphs in relation to mutation operations selected from a set of selected types of mutation operations to generate modified directed graphs; C. competition simulation means for performing a processing operation in connection with attributes of said nodes of said graphs to simulate a competition among said current generation of directed graphs in connection with a selected goal, to develop said ranking information for use by the subsequent generation population generating means; and D. iteration control means for controlling the operations of the initial population means, said subsequent generation population generating means and said competition simulation means through a series of iterations. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16)
-
Specification