Optimized factory schedule and layout generation
AssigneeVeo Robotics, Inc.
InventorsPatrick Sobalvarro, Clara Vu, Joshua Downer, Paulo Ferreira, Mehmet Ali Guney, Thomas C. Ferree, Alberto Moel, Richard A. Kelsey
Life of this patent
Estimating the term…
Abstract
Systems and methods for optimizing factory scheduling, layout or both which represent active factory elements (human and machine) as computational objects and simulate factory operation to optimize a solution. This enables the efficient assembly of customized products, accommodates variable demand, and mitigates unplanned events (floor blockages, machines/IMRs/workcell/workers downtime, variable quantity, location, and destination of supply parts).
Claims14
A method of scheduling, for execution in a facility having a layout, the method comprising the steps of:
- (a) storing, in a computer memory, a plurality of object data structures each corresponding to a machine or a human and containing data and/or instructions for simulating behavior in (i) carrying out a task, (ii) allowed movement about the facility, (iii) speed of operation and movement based on inherent characteristics of the machine or the human and proximity thereof to other objects, wherein the object data structures include parameter values constraining the simulated behavior, at least some of the machines are mobile, and at least one of the object data structures corresponds to a human and references a model of human anatomy and movement;
- (b) receiving, by a computational simulator, a work order and an objective function specifying a quantity to be maximized and a representation of at least a portion of the layout;
- (c) based on the work order, simulating, using the computational simulator and the stored object data structures, performance of the work including movement of the mobile machines and at least one human in the facility along one or more planned paths;
- (d) iteratively repeating step (c) with object parameter values and paths that have been updated in accordance with, respectively, an optimization algorithm and a path-planning algorithm until the quantity specified by the objective function is maximized;
- and
- (e) generating an operation schedule for the machines represented by object data structures.
Dependencies are inferred from the claim text.