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 language | English (US) |
|---|---|
| Title of host publication | IJCAI International Joint Conference on Artificial Intelligence |
| Pages | 1522-1523 |
| Number of pages | 2 |
| State | Published - 2003 |
| Event | 18th International Joint Conference on Artificial Intelligence, IJCAI 2003 - Acapulco, Mexico Duration: Aug 9 2003 → Aug 15 2003 |
Other
| Other | 18th International Joint Conference on Artificial Intelligence, IJCAI 2003 |
|---|---|
| Country/Territory | Mexico |
| City | Acapulco |
| Period | 8/9/03 → 8/15/03 |
ASJC Scopus subject areas
- Artificial Intelligence