{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,7]],"date-time":"2024-08-07T07:40:58Z","timestamp":1723016458147},"publisher-location":"California","reference-count":0,"publisher":"International Joint Conferences on Artificial Intelligence Organization","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,9]]},"abstract":"<jats:p>Even though automated planning is PSPACE-complete in general, satisficing planners are able to solve large planning tasks quickly. However, the found plans are often far from optimal and may even contain actions that can be removed while maintaining a valid plan. The problem of finding and eliminating the most expensive set of such redundant actions in a plan is NP-complete and there is a compilation to MaxSAT that solves it. Here, we introduce a simple and natural formulation of the problem as a  planning task. Solving it with an optimal planner guarantees finding a minimal reduction. Our experiments show that this is competitive with the previous state of the art for optimal action elimination.<\/jats:p>","DOI":"10.24963\/kr.2023\/80","type":"proceedings-article","created":{"date-parts":[[2023,7,31]],"date-time":"2023-07-31T22:27:47Z","timestamp":1690842467000},"page":"774-778","source":"Crossref","is-referenced-by-count":0,"title":["Eliminating Redundant Actions from Plans Using Classical Planning"],"prefix":"10.24963","author":[{"given":"Mauricio","family":"Salerno","sequence":"first","affiliation":[{"name":"Universidad Carlos III de Madrid"}]},{"given":"Raquel","family":"Fuentetaja","sequence":"additional","affiliation":[{"name":"Universidad Carlos III de Madrid"}]},{"given":"Jendrik","family":"Seipp","sequence":"additional","affiliation":[{"name":"Link\u00f6ping University"}]}],"member":"10584","event":{"number":"20","sponsor":["Artificial Intelligence Journal","Principles of Knowledge Representation and Reasoning Inc.","Academic College of Tel-Aviv","European Association for Artificial Intelligence","National Science Foundation"],"acronym":"KR-2023","name":"20th International Conference on Principles of Knowledge Representation and Reasoning {KR-2023}","start":{"date-parts":[[2023,9,2]]},"theme":"Artificial Intelligence","location":"Rhodes, Greece","end":{"date-parts":[[2023,9,8]]}},"container-title":["Proceedings of the Twentieth International Conference on Principles of Knowledge Representation and Reasoning"],"original-title":[],"deposited":{"date-parts":[[2023,7,31]],"date-time":"2023-07-31T22:29:18Z","timestamp":1690842558000},"score":1,"resource":{"primary":{"URL":"https:\/\/proceedings.kr.org\/2023\/80"}},"subtitle":[],"proceedings-subject":"Artificial Intelligence Research Articles","short-title":[],"issued":{"date-parts":[[2023,9]]},"references-count":0,"URL":"https:\/\/doi.org\/10.24963\/kr.2023\/80","relation":{},"subject":[],"published":{"date-parts":[[2023,9]]}}}