[Question] Is “hidden complexity of wishes problem” solved?

Can the problem described in the hidden complexity of wishes (at least partially) be considered solved? I believe that current LLMs are perfectly capable of answering a question like “How do I save grandma from a burning house?” without suggesting any unexpected maximums in an underspecified utility function.

However, I still think that the existence of LLMs capable of answering such questions is not sufficient proof of solving the problem (we do not have a robot capable of performing tasks of a similar level of difficulty to the ‘saving grandma’ task, with safety properties comparable to those that a human firefighter can provide when performing ‘saving grandma’ task). But can it at least be considered evidence supporting progress in that direction? This seems like a topic worth discussing, and I expect it has been discussed somewhere. If so, please link to it in answers.