New Type of Recipe for Collision Avoidance among AGVs Focusing No-Buffer Constraint

抄録

A new type of recipe for route assignments is proposed to plan the operations to be solved in the no-buffer scheduling problem. A specific constraint of the scheduling problem prohibits automated guided vehicles (AGVs) passing each other on one route. The mathematical expression for the no-buffer scheduling problem is prepared in the form of mixed-integer programming. The original template of the schedules’ recipe is proposed to construct the zone control, prohibiting undesirable collisions among the AGVs. Also, computer simulations are examined to the different factory production route to verify the proposed approach.