System and method for constructing cognitive programs

• US 7,548,893 B2
• Filed: 06/07/2007
• Issued: 06/16/2009
• Est. Priority Date: 12/07/2004
• Status: Expired due to Fees

• Current Assignee: Eric Baum
• Original Assignee: Eric Baum
• Inventors: Baum, Eric
• Primary Examiner(s): Vincent; David R
• Assistant Examiner(s): Brown, Jr.; Nathan H
• Application Number:
  US11/811,067
• Publication Number:
  US 20070245295A1
• Time in Patent Office: 740 Days
• Field of Search: 706/12, 706/13
• US Class Current: 706/12
• CPC Class Codes: G06F 9/30145 Instruction analysis, e.g. decoding, instruction word fields
• CPC Class Codes: G06N 20/00 Machine learning

Abstract

The present invention is directed to a method to search for a solution to a problem in a domain. The method may comprise obtaining a plurality of agents each operable to produce one or more numerical bids and to propose one or more actions and a plurality of nodes each representing a state of the domain; automatically selecting a respective agent and a respective node based on a bids from the plurality of agents; and automatically adding a new node representing a new state which is obtained by applying to the state represented by the selected node an action proposed by the selected agent. The plurality of nodes may each have a depth associated therewith and the respective agent and the respective node may be selected regardless of the depth associated with the selected node.

Claims

1. A computer readable medium having stored thereon a computer program executable by a computer to search for a solution achieving one or more goals in a domain, the computer program comprising:

specifying an initial node and providing a number of other nodes each representing a state of the domain;

obtaining a plurality of agents each having a respective numerical quantity associated therewith and each operable to produce one or more numerical bids and to propose one or more actions;

automatically selecting a first respective agent and a first respective node based on one or more bids from the plurality of agents;

automatically adding a new node representing a new state which is obtained by applying to a respective state represented by the first respective node an action proposed by the first respective agent;

automatically selecting a second respective agent and a second respective node different from the first respective node and different from said new node based on bids from the plurality of agents, in which the second respective agent and the second respective node are selected after the first respective agent and the first respective node are selected, and in which the first respective node and the second respective node each have a respective depth associated therewith in which the respective depth of a respective node is representative of a minimum number of sequential actions applied to reach the respective node from said initial node, and in which the depth of the second respective node is less than the depth of the first respective node; and

subtracting from the numerical quantity associated with the second respective agent an amount based on the bid of the second respective agent without paying the subtracted amount into the numerical quantity associated with the agent selected immediately before the second respective agent.

2. The medium according to claim 1, the computer program further comprising automatically removing a respective agent having respective associated numerical quantity which is below a threshold quantity.

3. The medium according to claim 1, the computer program further comprising rendering a respective agent having respective associated numerical quantity which is below a threshold quantity inactive so that said respective agent is unable to bid.

4. The medium according to claim 1, in which the numerical quantities of the agents are automatically respectively adjusted so as to increase the numerical quantity of each agent whose action or actions leads to a path which achieves a desired goal.

5. The medium according to claim 1, in which the numerical quantities of the agents are automatically respectively adjusted so as to increase the numerical quantity of only the agent or agents whose action or actions leads to a path which achieves a desired goal.

6. The medium according to claim 1, in which a plurality of paths accomplish a desired goal and in which the respective numerical quantity or quantities of only the agent or agents along a first path obtained from the plurality of paths are increased.

7. The medium according to claim 1, the computer program further comprising automatically modifying an existing agent so as to create a new agent.

8. A computer system to construct a computer program to search for a solution achieving one or more goals in a domain, the system comprising:

means for specifying an initial node and providing a number of other nodes each representing a state of the domain;

means for obtaining a plurality of agents each having a respective numerical quantity associated therewith and each operable to produce one or more numerical bids and to propose one or more actions;

means for automatically selecting a first respective agent and a first respective node based on one or more bids from the plurality of agents;

means for automatically adding a new node representing a new state which is obtained by applying to a respective state represented by the first respective node an action proposed by the first respective agent;

