Artificial intelligence system that employs windowed cellular automata to create plausible alternatives
AssigneeThe Aerospace Corporation
InventorsTerence Yeoh, Nehal Desai
Life of this patent
Estimating the term…
Abstract
An artificial intelligence (AI) system is disclosed that employs windowed cellular automata to create plausible alternatives. A cellular automata-based technique may be utilized to perform pattern recognition and assess the best path available (i.e., “instant improv”). Alternative sequences (i.e., “pattern improv”) may also be used to determine alternative paths. This instant improv and pattern improv may then be used to create completely new, plausible alternative nodes. The subsequent evaluation of the sentiment further creates new, dynamic capabilities. Through the use of windowed memory learning, recall, and interpolation, new plausible structures are generated that predict dynamic systems.
Claims23
A computer program for analyzing a scenario embodied on a non-transitory computer-readable medium, the program configured to cause at least one processor to:
- perform pattern recognition to determine a best available path from a plurality of nodes representing choices, the plurality of nodes encoded into a cellular automata array and comprising a unique identifier (UID);
- traverse the best available path and look for alternative paths within a predetermined distance from a current UID that present alternative path choices, the alternative path choices not directly reachable via the best available path;
- generate at least one new alternative node that is closer to at least one more beneficial node of at least one of the alternative paths;
- jump from the determined best path available to an alternative path via the generated at least one new alternative node;
- and
- provide a solution by following the alternative path to which the program jumped to a conclusion of the alternative path, wherein
- each UID comprises numbers derived from a dimensional reduction technique that provides relational meaning between unique IDs.
A computer-implemented method, comprising:
- generating, by a computing system, a new alternative node, the new alternative node between a first node of a current path and a second node of an alternative path, the first node the second node having respective unique identifiers (UIDs), the first node and the second node proximate to one another within a predetermined distance based on the respective Ms;
- saving paths that lead to a positive outcome in a positive outcome bin, by the computing system;
- saving paths that lead to a negative outcome in a negative outcome bin, by the computing system;
- and
- saving paths that lead to a neutral outcome in a neutral outcome bin, by the computing system;
- jumping, by the computing system, from the first node to the second node via the generated new alternative node;
- and
- providing a solution, by the computing system, by following the alternative path to which the program jumped to a conclusion of the alternative path.
Dependencies are inferred from the claim text.