Parameterized Complexity and Kernel Bounds for Hard Planning Problems