WO2022143814A1

WO2022143814A1 - Method, device, computer readable medium, and program product for manufacturing laminated glass

Info

Publication number: WO2022143814A1
Application number: PCT/CN2021/142692
Authority: WO
Inventors: Zhiyi WANG; Bernard Nghiem; Romain Decourcelle; Xuekun CUI; Jia Zhu; Xiaowei Sun
Original assignee: Saint-Gobain Glass France
Priority date: 2020-12-31
Filing date: 2021-12-29
Publication date: 2022-07-07
Also published as: CN113962117A

Abstract

A method, device, computer readable medium, and program product for manufacturing a laminated glass. The method comprises: determining parameters of a plurality of first glasses and a plurality of second glasses based on identifiers of the plurality of first glasses and the plurality of second glasses, the plurality of first glasses and the plurality of second glasses produced by a glass bending process; pairing the plurality of first glasses and the plurality of second glasses based on matching degrees of the parameters of the plurality of first glasses and the plurality of second glasses satisfying a predetermined condition; and locating the paired glasses for a lamination process.

Description

[Title established by the ISA under Rule 37.2] METHOD, DEVICE, COMPUTER READABLE MEDIUM, AND PROGRAM PRODUCT FOR MANUFACTURING LAMINATED GLASS

FIELD

Embodiments of the present disclosure relate to the glass manufacturing field, and more specifically to a method, electronic device, computer readable storage medium, and computer program product for pairing glasses to be laminated.

BACKGROUND

In the course of manufacturing vehicle glasses (for example, windshield glasses, sunroof glasses) , one or more intermediate layers are sandwiched between two or more bent glasses, and after being subjected to a special high-temperature pre-pressing (or evacuation) and high-temperature and high-pressure process, the glasses and the intermediate layer are bonded together as a composite glass product. There are high requirements for the matching degrees of parameters such as the shapes of the glasses during glass lamination. Therefore, this imposes very high requirements for the consistency of the glass bending process, otherwise a lower product yield rate might be caused.

SUMMARY

Embodiments of the present disclosure provide a method, electronic device, computer readable medium, and computer program product for manufacturing a laminated glass.

According to a first aspect of the present disclosure, there is provided a method of manufacturing a laminated glass. The method comprises: determining parameters of a plurality of first glasses and a plurality of second glasses based on identifiers of the plurality of first glasses and the plurality of second glasses, the plurality of first glasses and the plurality of second glasses produced by a glass bending process; pairing the plurality of first glasses and the plurality of second glasses based on matching degrees of the parameters of the plurality of first glasses and plurality of second glasses satisfying a predetermined condition; and locating the paired glasses for a lamination process.

According to a second aspect of the present disclosure, there is provided an electronic device, comprising: at least one processor; and a memory communicatively connected with the at least one processor; wherein the memory stores instructions executable by the at least one processor, the instructions, when executed by the at least one processor, causing the at least one processor to perform the method according to the first aspect of the present disclosure.

According to a third aspect of the present disclosure, there is provided a computer readable storage medium storing computer instructions, wherein the computer instructions are used to cause the computer to perform the method according to the first aspect of the present disclosure.

According to a fourth aspect of the present disclosure, there is provided a computer program product, comprising a computer program which, when executed by a processor, performs the method according to the first aspect of the present disclosure.

It should be appreciated that this Summary is not intended to identify key features or essential features of the claimed subject matter, nor is it intended to be used to limit the scope of the claimed subject matter. Other features of the subject matter will be made apparent by the following depictions.

BRIEF DESCRIPTION OF THE DRAWINGS

The above and other objectives, features, and advantages of example embodiments of the present disclosure will become more apparent from the following detailed description with reference to the accompanying drawings, in which the same reference symbols refer to the same elements:

FIG. 1 illustrates a schematic diagram of a glass storage area according to some embodiments of the present disclosure.

FIG. 2A illustrates a schematic diagram of an optimization algorithm according to some embodiments of the present disclosure.

FIG. 2B illustrates a schematic diagram of an optimization algorithm according to some embodiments of the present disclosure.

FIG. 3 illustrates a flowchart of a method for manufacturing a laminated glass according to some embodiments of the present disclosure.

FIG. 4 illustrates a block diagram of an electronic device capable of implementing some embodiments of the present disclosure.

DETAILED DESCRIPTION OF EMBODIMENTS

