CN110659851A - Data processing method and system, computer system and computer readable medium - Google Patents

Data processing method and system, computer system and computer readable medium Download PDF

Info

Publication number
CN110659851A
CN110659851A CN201810704547.8A CN201810704547A CN110659851A CN 110659851 A CN110659851 A CN 110659851A CN 201810704547 A CN201810704547 A CN 201810704547A CN 110659851 A CN110659851 A CN 110659851A
Authority
CN
China
Prior art keywords
storage unit
preset
storage
attribute data
size
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN201810704547.8A
Other languages
Chinese (zh)
Inventor
李泽国
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beijing Jingdong Qianshi Technology Co Ltd
Original Assignee
Tianjin Jingdong Shentuo Robot Technology Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Tianjin Jingdong Shentuo Robot Technology Co Ltd filed Critical Tianjin Jingdong Shentuo Robot Technology Co Ltd
Priority to CN201810704547.8A priority Critical patent/CN110659851A/en
Publication of CN110659851A publication Critical patent/CN110659851A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00Administration; Management
    • G06Q10/08Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
    • G06Q10/087Inventory or stock management, e.g. order filling, procurement or balancing against orders

Landscapes

  • Business, Economics & Management (AREA)
  • Economics (AREA)
  • Engineering & Computer Science (AREA)
  • Marketing (AREA)
  • Quality & Reliability (AREA)
  • Finance (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Human Resources & Organizations (AREA)
  • Accounting & Taxation (AREA)
  • Operations Research (AREA)
  • Development Economics (AREA)
  • Strategic Management (AREA)
  • Tourism & Hospitality (AREA)
  • Physics & Mathematics (AREA)
  • General Business, Economics & Management (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)

Abstract

The present disclosure provides a data processing method, including: acquiring preset attribute data of a plurality of storage units arranged in a storage container, wherein the preset attribute data are used for representing preset identifications and preset sizes of the storage units; acquiring characteristic attribute data of an object to be stored; searching whether a storage unit capable of placing the object to be stored inside exists in the storage container; and under the condition that the storage container does not have a storage unit capable of placing the object to be stored inside, adjusting the preset attribute data of at least one storage unit according to the characteristic attribute data to determine a target storage unit capable of placing the object to be stored inside. The present disclosure also provides a data processing system, a computer system and a computer readable medium.

Description

Data processing method and system, computer system and computer readable medium
Technical Field
The present disclosure relates to the field of data processing, and more particularly, to a data processing method and system, and a computer system and a computer-readable medium.
Background
The traditional warehouse management mode has the defects of low efficiency and the like caused by excessive manual participation, and can not meet the requirements on intellectualization and high efficiency of warehouse management caused by rapid development of the logistics industry, so that the problem of how to improve the intellectualization level of warehouse management becomes urgent to be solved. Generally, in order to manage and position goods in a warehouse conveniently, each layer of the shelf can be split into a plurality of storage positions, corresponding storage position codes are pasted on the storage positions, and the goods at the corresponding positions can be placed or unloaded according to the storage position codes when the goods are put on or off the shelf.
However, in implementing the concept of the present disclosure, the inventors found that at least the following problems exist in the related art: in the related art, since the size of the storage position in the shelf is fixed, the problem that the storage position is not matched with the goods may be caused.
In view of the above problems in the related art, no effective solution has been proposed at present.
Disclosure of Invention
In view of the above, the present disclosure provides a data processing method and a data processing system, a computer system, and a computer readable medium.
A first aspect of the present disclosure provides a data processing method, including: acquiring preset attribute data of a plurality of storage units arranged in a storage container, wherein the preset attribute data are used for representing preset marks and preset sizes of the storage units; acquiring characteristic attribute data of an object to be stored; searching whether a storage unit capable of placing the object to be stored inside exists in the storage container; and under the condition that the storage container does not have a storage unit capable of placing the object to be stored inside, adjusting the preset attribute data of at least one storage unit according to the characteristic attribute data to determine a target storage unit capable of placing the object to be stored inside.
According to an embodiment of the present disclosure, the storage container includes at least one layer of storage spaces isolated from each other, each layer of storage space includes at least one storage unit, and the acquiring preset attribute data of a plurality of storage units disposed in the storage container includes: acquiring an initialization rule of each storage unit in the storage container; acquiring the preset size of each storage unit based on the initialization rule; acquiring the position information of each storage unit in the storage container; and acquiring preset identifications of the storage units based on the position information.
According to an embodiment of the present disclosure, adjusting the preset attribute data of at least one storage unit according to the characteristic attribute data to determine a target storage unit that can place the object to be stored inside includes: determining a target size of the target storage unit based on the characteristic attribute data; detecting whether a first storage unit and a second storage unit which are adjacent to each other and are available exist in the storage container; determining whether the sum of a first preset size and a second preset size is larger than the target size in a specified dimension based on a first preset size of the first storage unit and a second preset size of the second storage unit under the condition that the first storage unit and the second storage unit are detected; and under the condition that the sum of the first preset size and the second preset size is larger than the target size in a specified dimension, combining the first storage unit and the second storage unit to form a new first storage unit, and adjusting the preset attribute data of the new first storage unit according to the characteristic attribute data to determine a target storage unit capable of placing the object to be stored inside.
According to an embodiment of the present disclosure, adjusting the preset attribute data of the new first storage unit according to the characteristic attribute data includes: acquiring a first preset identifier of the first storage unit; setting the preset identifier of the new first storage unit as the first preset identifier; and sequentially updating the preset identifications of the other storage units except the new first storage unit according to a preset rule.
According to an embodiment of the present disclosure, the adjusting the preset attribute data of at least one storage unit according to the characteristic attribute data to determine a target storage unit capable of placing the object to be stored inside includes: detecting whether a third storage unit with a preset size larger than the target size exists in the storage container; and splitting the third storage unit into a fourth storage unit and a fifth storage unit according to the characteristic attribute data when the third storage unit having a preset size larger than the target size exists in the storage container, wherein the preset size of the fourth storage unit is adapted to the target size, and the fourth storage unit is determined as the target storage unit.
According to an embodiment of the present disclosure, the method further includes: acquiring a second preset identifier of the third storage unit; setting the preset identifier of the fourth storage unit as the second preset identifier; and sequentially updating the preset identifications of the other storage units except the fourth storage unit according to a preset rule.
A second aspect of the present disclosure provides a data processing system comprising: the device comprises a first acquisition module, a second acquisition module and a third acquisition module, wherein the first acquisition module is used for acquiring preset attribute data of a plurality of storage units arranged in a storage container, and the preset attribute data is used for representing preset marks and preset sizes of the storage units; the second acquisition module is used for acquiring the characteristic attribute data of the object to be stored; the searching module is used for searching whether a storage unit capable of placing the object to be stored in the storage container exists or not; and an adjusting module, configured to adjust preset attribute data of at least one storage unit according to the characteristic attribute data when a storage unit, in which the object to be stored can be placed, does not exist in the storage container, so as to determine a target storage unit, in which the object to be stored can be placed.
According to an embodiment of the present disclosure, the first obtaining module includes: a first obtaining unit, configured to obtain an initialization rule of each storage unit in the storage container; the second acquisition unit is used for acquiring the preset size of each storage unit based on the initialization rule; a third acquiring unit, configured to acquire position information of each storage unit in the storage container; and a fourth obtaining unit, configured to obtain the preset identifier of each storage unit based on the location information.
According to an embodiment of the present disclosure, the adjusting module includes: a first determining unit configured to determine a target size of the target storage unit based on the characteristic attribute data; a first detecting unit for detecting whether there are a first storage unit and a second storage unit adjacent to each other and available in the storage container; a second determining unit configured to determine, when the first storage unit and the second storage unit are detected, whether a sum of a first preset size of the first storage unit and a second preset size of the second storage unit is larger than the target size in a specified dimension based on the first preset size of the first storage unit and the second preset size of the second storage unit; and a first adjusting unit, configured to, when a sum of the first preset size and the second preset size is larger than the target size in a specified dimension, combine the first storage unit and the second storage unit to form a new first storage unit, and adjust preset attribute data of the new first storage unit according to the characteristic attribute data, so as to determine a target storage unit in which the object to be stored can be placed.
According to an embodiment of the present disclosure, the first adjusting unit includes: the first obtaining subunit is configured to obtain a first preset identifier of the first storage unit; a first setting subunit, configured to set a preset identifier of the new first storage unit as the first preset identifier; and the first updating subunit is used for sequentially updating the preset identifications of the other storage units except the new first storage unit according to a preset rule.
According to an embodiment of the present disclosure, the adjusting module includes: a second detecting unit for detecting whether a third storage unit having a preset size larger than the target size exists in the storage container; and a second adjusting unit configured to, when a third storage unit having a preset size larger than the target size exists in the storage container, split the third storage unit into a fourth storage unit and a fifth storage unit according to the characteristic attribute data, wherein the preset size of the fourth storage unit is adapted to the target size, and the fourth storage unit is determined as the target storage unit.
According to an embodiment of the present disclosure, the second adjusting unit includes: the second obtaining subunit is configured to obtain a second preset identifier of the third storage unit; a second setting subunit, configured to set the preset identifier of the fourth storage unit as the second preset identifier; and the second updating subunit is used for sequentially updating the preset identifications of the other storage units except the fourth storage unit according to a preset rule.
Another aspect of the present disclosure provides a computer system comprising: one or more processors; a memory for storing one or more programs, wherein the one or more programs, when executed by the one or more processors, cause the one or more processors to implement the method as described above.
Another aspect of the present disclosure provides a computer-readable storage medium having stored thereon executable instructions that, when executed by a processor, cause the processor to implement the method as described above.
Another aspect of the present disclosure provides a computer program comprising computer executable instructions for implementing the method as described above when executed.
According to the embodiment of the disclosure, due to the adoption of the technical scheme that the target storage unit is determined according to the characteristic attribute data of the object to be stored and the preset attribute data of the storage unit, the technical problem that the object to be stored is not matched with the storage unit due to the fixed preset size of the storage unit in the related art can be at least partially overcome, and therefore, the technical effects of dynamically managing the storage unit in the storage container and improving the management efficiency are achieved.
Drawings
The above and other objects, features and advantages of the present disclosure will become more apparent from the following description of embodiments of the present disclosure with reference to the accompanying drawings, in which:
FIG. 1 schematically illustrates an application scenario of a data processing method and a data processing system according to an embodiment of the present disclosure;
FIG. 2 schematically shows a flow chart of a data processing method according to an embodiment of the present disclosure;
FIG. 3A schematically illustrates a flow chart for obtaining preset attribute data for a plurality of storage units disposed in a storage container according to an embodiment of the disclosure;
FIG. 3B is a flow chart that schematically illustrates adjusting the default attribute data of at least one storage unit according to the characteristic attribute data to determine a target storage unit that can internally locate an object to be stored, according to an embodiment of the present disclosure;
FIG. 3C schematically shows a flow chart for adjusting the preset attribute data of the new first storage unit according to the feature attribute data according to an embodiment of the present disclosure;
FIG. 3D schematically illustrates a flow chart of adjusting the preset attribute data of at least one storage unit according to the characteristic attribute data to determine a target storage unit where an object to be stored can be placed inside according to an embodiment of the present disclosure;
FIG. 3E schematically illustrates a flow chart of adjusting the preset attribute data of at least one storage unit according to the characteristic attribute data to determine a target storage unit where an object to be stored can be placed inside according to yet another embodiment of the present disclosure;
FIG. 4 schematically shows a block diagram of a data processing system according to an embodiment of the present disclosure;
FIG. 5A schematically illustrates a block diagram of a first acquisition module according to an embodiment of the present disclosure;
FIG. 5B schematically illustrates a block diagram of an adjustment module according to an embodiment of the disclosure;
fig. 5C schematically shows a block diagram of a first adjustment unit according to an embodiment of the present disclosure;
FIG. 5D schematically illustrates a block diagram of an adjustment module according to another embodiment of the present disclosure;
fig. 5E schematically shows a block diagram of a second adjustment unit according to an embodiment of the present disclosure; and
FIG. 6 schematically shows a block diagram of a computer system suitable for implementing the data processing method according to an embodiment of the present disclosure.
Detailed Description
Hereinafter, embodiments of the present disclosure will be described with reference to the accompanying drawings. It should be understood that the description is illustrative only and is not intended to limit the scope of the present disclosure. In the following detailed description, for purposes of explanation, numerous specific details are set forth in order to provide a thorough understanding of the embodiments of the disclosure. It may be evident, however, that one or more embodiments may be practiced without these specific details. Moreover, in the following description, descriptions of well-known structures and techniques are omitted so as to not unnecessarily obscure the concepts of the present disclosure.
The terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the disclosure. The terms "comprises," "comprising," and the like, as used herein, specify the presence of stated features, steps, operations, and/or components, but do not preclude the presence or addition of one or more other features, steps, operations, or components.
All terms (including technical and scientific terms) used herein have the same meaning as commonly understood by one of ordinary skill in the art unless otherwise defined. It is noted that the terms used herein should be interpreted as having a meaning that is consistent with the context of this specification and should not be interpreted in an idealized or overly formal sense.
Where a convention analogous to "at least one of A, B and C, etc." is used, in general such a construction is intended in the sense one having skill in the art would understand the convention (e.g., "a system having at least one of A, B and C" would include but not be limited to systems that have a alone, B alone, C alone, a and B together, a and C together, B and C together, and/or A, B, C together, etc.). Where a convention analogous to "A, B or at least one of C, etc." is used, in general such a construction is intended in the sense one having skill in the art would understand the convention (e.g., "a system having at least one of A, B or C" would include but not be limited to systems that have a alone, B alone, C alone, a and B together, a and C together, B and C together, and/or A, B, C together, etc.). It will be further understood by those within the art that virtually any disjunctive word and/or phrase presenting two or more alternative terms, whether in the description, claims, or drawings, should be understood to contemplate the possibilities of including one of the terms, either of the terms, or both terms. For example, the phrase "a or B" should be understood to include the possibility of "a" or "B", or "a and B".
The present disclosure provides a data processing method, including: acquiring preset attribute data of a plurality of storage units arranged in a storage container, wherein the preset attribute data are used for representing preset identifications and preset sizes of the storage units; acquiring characteristic attribute data of an object to be stored; searching whether a storage unit capable of placing the object to be stored inside exists in the storage container; and under the condition that the storage container does not have a storage unit capable of placing the object to be stored inside, adjusting the preset attribute data of at least one storage unit according to the characteristic attribute data to determine a target storage unit capable of placing the object to be stored inside.
Fig. 1 schematically shows an application scenario 100 of a data processing method and a data processing system according to an embodiment of the present disclosure. It should be noted that fig. 1 is only an example of a system architecture to which the embodiments of the present disclosure may be applied to help those skilled in the art understand the technical content of the present disclosure, and does not mean that the embodiments of the present disclosure may not be applied to other devices, systems, environments or scenarios.
The application scenario 100 of the data processing method and the data processing system according to the embodiment of the present disclosure may be any storage container including a plurality of storage units. For convenience of illustration, fig. 1 schematically shows a storage container 00001. Each storage unit in the storage container 00001 has preset attribute data, for example, a preset identifier can be set for each storage unit according to actual needs, and a size can be preset for each storage unit according to the length, width (depth) and height of the storage container 00001, so as to meet the intelligent management requirement.
Taking fig. 1 as an example, the storage container 00001 takes the lower left corner as the origin of coordinates, that is, the storage container is numbered from bottom to top, if the lowest layer is 1, each layer can be numbered from left to right, if the leftmost layer is 1, during initialization, each layer is a storage unit, according to the identifier of each storage unit, the location information of the storage unit in the storage container can be conveniently obtained, and similarly, according to the specification of the storage container, the preset size information of each storage unit can also be conveniently obtained. For example, for a shelf, when opening the warehouse, the inventory system initializes shelf data, fixes the length of the shelf number, and sequentially identifies, for example 00001 is a shelf identifier of one, and the shelf is physically layered, from bottom to top, for example, the bottom layer is 1, and each layer is identified from left to right, for example, the left side is 1. When initializing, each layer is a goods grid, the storage position identification is connected with the default connection symbol according to the rule, if: 00001-1-1 is labeled as the first compartment on the left of shelf level one.
It should be noted that, the coordinate system in which the lower left corner is used as the origin for setting the preset attribute of each storage unit in the storage container is only exemplary, and is not a specific limitation on the setting mode of the preset attribute, and can be set by itself according to actual needs, which is not described herein again.
After the preset attributes of a plurality of storage units in the storage container are set, the goods can be conveniently and flexibly put on and off, and when the goods are put on the shelf, the system resolves the goods into goods shelves, goods shelf layers and storage level layer marks according to the positioned storage level numbers. And positioning the physical position of the goods shelf according to the goods shelf number, positioning the physical position of the storage position on the goods shelf according to the goods shelf layer and the storage position layer identification, and highlighting the position of the goods shelf on an interface provided by the system in proportion. If 00001-1-2, the left side 00001-1-1-1 is recorded in the system to 30cm in length, the 00001-1-2 depot starting point can be located at 30cm from the left side shelf edge at the first level of 00001 shelves.
In this context, in different description scenarios, the storage unit may be described as a goods grid, the storage unit may be described as a storage location, the storage container may be described as a shelf, and the preset identifier may be described as a code.
It should be understood that the storage container, the number of storage units in the storage container in fig. 1 is merely illustrative. There may be any number of storage containers and any number of storage units in each storage container, as desired for the implementation.
Fig. 2 schematically shows a flow chart of a data processing method according to an embodiment of the present disclosure.
As shown in fig. 2, the method may include operations S210 to S240. Wherein:
in operation S210, preset attribute data of a plurality of storage units disposed in a storage container is acquired.
In operation S220, feature attribute data of an object to be stored is acquired.
In operation S230, a search is made for whether a storage unit in which an object to be stored can be placed exists in the storage container.
In operation S240, in the case that there is no storage unit in the storage container in which the object to be stored can be placed, the preset attribute data of at least one storage unit is adjusted according to the characteristic attribute data to determine a target storage unit in which the object to be stored can be placed.
According to the embodiment of the disclosure, for one storage container, any number of storage units may be set, each storage unit may have its own preset attribute, and the preset attribute data is used to represent the preset identifier and the preset size of each storage unit in the storage container, for example, the identifier information of the storage unit associated with the storage container may be included to specify the preset position, and the length, the height, and the width of the storage unit are used to specify the preset size. As described in fig. 1, will not be described in detail herein.
It should be noted that the preset attributes of each storage unit may be the same or different, and the disclosure is not limited thereto. For convenience of description, the present disclosure only uses the example that the preset attributes of the storage units in the storage container are the same, and the embodiments of the present disclosure are described in detail, and for the case that the preset attributes of the storage units are different, the embodiments can be properly displayed according to the spirit of the present disclosure, and details are not repeated herein.
According to the embodiment of the present disclosure, an object to be stored is any object that needs to be shelved into a storage container, the object has a characteristic attribute, and the characteristic attribute data is used as one of bases for determining a target storage unit for storing the object to be stored, for example, the characteristic attribute data may be an item type, an object code, and appearance attribute data for representing a length, a width, and a height of the object, and the like of the object, and as long as the bases for determining the target storage unit for storing the object to be stored are within the protection scope of the present disclosure, details of the bases are not repeated here. The characteristic attribute data can acquire the recorded length, width, high and the like basic data of the object to be stored from the system according to the object code of the object to be stored, and can also be the length, width, high and the like basic data measured by the object to be stored, and correspondingly, the target storage unit in which the object to be stored is placed can be a target storage unit which can completely contain the object to be stored and can not overflow or misplace.
According to the embodiment of the disclosure, the preset attribute data of the storage unit may be matched with the characteristic attribute data of the object to be stored, that is, when the object to be stored is stored in the storage unit, at least the problem that the overflow storage unit, the storage unit and the object to be stored are not dislocated does not occur, and the preset attribute data of the storage unit may also be not matched with the characteristic attribute data of the object to be stored, that is, when the object to be stored is stored in the storage unit, the problem that the overflow storage unit, the storage unit and the object to be stored are dislocated occurs.
According to the embodiment of the disclosure, whether a storage unit capable of placing the object to be stored inside exists in the storage container or not can be searched, and in the case that the storage unit capable of placing the object to be stored inside does not exist in the storage container, the preset attribute data of at least one storage unit is adjusted according to the characteristic attribute data, so as to determine a target storage unit capable of placing the object to be stored inside.
Through the embodiment of the disclosure, the target storage unit is determined according to the characteristic attribute data of the object to be stored and the preset attribute data of the storage unit, so that the technical problem that the object to be stored and the storage unit are not matched due to the fixed preset size of the storage unit in the related art can be at least partially overcome, and the technical effect of dynamically managing the storage unit is realized.
The data processing method shown in fig. 2 will be further described with reference to fig. 3A to 3E in conjunction with specific embodiments.
Fig. 3A schematically shows a flowchart for acquiring preset attribute data of a plurality of storage units disposed in a storage container according to an embodiment of the present disclosure.
As shown in fig. 3A, the method may include operations S311 to S314. Wherein:
in operation S311, an initialization rule for each storage unit in the storage container is acquired.
In operation S312, a preset size of each memory cell is acquired based on the initialization rule.
In operation S313, location information of each storage unit in the storage container is acquired.
In operation S314, a preset identification of each storage unit is acquired based on the location information.
According to an embodiment of the present disclosure, a storage container includes at least one layer of storage spaces isolated from each other, each layer of storage spaces including at least one storage unit.
According to the embodiment of the disclosure, before the object to be stored is put on shelf, in order to clearly know the space distribution condition of each storage unit in the storage container and the preset attribute of each storage unit, the preset attribute data of a plurality of storage units needs to be acquired according to the storage container initialization system shown in fig. 1.
According to an embodiment of the present disclosure, the initialization rule may include a rule of a preset size of each storage unit in the storage container, taking a storage container with a length of 300 cm, a height of 1000 cm and a depth of 200 cm as an example, if the storage container is equally divided into 15 storage units as shown in fig. 1 in the dimensions of length, height and depth, the storage container is equally divided into 5 cargo grids in the longitudinal direction, each cargo grid is equally divided into 3 storage units, and thus it may be determined that each storage unit has a length of 100 cm, a height of 200 cm and a depth of 200 cm.
According to an embodiment of the present disclosure, the initialization rule also includes a rule of a preset identifier of each storage unit in the storage container, for example, in a coordinate system with the lower left corner as an origin, the numbers of the storage units are connected by a default connection symbol, the shelves are physically layered, numbered from bottom to top, for example, the lowest layer is 1, and numbered from left to right, for example, the leftmost layer is 1. When initializing, each layer is a goods grid, and the storage position number is connected with the default connection symbol according to the rule, such as: 00001-1-1 is labeled as the first cargo space on the left side of the first shelf level, such as 00001-1-2, and the left side 00001-1-1-1 is recorded in the system to be 100 cm in length, the beginning of the 00001-1-2 bin can be located 100 cm from the edge of the left shelf on the first level of the 00001 shelf.
According to the embodiment of the disclosure, the initialization rule may further include highlighting the positions of the storage units in proportion on an interface provided by the intelligent management system of the storage container, and representing the storage units in different states by using different colors, for example, representing the storage unit in an available state by using green highlighting and representing the storage unit in an unavailable state by using red highlighting, so that a manager can conveniently and quickly know the storage condition of the whole warehouse system according to the system display.
Through the embodiment of the disclosure, before the object to be stored is stored, the preset attribute data of the plurality of storage units arranged in the storage container is acquired, so that reliable data support can be provided for determining the target storage unit which can place the object to be stored in the storage container, meanwhile, managers can conveniently and quickly and accurately judge whether the storage container has the storage unit which can place the object to be stored in the storage container, and the intelligent level of the warehouse management system is improved.
Fig. 3B schematically illustrates a flowchart of adjusting the preset attribute data of at least one storage unit according to the characteristic attribute data to determine a target storage unit in which an object to be stored can be placed according to the embodiment of the present disclosure.
As shown in fig. 3B, the method may include operations S321 to S324. Wherein:
in operation S321, a target size of the target storage unit is determined based on the feature attribute data.
In operation S322, it is detected whether there are a first storage unit and a second storage unit adjacent to and available from each other in the storage container.
In operation S323, in the case where the first storage unit and the second storage unit are detected, it is determined whether a sum of the first preset size and the second preset size is greater than a target size in a designated dimension based on a first preset size of the first storage unit and a second preset size of the second storage unit.
In operation S324, in a case that a sum of the first preset size and the second preset size is greater than the target size in the designated dimension, the first storage unit and the second storage unit are merged to form a new first storage unit, and the preset attribute data of the new first storage unit is adjusted according to the characteristic attribute data to determine a target storage unit in which the object to be stored can be placed.
According to the embodiment of the present disclosure, the target size of the target storage unit may be determined based on the characteristic attribute data of the object to be stored. Specifically, when there are a plurality of objects to be stored, the basic data of the length, width, height, and the like of the objects to be stored recorded in the system can be obtained according to the commodity code of the objects to be stored, so as to calculate the volume of a single commodity, and then the volume of the single commodity plus the number of the objects to be stored is calculated to calculate the volume of the lattice required by the task of putting on shelf this time, that is, the target size.
According to the embodiment of the disclosure, before the object to be stored is shelved, whether all storage units in the storage container have a storage unit in which the object to be stored can be placed inside can be searched, and two cases can occur.
The first condition is as follows: if the search is successful, that is, all storage units in the storage container have a storage unit capable of placing the object to be stored inside, the object to be stored is put on the searched storage unit and marked in the system, for example, the highlight color of the storage unit is changed from green to red, so as to update the highlight state of each storage unit in the storage container in real time.
Case two: the searching is unsuccessful, that is, a storage unit capable of placing the object to be stored in the storage container does not exist, if the object to be stored overflows the storage unit or is misplaced due to forced shelving, the possibility of abnormality in subsequent shelving operation or shelving operation is directly increased, therefore, according to the embodiment of the disclosure, several solutions can be provided to determine a target storage unit capable of placing the object to be stored in the storage container, so that the target storage unit can place the object to be stored in the storage container without overflow or misplacement, and the possibility of abnormality in subsequent shelving operation or shelving operation is reduced.
The first solution is as follows: and merging the storage units.
According to the embodiment of the present disclosure, it may be detected whether a first storage unit and a second storage unit which are adjacent to each other and are available exist in a storage container, it should be noted that the first storage unit and the second storage unit may be initialized original storage units, or may be storage units which have been merged, which is not limited herein, and a technical solution of determining a target storage unit which can place an object to be stored inside a storage container by taking the first storage unit and the second storage unit as an example will be described in detail below.
According to the embodiment of the disclosure, in the case that the first storage unit and the second storage unit are detected, whether the sum of the first preset size and the second preset size is larger than the target size in the designated dimension is determined based on the first preset size of the first storage unit and the second preset size of the second storage unit, in the case that the sum of the first preset size and the second preset size is larger than the target size in the designated dimension, the first storage unit and the second storage unit are merged to form a new first storage unit, and the preset attribute data of the new first storage unit is adjusted according to the characteristic attribute data to determine the target storage unit in which the object to be stored can be placed inside, wherein the designated dimension can be three dimensions of length, width and height.
According to the embodiment of the disclosure, under the condition that the adjacent empty storage units are searched and the merged new storage unit can place the object to be stored in the inner part, the merged new storage unit is determined as the target storage unit, the storage unit can be dynamically adjusted according to the characteristic attribute of the object to be stored, and the technical problem that the object to be stored overflows or misplaces the storage unit due to the fact that the size of the storage unit is fixed and cannot be adjusted according to the characteristic attribute of the object to be stored in the related art is at least partially overcome, and the technical effect that the storage unit can be adjusted according to the characteristic attribute of the object to be stored is achieved, so that the object to be stored is completely placed in the target storage unit is achieved.
Fig. 3C schematically shows a flowchart for adjusting the preset attribute data of the new first storage unit according to the feature attribute data according to an embodiment of the present disclosure.
As shown in fig. 3C, the method may include operations S331 to S333. Wherein:
in operation S331, a first preset identification of a first storage unit is acquired.
In operation S332, the preset flag of the new first storage unit is set as the first preset flag.
In operation S333, the preset identities of the other storage units except the new first storage unit are sequentially updated according to the preset rule.
According to the embodiment of the disclosure, adjacent empty storage positions can be searched, whether the sum of the preset sizes of the combined storage units meets the condition or not is calculated, if yes, the storage units are combined in the system, the storage position number uses the storage position number at the leftmost side, and if non-empty storage positions exist at the right side, the storage position layer in the storage position number is marked with + 1. For example, the 1-layer of 00001 shelf has four compartments: 00001-1-1, 00001-1-2, 00001-1-3, 00001-1-4, wherein 00001-1-2, 00001-1-3 need to be combined, then after combination: 00001-1-1, 00001-1-2 and 00001-1-3, wherein 00001-1-3 is a storage location after 00001-1-4 is updated.
Through the embodiment of the disclosure, after the target storage unit is determined, the preset position of each storage unit in the storage container is updated, and the technical effect of dynamically managing the storage container is achieved.
Fig. 3D schematically illustrates a flowchart of adjusting the preset attribute data of at least one storage unit according to the characteristic attribute data to determine a target storage unit in which an object to be stored may be placed according to an embodiment of the present disclosure.
As shown in fig. 3D, the method may include operations S341 to S342. Wherein:
in operation S341, it is detected whether a third storage unit having a preset size larger than the target size exists in the storage container.
In operation S342, in the case where a third storage unit having a preset size larger than the target size exists in the storage container, the third storage unit is split into a fourth storage unit and a fifth storage unit according to the characteristic attribute data.
The second solution is as follows: and splitting the storage unit.
According to an embodiment of the present disclosure, the preset size of the fourth storage unit is adapted to the target size, and the fourth storage unit is determined as the target storage unit
According to the embodiment of the present disclosure, under the condition that the second storage unit left-adjacent or right-adjacent to the preset position of the first storage unit is in an unavailable state, the volume of the storage position can be searched for and be larger than or far larger than the storage position of the required volume, the search is successful, then the system installation requirement volume is split and stored, the left side is the storage position on the shelf, the volume is strictly adapted to the volume on the shelf, and the right side is the new storage position, if: 00001-1-1 is divided into 00001-1-1 and 00001-1-2, and the other 00001-1-1-1 is an upper shelf storage position and the volume is the upper shelf volume, and 00001-1-2 is a new storage position.
Through the embodiment of the disclosure, if the third storage unit with the preset size larger than the target size is searched in the storage container and is subjected to splitting processing, so as to determine the target storage unit, and improve the space utilization rate of the storage container while realizing the technical effect of matching the storage unit with the object to be stored.
According to the embodiment of the disclosure, under the condition that the sum of the first preset size of the first storage unit and the second preset size of the second storage unit is larger than the target size, the first storage unit and the second storage unit can be split, the size is strictly adapted to the volume on the shelf, and the right side is a new storage position. Specifically, the method for identifying the storage location is not described herein again.
Through the embodiment of the disclosure, under the condition that the sum of the preset sizes of the plurality of storage units is larger than the target size, the storage units can be split to determine the target storage units, so that the technical effect of matching the storage units with the object to be stored is realized, and the space utilization rate of the storage container is improved.
Fig. 3E schematically shows a flowchart of adjusting the preset attribute data of at least one storage unit according to the characteristic attribute data to determine a target storage unit where an object to be stored can be placed inside according to yet another embodiment of the present disclosure.
As shown in FIG. 3E, the method may include operations S351-S353. Wherein:
in operation S351, a second preset identification of the third storage unit is acquired.
In operation S352, the preset flag of the fourth storage unit is set to the second preset flag.
In operation S353, the preset identities of the other storage units except the fourth storage unit are sequentially updated according to the preset rule.
According to this disclosed embodiment, carry out the split processing to the third memory cell that preset size is greater than the target dimension according to the demand volume, the left side stores up the position for putting on the shelf, and volume strict adaptation volume of putting on the shelf, the right side is for newly storing up the position, if: 00001-1-1 is divided into 00001-1-1 and 00001-1-2, and the other 00001-1-1-1 is an upper shelf storage position with the volume being the upper shelf volume, and 00001-1 is a new storage position.
Through the embodiment of the disclosure, after the target storage unit is determined, the preset position of each storage unit in the storage container is updated, and the technical effect of dynamically managing the storage container is achieved.
FIG. 4 schematically shows a block diagram of a data processing system according to an embodiment of the present disclosure.
As shown in fig. 4, the data processing system 400 may include a first acquisition module 410, a second acquisition module 420, a search module 430, and an adjustment module 440. Wherein:
the first obtaining module 410 is configured to obtain preset attribute data of a plurality of storage units disposed in a storage container.
The second obtaining module 420 is configured to obtain feature attribute data of an object to be stored.
The searching module 430 is used for searching whether a storage unit capable of placing the object to be stored inside exists in the storage container.
The adjusting module 440 is configured to, when there is no storage unit in the storage container, adjust the preset attribute data of at least one storage unit according to the characteristic attribute data to determine a target storage unit in which the object to be stored can be placed.
Through the embodiment of the disclosure, the target storage unit is determined according to the characteristic attribute data of the object to be stored and the preset attribute data of the storage unit, so that the technical problem that the object to be stored and the storage unit are not matched due to the fixed preset size of the storage unit in the related art can be at least partially overcome, and the technical effect of dynamically managing the storage unit is realized.
Fig. 5A schematically illustrates a block diagram of a first acquisition module according to an embodiment of the disclosure.
As shown in fig. 5A, the first obtaining module 410 may include: a first acquisition unit 511, a second acquisition unit 512, a third acquisition unit 513, and a fourth acquisition unit 514. Wherein:
the first obtaining unit 511 is configured to obtain an initialization rule of each storage unit in the storage container.
The second obtaining unit 512 is configured to obtain the preset size of each storage unit based on the initialization rule.
The third obtaining unit 513 is configured to obtain the location information of each storage unit in the storage container.
The fourth obtaining unit 514 is configured to obtain the preset identifier of each storage unit based on the location information.
Fig. 5B schematically illustrates a block diagram of an adjustment module according to an embodiment of the disclosure.
Through the embodiment of the disclosure, before the object to be stored is stored, the preset attribute data of the plurality of storage units arranged in the storage container is acquired, so that reliable data support can be provided for determining the target storage unit which can place the object to be stored in the storage container, meanwhile, managers can conveniently and quickly and accurately judge whether the storage container has the storage unit which can place the object to be stored in the storage container, and the intelligent level of the warehouse management system is improved.
As shown in fig. 5B, the adjusting module 440 may include a first determining unit 521, a first detecting unit 522, a second determining unit 523, and a first adjusting unit 524. Wherein:
the first determination unit 521 is configured to determine a target size of the target storage unit based on the feature attribute data.
The first detection unit 522 is used to detect whether there are a first storage unit and a second storage unit adjacent to each other and available in the storage container.
The second determining unit 523 is configured to determine, when the first storage unit and the second storage unit are detected, whether a sum of the first preset size and the second preset size is larger than the target size in the specified dimension based on the first preset size of the first storage unit and the second preset size of the second storage unit.
The first adjusting unit 524 is configured to, when a sum of the first preset size and the second preset size is larger than the target size in the designated dimension, combine the first storage unit and the second storage unit to form a new first storage unit, and adjust the preset attribute data of the new first storage unit according to the feature attribute data to determine a target storage unit in which the object to be stored can be placed.
According to the embodiment of the disclosure, under the condition that the adjacent empty storage units are searched and the merged new storage unit can place the object to be stored in the inner part, the merged new storage unit is determined as the target storage unit, the storage unit can be dynamically adjusted according to the characteristic attribute of the object to be stored, and the technical problem that the object to be stored overflows or misplaces the storage unit due to the fact that the size of the storage unit is fixed and cannot be adjusted according to the characteristic attribute of the object to be stored in the related art is at least partially overcome, and the technical effect that the storage unit can be adjusted according to the characteristic attribute of the object to be stored is achieved, so that the object to be stored is completely placed in the target storage unit is achieved.
Fig. 5C schematically shows a block diagram of a first adjustment unit according to an embodiment of the present disclosure.
As shown in fig. 5C, the first adjusting unit 524 may include: a first acquisition sub-unit 531, a first setting sub-unit 532, and a first updating sub-unit 533. Wherein:
the first obtaining subunit 531 is configured to obtain a first preset identifier of the first storage unit.
The first setting subunit 532 is configured to set the preset identifier of the new first storage unit as the first preset identifier.
The first updating subunit 533 is configured to sequentially update the preset identifiers of the other storage units except the new first storage unit according to a preset rule. .
Through the embodiment of the disclosure, after the target storage unit is determined, the preset position of each storage unit in the storage container is updated, and the technical effect of dynamically managing the storage container is achieved.
Fig. 5D schematically illustrates a block diagram of an adjustment module according to another embodiment of the present disclosure.
As shown in fig. 5D, the adjusting module 440 may include a second detecting unit 541 and a second adjusting unit 542. Wherein:
the second detection unit 541 detects whether a third storage unit having a preset size larger than the target size exists in the storage container.
The second adjusting unit 542 is configured to, when a third storage unit with a preset size larger than the target size exists in the storage container, split the third storage unit into a fourth storage unit and a fifth storage unit according to the characteristic attribute data, where the preset size of the fourth storage unit is adapted to the target size, and determine the fourth storage unit as the target storage unit.
Through the embodiment of the disclosure, under the condition that the sum of the preset sizes of the plurality of storage units is larger than the target size, the storage units can be split to determine the target storage units, so that the technical effect of matching the storage units with the object to be stored is realized, and the space utilization rate of the storage container is improved.
Fig. 5E schematically shows a block diagram of a second adjustment unit according to an embodiment of the disclosure.
As shown in fig. 5E, the second adjusting unit 542 may include a second obtaining sub-unit 551. A second setup sub-unit 552 and a second update sub-unit 553. Wherein:
the second obtaining subunit 551 is configured to obtain a second preset identifier of the third storage unit.
The second setting subunit 552 is configured to set the preset identifier of the fourth storage unit as a second preset identifier.
The second updating sub-unit 553 is configured to sequentially update the preset identities of the other memory units except the fourth memory unit according to a preset rule.
Through the embodiment of the disclosure, after the target storage unit is determined, the preset position of each storage unit in the storage container is updated, and the technical effect of dynamically managing the storage container is achieved.
Any of the modules, units, sub-units, or at least part of the functionality of any of them according to embodiments of the present disclosure may be implemented in one module. Any one or more of the modules, sub-modules, units, and sub-units according to the embodiments of the present disclosure may be implemented by being split into a plurality of modules. Any one or more of the modules, units, sub-units according to the embodiments of the present disclosure may be implemented at least partially as a hardware circuit, such as a Field Programmable Gate Array (FPGA), a Programmable Logic Array (PLA), a system on a chip, a system on a substrate, a system on a package, an Application Specific Integrated Circuit (ASIC), or may be implemented in any other reasonable manner of hardware or firmware by integrating or packaging a circuit, or in any one of three implementations of software, hardware, and firmware, or in any suitable combination of any of them. Alternatively, one or more of the modules, units, sub-units according to embodiments of the disclosure may be at least partially implemented as computer program modules, which, when executed, may perform the corresponding functions.
For example, any plurality of the first obtaining module 410, the second obtaining module 420, the searching module 430 and the adjusting module 440 may be combined and implemented in one module, or any one of the modules may be split into a plurality of modules. Alternatively, at least part of the functionality of one or more of these modules may be combined with at least part of the functionality of the other modules and implemented in one module. According to an embodiment of the present disclosure, at least one of the first obtaining module 410, the second obtaining module 420, the searching module 430 and the adjusting module 440 may be implemented at least partially as a hardware circuit, such as a Field Programmable Gate Array (FPGA), a Programmable Logic Array (PLA), a system on a chip, a system on a substrate, a system on a package, an Application Specific Integrated Circuit (ASIC), or may be implemented in hardware or firmware by any other reasonable manner of integrating or packaging a circuit, or may be implemented in any one of three implementations of software, hardware and firmware, or in a suitable combination of any of them. Alternatively, at least one of the first obtaining module 410, the second obtaining module 420, the searching module 430 and the adjusting module 440 may be at least partially implemented as a computer program module, which when executed, may perform a corresponding function.
FIG. 6 schematically shows a block diagram of a computer system suitable for implementing the data processing method according to an embodiment of the present disclosure. The computer system illustrated in FIG. 6 is only one example and should not impose any limitations on the scope of use or functionality of embodiments of the disclosure.
As shown in fig. 6, a computer system 600 according to an embodiment of the present disclosure includes a processor 601, which can perform various appropriate actions and processes according to a program stored in a Read Only Memory (ROM)602 or a program loaded from a storage section 608 into a Random Access Memory (RAM) 603. Processor 601 may include, for example, a general purpose microprocessor (e.g., a CPU), an instruction set processor and/or associated chipset, and/or a special purpose microprocessor (e.g., an Application Specific Integrated Circuit (ASIC)), among others. The processor 601 may also include onboard memory for caching purposes. Processor 601 may include a single processing unit or multiple processing units for performing different actions of a method flow according to embodiments of the disclosure.
In the RAM 603, various programs and data necessary for the operation of the system 600 are stored. The processor 601, the ROM602, and the RAM 603 are connected to each other via a bus 604. The processor 601 performs various operations of the method flows according to the embodiments of the present disclosure by executing programs in the ROM602 and/or RAM 603. It is to be noted that the programs may also be stored in one or more memories other than the ROM602 and RAM 603. The processor 601 may also perform various operations of the method flows according to embodiments of the present disclosure by executing programs stored in the one or more memories.
According to an embodiment of the present disclosure, system 600 may also include an input/output (I/O) interface 605, input/output (I/O) interface 605 also connected to bus 604. The system 600 may also include one or more of the following components connected to the I/O interface 605: an input portion 606 including a keyboard, a mouse, and the like; an output portion 607 including a display such as a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker; a storage section 608 including a hard disk and the like; and a communication section 609 including a network interface card such as a LAN card, a modem, or the like. The communication section 609 performs communication processing via a network such as the internet. The driver 610 is also connected to the I/O interface 605 as needed. A removable medium 611 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is mounted on the drive 610 as necessary, so that a computer program read out therefrom is mounted in the storage section 608 as necessary.
According to embodiments of the present disclosure, method flows according to embodiments of the present disclosure may be implemented as computer software programs. For example, embodiments of the present disclosure include a computer program product comprising a computer program embodied on a computer readable medium, the computer program comprising program code for performing the method illustrated in the flow chart. In such an embodiment, the computer program may be downloaded and installed from a network through the communication section 609, and/or installed from the removable medium 611. The computer program, when executed by the processor 601, performs the above-described functions defined in the system of the embodiments of the present disclosure. The systems, devices, apparatuses, modules, units, etc. described above may be implemented by computer program modules according to embodiments of the present disclosure.
The present disclosure also provides a computer-readable medium, which may be embodied in the apparatus/device/system described in the above embodiments; or may exist separately and not be assembled into the device/apparatus/system. The computer readable medium carries one or more programs which, when executed, perform a method according to an embodiment of the disclosure.
According to embodiments of the present disclosure, a computer readable medium may be a computer readable signal medium or a computer readable storage medium or any combination of the two. A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the foregoing. More specific examples of the computer readable storage medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the present disclosure, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. In contrast, in the present disclosure, a computer-readable signal medium may include a propagated data signal with computer-readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated data signal may take many forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A computer readable signal medium may also be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to: wireless, wired, optical fiber cable, radio frequency signals, etc., or any suitable combination of the foregoing.
For example, according to an embodiment of the present disclosure, a computer-readable medium may include the ROM602 and/or the RAM 603 and/or one or more memories other than the ROM602 and the RAM 603 described above.
The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present disclosure. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams or flowchart illustration, and combinations of blocks in the block diagrams or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
Those skilled in the art will appreciate that various combinations and/or combinations of features recited in the various embodiments and/or claims of the present disclosure can be made, even if such combinations or combinations are not expressly recited in the present disclosure. In particular, various combinations and/or combinations of the features recited in the various embodiments and/or claims of the present disclosure may be made without departing from the spirit or teaching of the present disclosure. All such combinations and/or associations are within the scope of the present disclosure.
The embodiments of the present disclosure have been described above. However, these examples are for illustrative purposes only and are not intended to limit the scope of the present disclosure. Although the embodiments are described separately above, this does not mean that the measures in the embodiments cannot be used in advantageous combination. The scope of the disclosure is defined by the appended claims and equivalents thereof. Various alternatives and modifications can be devised by those skilled in the art without departing from the scope of the present disclosure, and such alternatives and modifications are intended to be within the scope of the present disclosure.

Claims (14)

1. A method of data processing, comprising:
acquiring preset attribute data of a plurality of storage units arranged in a storage container, wherein the preset attribute data are used for representing preset identifications and preset sizes of the storage units;
acquiring characteristic attribute data of an object to be stored;
searching whether a storage unit capable of placing the object to be stored inside exists in the storage container; and
and under the condition that no storage unit capable of placing the object to be stored inside exists in the storage container, adjusting preset attribute data of at least one storage unit according to the characteristic attribute data to determine a target storage unit capable of placing the object to be stored inside.
2. The method of claim 1, wherein the storage container comprises at least one layer of storage space isolated from each other, each layer of storage space comprises at least one storage unit, and the acquiring preset attribute data of a plurality of storage units arranged in the storage container comprises:
acquiring an initialization rule of each storage unit in the storage container;
acquiring the preset size of each storage unit based on the initialization rule;
acquiring the position information of each storage unit in the storage container; and
and acquiring preset identifications of the storage units based on the position information.
3. The method of claim 2, wherein adjusting the preset attribute data of at least one storage unit according to the characteristic attribute data to determine a target storage unit in which the object to be stored can be placed comprises:
determining a target size of the target storage unit based on the feature attribute data;
detecting whether a first storage unit and a second storage unit which are adjacent to each other and available exist in the storage container;
under the condition that the first storage unit and the second storage unit are detected, determining whether the sum of a first preset size and a second preset size of the first storage unit is larger than the target size in a specified dimension or not based on the first preset size of the first storage unit and the second preset size of the second storage unit; and
and under the condition that the sum of the first preset size and the second preset size is larger than the target size in a specified dimension, combining the first storage unit and the second storage unit to form a new first storage unit, and adjusting the preset attribute data of the new first storage unit according to the characteristic attribute data to determine a target storage unit capable of placing the object to be stored inside.
4. The method of claim 3, wherein adjusting the preset attribute data of the new first storage unit according to the feature attribute data comprises:
acquiring a first preset identifier of the first storage unit;
setting the preset identifier of the new first storage unit as the first preset identifier; and
and sequentially updating the preset identifications of the other storage units except the new first storage unit according to a preset rule.
5. The method according to claim 2, wherein the adjusting the preset attribute data of at least one storage unit according to the characteristic attribute data to determine a target storage unit in which the object to be stored can be placed comprises:
detecting whether a third storage unit with a preset size larger than the target size exists in the storage container; and
when a third storage unit with a preset size larger than the target size exists in the storage container, splitting the third storage unit into a fourth storage unit and a fifth storage unit according to the feature attribute data, wherein the preset size of the fourth storage unit is adapted to the target size, and determining the fourth storage unit as the target storage unit.
6. The method of claim 5, wherein the method further comprises:
acquiring a second preset identifier of the third storage unit;
setting a preset identifier of the fourth storage unit as the second preset identifier; and
and sequentially updating the preset identifications of the other storage units except the fourth storage unit according to a preset rule.
7. A data processing system comprising:
the device comprises a first acquisition module, a second acquisition module and a third acquisition module, wherein the first acquisition module is used for acquiring preset attribute data of a plurality of storage units arranged in a storage container, and the preset attribute data is used for representing preset marks and preset sizes of the storage units;
the second acquisition module is used for acquiring the characteristic attribute data of the object to be stored;
the searching module is used for searching whether a storage unit capable of placing the object to be stored inside exists in the storage container; and
and the adjusting module is used for adjusting the preset attribute data of at least one storage unit according to the characteristic attribute data under the condition that no storage unit capable of placing the object to be stored inside exists in the storage container, so as to determine a target storage unit capable of placing the object to be stored inside.
8. The system of claim 7, wherein the first acquisition module comprises:
the first acquisition unit is used for acquiring the initialization rule of each storage unit in the storage container;
the second acquisition unit is used for acquiring the preset size of each storage unit based on the initialization rule;
a third acquiring unit, configured to acquire location information of each storage unit in the storage container; and
and the fourth acquisition unit is used for acquiring the preset identification of each storage unit based on the position information.
9. The system of claim 8, wherein the adjustment module comprises:
a first determining unit configured to determine a target size of the target storage unit based on the feature attribute data;
a first detection unit for detecting whether there are a first storage unit and a second storage unit adjacent to each other and available in the storage container;
a second determining unit, configured to determine, when the first storage unit and the second storage unit are detected, whether a sum of a first preset size of the first storage unit and a second preset size of the second storage unit is larger than the target size in a specified dimension based on the first preset size of the first storage unit and the second preset size of the second storage unit; and
and the first adjusting unit is used for combining the first storage unit and the second storage unit to form a new first storage unit under the condition that the sum of the first preset size and the second preset size is larger than the target size in a specified dimension, and adjusting the preset attribute data of the new first storage unit according to the characteristic attribute data to determine a target storage unit capable of placing the object to be stored inside.
10. The system of claim 9, wherein the first adjusting unit comprises:
the first obtaining subunit is configured to obtain a first preset identifier of the first storage unit;
the first setting subunit is configured to set the preset identifier of the new first storage unit as the first preset identifier; and
and the first updating subunit is used for sequentially updating the preset identifications of the other storage units except the new first storage unit according to a preset rule.
11. The system of claim 8, wherein the adjustment module comprises:
the second detection unit is used for detecting whether a third storage unit with a preset size larger than the target size exists in the storage container or not; and
a second adjusting unit, configured to, when a third storage unit with a preset size larger than the target size exists in the storage container, split the third storage unit into a fourth storage unit and a fifth storage unit according to the feature attribute data, where the preset size of the fourth storage unit is adapted to the target size, and determine the fourth storage unit as the target storage unit.
12. The system of claim 11, wherein the second adjusting unit comprises:
the second obtaining subunit is configured to obtain a second preset identifier of the third storage unit;
the second setting subunit is configured to set the preset identifier of the fourth storage unit as the second preset identifier; and
and the second updating subunit is used for sequentially updating the preset identifications of the other storage units except the fourth storage unit according to a preset rule.
13. A computer system, comprising:
one or more processors;
a storage device for storing one or more programs,
wherein the one or more programs, when executed by the one or more processors, cause the one or more processors to implement the data processing method of any of claims 1 to 6.
14. A computer readable medium having stored thereon executable instructions which, when executed by a processor, cause the processor to carry out the data processing method of any one of claims 1 to 6.
CN201810704547.8A 2018-06-29 2018-06-29 Data processing method and system, computer system and computer readable medium Pending CN110659851A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201810704547.8A CN110659851A (en) 2018-06-29 2018-06-29 Data processing method and system, computer system and computer readable medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201810704547.8A CN110659851A (en) 2018-06-29 2018-06-29 Data processing method and system, computer system and computer readable medium

Publications (1)

Publication Number Publication Date
CN110659851A true CN110659851A (en) 2020-01-07

Family

ID=69027065

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201810704547.8A Pending CN110659851A (en) 2018-06-29 2018-06-29 Data processing method and system, computer system and computer readable medium

Country Status (1)

Country Link
CN (1) CN110659851A (en)

Citations (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1395198A (en) * 2001-07-06 2003-02-05 英业达股份有限公司 Storage management system by using graphic interface
JP2008222322A (en) * 2007-03-08 2008-09-25 Toyo Tire & Rubber Co Ltd Storage rack facility
CN102673934A (en) * 2012-05-16 2012-09-19 北京航空航天大学 Automated pharmacy drug storage control and management system
CN102945523A (en) * 2012-11-30 2013-02-27 浙江网仓科技有限公司 Random dynamic warehouse management method
CN202988035U (en) * 2012-11-30 2013-06-12 浙江网仓科技有限公司 Stochastic dynamic storage type goods shelf
CN103473616A (en) * 2013-09-17 2013-12-25 四川航天系统工程研究所 Dynamic goods allocation planning method and system for processing multi-variety goods and material storage
CN204587850U (en) * 2015-04-15 2015-08-26 北京物资学院 A kind of goods yard escapement
CN105501633A (en) * 2015-12-10 2016-04-20 国网上海市电力公司 Vertically-placed storage container for prefabricated connecting wires
CN105701631A (en) * 2016-01-06 2016-06-22 北京京东尚科信息技术有限公司 Commodity warehousing method and warehouse management system
CN106709692A (en) * 2017-02-24 2017-05-24 北京远大宏略科技股份有限公司 Logistics center storage position allocation method
CN106991548A (en) * 2016-01-21 2017-07-28 阿里巴巴集团控股有限公司 A kind of warehouse goods yard planing method, device and electronic installation

Patent Citations (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1395198A (en) * 2001-07-06 2003-02-05 英业达股份有限公司 Storage management system by using graphic interface
JP2008222322A (en) * 2007-03-08 2008-09-25 Toyo Tire & Rubber Co Ltd Storage rack facility
CN102673934A (en) * 2012-05-16 2012-09-19 北京航空航天大学 Automated pharmacy drug storage control and management system
CN102945523A (en) * 2012-11-30 2013-02-27 浙江网仓科技有限公司 Random dynamic warehouse management method
CN202988035U (en) * 2012-11-30 2013-06-12 浙江网仓科技有限公司 Stochastic dynamic storage type goods shelf
CN103473616A (en) * 2013-09-17 2013-12-25 四川航天系统工程研究所 Dynamic goods allocation planning method and system for processing multi-variety goods and material storage
CN204587850U (en) * 2015-04-15 2015-08-26 北京物资学院 A kind of goods yard escapement
CN105501633A (en) * 2015-12-10 2016-04-20 国网上海市电力公司 Vertically-placed storage container for prefabricated connecting wires
CN105701631A (en) * 2016-01-06 2016-06-22 北京京东尚科信息技术有限公司 Commodity warehousing method and warehouse management system
CN106991548A (en) * 2016-01-21 2017-07-28 阿里巴巴集团控股有限公司 A kind of warehouse goods yard planing method, device and electronic installation
CN106709692A (en) * 2017-02-24 2017-05-24 北京远大宏略科技股份有限公司 Logistics center storage position allocation method

Similar Documents

Publication Publication Date Title
CN109472523B (en) Method and device for sorting goods
CN109647719B (en) Method and device for sorting goods
US9563793B2 (en) RFID reader location self-discovery
CN110418569B (en) Method and device for determining installation position of server, electronic equipment and medium
WO2022052810A1 (en) Method for guiding robot to transport cargo in warehouse, and apparatus
US9584983B2 (en) Tracking a mobile unit in a housing facility for mobile units
US11378643B2 (en) Position detection system
US11861910B2 (en) Method and system for acquiring item placing state
CN111144796B (en) Method and device for generating tally information
US20180285708A1 (en) Intelligent Fixture System
CN111738640A (en) Method, device, equipment and medium for creating workstation in warehouse
CN108960698A (en) The method and apparatus for indicating the storage location of material
CN113743639B (en) Method, device, computing equipment and medium for distributing articles
CN114462948A (en) Freight scheduling processing method, device, equipment and medium
CN110659851A (en) Data processing method and system, computer system and computer readable medium
CN111080188B (en) Cargo loading method and device and computer readable storage medium
CN111598192A (en) Method, apparatus and system for positioning electronic device, computer system and medium
CN111104184A (en) Method and device for online loading and unloading of comprehensive traffic operation monitoring indexes
US20220383252A1 (en) A method and a system for tracking an item
CN115390958A (en) Task processing method and device
CN108389013B (en) Storage data dynamic processing method and device
CN113361987B (en) Information processing method, apparatus, electronic device, and readable storage medium
CN112407708A (en) Warehouse goods handling method and system, storage medium and electronic equipment
CN115526560A (en) Goods storage method and device, electronic equipment and storage medium
CN112650822B (en) Map access method, map access device, electronic equipment and machine-readable storage medium

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
TA01 Transfer of patent application right
TA01 Transfer of patent application right

Effective date of registration: 20200519

Address after: Room A1905, 19th floor, No. 2 Building, 18 Kechuang 11th Street, Beijing Daxing District, Beijing

Applicant after: Beijing Jingdong Qianshi Technology Co.,Ltd.

Address before: 300 457 days First Floor, Phase 2, No. 10, Fourth Avenue, Economic and Technological Development Zone, Tianjin Binhai New Area

Applicant before: Tianjin Jingdong Shentuo Robot Technology Co.,Ltd.

RJ01 Rejection of invention patent application after publication
RJ01 Rejection of invention patent application after publication

Application publication date: 20200107