EPO Patent: Computer Method Optimizes Item Storage Using CQM Problem
Summary
The European Patent Office has published patent application EP4711994A1, detailing a computer-implemented method for optimizing item storage using a constrained quadratic model (CQM) problem, potentially leveraging quantum computing. The patent, filed by Fundación Tecnalia Research & Innovation, aims to maximize item storage at ground level.
What changed
This document is a published patent application (EP4711994A1) from the European Patent Office (EPO) concerning a computer-implemented method for optimizing the disposition of items in physical locations. The method defines the storage problem as a constrained quadratic model (CQM) problem, aiming to maximize items stored at ground level, and may utilize quantum computing for solving the CQM problem. The patent application was published on March 18, 2026, with Fundación Tecnalia Research & Innovation listed as the applicant.
As this is a patent publication, it does not impose direct regulatory obligations or compliance deadlines on regulated entities. However, it signifies innovation in AI and quantum computing applications for logistics and operations. Companies involved in warehousing, supply chain management, or AI development may find the technical details relevant for understanding emerging technologies in optimization and storage solutions.
Source document (simplified)
METHODS AND DEVICES FOR OPTIMIZING STORAGE OF ITEMS
Publication EP4711994A1 Kind: A1 Mar 18, 2026
Applicants
Fundación Tecnalia Research & Innovation
Inventors
OSABA, Eneko, VILLAR-RODRÍGUEZ, Esther
Abstract
A computer-implemented method for optimizing the disposition of items in one or more locations of a physical environment is provided. The method comprises: providing (132) a plurality of available locations in which items can be disposed; providing (131) a plurality of items to be located; defining (141) a problem associated to a WOP for storing as many items as possible at ground level, said problem being defined as a constrained quadratic model problem (CQM problem) to decide the location I in which each item i should be stored; solving (143) the CQM model problem by maximizing the amount of items i stored at the ground level of the available set of locations, thus obtaining partial solutions; completing (145) each partial solution (144) by stacking, if required, all items that have been left unstacked; eliminating (149) repeated and unfeasible solutions, thus obtaining a set of N feasible solutions to the WOP; selecting (16) one or more initial solutions of the N feasible solutions and optimizing (18) them, providing a most optimal one; wherein solving (143) the CQM problem is done at least partially in a quantum computer.
IPC Classifications
G06Q 10/04 20230101AFI20250303BHEP G06N 10/00 20220101ALI20250303BHEP G06Q 10/08 20240101ALI20250303BHEP G06F 8/41 20180101ALI20250303BHEP G06N 10/60 20220101ALI20250303BHEP
Designated States
AL, AT, BE, BG, CH, CY, CZ, DE, DK, EE, ES, FI, FR, GB, GR, HR, HU, IE, IS, IT, LI, LT, LU, LV, MC, ME, MK, MT, NL, NO, PL, PT, RO, RS, SE, SI, SK, SM, TR
Named provisions
Related changes
Source
Classification
Who this affects
Taxonomy
Browse Categories
Get Telecom & Technology alerts
Weekly digest. AI-summarized, no noise.
Free. Unsubscribe anytime.
Get alerts for this source
We'll email you when ChangeBridge: EPO Bulletin - AI & Computing (G06N) publishes new changes.