What does NP-hardness look like for self-driving car tech? non-deterministic polynomial in: number of objects? number of lanes? time steps in the planning horizon? action/observation branching factor? These things are bounded in practice.
Not saying that the computational problems aren't hard. But ending the conversation at "NP Hard" throws away too many nuances.
What does NP-hardness look like for self-driving car tech? non-deterministic polynomial in: number of objects? number of lanes? time steps in the planning horizon? action/observation branching factor? These things are bounded in practice.
Not saying that the computational problems aren't hard. But ending the conversation at "NP Hard" throws away too many nuances.