Name
Abstract | ||
|---|---|---|
Generalized planning is concerned with the computation of plans that solve not one but multiple instances of a planning domain. Recently, it has been shown that generalized plans can be expressed as mappings of feature values into actions, and that they can often be computed with fully observable non-deterministic (FOND) planners. The actions in such plans, however, are not the actions in the instances themselves, which are not necessarily common to other instances, but abstract actions that are defined on a set of common features. The formulation assumes that the features and the abstract actions are given. In this work, we address this limitation by showing how to learn them automatically. The resulting account of generalized planning combines learning and planning in a novel way: a learner, based on a Max SAT formulation, yields the features and abstract actions from sampled state transitions, and a FOND planner uses this information, suitably transformed, to produce the general plans. Correctness guarantees are given and experimental results on several domains are reported. |
Year | Venue | Field |
|---|---|---|
2018 | national conference on artificial intelligence | Maximum satisfiability problem,Observable,Computer science,Correctness,Planner,Theoretical computer science,Artificial intelligence,Machine learning,Computation |
DocType | Volume | Citations |
Journal | abs/1811.07231 | 0 |
PageRank | References | Authors |
0.34 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Blai Bonet | 1 | 1750 | 125.77 |
| Guillem Francès | 2 | 29 | 4.73 |
| Hector Geffner | 3 | 2585 | 184.65 |