dc.contributor.author | Nebel, B. | en |
dc.contributor.author | Dimopoulos, Yannis | en |
dc.contributor.author | Koehler, J. | en |
dc.creator | Nebel, B. | en |
dc.creator | Dimopoulos, Yannis | en |
dc.creator | Koehler, J. | en |
dc.date.accessioned | 2019-11-13T10:41:23Z | |
dc.date.available | 2019-11-13T10:41:23Z | |
dc.date.issued | 1997 | |
dc.identifier.issn | 0302-9743 | |
dc.identifier.uri | http://gnosis.library.ucy.ac.cy/handle/7/54574 | |
dc.description.abstract | It is traditional wisdom that one should start from the goals when generating a plan in order to focus the plan generation process on potentially relevant actions. The graphplan system, however, which is the most efficient planning system nowadays, builds a "planning graph" in a forward-chaining manner. Although this strategy seems to work well, it may possibly lead to problems if the planning task description contains irrelevant information. Although some irrelevant information can be filtered out by graphplan, most cases of irrelevance are not noticed. In this paper, we analyze the effects arising from "irrelevant" information to planning task descriptions for different types of planners. Based on that, we propose a family of heuristics that select relevant information by minimizing the number of initial facts that axe used when approximating a plan by backchaining from the goals ignoring any conflicts. These heuristics, although not solution-preserving, turn out to be very useful for guiding the planning process, as shown by applying the heuristics to a large number of examples from the literature. | en |
dc.source | 4th European Conference on Planning, ECP 1997 | en |
dc.source.uri | https://www.scopus.com/inward/record.uri?eid=2-s2.0-84880674989&partnerID=40&md5=454305132e53ea0772e6a383e98d2df2 | |
dc.subject | Computers | en |
dc.subject | Artificial intelligence | en |
dc.subject | Information filtering | en |
dc.subject | Computer science | en |
dc.subject | Graphplan | en |
dc.subject | Planning graphs | en |
dc.subject | Efficient planning | en |
dc.subject | Minimizing the number of | en |
dc.subject | Plan generation | en |
dc.subject | Planning process | en |
dc.subject | Planning tasks | en |
dc.title | Ignoring irrelevant facts and operators in plan generation | en |
dc.type | info:eu-repo/semantics/article | |
dc.description.volume | 1348 LNAI | en |
dc.description.startingpage | 338 | |
dc.description.endingpage | 350 | |
dc.author.faculty | 002 Σχολή Θετικών και Εφαρμοσμένων Επιστημών / Faculty of Pure and Applied Sciences | |
dc.author.department | Τμήμα Πληροφορικής / Department of Computer Science | |
dc.type.uhtype | Article | en |
dc.description.notes | <p>Sponsors: | en |
dc.description.notes | Conference code: 104575 | en |
dc.description.notes | Cited By :16</p> | en |
dc.source.abbreviation | Lect. Notes Comput. Sci. | en |
dc.contributor.orcid | Dimopoulos, Yannis [0000-0001-9583-9754] | |
dc.gnosis.orcid | 0000-0001-9583-9754 | |