The concept of the present disclosure will now be illustrated with reference to various exemplary embodiments shown in the drawings. It should be understood that the description of these embodiments is only for enabling those skilled in the art to better understand and further implement the present disclosure, and is not intended to limit the scope of the present disclosure in any way. It should be noted that similar or identical reference signs may be used in the drawings if possible, and similar or identical reference signs may indicate similar or identical elements. Those skilled in the art will understand that from the following depictions, alternative embodiments of the structures and/or methods described herein can be employed without departing from the principles and concepts of the present disclosure described.

As used herein, the term “includes” and its variants are to be read as open-ended terms that mean “includes, but is not limited to. ” The term “based on” is to be read as “based at least in part on. ” The term “one example implementation” and “an example implementation” are to be read as “at least one example implementation. ” The term “another implementation” is to be read as “at least one other implementation. ” Other terms that might appear but are not mentioned here, unless explicitly stated, should not be interpreted or limited in a manner that is contrary to the concept on which the embodiments of the present disclosure are based.

In the glass manufacturing process, each glass may be assigned an identifier to achieve the tracking of the glass manufacturing process. For example, in the glass bending process, process parameters of each glass may be tracked based on the identifier of the glass. After the glass bending process, the shape of the glass may be measured and recorded through the identifier of the glass. After the shape of the glass is measured, the glass may be stored at a corresponding storage position, and the glass storage position may be recorded through the identifier of the glass. Since various information of the glass is associated through the identifier of the glass, different types of glasses may be matched or paired according to these information of the glasses, and a lamination process may be applied to the paired glasses. Since the lamination process is performed for the paired glasses, requirements in aspects such as the tolerance of the glass bending process may be reduced.

Generally speaking, glasses may be manufactured in batches, for example, glasses may be bent in batches by using the glass bending process. Therefore, it is also possible to assign corresponding identifiers to part of the glasses in a batch, and to represent the glasses of the batch by tracking the process parameters, shapes, and storage positions of this part of the glasses. The matching degrees of the shapes of the glasses may be measured by a difference of measurement values (e.g., surface curvature values) of the shapes thereof, or represented by using other similarity parameters such as cosine similarity.

The embodiments of the present disclosure will be further described below with reference to figures, wherein FIG. 1 illustrates a schematic diagram of a glass storage area 100 according to some embodiments of the present disclosure. FIG. 1 shows two types of glasses, namely, glass 101 and glass 102. The two types of glasses are made by the glass bending process and will be laminated together by a lamination process.

The glass 101 (representing glass type A, for example, 3.5mm-thick glass, or 1.6mm-thick glass) may be stored in one or more container units (for example, glass shelves) . For example, a batch of glasses may be placed in a container unit. FIG. 1 typically shows a container unit 103i as the i ^th container unit. Each container unit may be provided with a corresponding identifier, for example, a radio frequency identification (RFID) tag, a QR code, a color chart, a code, a number, etc. The advantages of an active RFID tag for example lie in that it may be read remotely and located geographically to facilitate easily locating its storage position. For example, in the example of FIG. 1, the container unit 103 includes an RFID tag 105 for identifying the container unit. The container units may be sought through the identifiers of the container units, to select suitable glasses from the corresponding container units to perform pairing and lamination. The container unit 103 contains one or more glasses, for example, glass 107. The container unit for example may be a shelf, a rack, etc., for storing bent glasses.

Similarly, glass 102 (or glass type B) is for example a 1.6mm-thick glass or 3.5mm-thick glass. It may be understood that glass type A and glass type B may be the same or different, for example, when the thickness of glass type A is 3.5 mm, the thickness of glass type B is 1.6mm; or when the thickness of glass type A is 3.5mm, the thickness of glass type B is 3.5mm. The glass 102 may also be stored in one or more container units (for example, glass shelves) . For example, a batch of glasses may be placed in one container unit. FIG. 1 typically shows a container unit 104j as the j ^th container unit. Each container unit may be provided with a corresponding identifier, for example, a radio frequency identification (RFID) tag, a QR code, a color chart, a code, a numbers, etc. For example, in the example of FIG. 1, the container unit 104 includes an RFID tag 106 for identifying the container unit. The container units may be sought through the identifiers of the container units, to select suitable glasses from the corresponding container units to perform pairing and lamination. The container unit 104 contains one or more glasses, for example, glass 108. In one embodiment, glass type A and glass type B are in the same workshop of a factory.

