Why is a continuous action space harder than a discrete one?
Answer: C
With infinitely many options, the agent must optimise over the space rather than compare a list, which brings in gradients, sampling and parametrised policies. Robot control and vehicle steering are the usual examples. Execution time, state count and measurement are separate concerns. Whether a decision can be made by enumeration or requires optimisation is one of the sharpest practical divisions in agent design and it determines the whole class of algorithm used.
Please log in or register to report this question.