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
How does FillGapsOfParetoFrontSequence2D deal with jumps in the PF? Currently, assuming there is only one area between points of the PF where no solutions can be identified, the distance between the points closest to the are will remain to be the largest one. Thus, FillGapsOfParetoFrontSequence2D will try to identify points in that range and waste computation time while other points on the PF remain undetected.
My quick fix would be to remember the last identified gap and if it is the same as the current gap, the next larger distance will be selected. This has the downside, that the jump will be revisited every second time. Maybe there is a better solution to that?
The text was updated successfully, but these errors were encountered:
How does FillGapsOfParetoFrontSequence2D deal with jumps in the PF? Currently, assuming there is only one area between points of the PF where no solutions can be identified, the distance between the points closest to the are will remain to be the largest one. Thus, FillGapsOfParetoFrontSequence2D will try to identify points in that range and waste computation time while other points on the PF remain undetected.
My quick fix would be to remember the last identified gap and if it is the same as the current gap, the next larger distance will be selected. This has the downside, that the jump will be revisited every second time. Maybe there is a better solution to that?
The text was updated successfully, but these errors were encountered: