Patent US4829450A successfully refreshed from Google Patents.
US4829450A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Reasoning machine
Assignee: Individual
•
Filing: 1986-02-28
•
Granted: 1989-05-09
•
Expires: 2006-02-28
Abstract
Abstract A computer system which learns or assimilates its experience into a hierarchical arrangement. The current set of events, represented as a general directed graph of nodes and arcs, is incorporated into a memory. After each observation or input, the resulting graph is analyzed to determine if any cycles exist. Each cycle is reduced to a single node. This collapsing of the graph creates a hierarchial arrangement of the past events. Each successive level of hierarchy, by burying the details, is a more generalized model of the past experiences. In this manner, not only are computational and memory requirements reduced, but, the computer system will learn from past events which to permit use in such applications as robotics or general operator inquiry and interaction.
Inventors
- 👤 Michael Manthey
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-29 08:54
CPC Classifications
G; G06; G06N; G06N20/00; Y; Y10; Y10S; Y10S706/00; Y10S706/902; Y10S706/903; Y10S706/905
Claims Analysis
Total Claims: 39
Claim 1
Independent Claim
92 words
A computer system comprising: A. a memory means for storage of data; B. input means for receiving current data being representable as a directed graph; and C. control means for: 1. combining said current data with any existing data in said memory means, said existing data being sequential in nature; 2. determining if a cycle exists in said combined current data and existing data; and, 3. storing in said memory, new data representive of the combined current data and existing data wherein said determined cycle is represented as a single datum point.
Claim 2
Dependent Claim
92 words
A computer system comprising: A. a memory means for storage of data; B. input means for receiving current data being representable as a directed graph; and C. control means for: 1. combining said current data with any existing data in said memory means, said existing data being sequential in nature; 2. determining if a cycle exists in said combined current data and existing data; and, 3. storing in said memory, new data representive of the combined current data and existing data wherein said determined cycle is represented as a single datum point.
Claim 3
Dependent Claim
24 words
The computer system according to claim 1 where said control means further comprises means for determining if a cycle exists in said new data.
Claim 4
Dependent Claim
46 words
The computer system according to claim 2 where said control means includes means for repetitively: A. determining if a cycle exists; B. for storing said new data; and C. for permitting current data via said input means only when no cycle exists in said new data.
Claim 5
Dependent Claim
19 words
The computer system according to claim 1 wherein said input means includes input means for operator generated data input.
Claim 6
Dependent Claim
23 words
The computer system according to claim 4 wherein said control means includes means for comparing the operator generated data with said new data.
Claim 7
Dependent Claim
39 words
The computer system according to claim 5 further comprising an output means and wherein said control means includes means for communicating via said output means, data indicative of the comparison of said operator generated input and said new data.
Claim 8
Dependent Claim
51 words
The computer system according to claim 1 further comprising at least one robotic device and wherein said control means further comprises means for: A. comparing said new data with predefined objective data; and, B. manipulating said robotic device based upon said comparison of said new data and said predefined objective data.
Claim 9
Dependent Claim
27 words
The computer system according to claim 7 wherein data indicative of the manipulation of said at least one robotic device comprises a component of said current data.
Claim 10
Dependent Claim
16 words
The computer system according to claim 8 further comprising means for updating said predefined objective data.
Claim 11
Dependent Claim
18 words
The computer system according to claim 9 wherein said predefined objective data is stored in said memory means.
Claim 12
Independent Claim
111 words
A system for assimilating actions comprising: a. memory means for storage of a graph representation, said graph having nodes and connecting arcs; b. means for defining within said memory means a graph representative of past activities; c. means for incorporating a graph representative of current activities into said existing graph, thereby creating a new graph within said memory; d. means for identifying cycles existing in said new graph; e. means for selecting one of said identified cycles; and f. means for creating, within said memory means, a higher hierarchical graph, said higher hierarchical graph being identical to said new graph except that said selected cycle is represented as a single node.
Claim 13
Independent Claim
111 words
A system for assimilating actions comprising: a. memory means for storage of a graph representation, said graph having nodes and connecting arcs; b. means for defining within said memory means a graph representative of past activities; c. means for incorporating a graph representative of current activities into said existing graph, thereby creating a new graph within said memory; d. means for identifying cycles existing in said new graph; e. means for selecting one of said identified cycles; and f. means for creating, within said memory means, a higher hierarchical graph, said higher hierarchical graph being identical to said new graph except that said selected cycle is represented as a single node.
Claim 14
Dependent Claim
23 words
The system according to claim 11 further comprising means for determining if a cycle exists in said higher hierarchical graph within said memory.
Claim 15
Dependent Claim
63 words
The system according to claim 12 further including means for repetitively: A. determining if a cycle exists in the highest hierarchical graph; B. for creating an even higher hierarchical graph by reducing the determined cycle to a single node; and C. for permitting the incorporation of the graph representative of current activities only when no cycle exists in the even higher hierarchical graph.
Claim 16
Dependent Claim
14 words
The system according to claim 11 further including input means for operator generated data.
Claim 17
Dependent Claim
19 words
The system according to claim 14 further including means for comparing operator generated data with said highest hierarchical graph.
Claim 18
Dependent Claim
34 words
The system according to claim 15 further comprising an output means and means for communicating via said output means, data indicative of the comparision of said operator generated data and said highest hierarchical graph.
Claim 19
Dependent Claim
42 words
The system according to claim 11 further comprising at least one robotic device and further comprising means for: A. comparing said highest hierarchical graph with a predefined objective data; and, B. manipulating said at least one robotic device based upon said comparison.
Claim 20
Dependent Claim
26 words
The system according to claim 17 wherein data indicative of the manipulation of said robotic device comprises a component of said graph representation of current activities.
Claim 21
Dependent Claim
15 words
The system according to claim 18 further comprising means for updating said predefined objective data.
Claim 22
Dependent Claim
17 words
The system according to claim 19 wherein said predefined objective data is stored in said memory means.
Claim 23
Dependent Claim
125 words
An intelligent system comprising: A. a memory having a plurality of memory sections, each of said memory sections initially being empty, and each of said memory sections having hierarchical relationship to the other memory sections; B. input means for receipt of event data which is representable as a directed graph; and C. means for, 1. accepting new event data from said input means, 2. creating a graphical representation consisting of nodes and arcs representative of said new event data, 3. incorporating said graphical representation into any existing graph stored in the lowest hierarchical memory section, and, 4. creating for each successive hierarchical section, a graphical representation of the prior hierarchical graphical representation having selected cycles of said prior hierarchial graphical representation represented as single nodes.
Claim 24
Dependent Claim
125 words
An intelligent system comprising: A. a memory having a plurality of memory sections, each of said memory sections initially being empty, and each of said memory sections having hierarchical relationship to the other memory sections; B. input means for receipt of event data which is representable as a directed graph; and C. means for, 1. accepting new event data from said input means, 2. creating a graphical representation consisting of nodes and arcs representative of said new event data, 3. incorporating said graphical representation into any existing graph stored in the lowest hierarchical memory section, and, 4. creating for each successive hierarchical section, a graphical representation of the prior hierarchical graphical representation having selected cycles of said prior hierarchial graphical representation represented as single nodes.
Claim 25
Dependent Claim
23 words
The intelligent system according to claim 21 further comprising means for determining if a graphical cycle exists in any of said memory sections.
Claim 26
Dependent Claim
32 words
The intelligent system according to claim 22 further including means for permitting data indicative of a new sequence of events only when no graphical cycle exists in any of said memory sections.
Claim 27
Dependent Claim
19 words
The intelligent system according to claim 21 wherein said input means includes means for input of operator generated data.
Claim 28
Dependent Claim
23 words
The intelligent system according to claim 24 further including means for analyzing said operator generated data with the contents of selected memory sections.
Claim 29
Dependent Claim
39 words
The intelligent system according to claim 25 further comprising: A. an output means; and, B. means for communicating via said output means, data indicative of the analysis of said operator generated data and the contents of selected memory sections.
Claim 30
Dependent Claim
42 words
The intelligent system according to claim 21 further comprising; A. at least one robotic device; and, B. means for, 1. analyzing the contents of selected hierarchical memory sections with predefined objective data; and, 2. manipulating said robotic device based upon said analysis.
Claim 31
Dependent Claim
29 words
The intelligent system according to claim 27 wherein data representative of the manipulation of said robotic device comprises a component of said graphical representation of said new event data.
Claim 32
Dependent Claim
16 words
The intelligent system according to claim 28 further comprising means for updating said predefined objective data.
Claim 33
Dependent Claim
17 words
The intelligent system according to claim 29 wherein said predefined objective data is stored in said memory.
Claim 34
Independent Claim
130 words
A method of operating a system having a memory with a plurality of memory sections, each of said memory sections initially being empty, and each of said memory sections being hierarchically arranged to each other, said system also having input means for receipt of data indicative of a sequence of events, the method of operating the system comprising the steps of: a. accepting a new sequence of events from said input means; b. creating a graphical representation consisting of nodes and arcs representative of said new event data; c. incorporating said graphical representation into any existing graph stored in the lowest hierarchical memory section; and, d. creating, for each successive hierarchical memory section, a graphical representation being the prior hierarchical memory's graphical representation with selected cycles represented as single nodes.
Claim 35
Independent Claim
130 words
A method of operating a system having a memory with a plurality of memory sections, each of said memory sections initially being empty, and each of said memory sections being hierarchically arranged to each other, said system also having input means for receipt of data indicative of a sequence of events, the method of operating the system comprising the steps of: a. accepting a new sequence of events from said input means; b. creating a graphical representation consisting of nodes and arcs representative of said new event data; c. incorporating said graphical representation into any existing graph stored in the lowest hierarchical memory section; and, d. creating, for each successive hierarchical memory section, a graphical representation being the prior hierarchical memory's graphical representation with selected cycles represented as single nodes.
Claim 36
Dependent Claim
24 words
The method of operating a system according to claim 31 further comprising the step of analyzing operator generated data with the highest hierarchial memory.
Claim 37
Dependent Claim
34 words
The method of operating a system according to claim 32 further comprising the step of communicating via an output means, data indicative of the analysis of said operator generated input and said new data.
Claim 38
Dependent Claim
39 words
The method of operating a system according to claim 31 further comprising the steps of: A. determining the relationship of the highest hierarchical memory with a predefined objective data; and, B. manipulating a robotic device based upon said determination.
Claim 39
Dependent Claim
20 words
The method of operating a system according to claim 34 further comprising the step of updating said predefined objective data.
References Cited (Backward Citations)
No citation records indexed.
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1992-05-08 | 1992-11-07 | 1993-05-09 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1996-05-08 | 1996-11-07 | 1997-05-09 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2000-05-08 | 2000-11-07 | 2001-05-09 | $7700.00 | Window Closed / Lapsed |