Corpus ID: 16176732

Towards an Integration of Golog and Planning

@inproceedings{Claen2007TowardsAI,
  title={Towards an Integration of Golog and Planning},
  author={Jens Cla{\ss}en and Patrick Eyerich and G. Lakemeyer and B. Nebel},
  booktitle={IJCAI},
  year={2007}
}
The action language Golog has been applied successfully to the control of robots, among other things. Perhaps its greatest advantage is that a user can write programs which constrain the search for an executable plan in a flexible manner. However, when general planning is needed, Golog supports this only in principle, but does not measure up with state-of-the-art planners. In this paper we propose an integration of Golog and planning in the sense that planning problems, formulated as part of a… Expand
Planning and Verification in the agent language Golog
TLDR
This thesis proposes an integration of Golog and planning where planning subtasks encountered during the execution of a Golog program are referred to a PDDL planner, thus combining Golog’s expressiveness with the efficiency of modern planners. Expand
Integrating Golog and Planning : An Empirical Evaluation
TLDR
An empirical evaluation shows that equipping IndiGolog with a PDDL planner (FF in this case) pays off in terms of the runtime performance of the overall system. Expand
Platas—Integrating Planning and the Action Language Golog
TLDR
The theoretical foundation is laid by a mapping between the planning language Pddl and the Situation Calculus, which is underlying Golog, together with a study of how these formalisms relate in terms of expressivity. Expand
On the Relative Expressiveness of ADL and Golog: The Last Piece in the Puzzle
TLDR
Using Nebel's compilation framework, a maximal fragment of basic action theories is identified, the formalism Golog is based on, that is expressively equivalent to the ADL subset of PDDL. Expand
1 Golog-Style Search Control for Planning
Domain control knowledge (DCK) has proven effective in improving the efficiency of plan generation by reducing the search space for a plan. Procedural DCK is a compelling type of DCK that supports aExpand
GOLOG and PDDL: what is the relative expressiveness?
Action formalisms such as GOLOG or FLUX have been developed primarily for representing and reasoning about change in a logical framework. For this reason, expressivity was the main goal in theExpand
Continual Planning in Golog
TLDR
This work formalize and implement continual planning in GOLOG which was so far only supported in PDDL-based systems and shows that the approach supports expressive behavior specification combined with efficient sub-plan generation to handle dynamic environments and incomplete knowledge in a unified way. Expand
Effective search techniques for non-classical planning via reformulation
TLDR
This thesis shows that many of the most successful advances in classical planning can be leveraged for solving compelling non-classical problems, and shows that both the problems of planning with temporally extended goals and with procedural control can be mapped into classical planning. Expand
A Situation-Calculus Semantics for an Expressive Fragment of PDDL
TLDR
An alternative semantics for an expressive fragment of PDDL within the situation calculus is proposed, which is purely declarative, making it amenable to an analysis in terms of logical entailments and facilitates the comparison with and mapping to other formalisms that are defined on top of the same logic, such as the agent control language Golog. Expand
P 2 : A Baseline Approach to Planning with Control Structures and Programs
Many planners model planning domains with “primitive actions,” where action preconditions are represented by sets of simple tests about the state of domain fluents, and action effects are describedExpand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 22 REFERENCES
GOLOG and PDDL: what is the relative expressiveness?
Action formalisms such as GOLOG or FLUX have been developed primarily for representing and reasoning about change in a logical framework. For this reason, expressivity was the main goal in theExpand
PDDL2.1: An Extension to PDDL for Expressing Temporal Planning Domains
TLDR
The syntax of the language, PDDL2.1, is described, which has considerable modelling power -- exceeding the capabilities of current planning technology -- and presents a number of important challenges to the research community. Expand
GOLOG: A Logic Programming Language for Dynamic Domains
TLDR
A new logic programming language called GOLOG whose interpreter automatically maintains an explicit representation of the dynamic world being modeled, on the basis of user supplied axioms about the preconditions and effects of actions and the initial state of the world is proposed. Expand
On the Semantics of Deliberation in IndiGolog — from Theory to Implementation
TLDR
An account of the kind of deliberation that an agent that is doing planning or executing high-level programs under incomplete information must be able to perform is developed and deliberation in the situation calculus based IndiGolog agent programming language is characterized in terms of it. Expand
The FF Planning System: Fast Plan Generation Through Heuristic Search
TLDR
A novel search strategy is introduced that combines hill-climbing with systematic search, and it is shown how other powerful heuristic information can be extracted and used to prune the search space. Expand
Heuristic Search Planner 2.0
TLDR
The hsp2.0 planning algorithm that entered the second planning contest held at the Fifth International Conference on Artificial Intelligence Planning and Scheduling (AIPS'00) is described and its performance is compared with two other optimal planners, stan and blackbox. Expand
Experiences with an Interactive Museum Tour-Guide Robot
TLDR
The software architecture of an autonomous, interactive tour-guide robot is presented, which integrates localization, mapping, collision avoidance, planning, and various modules concerned with user interaction and Web-based telepresence and enables robots to operate safely, reliably, and at high speeds in highly dynamic environments. Expand
Semantics for a useful fragment of the situation calculus
TLDR
It is argued that the fragment of the situation calculus represented by ES is rich enough to handle the basic action theories defined by Reiter as well as Golog and it is shown that in the full second-order version of ES, almost all of the scenario calculus can be accommodated. Expand
Knowledge in Action: Logical Foundations for Specifying and Implementing Dynamical Systems
TLDR
When I started out as a newly hatched PhD student, one of the first articles I read and understood was Ray Reiter’s classic article on default logic, and I became fascinated by both default logic and, more generally, non-monotonic logics. Expand
How to Progress a Database
TLDR
This paper considers the general problem of progressing an initial database in response to a given sequence of actions and appeals to the situation calculus and an axiomatization of actions which addresses the frame problem. Expand
...
1
2
3
...