Identification of Actions in Artificial Intelligence Planning
摘要:
Automated improved computer mechanisms are provided for improving the way in which a lifted successor generation (LSG) solution to an artificial intelligence (AI) planning problem is processed. An artificial intelligence (AI) planning problem is received that includes definitions for a plurality of operators. An initial label set, which defines an initial version of an action space, is created, with each label corresponding to an operator. A label reduction is performed on the label set to obtain a reduced label set (seed set) that defines a reduced action space. The AI planning problem is represented as a LSG problem comprising a set of tables and a join query. A LSG module is executed on the LSG problem using the seed set to process the join query and generate applicable action(s) as a solution to the AI planning problem which are then output for further AI operations.
信息查询
0/0