Abstract
We now verify the hypotheses we stated in Section 7.2, i.e., we determine what exactly the local search topology under h + is in our domains. It turns out that all the hypotheses are true except those about the Assembly domain. As a side effect of the proofs we also determine what the structural reasons are behind the topological phenomena, on the level of the planning tasks’ specifications. The investigation proceeds as follows.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Hoffmann, J. (2003). Chapter 8: Verifying the h + Hypotheses. In: Utilizing Problem Structure in Planning. Lecture Notes in Computer Science(), vol 2854. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39607-9_8
Download citation
DOI: https://doi.org/10.1007/978-3-540-39607-9_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20259-2
Online ISBN: 978-3-540-39607-9
eBook Packages: Springer Book Archive