Turning an action formalism into a planner
| dc.contributor.author | Hertzberg, Joachim | de |
| dc.contributor.author | Thiebaux, Sylvie | de |
| dc.date.accessioned | 2004-12-06T12:53:33Z | |
| dc.date.available | 2004-12-06T12:53:33Z | |
| dc.date.created | 1994 | de |
| dc.date.issued | 1999-10-28 | de |
| dc.description.abstract | The paper describes a case study that explores the idea of building a planner with a neat semantics of the plans it produces, by choosing some action formalism that is "ideal" for the planning application and building the planner accordingly. In general-and particularly so for the action formalism used in this study, which is quite expressive-this strategy is unlikely to yield fast and efficient planners if the formalism is used naively. Therefore, we adopt the idea that the planner approximates the theoretically ideal plans, where the approximation gets closer, the more run time the planner is allowed. As the particular formalism underlying our study allows a significant degree of uncertainty to be modeled and copes with the ramification problem, we end up in a planner that is functionally comparable to modern anytime uncertainty planners, yet is based on a neat formal semantics. To appear in the Journal of Logic and Computation, 1994. The paper is written in English. | en |
| dc.format.extent | 1056008 bytes | |
| dc.format.extent | 487667 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.format.mimetype | application/postscript | |
| dc.identifier.issn | 0943-4135 | de |
| dc.identifier.uri | http://hdl.handle.net/2003/2583 | |
| dc.identifier.uri | http://dx.doi.org/10.17877/DE290R-14894 | |
| dc.language.iso | en | de |
| dc.publisher | Universität Dortmund | de |
| dc.relation.ispartofseries | Forschungsberichte des Lehrstuhls VIII, Fachbereich Informatik der Universität Dortmund ; 8 | de |
| dc.subject.ddc | 004 | de |
| dc.title | Turning an action formalism into a planner | en |
| dc.type | Text | de |
| dc.type.publicationtype | report | |
| dcterms.accessRights | open access |