Encoding Partial Plans for Heuristic Search
| dc.contributor.author | Bercher, Pascal | en |
| dc.contributor.author | Biundo, Susanne | en |
| dc.date.accessioned | 2026-06-19T21:42:27Z | |
| dc.date.available | 2026-06-19T21:42:27Z | |
| dc.date.issued | 2013-06-10 | en |
| dc.description.abstract | We propose a technique that allows any planning system that searches in the space of partial plans to make use of heuristics from the literature which are based on search in the space of states. The technique uses a problem encoding that reduces the problem of finding a heuristic value for a partial plan to finding a heuristic value for a state: It encodes a partial plan into a new planning problem, s.t. solutions for the new problem correspond to solutions reachable from the partial plan. Evaluating the goal distance of the partial plan then corresponds to evaluating the goal distance of the initial state in the new planning problem. | en |
| dc.description.status | Peer-reviewed | en |
| dc.format.extent | 5 | en |
| dc.identifier.other | ORCID:/0000-0002-0795-4320/work/217921787 | en |
| dc.identifier.uri | https://hdl.handle.net/1885/733811682 | |
| dc.language.iso | en | en |
| dc.relation.ispartofseries | 4th Workshop on Knowledge Engineering for Planning and Scheduling | en |
| dc.title | Encoding Partial Plans for Heuristic Search | en |
| dc.type | Conference paper | en |
| dspace.entity.type | Publication | en |
| local.bibliographicCitation.lastpage | 15 | en |
| local.bibliographicCitation.startpage | 11 | en |
| local.contributor.affiliation | Bercher, Pascal; Ulm University | en |
| local.contributor.affiliation | Biundo, Susanne; Ulm University | en |
| local.identifier.pure | 60ee9e94-63f8-4b00-873a-8a8552423825 | en |
| local.identifier.url | https://icaps13.icaps-conference.org/technical-program/workshop-program/knowledge-engineering-for-planning-and-scheduling-keps/ | en |
| local.type.status | Published | en |