Subgoal Ordering and Goal Augmentation for Heuristic Problem Solving
Proceedings of the Tenth International Joint Conference on Artificial Intelligence. Reasoning. Pages 1018-1023.
Abstract
In order to improve the performance of heurist ic search for finding opt imal solutions, two high level problem solving strategies, namely, subgoal ordering and goal augmentation, have been developed. The essence of these two strategies is to make explicit the knowledge embedded in a general problem formulation which can be used to constrain the solution search space. These two strategies have been incorporated into a methodology which we previously developed for automatically generating admissible search heuristics. The effectiveness of these strategies is demonstrated by the application to robot optimal task planning problems.
@inproceedings{ijcai1987p210,
title = {Subgoal Ordering and Goal Augmentation for Heuristic Problem Solving},
author = {Irani, Keki B. and Cheng, Jie},
booktitle = {Proceedings of the Tenth International Joint Conference on
Artificial Intelligence, {IJCAI-87}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {John McDermott},
pages = {1018--1023},
year = {1987},
note = {Reasoning},
url = {https://ijcai.org/proceedings/1987/210},
}
TY - CPAPER TI - Subgoal Ordering and Goal Augmentation for Heuristic Problem Solving AU - Irani, Keki B. AU - Cheng, Jie T2 - Proceedings of the Tenth International Joint Conference on Artificial Intelligence, IJCAI-87 PB - International Joint Conferences on Artificial Intelligence PY - 1987 SP - 1018 EP - 1023 UR - https://ijcai.org/proceedings/1987/210 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
