Planning method and system for use in cognitive programs

• US 20100306149A1
• Filed: 12/24/2009
• Published: 12/02/2010
• Est. Priority Date: 04/15/2005
• Status: Abandoned Application

• Current Assignee: Eric Baum
• Original Assignee: Eric Baum
• Inventors: Baum, Eric
• Application Number:
  US12/655,256
• Publication Number:
  US 20100306149A1
• Time in Patent Office: Days
• US Class Current: 706/46
• CPC Class Codes: G06N 5/00 Computing arrangements using knowledge-based models
• CPC Class Codes: G06N 5/02 Knowledge representation; Symbolic representation
• CPC Class Codes: G06N 5/04 Inference or reasoning models

Abstract

A system for achieving a desired goal in a domain. The system may comprise a device operable to receive information and simulate the domain therefrom; a device operable to simulate one or more effects due to one or more operators; a device operable to specify a number of items and/or classes of items and whether each item and/or each class of items is an affectable obstacle or a non-affectable obstacle; a device operable to automatically generate a candidate plan to achieve the desired goal by utilizing the simulated domain and the simulated effect(s), wherein the candidate plan could involve one or more affectable obstacles but does not involve any non-affectable obstacles; and a device operable to automatically refine the candidate plan to change at least one of the affectable obstacles involved in the candidate plan.

Claims

1. A system for achieving a desired goal in a domain, in which the domain has one or more operators associated therewith, said system comprising:

means for receiving information pertaining to the domain and for simulating the domain therefrom;

means for simulating one or more effects due to the one or more operators associated with the domain;

means for specifying a number of items and/or a number of classes of items in the domain and whether each item and/or each class of items is an affectable obstacle wherein at least one of the one or more operators can cause a change thereto or a non-affectable obstacle wherein the one or more operators can not cause a change thereto;

means for automatically generating a candidate plan to achieve the desired goal by utilizing the simulated domain and the simulated effect(s), wherein the candidate plan could involve one or more affectable obstacles but does not involve any non-affectable obstacles; and

means for automatically refining the candidate plan to change at least one of the affectable obstacles involved in the candidate plan.