In some embodiments, matching degrees between shapes of batches of glasses may be calculated, and a batch with a maximum matching degree may be determined. Alternatively, matching degrees between shapes of glasses in respective container units may be calculated, and a container unit with a maximum matching degree may be determined. For example, this may be achieved by an optimization algorithm that may minimize a difference of a distance between glass 101 and glass 102. For various possible container unit combinations, the difference of the distance between the glasses may be minimized, thereby providing the optimal matching of the container units.

It should be appreciated that the term “matching degree” may be defined by the difference of the distance between the

glasses

101 and 102. The distance here is not a physical distance, but a topological distance, which may not only represent shape features, but also include other features, such as optical properties, mechanical resistance, and so on. That is, the optimization objective function may include the shape as well as other factors. When the optimization objective function is minimized, the matching degree is highest. Therefore, the optimal match does not mean that the shapes are the same. For example, for glasses with different thicknesses, the optimal match might require that two types of glasses are slightly different in shape due to the existence of other constraints. For example, when it is necessary to combine a bare glass with a thickness of 3.5mm and another bare glass with a thickness of 1.6mm, the matching degree may indicate that the shapes are slightly different. However, it should be appreciated that, in some embodiments, the term “matching degree” may also be defined by a difference of shapes of glasses, for example, the difference of shapes is within a certain threshold range.

FIG. 2A illustrates a schematic diagram of an optimization algorithm according to some embodiments of the present disclosure. The container unit 103i contains a plurality of glasses 107, including glasses 107-1, 107-2 ... 107-p, in turn. The container unit 104j contains a plurality of glasses 108, including glasses 108-1, 108-2 ... 108-p in turn. Although only the container unit 103i and the container unit 104j are shown in FIG. 1, it may be understood that glass type A may be stored in a plurality of container units, for example, 1031, 1032, and containers 103 (i-1) (not shown) and 103i; glass type B may be stored in a plurality of container units, 1041, 1042, and containers 104j-1 (not shown) and 104j. The glass matching may be performed in the order shown in FIG. 2A, and the objective function to be optimized (also referred to as a cost function) may be defined. The objective function to be optimized evaluates a difference of distances between glasses in two containers, for example, a difference of distances between glasses on the container unit 103i for storing the type A of glasses and the container unit 104j for storing the type B of glasses. For example, an example of the objective function to be optimized may be:

where C _ij represents the objective function to be optimized, that is, the difference of distances between the glasses on the i ^th container unit 103i and the glasses on the j ^th container unit 104j.

represents a shape measurement result, e.g., a Marposs measurement result, of the p ^th block of glass 107-p on the i ^th container unit 103i at a measurement point k. Similarly,

represents a shape measurement result, e.g., a Marposs measurement result, of the p ^th block of glass 108-p on the j ^th container unit 104j at a measurement point k.

estimates the difference of distances on glass surfaces (namely, surface curvature points or Double Bending (DB) points) of the p ^th pair of glasses on the container units i and j. It should be appreciated that although only shape parameters are exemplarily considered in the Equation (1) , other parameters such as optical property parameters and mechanical strength parameters may also be considered in Equation (1) in other examples.

Alternatively, it is possible to construct the objective function to be optimized by summating the differences of distances between a plurality of glasses on the container units, or by summating the differences of distances between all glasses on the container units. For example, the objective function to be optimized is constructed by summating the differences of distances between all glasses on the container units, the following Equation (2) may be used:

In this way, a target matrix (also called a cost matrix) C may be constructed. The target matrix C provides information on the differences of distances of all possible combinations of container units. For example, the form of the target matrix C may be:

To find the optimal match between container units, one needs to minimize a total cost, where the total cost is the sum of the costs or differences of distances of all possible container unit combinations, and a corresponding mathematical description is:

Min∑ _i∑ _j C _ij Formula (4) ,

where a constraint condition is: each row i can only be assigned to one column j, and each column j can only be assigned to one row i. such optimization problem can be solved by for example the Hungarian algorithm. Optionally, the optimization algorithm may also include KM (Kuhn-Munkres Algorithm) algorithm, genetic algorithm, and the like. In addition, a supervised machine learning algorithm may also be used to gradually increase a prediction effect of the algorithm and increase a success rate of the algorithm in matching glass parameters.

