| US 7,533,073 B2 | ||
| Methods and apparatus for heuristic search to optimize metrics in generating a plan having a series of actions | ||
| Michael D. Howard, Westlake Village, Calif. (US); and Eric Huang, Los Angeles, Calif. (US) | ||
| Assigned to Raytheon Company, Waltham, Mass. (US) | ||
| Filed on Dec. 05, 2006, as Appl. No. 11/566,984. | ||
| Claims priority of provisional application 60/742321, filed on Dec. 05, 2005. | ||
| Prior Publication US 2007/0129834 A1, Jun. 07, 2007 | ||
| Int. Cl. G06N 5/00 (2006.01) | ||
| U.S. Cl. 706—47 [706/45] | 17 Claims |
| 1. A method of generating a plan for a planner including tightening bounds on a metric cost of the plan, comprising:
tagging a fact with a compressed representation of relaxed states that can make the fact true;
generating, using a computer, the compressed representation as a range of possible values that a numeric variable for the
relaxed states can possibly take on when the fact is true, where the range of the numeric variable includes a set of disjoint
ranges;
computing a new range of values for the numeric variables as a combination of ranges of values tagged on each precondition
of an action modified by effects of the action; and
outputting the plan in a format to enable display for a user to make decisions for reaching a plan goal.
|