-
1.发明申请公开(公告)号：US20210216879A1
公开(公告)日：2021-07-15
申请号：US16741431
申请日：2020-01-13
摘要： Embodiments for improving heuristic searching in artificial intelligence (AI) planning are provided. At least one planning task within a planning domain is identified. The at least one planning task is solved to generate a plurality of plans. The plurality of plans include a plurality of state-action pairs. A neural network is trained utilizing the plurality of state-action pairs. Preferred actions for states within the planning domain are determined utilizing the neural network.
-
公开(公告)号：US20210004741A1
公开(公告)日：2021-01-07
申请号：US16459324
申请日：2019-07-01
摘要： Embodiments are provided for providing top-K quality plans streaming applications in a computing environment. A set of top-K quality plans using a quality bound for a planning problem. The planning problem may be reformulated in one or more subsequent iterations and forbidding use one or more of the set of top-K quality plans. Identifying one or more of the set top-K quality plans having a quality less than the quality bound during the one or more subsequent iterations.
-
公开(公告)号：US20210142197A1
公开(公告)日：2021-05-13
申请号：US16679434
申请日：2019-11-11
IPC分类号： G06N7/00 , G06F16/901
摘要： Embodiments for creating planning tasks are provided. A plurality of atoms are generated. The plurality of atoms are partitioned into a plurality of variables. A casual graph is generated based on the plurality of variables. A layered graph including interchanging variable value layers and action layers is created based on the casual graph. A planning task is generated based on the layered graph.
-
4.发明申请公开(公告)号：US20190340525A1
公开(公告)日：2019-11-07
申请号：US15971911
申请日：2018-05-04
IPC分类号： G06N5/04 , G05B13/04 , G06F8/30 , G05B19/042
摘要： A method for improving performance of at least one hardware processor solving a top-k planning problem includes obtaining, in a memory coupled to the at least one processor, a specification of the planning problem in a planning language; obtaining, in a first iteration carried out by the at least one processor, at least one solution to the planning problem; and modifying the planning problem, in the first iteration carried out by the at least one processor, to forbid the at least one solution. The method further includes repeating, by the at least one processor, the obtaining of the at least one solution and the modifying to forbid the at least one solution, for a plurality of additional iterations, after the first iteration, until a desired number, k, of solutions to the planning problem are found or until no further solutions exist, whichever comes first.
-
-
-
搜索结果
4 条记录 (耗时 0.015 秒)