After the matched container units are determined by the above method, the positions of the container units may be determined through the identifiers of the container units. Then, the position of each glass in each container unit is determined through the identifier of the each glass, to determine the paired glasses for the lamination process. When the glasses in the container units are ordered for example in a descending order of DB values from a maximum DB value to a minimum DB value, or in an ascending order of DB values from a minimum DB value to a maximum DB value, after the correspondence relationship between the container units is determined, the glasses in the container units may be directly matched in turn in the descending order or the ascending order. For example, in the example of FIG. 2A, if it is determined that the container unit 103 matches the container unit 104, glass 107-1 matches glass 108-1, glass 107-2 matches glass 108-2, and glass 107-p matches glass 108-p, and so on.

In some embodiments, an automated guided vehicle may be equipped with an RFID reader, and communicate with the RFID tag on the container unit, especially an active RFID tag, to transport the matched container unit to an adjacent location. In addition, the RFID tag (for example, a passive RFID tag) may be combined with an indicator lamp to indicate the position of the container unit, to facilitate the positioning of the container unit. In some embodiments, a color chart may also be used as the tag of the container unit. For example, the same color may be used between the matched container units, so that an operator may very visually determine the container units whose glasses match one another and are adapted to be pressed together by the lamination process.

In some embodiments, parameter matching may be performed with a single glass as a unit other than the container unit as a unit. For example, each glass has its own identifier, such as a QR code or virtual identifier. The parameters of each glass may be determined according to the identifier of the each glass, and a glass best matching the each glass may be sought from other types of glasses. Then, the best-matched glass is positioned according to the identifier of the best-matched glass, and the two glass are laminated by the lamination process. For example, the above-mentioned matching algorithm may be performed with a single glass as a unit.

FIG. 2B illustrates a schematic diagram of an optimization algorithm according to some embodiments of the present disclosure. As shown in FIG. 2B, the laminated glasses in the container is disordered, for example, 107-p does not correspond to 108-p, and instead 107-p corresponds to 108-q. In the embodiment, the p, q optimal matching method in any two container may be found first. The calculation may also employ the Hungarian algorithm. For example, C _ij is first calculated, namely, the method corresponding to the glass matching order p and q in the container is found so that

(Equation 5) . Then, the matching of containers is performed, for example, calculation is performed using Formula (3) and Formula (4) .

In some embodiments, during the process of placing the glass, the surface curvature values (DB values) of the glasses may be ordered. For example, the DB values for example may be ordered in a descending order of DB values from a maximum DB value to a minimum DB value, or in an ascending order of DB values from a minimum DB value to a maximum DB value. Alternatively, optionally, glasses with a difference of DB values of glasses within a range of 0-0.5mm are placed in one container unit, glasses with a difference of DB values of glasses within a range of 0.5mm-1mm are placed in one container unit, and glasses with a difference of DB values of glasses within a range of 1-1.5mm are placed in one container unit.

In some embodiments, in the process of pairing glasses, the influence of the lamination process on parameters such as shapes of glasses may be considered. For example, for two different types of glass, the influence of the lamination process on the shapes of two different types of glasses might be different. In order to compensate for the influence, glasses with a slightly lower matching degree in shape might be selected deliberately for the lamination process. Therefore, the two types of glasses may be paired based on the shape of the two types of glasses and a simulation result of a finite element model for the lamination process.

FIG. 3 shows a flowchart of a method 300 according to some embodiments of the present disclosure.

At 302, parameters of a plurality of first glasses and a plurality of second glasses are determined based on identifiers of the plurality of first glasses and the plurality of second glasses, the plurality of first glasses and the plurality of second glasses being produced by a glass bending process. It should be understood that, at 302, the data of the parameters of all the glasses may not be acquired, and instead the data of the parameters of only part of the glasses may be acquired.

At 304, the plurality of first glasses and the plurality of second glasses are paired based on matching degrees of the parameters of the plurality of first glasses and the plurality of second glasses satisfying a predetermined condition.

In some embodiments, matching degrees of the parameters of the plurality of first glasses in a plurality of container units and the plurality of second glasses in a plurality of container units are determined. The plurality of first glasses and the plurality of second glasses are paired based on the matching degrees of the parameters. In this way, the glass paring may be performed with the container unit as a unit. For example, the paring of a first container unit and a second container unit is implemented by determining that the matching degrees of the parameters of the plurality of first glasses in the first container unit and the plurality of second glasses in the second container unit satisfy the predetermined condition.

