You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Ways of thinking that possibly can help solve this problem
Find all possible paths from fixed point A to arbitrary point B (or arbitrary point A to arbitrary point B), maybe somehow find the function nextStepAction(kinematicState).
Kinematic constraint:
If we have an action function, we can easily get a trajectory, but how can we solve the inverse problem? What if we have a trajectory and the problem is to compute an action function?
А continuous space in practice may contain parts similar to each other can this be used somehow?
Can the simulation car track the path perfectly?
Maybe take account of smooth path by kinematic constraint.
The text was updated successfully, but these errors were encountered: