Abstract: For each fixed $k$, iterative-width search finds optimal plans in polynomial time on tasks of bounded tuple-chain width, but the approximability of planning width has remained open even when an optimal plan is supplied. When all optimal plans visit the same state sequence, we characterize set and chain width as hitting numbers of competing
[…]
Content was trimmed to protect the source. Please visit the original article for the full text.
Read the original article:
Planning Width Is Hard to Approximate Even Given the Unique Optimal Plan
