Since no classical planner consistently outperforms all others, it is important to select a planner that works well for a given classical planning task. The two strongest approaches for planner selection use image and graph convolutional neural networks. They have the drawback that the learned models are complicated and uninterpretable. To obtain explainable models, we identify a small set of simple task features and show that elementary and interpretable machine learning techniques can use these features to solve roughly as many tasks as the complex approaches based on neural networks
Cost-optimal planning has not seen many successful approaches that work well across all domains. Som...
This thesis discusses the ways in which choices are made by an AI planner. A detailed examination i...
Recently, the trend of incorporating differentiable algorithms into deep learning architectures aros...
Automated planning is one of the foundational areas of AI. Since no single planner can work well for...
As classical planning is known to be computationally hard, no single planner is expected to work wel...
Real-world planning problems often involve hundreds or even thousands of objects, straining the limi...
abstract: Classical planning is a field of Artificial Intelligence concerned with allowing autonomou...
This thesis is mainly about classical planning for artificial intelligence (AI). In planning, we dea...
We introduce a new approach to planning in STRIPS-like domains based on constructing and analyzing a...
We introduce a new approach to planning in STRIPS-like domains based on con-structing and analyzing ...
Current domain-independent, classical planners require symbolic models of the problem domain and ins...
We describe a large scale study of planners and their performance: 28 planners on 4726 benchmark pro...
AbstractWe introduce a new approach to planning in STRIPS-like domains based on constructing and ana...
The paper illustrates a novel approach to conformant planning using classical planners. The approach...
Automated planning is a branch of AI that addresses the problem of generating a course of action to ...
Cost-optimal planning has not seen many successful approaches that work well across all domains. Som...
This thesis discusses the ways in which choices are made by an AI planner. A detailed examination i...
Recently, the trend of incorporating differentiable algorithms into deep learning architectures aros...
Automated planning is one of the foundational areas of AI. Since no single planner can work well for...
As classical planning is known to be computationally hard, no single planner is expected to work wel...
Real-world planning problems often involve hundreds or even thousands of objects, straining the limi...
abstract: Classical planning is a field of Artificial Intelligence concerned with allowing autonomou...
This thesis is mainly about classical planning for artificial intelligence (AI). In planning, we dea...
We introduce a new approach to planning in STRIPS-like domains based on constructing and analyzing a...
We introduce a new approach to planning in STRIPS-like domains based on con-structing and analyzing ...
Current domain-independent, classical planners require symbolic models of the problem domain and ins...
We describe a large scale study of planners and their performance: 28 planners on 4726 benchmark pro...
AbstractWe introduce a new approach to planning in STRIPS-like domains based on constructing and ana...
The paper illustrates a novel approach to conformant planning using classical planners. The approach...
Automated planning is a branch of AI that addresses the problem of generating a course of action to ...
Cost-optimal planning has not seen many successful approaches that work well across all domains. Som...
This thesis discusses the ways in which choices are made by an AI planner. A detailed examination i...
Recently, the trend of incorporating differentiable algorithms into deep learning architectures aros...