Parallelizing State Space Plans Online
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 post-processing (offline) techniques in terms of the quality of the solutions returned.
Cite
Text
Nigenda and Kambhampati. "Parallelizing State Space Plans Online." International Joint Conference on Artificial Intelligence, 2003.Markdown
[Nigenda and Kambhampati. "Parallelizing State Space Plans Online." International Joint Conference on Artificial Intelligence, 2003.](https://mlanthology.org/ijcai/2003/nigenda2003ijcai-parallelizing/)BibTeX
@inproceedings{nigenda2003ijcai-parallelizing,
title = {{Parallelizing State Space Plans Online}},
author = {Nigenda, Romeo Sanchez and Kambhampati, Subbarao},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {2003},
pages = {1522-1523},
url = {https://mlanthology.org/ijcai/2003/nigenda2003ijcai-parallelizing/}
}