An approach to safe continuous planning

Authors:
Gary Cleveland;Mike Barley
Affiliations:
University of Auckland, New Zealand;University of Auckland, New Zealand
Venue:
PRIMA'04 Proceedings of the 7th Pacific Rim international conference on Intelligent Agents and Multi-Agent Systems
Year:
2004

Citing 10
Cited 0

Planning as search: a quantitative approach

Artificial Intelligence
Automatic abstraction in planning

Automatic abstraction in planning
Automatically generating abstractions for problem solving

Automatically generating abstractions for problem solving
Automatically abstracting the effects of operators

Proceedings of the first international conference on Artificial intelligence planning systems
Knowledge-based proof planning

Artificial Intelligence
Artificial Intelligence: A Modern Approach

Artificial Intelligence: A Modern Approach
Human Problem Solving

Human Problem Solving
The downward refinement property

IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
ABTWEAK: abstracting a nonlinear, least commitment planner

AAAI'90 Proceedings of the eighth National conference on Artificial intelligence - Volume 1
Characterizing abstraction hierarchies for planning

AAAI'91 Proceedings of the ninth National conference on Artificial intelligence - Volume 2

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we discuss the “safe to act” problem, a problem associated with the safe interleaving of acting and planning. We also discuss previous research that is relevant to this problem. We then propose a specific search strategy for a general hierarchical plan-space planner that pushes portions of the emerging plan to become “execution ready” as quickly as possible. Finally, we discuss a property, critical serialisability, that is sufficient for a domain to possess in order for these portions to be “safely” executed.