An ordering on subgoals for planning

Authors:
Fangzhen Lin
Affiliations:
Department of Computer Science, The Hong Kong University of Science and Technology, Clear Water Bay, Kowloon, Hong Kong E-mail: fl@cs.ust.hk
Venue:
Annals of Mathematics and Artificial Intelligence
Year:
1997

Citing 11
Cited 3

Planning for conjunctive goals

Artificial Intelligence
Planning as search: a quantitative approach

Artificial Intelligence
Principles of artificial intelligence

Principles of artificial intelligence
Logical foundations of artificial intelligence

Logical foundations of artificial intelligence
A theoretical analysis of conjunctive-goal problems

Artificial Intelligence
The frame problem in situation the calculus: a simple solution (sometimes) and a completeness result for goal regression

Artificial intelligence and mathematical theory of computation
A theory of conflict resolution in planning

Artificial Intelligence - Special volume on constraint-based reasoning
Acquiring search-control knowledge via static analysis

Artificial Intelligence
Proving properties of states in the situation calculus

Artificial Intelligence
How to progress a database

Artificial Intelligence
Planning for temporally extended goals

AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2

Relating logic programming theories of actions and partial order planning

Annals of Mathematics and Artificial Intelligence
Declarative Formalization of Reasoning Strategies: A Case Study on Heuristic Nonlinear Planning

Annals of Mathematics and Artificial Intelligence
What robots can do: robot programs and effective achievability

Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

Subgoal ordering is a type of control information that has received much attention in AI planning community. In this paper we formulate precisely a subgoal ordering in the situation calculus. We show how information about this subgoal ordering can be deduced from the background action theory. We also show for both linear and nonlinear planners how knowledge about this ordering can be used in a provably correct way to avoid unnecessary backtracking.