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
At bit population stage, each bit should be checked for having a reserved space in order to be able to be hold by prehensor during cutting process. The size of reserved space should be a parameter. At the moment, it will only be used when preprocessing in order to add preprocessing information like a potential cut line along the reserved space. Later this would be use in a different way, the patern population algorithms will be able to check if they can use a bit without having to cut that part or not therefore driving to a two lengh bit possibility, one with that reserved space cut, another with that space kept. THis has on impact on optimisation algorithms therefore it is not so simple to implement.
The text was updated successfully, but these errors were encountered:
This feature modify behaviour of automatics algorithms like classic brick, improved, diagonal,economic et unit square.
It should be deactivated for these patterns in order to make them work even if using a shorter bits. (means theses patterns should be using "bit lenght" instead of "bit full lenght". This means that by default these paterns will induce a cut for each bit.
laurent-daniel-utt
changed the title
add a reserved space for each bit in order to be able to hold during cutting
modify reserved space for each bit in order to be able to hold during cutting algoritm
Aug 22, 2022
At bit population stage, each bit should be checked for having a reserved space in order to be able to be hold by prehensor during cutting process. The size of reserved space should be a parameter. At the moment, it will only be used when preprocessing in order to add preprocessing information like a potential cut line along the reserved space. Later this would be use in a different way, the patern population algorithms will be able to check if they can use a bit without having to cut that part or not therefore driving to a two lengh bit possibility, one with that reserved space cut, another with that space kept. THis has on impact on optimisation algorithms therefore it is not so simple to implement.
The text was updated successfully, but these errors were encountered: