|
HKUST Institutional Repository >
Computer Science and Engineering >
CSE Conference Papers >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/1783.1/758
|
| Title: | On measuring plan quality (a preliminary report) |
| Authors: | Lin, Fangzhen |
| Keywords: | Plan quality
STRIPS |
| Issue Date: | 1998 |
| Citation: | Proceedings of the Sixth International Conference on Principles of Knowledge Representation and Reasoning (KR '98) pp. 224-233, Trento, Italy, June 1998 |
| Abstract: | By using an example from a robot navigating domain we argue that to specify declaratively the behavior of an agent, we need to have a formal and explicit notion of "quality plans". To that end, we propose the following three domain independent measures of plan quality: a plan is said to be A-minimal if none of the actions in it can be deleted and have it continue to be a plan; it is said to be B-minimal if none of its segments can be deleted and have it continue to be a plan; and it is said to be C-minimal if none of its segments can be replaced by a single action and have it continue to be a plan. We show that given a plan, checking if it satisfies any of these three measures, and if not transforming it into one that does, can be done in polynomial numbers of plan tests. We also show how these three notions of plan minimality can be axiomatized naturally and straightforwardly in the situation calculus and, as a result, show their relationships with STRIPS triangle tables. Finally, we show their applications in the declarative specifications of agents' behaviours. |
| URI: | http://hdl.handle.net/1783.1/758 |
| Appears in Collections: | CSE Conference Papers
|
Files in This Item:
| File |
Description |
Size | Format |
|---|
| kr98.pdf | | 202Kb | Adobe PDF | View/Open |
|
All items in this Repository are protected by copyright, with all rights reserved.
|
