Patents by Inventor Ana Marcusanu

Ana Marcusanu has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Patent number: 11886172
    Abstract: It is proposed a method for factory operation. The method includes providing manufacturing tasks each represented by a law describing a manufacturing of a product by one or more manageable machines. The method includes obtaining one or more manufacturing constraints and one or more manufacturing events. The method includes determining an operating mode of the factory based on the one or more manufacturing constraints and on one or more product constraints. The determining includes one or more iterations. Each iteration computes a respective propensity of each manufacturing task representing a frequency with which the task is chosen for manufacturing the product given the constraints and/or a previous event(s) occurrence. The iteration ranks the tasks according to a propensity descending order. The iteration visits the tasks according to the ranking and affecting to each task one or more manageable machines and resources. The iteration executes the tasks until an event(s).
    Type: Grant
    Filed: December 17, 2021
    Date of Patent: January 30, 2024
    Assignee: DASSAULT SYSTEMES
    Inventors: Laure-Anne Poisson, Philippe Belmans, Ana Marcusanu, Vincent Siess
  • Publication number: 20230076988
    Abstract: A computer-implemented method for automatically furnishing a 3D room based on user preferences including obtaining at least one spatial relations graph of a virtual 3D room and a set of user preferences, converting the set of user preferences into a set of target parameters, computing, for each spatial relations graph: a set of Key Performance Indicator values, and a KPI distance, automatically selecting at least one most promising spatial relations graph, instantiating the most promising spatial relations graph into the 3D room to be furnished, displaying the furnished virtual 3D room proposal to the user, receiving an update of the user preferences, and reiterating until a stopping criterion is fulfilled.
    Type: Application
    Filed: August 24, 2022
    Publication date: March 9, 2023
    Applicant: DASSAULT SYSTEMES
    Inventors: Tom DURAND, Ana MARCUSANU
  • Publication number: 20220335171
    Abstract: A computer-implemented method for automatically providing at least a template of a furnished virtual 3D room including 3D elements, including, for each furnished virtual 3D room: automatically extracting a spatial relations graph based on spatial relations between the 3D elements of the 3D room, said 3D elements including 3D architectural elements and 3D furnishing objects located in the furnished virtual 3D room, automatically extracting at least one zone from the 3D room based on the spatial relations graph, and extracting a set of constraints about a relative arrangement of said zone with respect to the room architecture or with respect to other zones of the 3D room, a zone being defined by a local spatial arrangement of at least one 3D furnishing object, and storing a template of the furnished virtual 3D room, said template including said zone and said set of constraints.
    Type: Application
    Filed: April 6, 2022
    Publication date: October 20, 2022
    Applicant: DASSAULT SYSTEMES
    Inventors: Tom DURAND, Ana MARCUSANU, Aurélien LOUIS, Célia AEPLY, Julie FARRE
  • Publication number: 20220197259
    Abstract: It is proposed a method for factory operation. The method includes providing manufacturing tasks each represented by a law describing a manufacturing of a product by one or more manageable machines. The method includes obtaining one or more manufacturing constraints and one or more manufacturing events. The method includes determining an operating mode of the factory based on the one or more manufacturing constraints and on one or more product constraints. The determining includes one or more iterations. Each iteration computes a respective propensity of each manufacturing task representing a frequency with which the task is chosen for manufacturing the product given the constraints and/or a previous event(s) occurrence. The iteration ranks the tasks according to a propensity descending order. The iteration visits the tasks according to the ranking and affecting to each task one or more manageable machines and resources. The iteration executes the tasks until an event(s).
    Type: Application
    Filed: December 17, 2021
    Publication date: June 23, 2022
    Applicant: DASSAULT SYSTEMES
    Inventors: Laure-Anne Poisson, Philippe Belmans, Ana Marcusanu, Vincent Siess