Parallelizing state space plans online

Romeo Sanchez Nigenda, Subbarao Kambhampati

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Scopus citations

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.

Original languageEnglish (US)
Title of host publicationIJCAI International Joint Conference on Artificial Intelligence
Pages1522-1523
Number of pages2
StatePublished - 2003
Event18th International Joint Conference on Artificial Intelligence, IJCAI 2003 - Acapulco, Mexico
Duration: Aug 9 2003Aug 15 2003

Other

Other18th International Joint Conference on Artificial Intelligence, IJCAI 2003
CountryMexico
CityAcapulco
Period8/9/038/15/03

ASJC Scopus subject areas

  • Artificial Intelligence

Cite this

Sanchez Nigenda, R., & Kambhampati, S. (2003). Parallelizing state space plans online. In IJCAI International Joint Conference on Artificial Intelligence (pp. 1522-1523)