Guided Symbolic Universal Planning

Rune Møller Jensen, Manuela M. Veloso, Randal E. Bryant

Publikation: Konference artikel i Proceeding eller bog/rapport kapitelKonferencebidrag i proceedingsForskningpeer review


Symbolic universal planning based on the reduced Ordered Binary Decision Diagram (OBDD) has been shown to be an efficient approach for planning in non-deterministic domains. To date, however, no guided algorithms exist for synthesizing universal plans. In this paper, we introduce a general approach for guiding universal planning based on an existing method for heuristic symbolic search in deterministic domains. We present three new sound and complete algorithms for best-first strong, strong cyclic, and weak universal planning. Our experimental results show that guiding the search dramatically can reduce both the computation time and the size of the generated plans.
TitelProceedings of the 13th International Conference on Automated Planning and Scheduling (ICAPS-03)
Antal sider10
ForlagAAAI Press
ISBN (Trykt)978-1-57735-187-0
StatusUdgivet - 2003


Dyk ned i forskningsemnerne om 'Guided Symbolic Universal Planning'. Sammen danner de et unikt fingeraftryk.