In some embodiments, the matching degrees of the parameters of the plurality of first glasses in the plurality of container units and the plurality of second glasses in the plurality of container units are defined by differences of distances between the plurality of first glasses in the plurality of container units and the plurality of second glasses in the plurality of container units. For example, the difference of distance may be the abovementioned Cij. The plurality of first glasses and the plurality of second glasses are paired by minimizing a sum of the differences of distances (for example, as stated above, ∑ _i∑ _j C _ij and the following constraint condition is satisfied: each row i can only be assigned to one column j, and each column j can only be assigned to one row i) .

In some embodiments, the parameters comprise shape parameters, and the matching degrees of the shapes of the plurality of first glasses in the plurality of container units and the plurality of second glasses in the plurality of container units are defined by differences of shapes between the plurality of first glasses in the plurality of container units and the plurality of second glasses in the plurality of container units. For example, the differences of distances may be represented by a difference of measured glass surface curvature values (DV values) of two glasses at a plurality of points. The plurality of first glasses and the plurality of second glasses are paired by minimizing a sum of the differences of shapes.

In some embodiments, the plurality of first glasses and the plurality of second glasses comprises: pairing the plurality of first glasses and the plurality of second glasses by making the sum of the differences of shapes less than a predetermined threshold according to an optimization algorithm.

In some embodiments, pairing the plurality of first glasses and the plurality of second glasses comprises: pairing the plurality of first glasses and the plurality of second glasses by minimizing the sum of the differences of shapes according to an optimization algorithm.

At 306, the paired glasses are located for the lamination process. In some embodiments, the paired glasses are laminated after the paired glasses are located.

In some embodiments, locating the paired glasses comprises: determining identifiers of the container units for the paired glasses based on the identifiers of respective glasses; and locating the container units for the paired glasses based on the identifiers of the container units.

In some embodiments, the identifiers of container units are selected from a group consisting of RFIDs, QR codes, or color charts on the container units.

In some embodiments, locating the paired glasses further comprises: determining positions of the paired glasses in the respective container units from the identifiers for the paired glasses.

In some embodiments, pairing the plurality of first glasses and the plurality of second glasses comprises: determining the paired glasses based on the parameters of the plurality of first glasses and the plurality of second glasses and a simulation result of a finite element model for the lamination process.

In some embodiments, the plurality of first glasses and the plurality of second glasses are ordered according to surface curvature values (DB values) of the plurality of first glasses and the plurality of second glasses.

In some embodiments, the paired glasses are laminated by the lamination process after the paired glasses are located

In some embodiments, when the matching degrees of the parameters of the plurality of first glasses and the plurality of second glasses do not satisfy a predetermined condition, parameters of glasses to be produced are adjusted according to parameters of at least one of the plurality of first glasses and the plurality of second glasses.

In some embodiments, the parameters comprise at least one of shape parameter, optical property parameter and mechanical strength parameter.

FIG. 4 shows a schematic block diagram of a device 400 that may be used to implement embodiments of the present disclosure. The method 300 shown in FIG. 3 may be implemented by the device 400. The device 400 may receive measurement data from a measurement device, and calculate the adjusted glass bending parameters based on the measurement data.

As shown in FIG. 4, the device 400 comprises a central processing unit (CPU) 401 that may perform various appropriate actions and processing based on computer program instructions stored in a read-only memory (ROM) 402 or computer program instructions loaded from a memory unit 408 to a random access memory (RAM) 403. In the RAM 403, there further store various programs and data needed for operations of the device 400. The CPU 401, ROM 402 and RAM 403 are connected to each other via a bus 404. An input/output (I/O) interface 405 is also connected to the bus 404.

Various components in the device 400 are connected to the I/O interface 405, including: an input unit 406 such as a keyboard, a mouse and the like; an output unit 407 including various kinds of displays and a loudspeaker, etc.; a memory unit 408 including a magnetic disk, an optical disk, and etc.; a communication unit 409 including a network card, a modem, and a wireless communication transceiver, etc. The communication unit 409 allows the device 400 to exchange information/data with other devices through a computer network such as the Internet and/or various kinds of telecommunications networks.

