-
公开(公告)号：US20240330301A1
公开(公告)日：2024-10-03
申请号：US18127357
申请日：2023-03-28
IPC分类号： G06F16/2455 , G06F16/22
CPC分类号： G06F16/2456 , G06F16/2282
摘要： 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.
-
公开(公告)号：US20230342653A1
公开(公告)日：2023-10-26
申请号：US17660036
申请日：2022-04-21
摘要： Technology for: (i) receiving a domain-dependent artificial intelligence planning problem including definitions for a plurality of operators; (ii) creating an initial version of a label set, which defines an initial version of an action space, with the label set including a plurality of labels, and with each label of the plurality of labels respectively corresponding to the operators of the plurality of operators; (iii) performing, automatically and by machine logic, a label reduction on the initial version of the label set to obtain a reduced version of the label set that defines a reduced action space; and (iv) recasting the artificial planning problem as a first Markov decision process using the reduced version of label set.
-
搜索结果
2 条记录 (耗时 0.014 秒)