means for automatically selecting a second respective agent and a second respective node different from the first respective node and different from said new node based on bids from the plurality of agents, in which the second respective agent and the second respective node are selected after the first respective agent and the first respective node are selected, and in which the first respective node and the second respective node each have a respective depth associated therewith in which the respective depth of a respective node is representative of a minimum number of sequential actions applied to reach the respective node from said initial node, and in which the depth of the second respective node is less than the depth of the first respective node; and

means for subtracting from the numerical quantity associated with the second respective agent an amount based on the bid of the second respective agent without paying the subtracted amount into the numerical quantity associated with the agent selected immediately before the second respective agent,

the means for specifying, the means for obtaining, the means for automatically selecting a first respective agent and a first respective node, the means for automatically adding, the means for automatically selecting a second respective agent and a second respective node, and the means for subtracting are each executable by a computer.

9. The system according to claim 8, further comprising means for automatically removing from the program a respective agent having respective associated numerical quantity which is below a threshold quantity.

10. The system according to claim 8, further comprising means for rendering a respective agent having a respective associated numerical quantity which is below a threshold quantity inactive so that said respective agent is unable to bid.

11. The system according to claim 8, in which the numerical quantities of the agents are automatically respectively adjusted so as to increase the numerical quantity of each agent whose action or actions leads to a path which achieves a desired goal.

12. The system according to claim 8, in which the numerical quantities of the agents are automatically respectively adjusted so as to increase the numerical quantity of only the agent or agents whose action or actions leads to a path which achieves a desired goal.

13. The system according to claim 8, in which a plurality of paths accomplish a desired goal and in which the respective numerical quantity or quantities of only the agent or agents along a first path obtained from the plurality of paths are increased.

14. The system according to claim 8, further comprising means for automatically modifying an existing agent so as to create a new agent.

15. A computer system to construct a computer program to search for a solution achieving one or more goals in a domain, the system comprising:

a device to specify an initial node and providing a number of other nodes each representing a state of the domain;

a device to obtain a plurality of agents each having a respective numerical quantity associated therewith and each for producing one or more numerical bids and for proposing one or more actions;

a device to automatically select a first respective agent and a first respective node based on one or more bids from the plurality of agents;

a device to automatically add a new node representing a new state which is obtained by applying to a respective state represented by the first respective node an action proposed by the first respective agent;

a device to automatically select a second respective agent and a second respective node different from the first respective node and different from said new node based on bids from the plurality of agents, in which the second respective agent and the second respective node are selected after the first respective agent and the first respective node are selected, and in which the first respective node and the second respective node each have a respective depth associated therewith in which the respective depth of a respective node is representative of a minimum number of sequential actions applied to reach the respective node from said initial node, and in which the depth of the second respective node is less than the depth of the first respective node; and

a device to subtract from the numerical quantity associated with the second respective agent an amount based on the bid of the second respective agent without paying the subtracted amount into the numerical quantity associated with the agent selected immediately before the second respective agent,

the device to specify, the device to obtain, the device to automatically select a first respective agent and a first respective node, the device to automatically add, the device to automatically select a second respective agent and a second respective node, and the device to subtract are each executable by a computer.

16. The system according to claim 15, further comprising a device to automatically remove from the program a respective agent having respective associated numerical quantity which is below a threshold quantity.

17. The system according to claim 15, further comprising a device render a respective agent having a respective associated numerical quantity which is below a threshold quantity inactive so that said respective agent is unable to bid.

18. The system according to claim 15, in which the numerical quantities of the agents are automatically respectively adjusted so as to increase the numerical quantity of each agent whose action or actions leads to a path which achieves a desired goal.

19. The system according to claim 15, in which the numerical quantities of the agents are automatically respectively adjusted so as to increase the numerical quantity of only the agent or agents whose action or actions leads to a path which achieves a desired goal.

20. The system according to claim 15, in which a plurality of paths accomplish a desired goal and in which the respective numerical quantity or quantities of only the agent or agents along a first path obtained from the plurality of paths are increased.

21. The system according to claim 15, further comprising a device to automatically modify an existing agent so as to create a new agent.