Parallelizing State Space Plans Online
Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence. Pages 1522-1522.
Abstract
Searching for parallel solutions in state space planners is a challenging problem, because it would require the planners to branch on all possible subsets of parallel actions, exponentially increasing their branching factor. We introduce a variant of our heuristic state search planner AltAlt, which generates parallel plans by using greedy online parallelization of partial plans. Empirical results show that our online approach outperforms postprocessing (offline) techniques in terms of the quality of the solutions returned.
@inproceedings{ijcai2003p259,
title = {Parallelizing State Space Plans Online},
author = {Nigenda, Romeo Sanchez and Kambhampati, Subbarao},
booktitle = {Proceedings of the Eighteenth International Joint Conference on
Artificial Intelligence, {IJCAI-03}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Georg Gottlob},
pages = {1522--1522},
year = {2003},
url = {https://ijcai.org/proceedings/2003/259},
}
TY - CPAPER TI - Parallelizing State Space Plans Online AU - Nigenda, Romeo Sanchez AU - Kambhampati, Subbarao T2 - Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence, IJCAI-03 PB - International Joint Conferences on Artificial Intelligence PY - 2003 SP - 1522 EP - 1522 UR - https://ijcai.org/proceedings/2003/259 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