Various processes and processing described above, e.g., method 300, may be executed by the processing unit 401. For example, in some embodiments, the method 400 may be implemented as a computer software program that is tangibly embodied on a machine readable medium, e.g., the storage unit 408. In some embodiments, part or all of the computer program may be loaded and/or mounted onto the device 400 via ROM 402 and/or communication unit 409. When the computer program is loaded to the RAM 403 and executed by the CPU 401, one or more steps of the at least one of the method 400 as described above may be executed.

Embodiments of the present disclosure relate to a method, apparatus, system and/or computer program product. The computer program product may include a computer readable storage medium on which computer readable program instructions for executing various aspects of the present disclosure are embodied.

The computer readable storage medium can be a tangible device that can retain and store instructions for use by an instruction execution device. The computer readable storage medium may be, for example, but is not limited to, an electronic storage device, a magnetic storage device, an optical storage device, an electromagnetic storage device, a semiconductor storage device, or any suitable combination of the foregoing. A non-exhaustive list of more specific examples of the computer readable storage medium includes the following: 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) , a static random access memory (SRAM) , a portable compact disc read-only memory (CD-ROM) , a digital versatile disk (DVD) , a memory stick, a floppy disk, a mechanically encoded device such as punch-cards or raised structures in a groove having instructions recorded thereon, and any suitable combination of the foregoing. A computer readable storage medium, as used herein, is not to be construed as being transitory signals per se, such as radio waves or other freely propagating electromagnetic waves, electromagnetic waves propagating through a waveguide or other transmission media (e.g., light pulses passing through a fiber-optic cable) , or electrical signals transmitted through a wire.

Computer readable program instructions described herein can be downloaded to respective computing/processing devices from a computer readable storage medium or to an external computer or external storage device via a network, for example, the Internet, a local area network, a wide area network and/or a wireless network. The network may comprise copper transmission cables, optical transmission fibers, wireless transmission, routers, firewalls, switches, gateway computers and/or edge servers. A network adapter card or network interface in each computing/processing device receives computer readable program instructions from the network and forwards the computer readable program instructions for storage in a computer readable storage medium within the respective computing/processing device.

Computer readable program instructions for carrying out operations of the present invention may be assembler instructions, instruction-set-architecture (ISA) instructions, machine instructions, machine dependent instructions, microcode, firmware instructions, state-setting data, or either source code or object code written in any combination of one or more programming languages, including an object oriented programming language such as Smalltalk, C++ or the like, and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The computer readable program instructions may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the latter scenario, the remote computer may be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN) , or the connection may be made to an external computer (for example, through the Internet using an Internet Service Provider) . In some embodiments, electronic circuitry including, for example, programmable logic circuitry, field-programmable gate arrays (FPGA) , or programmable logic arrays (PLA) may execute the computer readable program instructions by utilizing state information of the computer readable program instructions to personalize the electronic circuitry, in order to perform aspects of the present invention.

Aspects of the present invention are described herein with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) , and computer program products according to embodiments of the invention. It will be understood that each block of the flowchart illustrations and/or block diagrams, and combinations of blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer readable program instructions.

These computer readable program instructions may be provided to a processor of a general purpose computer, special purpose computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks. These computer readable program instructions may also be stored in a computer readable storage medium that can direct a computer, a programmable data processing apparatus, and/or other devices to function in a particular manner, such that the computer readable storage medium having instructions stored therein comprises an article of manufacture including instructions which implement aspects of the function/act specified in the flowchart and/or block diagram block or blocks.

The computer readable program instructions may also be loaded onto a computer, other programmable data processing apparatus, or other device to cause a series of operational steps to be performed on the computer, other programmable apparatus or other device to produce a computer implemented process, such that the instructions which execute on the computer, other programmable apparatus, or other device implement the functions/acts specified in the flowchart and/or block diagram block or blocks.

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 invention. 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 and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems that perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.

The description of the various embodiments of the present invention have been presented for purposes of illustration, but are not intended to be exhaustive or limited to the embodiments disclosed. Many modifications and variations will be apparent to those of ordinary skill in the art without departing from the scope and spirit of the described embodiments. The terminology used herein was chosen to best explain the principles of the embodiments, the practical application or technical improvement over technologies found in the marketplace, or to enable others of ordinary skill in the art to understand the embodiments disclosed herein.

Claims

A method of manufacturing a laminated glass, comprising:

