Trajectory planning with Timefold #1420
francesco-bufalini
started this conversation in
General
Replies: 1 comment
-
In your text you state Some additional questions:
|
Beta Was this translation helpful? Give feedback.
0 replies
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Uh oh!
There was an error while loading. Please reload this page.
-
I am trying to use Timefold to assign a list of Input to a drone (a representation of the command given to the drone expressed as total thrust and torque).
To do this I am using a planning list located in the planning entity Drone. When an Input is assigned to index K of the list (which corresponds to the input that is given to the drone at time DTxK with constant DT) it triggers the calculation of the drone's state (position, speed, etc.) at time DT*K starting from the previous state and input (contained in the element at index K-1). This is possible thanks to a previous element shadow variable and several cascading update shadow variables that are located in the Input class.
Despite the convenience of these exclusive planning list mechanisms, I am forced to create N copies of each assignable Input because the best solution could be that the list, of maximum length N, is filled with the same Input. Needless to say, this causes the solution space to explode. However, reversing the problem and avoiding using a planning list is complicated because it is the only one that guarantees a sequential assignment and therefore allows the state to be calculated at the time of assignment. In the current way, the program manages to find a feasible solution in less than 100 seconds to go to any point I have tested within a radius of 15 meters (the travel time of the trajectories is always less than 1.5 seconds and I use a tolerance to the centimeter when considering distances). I am open to any type of advice and idea, especially to optimize the assignment.
.
.
Beta Was this translation helpful? Give feedback.
All reactions