Patents by Inventor Michael Alan Foster

Michael Alan Foster 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).

  • Publication number: 20240166379
    Abstract: Movable platforms for use with a vehicle capture assembly of a capture vehicle and related devices, systems, and methods include floors with rotatable legs extending between the floors. The rotation of the legs relative to one or more of the floors enables the movable platform to move from an initial position to a displaced position as one or more of the floors move relative to each other.
    Type: Application
    Filed: November 18, 2022
    Publication date: May 23, 2024
    Inventors: Emmanuel Simpri, Jack Purcell, Matthew Alan Michel, Michael J. Foster, Quentin Williams
  • Patent number: 10423693
    Abstract: A method, apparatus, system, computer program product, and computer readable storage medium provide the ability to parallel process hierarchical data. Hierarchical data is obtained. The hierarchical data is organized in a relationship graph having two or more nodes (consisting of parent nodes that are dependent on child nodes). The relationship graph requires bottom-up processing. Cycles are identified in the relationship graph. The relationship graph is leveled by traversing the graph and assigning all graph nodes into levels. The hierarchical data is processed by parallel processing the nodes in a first level of the one or more levels before parallel processing the nodes in a subsequent level.
    Type: Grant
    Filed: September 15, 2014
    Date of Patent: September 24, 2019
    Assignee: AUTODESK, INC.
    Inventors: Timothy E. Abla, Michael Alan Foster, John T. Koerner, Mikel L. Martin, Dennis M. Mulonas, Matthew W. Smith
  • Publication number: 20160078118
    Abstract: A method, apparatus, system, computer program product, and computer readable storage medium provide the ability to parallel process hierarchical data. Hierarchical data is obtained. The hierarchical data is organized in a relationship graph having two or more nodes (consisting of parent nodes that are dependent on child nodes). The relationship graph requires bottom-up processing. Cycles are identified in the relationship graph. The relationship graph is leveled by traversing the graph and assigning all graph nodes into levels. The hierarchical data is processed by parallel processing the nodes in a first level of the one or more levels before parallel processing the nodes in a subsequent level.
    Type: Application
    Filed: September 15, 2014
    Publication date: March 17, 2016
    Applicant: AUTODESK, INC.
    Inventors: Timothy E. Abla, Michael Alan Foster, John T. Koerner, Mikel L. Martin, Dennis M. Mulonas, Matthew W. Smith