STATE BASED DUMP LOCATION DETERMINATION

• US 20150186828A1
• Filed: 12/26/2013
• Published: 07/02/2015
• Est. Priority Date: 12/26/2013
• Status: Abandoned Application

• Current Assignee: Dassault Systemes Australia Pty Limited (Dassault Systemes SA)
• Original Assignee: Dassault Systemes Geovia, Inc. (Dassault Systemes SA)
• Inventors: Kapalko, Richard
• Application Number:
  US14/140,625
• Publication Number:
  US 20150186828A1
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: G06Q 10/06 Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
• CPC Class Codes: G06Q 10/06316 Sequencing of tasks or work
• CPC Class Codes: G06Q 10/08 Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
• CPC Class Codes: G06Q 50/02 Agriculture; Fishing; Forestry; Mining

Abstract

In an embodiment, a method of determining a storage location includes updating a first state corresponding to a first location in a three-dimensional area (3D area) of the plurality of locations based on a change of second state of a second location. The second location is related to the first location.

Claims

1. A method of determining a storage location, the method comprising:

updating a first state corresponding to a first location in a three-dimensional area (3D area) of the plurality of locations based on a change of second state of a second location, the second location related to the first location.

2. The method of claim 1, further comprising assigning an initial state corresponding to each of a plurality of locations in the 3D area.

3. The method of claim 1, wherein updating the first state corresponding to the first location includes one or more of:

if the second location is vertically related to the first location;

changing the first state from a state of ready to a state of floating if second location is unfilled, and changing the state from a state of floating to a state of ready if the second location is filled,

if the second location is horizontally related to the first location;

changing the first state from a state of ready to a state of lagged if the second location has a current or future operation outstanding, and changing the first state from a state of lagged to a state of ready if the second location has completed the current or future operation;

if the first location fills, changing the state from ready to full, and

if the first location unfills, changing the state from full to ready.

4. The method of claim 3, wherein a particular location with a state of ready indicates the location can be filled, and the particular location with a state of floating, lagged, or full indicates the location cannot be filled.

5. The method of claim 1, wherein the second location is related to the first location by one or more of a vertical relationship or a horizontal relationship.

6. The method of claim 1, wherein the second location is related to the first location by a vertical relationship of being stacked.

7. The method of claim 1, wherein the second location is related to the first location by a horizontal relationship of one or more of a radius or zone relative to the second location, the radius or zone indicating unavailable blocks.

8. The method of claim 1, further comprising determining the storage location by retrieving the plurality of locations having a state of ready, and selecting a particular location of the retrieved plurality of locations.

9. The method of claim 8, further comprising selecting the particular location of the retrieved plurality of locations by retrieving a first location of a sequence list.

10. A system for determining a storage location, the system comprising:

a memory configured to store a plurality of locations;

an update module configured to update a first state corresponding to a first location in a three-dimensional area (3D area) of the plurality of locations based on a change of second state of a second location of the plurality of locations, the second location related to the first location.

11. The system of claim 10, further comprising a state module configured to assign an initial state corresponding to each of a plurality of locations in the 3D area.

12. The system of claim 10, wherein the update module is further configured to update the first state corresponding to the first location by one or more of:

if the second location is vertically related to the first location;

changing the first state from a state of ready to a state of floating if second location is unfilled, and changing the state from a state of floating to a state of ready if the second location is filled,

if the second location is horizontally related to the first location;

changing the first state from a state of ready to a state of lagged if the second location has a current or future operation outstanding, and changing the first state from a state of lagged to a state of ready if the second location has completed the current or future operation;

if the first location fills, changing the state from ready to full, and

if the first location unfills, changing the state from full to ready.

13. The system of claim 12, wherein a particular location with a state of ready indicates the location can be filled, and the particular location with a state of floating, lagged, or full indicates the location cannot be filled.

14. The system of claim 10, wherein the second location is related to the first location by one or more of a vertical relationship or a horizontal relationship.

15. The system of claim 10, wherein the second location is related to the first location by a vertical relationship of being stacked.

16. The system of claim 10, wherein the second location is related to the first location by a horizontal relationship of one or more of a radius or zone relative to the second location, the radius or zone indicating unavailable blocks.

17. The system of claim 10, further comprising a scheduling module configured to determine the storage location by retrieving the plurality of locations having a state of ready, and selecting a particular location of the retrieved plurality of locations.

18. The system of claim 17, wherein the scheduling module is further configured to select the particular location of the retrieved plurality of locations by retrieving a first location of a sequence list.

19. A non-transitory computer-readable medium configured to store instructions for determining a storage location, the instructions, when loaded and executed by a processor, causes the processor to:

update a first state corresponding to a first location in a three-dimensional area (3D area) of the plurality of locations based on a change of second state of a second location, the second location related to the first location.

20. The non-transitory computer-readable medium of claim 19, wherein updating the first state corresponding to the first location includes one or more of:

if the second location is vertically related to the first location;

changing the first state from a state of ready to a state of floating if second location is unfilled, and changing the state from a state of floating to a state of ready if the second location is filled,

if the second location is horizontally related to the first location;

changing the first state from a state of ready to a state of lagged if the second location has a current or future operation outstanding, and changing the first state from a state of lagged to a state of ready if the second location has completed the current or future operation;

if the first location fills, changing the state from ready to full, and

if the first location unfills, changing the state from full to ready.