Patents by Inventor Virginia A. Didomizio

Virginia A. Didomizio 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: 7647232
    Abstract: A method routes a predefined number of entities (200) through a predetermined area for scanning the content of the predetermined area. The method comprises the steps of: partitioning the predetermined area into a first set of cells (100); grouping the first set of cells (100) into a number of corridors (201) equal to the number of entities (200); determining a starting cell for each entity (200) in each corridor (201); initiating a scan of cells of each of the corridors (201) from the starting cell of each of the entities (200) and determining the content of each of the scanned cells; and determining a total cost for each entity (200) to travel to each of the scanned cells scanned by each entity (200) and performing a scan from each of the scanned cells by each entity (200).
    Type: Grant
    Filed: February 21, 2002
    Date of Patent: January 12, 2010
    Assignee: Lockheed Martin Corporation
    Inventors: Abha Moitra, Robert M. Mattheyses, Robert J. Szczerba, Louis J. Hoebel, Virginia A. Didomizio, Boris Yamrom
  • Patent number: 6985810
    Abstract: A method routes an entity (200) through a predetermined area for scanning the content of the predetermined area. The method comprises the steps of: partitioning the predetermined area into cells (100); determining a starting cell for the entity (200); initiating a scan of a number of the cells from the starting cell and determining the content of each of the number of cells; and determining a total cost for the entity (200) to travel to each of the scanned cells and to perform a scan from each of the scanned cells.
    Type: Grant
    Filed: July 29, 2003
    Date of Patent: January 10, 2006
    Assignee: Lockheed Martin Corporation
    Inventors: Abha Moitra, Robert M. Mattheyses, Robert J. Szczerba, Louis J. Hoebel, Virginia A. Didomizio, Boris Yamrom
  • Patent number: 6725152
    Abstract: A method routes an entity (200) through a predetermined area for scanning the content of the predetermined area. The method includes the steps of: partitioning the predetermined area into cells (100); determining a starting cell for the entity (200); initiating a scan of a number of the cells from the starting cell and determining the content of each of the number of cells; and determining a total cost for the entity (200) to travel to each of the scanned cells and to perform a scan from each of the scanned cells.
    Type: Grant
    Filed: February 21, 2002
    Date of Patent: April 20, 2004
    Assignee: Lockheed Martin Corporation
    Inventors: Abha Moitra, Robert M. Mattheyses, Robert J. Szczerba, Louis J. Hoebel, Virginia A. Didomizio, Boris Yamrom
  • Publication number: 20040073341
    Abstract: A method routes an entity (200) through a predetermined area for scanning the content of the predetermined area. The method comprises the steps of: partitioning the predetermined area into cells (100); determining a starting cell for the entity (200); initiating a scan of a number of the cells from the starting cell and determining the content of each of the number of cells; and determining a total cost for the entity (200) to travel to each of the scanned cells and to perform a scan from each of the scanned cells.
    Type: Application
    Filed: July 29, 2003
    Publication date: April 15, 2004
    Applicant: Lockheed Martin Corporation
    Inventors: Abha Moitra, Robert M. Mattheyses, Robert J. Szczerba, Louis J. Hoebel, Virginia A. Didomizio, Boris Yamrom
  • Patent number: 6718261
    Abstract: A method routes a plurality of entities (200) through a predetermined area. The method includes the steps of: providing a plan; providing a deterministic method for computing the plan for the plurality of entities (200), the plan including a plurality of routes and sets of scan points for each of the entities (200); and performing the method by each of the plurality of entities (200) independently from the other of the plurality of entities (200).
    Type: Grant
    Filed: February 21, 2002
    Date of Patent: April 6, 2004
    Assignee: Lockheed Martin Corporation
    Inventors: Robert M. Mattheyses, Abha Moitra, Robert J. Szczerba, Louis J. Hoebel, Virginia A. Didomizio, Boris Yamrom
  • Patent number: 6687606
    Abstract: A method analyzes a plan for scanning the content of a predetermined area. The method includes the steps of: providing a plan for at least one entity (200), the plan including a route and a set of scan points; and assigning an associated score for the plan in order to compare the plan to other plans, the score indicating the quality of the plan.
    Type: Grant
    Filed: February 21, 2002
    Date of Patent: February 3, 2004
    Assignee: Lockheed Martin Corporation
    Inventors: Abha Moitra, Robert M. Mattheyses, Robert J. Szczerba, Louis J. Hoebel, Virginia A. Didomizio, Boris Yamrom
  • Publication number: 20030229443
    Abstract: A method routes an entity (200) through a predetermined area for scanning the content of the predetermined area. The method comprises the steps of: partitioning the predetermined area into cells (100); determining a starting cell for the entity (200); initiating a scan of a number of the cells from the starting cell and determining the content of each of the number of cells; and determining a total cost for the entity (200) to travel to each of the scanned cells and to perform a scan from each of the scanned cells.
    Type: Application
    Filed: February 21, 2002
    Publication date: December 11, 2003
    Inventors: Abha Moitra, Robert M. Mattheyses, Robert J. Szczerba, Louis J. Hoebel, Virginia A. Didomizio, Boris Yamrom
  • Publication number: 20030229442
    Abstract: A method routes a plurality of entities (200) through a predetermined area. The method includes the steps of: providing a plan; providing a deterministic method for computing the plan for the plurality of entities (200), the plan including a plurality of routes and sets of scan points for each of the entities (200); and performing the method by each of the plurality of entities (200) independently from the other of the plurality of entities (200).
    Type: Application
    Filed: February 21, 2002
    Publication date: December 11, 2003
    Inventors: Robert M. Mattheyses, Abha Moitra, Robert J. Szczerba, Louis J. Hoebel, Virginia A. Didomizio, Boris Yamrom
  • Publication number: 20030158744
    Abstract: A method routes a predefined number of entities (200) through a predetermined area for scanning the content of the predetermined area. The method comprises the steps of: partitioning the predetermined area into a first set of cells (100); grouping the first set of cells (100) into a number of corridors (201) equal to the number of entities (200); determining a starting cell for each entity (200) in each corridor (201); initiating a scan of cells of each of the corridors (201) from the starting cell of each of the entities (200) and determining the content of each of the scanned cells; and determining a total cost for each entity (200) to travel to each of the scanned cells scanned by each entity (200) and performing a scan from each of the scanned cells by each entity (200).
    Type: Application
    Filed: February 21, 2002
    Publication date: August 21, 2003
    Inventors: Abha Moitra, Robert M. Mattheyses, Robert J. Szczerba, Louis J. Hoebel, Virginia A. Didomizio, Boris Yamron