A genetic algorithm that generates and evaluates assembly plans is proposed This algorithm is able to generate near-optimal assembly plans through purposely developed crossover and mutation operators starting from a randomly initialized population of assembly sequences. The optimization criteria we used to assess the quality of feasible assembly sequences are: i) to minimize the orientation changes of the product; ii) to minimize the gripper changes, and iii) to group as much as possible technologically similar assembly operations. Experimental results that confirm the validity of our approach are also included.
Assembly planning based on genetic algorithms
LAZZERINI, BEATRICE;MARCELLONI, FRANCESCO;DINI, GINO;FAILLI, FRANCO
1999-01-01
Abstract
A genetic algorithm that generates and evaluates assembly plans is proposed This algorithm is able to generate near-optimal assembly plans through purposely developed crossover and mutation operators starting from a randomly initialized population of assembly sequences. The optimization criteria we used to assess the quality of feasible assembly sequences are: i) to minimize the orientation changes of the product; ii) to minimize the gripper changes, and iii) to group as much as possible technologically similar assembly operations. Experimental results that confirm the validity of our approach are also included.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.