Lukáš Chrpa

Lukáš Chrpa

Auto-generated profile, based on publicly available information

Lukáš Chrpa

Czech Technical University in Prague

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
18 April 2018 in The Knowledge Engineering Review
Verified
Journal Article
Closed access
PDF file
MVMauro Vallati
Mauro Vallati
LCLukáš Chrpa
Lukáš Chrpa
TMThomas L. Mccluskey
Thomas L. Mccluskey
The International Planning Competition (IPC) is a prominent event of the artificial intelligence planning community that has been organized since 1998; it aims at fostering the development and comparison of planning approaches, assessing the state-of-the-art in planning and identifying new challenging benchmarks. IPC has a strong impact also outside the planning community, by providing a large number of ready-to-use planning engines and testing pioneering applications of planning techniques. This paper focusses on the deterministic part of IPC 2014, and describes format, participants, benchmarks as well as a thorough analysis of the results. Generally, results of the competition indicates some significant progress, but they also highlight issues and challenges that the planning community will have to face in the future.

16 June 2021 in Journal of Automated Reasoning
Verified
Journal Article
Closed access
PDF file
MVMauro Vallati
Mauro Vallati
LCLukáš Chrpa
Lukáš Chrpa
TMThomas Leo McCluskey
Thomas Leo McCluskey
FHFrank Hutter
Frank Hutter


27 September 2021 in Theory and Practice of Logic Programming
Verified
Journal Article
Open access
PDF file
WFWolfgang Faber
Wolfgang Faber
MMMichael Morak
Michael Morak
LCLukáš Chrpa
Lukáš Chrpa
In the context of planning and reasoning about actions and change, we call an action reversible when its effects can be reverted by applying other actions, returning to the original state. Renewed interest in this area has led to several results in the context of the PDDL language, widely used for describing planning tasks. In this paper, we propose several solutions to the computational problem of deciding the reversibility of an action. In particular, we leverage an existing translation from PDDL to Answer Set Programming (ASP), and then use several different encodings to tackle the problem of action reversibility for the STRIPS fragment of PDDL. For these, we use ASP, as well as Epistemic Logic Programming (ELP), an extension of ASP with epistemic operators, and compare and contrast their strengths and weaknesses.

23 August 2018 in Journal of Experimental & Theoretical Artificial Intelligence
Verified
Journal Article
Closed access
LCLukáš Chrpa
Lukáš Chrpa
MVMauro Vallati
Mauro Vallati
TMThomas Leo McCluskey
Thomas Leo McCluskey
Domain independent planning engines accept a planning task description in a language such as PDDL and return a solution plan. Performance of planning engines can be improved by gathering additional knowledge about a class of planning tasks. In this paper we present Outer Entanglements, relations between planning operators and predicates, that are used to restrict the number of operator instances. Outer Entanglements can be encoded within a planning task description, effectively reformulating it. We provide an in depth analysis and evaluation of outer entanglements illustrating the effectiveness of using them as generic heuristics for improving the efficiency of planning engines.

22 March 2019 in Computational Intelligence
Verified
Journal Article
Open access
PDF file
LCLukáš Chrpa
Lukáš Chrpa
MVMauro Vallati
Mauro Vallati
TMThomas Leo McCluskey
Thomas Leo McCluskey
In the field of automated planning, the central research focus is on domain‐independent planning engines that accept planning tasks (domain models and problem descriptions) in a description language, such as Planning Domain Definition Language, and return solution plans. The performance of planning engines can be improved by gathering additional knowledge about specific planning domain models/tasks (such as control rules) that can narrow the search for a solution plan. Such knowledge is often learned from training plans and solutions of simple tasks. Using techniques to reformulate the given planning task to incorporate additional knowledge, while keeping to the same input language, allows to exploit off‐the‐shelf planning engines. In this paper, we present inner entanglements that are relations between pairs of operators and predicates that represent the exclusivity of predicate achievement or requirement between the given operators. Inner entanglements can be encoded into a planner's input language by transforming the original planning task; hence, planning engines can exploit them. The contribution of this paper is to provide an in‐depth analysis and evaluation of inner entanglements, covering theoretical aspects such as complexity results, and an extensive empirical study using International Planning Competition benchmarks and state‐of‐the‐art planning engines.