determining parameters of a plurality of first glasses and a plurality of second glasses based on identifiers of the plurality of first glasses and the plurality of second glasses, the plurality of first glasses and the plurality of second glasses produced by a glass bending process;

pairing the plurality of first glasses and the plurality of second glasses based on matching degrees of the parameters of the plurality of first glasses and the plurality of second glasses satisfying a predetermined condition; and

locating the paired glasses for a lamination process.
The method of claim 1, further comprising laminating the paired glasses though the lamination process after locating the paired glasses.
The method of claim 1, wherein pairing the plurality of first glasses and the plurality of second glasses comprises:

determining matching degrees of the parameters of the plurality of first glasses in a plurality of container units and the plurality of second glasses in a plurality of container units; and

pairing the plurality of first glasses and the plurality of second glasses based on the matching degrees of the parameters.
The method of claim 3, wherein pairing the plurality of first glasses and the plurality of second glasses based on the matching degrees of the parameters satisfying the predetermined condition comprises:

implementing the paring of a first container unit and a second container unit by determining that the matching degrees of the parameters of the plurality of first glasses in the first container unit and the plurality of second glasses in the second container unit satisfy the predetermined condition.
The method of claim 3, wherein the matching degrees of the parameters of the plurality of first glasses in the plurality of container units and the plurality of second glasses in the plurality of container units are defined by differences of distances between the plurality of first glasses in the plurality of container units and the plurality of second glasses in the plurality of container units, and

pairing the plurality of first glasses and the plurality of second glasses comprises: pairing the plurality of first glasses and the plurality of second glasses by minimizing a sum of the differences of distances.
The method of claim 3, wherein the parameters comprise shape parameters, and the matching degrees of the shape parameters of the plurality of first glasses in the plurality of container units and the plurality of second glasses in the plurality of container units are defined by differences of shapes between the plurality of first glasses in the plurality of container units and the plurality of second glasses in the plurality of container units, and

pairing the plurality of first glasses and the plurality of second glasses comprises: pairing the plurality of first glasses and the plurality of second glasses by minimizing a sum of the differences of shapes.
The method of claim 6, wherein pairing the plurality of first glasses and the plurality of second glasses comprises: pairing the plurality of first glasses and the plurality of second glasses by making the sum of the differences of shapes less than a predetermined threshold according to an optimization algorithm.
The method of claim 6, wherein pairing the plurality of first glasses and the plurality of second glasses comprises: pairing the plurality of first glasses and the plurality of second glasses by minimizing the sum of the differences of shapes according to an optimization algorithm.
The method of claim 1, wherein locating the paired glasses comprises:

determining identifiers of the container units for the paired glasses based on the identifiers of respective glasses; and

locating the container units for the paired glasses based on the identifiers of the container units.
The method of claim 9, wherein the identifiers of container units are selected from a group consisting of RFIDs, QR codes, or color charts on the container units.
The method of claim 9, wherein locating the paired glasses further comprises:

determining positions of the paired glasses in the respective container units from the identifiers for the paired glasses.
The method of claim 1, wherein pairing the plurality of first glasses and the plurality of second glasses comprises:

determining the paired glasses based on the parameters of the plurality of first glasses and the plurality of second glasses and a simulation result of a finite element model for the lamination process.
The method of claim 1, further comprising:

ordering the plurality of first glasses and the plurality of second glasses according to measurements of surface curvatures of the plurality of first glasses and the plurality of second glasses.
The method of claim 1, wherein the plurality of first glasses and the plurality of second glasses are different types of glasses.
The method of claim 1, further comprising:

when the matching degrees of the parameters of the plurality of first glasses and the plurality of second glasses do not satisfy a predetermined condition, adjusting parameters of glasses to be produced, according to parameters of at least one of the plurality of first glasses and the plurality of second glasses.
The method of any of claims 1-15, wherein the parameters comprise at least one of shape parameter, optical property parameter and mechanical strength parameter.
An electronic device comprising:

at least one processor; and

a memory communicatively connected with the at least one processor; wherein

the memory stores instructions executable by the at least one processor, the instructions, when executed by the at least one processor, causing the at least one processor to perform the method according to any of claims 1-16.
A computer readable storage medium storing computer instructions, wherein the computer instructions are used to cause the computer to perform the method according to any of claims 1-16.
A computer program product, comprising a computer program which, when executed by a processor, performs the method according to any of claims 1-16.