Interactive Q-Learning Approach for Pick-and-Place Optimization of the Die Attach Process in the Semiconductor Industry

Algorithm 1

Routing algorithm of the interactive Q model.

Input: , , , , ,

Procedure: Initialize and

Initialize and

Initialize # : current state of the pick agent

Initialize

Until do

Increase by 1

If do# If a strip is full, the strip is replaced with a new one

# Pick agent procedure

# Select an action of the pick agent

# Update the current state of the place agent

# Update the feasible action space of the pick agent

# Place agent procedure

Increase by 1

# Select an action of the place agent

# Update the feasible action space of the place agent

Output: