Determining redundant actions in sequential plans

Lukáš Chrpa, Thomas Leo McCluskey, Hugh Osborne

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

7 Citations (Scopus)


Automated planning even in its simplest form, classical planning, is a computationally hard problem. With the increasing involvement of intelligent systems in everyday life there is a need for more and more advanced planning techniques able to solve planning problems in little (or real) time. However, planners designed to solve planning problems as fast as possible often provide solution plans of low quality. The quality of solution plans can be improved by their post-planning analysis by which redundant actions or optimizable sub plans can be identified. In this paper, we present techniques for determining redundancy of actions in plans. Especially, we present techniques for efficient redundancy checking of pairs of inverse actions. These techniques are accompanied with necessary theoretical foundations and are also empirically evaluated using existing planning systems and standard planning benchmarks.

Original languageEnglish
Title of host publicationProceedings - 2012 IEEE 24th International Conference on Tools with Artificial Intelligence, ICTAI 2012
Number of pages8
Publication statusPublished - 2012
EventIEEE 24th International Conference on Tools with Artificial Intelligence - Athens, Greece
Duration: 7 Nov 20129 Nov 2012
Conference number: 24


ConferenceIEEE 24th International Conference on Tools with Artificial Intelligence
Abbreviated titleICTAI 2012


Dive into the research topics of 'Determining redundant actions in sequential plans'. Together they form a unique fingerprint.

Cite this