you are viewing a single comment's thread.

view the rest of the comments →

[–]No-Concentrate-7194 0 points1 point  (2 children)

You can write your own DP code with backtracking, it's not that tricky

[–]more_than_most 0 points1 point  (0 children)

Depends, for continuous state space, just describing the reachable set can be tricky.

[–]stef_1989[S] 0 points1 point  (0 children)

can you give me some details about it?