×

Stack handling operation method, system, and computer program

  • US 9,495,654 B2
  • Filed: 09/24/2013
  • Issued: 11/15/2016
  • Est. Priority Date: 09/11/2012
  • Status: Active Grant
First Claim
Patent Images

1. A computer-implemented method for searching transition routes from an initial state of a plurality of stackable items to a target state by a computer at predetermined conditions, comprising:

  • receiving a current state of a plurality of stacks, wherein a stack from the plurality of stacks is used to store stackable inventory, and a state of the stacks comprises an order in which the stackable inventory is stored in the stacks;

    determining a target state of the plurality of stacks based on a production schedule that is indicative of a sequence in which the stackable inventory is to be used;

    identifying one or more sequences of transitionable states to rearrange the inventory according to the target state from the current state, wherein a difference between consecutive transitionable states is a single operation;

    calculating an operation cost of each of the sequences of transitionable states, based on a cost associated with movement of the inventory according to the transitionable states, and by identification of a plurality of cut-positions in the current state, wherein each cut-position is indicative of a separation for a crane to operate at least once, and wherein a first cut-position from the plurality of cut-positions is identified at a first position in the initial state based on a comparison of the initial state and the target state, in response to;

    the first position in the initial state holding an inventory item that exists at a first target position in the target state; and

    a second position in the initial state that is adjacent to the first position holding an inventory item that does not match a corresponding adjacent position in the target state;

    selecting a sequence of transitionable states to rearrange the inventory from the current state to the target state that minimizes the operation cost by using a heuristic search algorithm to minimize a number of cut-positions; and

    instructing the crane to arrange the inventory according to the sequence of transitionable states selected from the one or more sequences of transitionable states.

View all claims
  • 1 Assignment
Timeline View
Assignment View
    ×
    ×