In this paper we discuss and describe preliminary results of integrating two strands of planning research - that of using plan graphs to speed up planning, and that of using object representations to better represent planning domain models. To this end we have designed and implemented OCL-graph, a plan generator which builds and searches an object-centred plan graph, extended to deal with conditional effects
We illustrate the importance of branching in planning by exploring alternative branching schemes in...
The past few years have seen a rapid development in AI Planning and Scheduling. Many algorithms and ...
STAN is a Graphplan-based planner, so-called because it uses a variety of STate ANalysis techniques ...
AbstractWe introduce a new approach to planning in STRIPS-like domains based on constructing and ana...
We introduce a new approach to planning in STRIPS-like domains based on con-structing and analyzing ...
AbstractWe introduce a new approach to planning in STRIPS-like domains based on constructing and ana...
We introduce a new approach to planning in STRIPS-like domains based on constructing and analyzing a...
STAN is a Graphplan-based planner, so-called because it uses a variety of STate ANalysis techniques ...
An important area in AI Planning is the expressiveness of planning domain specification languages su...
STAN is a Graphplan-based planner, so-called because it uses a variety of STate ANalysis techniques ...
In this paper we postulate OCLh as a prototype for future planning domain modelling languages which ...
This paper describes an extension of graphplan to a subset of ADL that allows conditional and univer...
Although the deep affinity between Graphplan's backward search, and the process of solving con...
Planning has been an area of research in artificial intelligence for over four decades. It increases...
Planning has been an area of research in artificial intelligence for over four decades. It increases...
We illustrate the importance of branching in planning by exploring alternative branching schemes in...
The past few years have seen a rapid development in AI Planning and Scheduling. Many algorithms and ...
STAN is a Graphplan-based planner, so-called because it uses a variety of STate ANalysis techniques ...
AbstractWe introduce a new approach to planning in STRIPS-like domains based on constructing and ana...
We introduce a new approach to planning in STRIPS-like domains based on con-structing and analyzing ...
AbstractWe introduce a new approach to planning in STRIPS-like domains based on constructing and ana...
We introduce a new approach to planning in STRIPS-like domains based on constructing and analyzing a...
STAN is a Graphplan-based planner, so-called because it uses a variety of STate ANalysis techniques ...
An important area in AI Planning is the expressiveness of planning domain specification languages su...
STAN is a Graphplan-based planner, so-called because it uses a variety of STate ANalysis techniques ...
In this paper we postulate OCLh as a prototype for future planning domain modelling languages which ...
This paper describes an extension of graphplan to a subset of ADL that allows conditional and univer...
Although the deep affinity between Graphplan's backward search, and the process of solving con...
Planning has been an area of research in artificial intelligence for over four decades. It increases...
Planning has been an area of research in artificial intelligence for over four decades. It increases...
We illustrate the importance of branching in planning by exploring alternative branching schemes in...
The past few years have seen a rapid development in AI Planning and Scheduling. Many algorithms and ...
STAN is a Graphplan-based planner, so-called because it uses a variety of STate ANalysis techniques ...