Patents by Inventor Tim C. Schmidt

Tim C. Schmidt 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).

  • System and method for parallel edge partitioning in and/or graph search
    Patent number: 10410144
    Abstract: A method and system for searching a graph in parallel which constructs an abstract representation of an AND/OR graph using state-space abstraction. The abstract representation of the graph includes one or more abstract nodes having duplicate detection scopes and one or more abstract edges having operator groups adjusted for AND node outcomes. The duplicate detection scopes of the abstract nodes are partitioned into smaller duplicate detection scopes using edge partitioning, wherein the abstract edges are used to define the smaller duplicate detection scopes. Nodes in the current search layer are expanded by a processing unit using the adjusted operator groups of outgoing abstract edges of the abstract nodes mapped into by the nodes, wherein the nodes expanded in parallel use adjusted operator groups associated with abstract edges having disjoint duplicate detection scopes.
    Type: Grant
    Filed: October 14, 2011
    Date of Patent: September 10, 2019
    Assignee: PALO ALTO RESEARCH CENTER INCORPORATED
    Inventors: Rong Zhou, Minh Binh Do, Tim C. Schmidt, Serdar Uckun
  • System and method for compressed level-ordered edge sequence encoding
    Patent number: 9876638
    Abstract: Compressed Level-Ordered Edge Sequence (CLOES) encodings are described. These techniques enable more aggressive compression of a state-set representation.
    Type: Grant
    Filed: June 22, 2012
    Date of Patent: January 23, 2018
    Assignee: Palo Alto Research Center Incorporated
    Inventors: Rong Zhou, Tim C. Schmidt
  • Memory efficient state-set representation for planning
    Patent number: 9361578
    Abstract: A method for encoding state sets which encodes a binary prefix tree representation as a level ordered edge sequence (LOES) where the inner tree nodes are ordered from left to right, and top to bottom order and coded as bit pairs which represent the presence of leaf nodes.
    Type: Grant
    Filed: July 13, 2011
    Date of Patent: June 7, 2016
    Assignee: Palo Alto Research Center Incorporated
    Inventors: Tim C. Schmidt, Rong Zhou
  • SYSTEM AND METHOD FOR COMPRESSED LEVEL-ORDERED EDGE SEQUENCE ENCODING
    Publication number: 20130346451
    Abstract: Compressed Level-Ordered Edge Sequence (CLOES) encodings are described. These techniques enable more aggressive compression of a state-set representation.
    Type: Application
    Filed: June 22, 2012
    Publication date: December 26, 2013
    Applicant: PALO ALTO RESEARCH CENTER INCORPORATED
    Inventors: Rong Zhou, Tim C. Schmidt
  • System and method for parallel edge partitioning in and/or graph search
    Publication number: 20130097199
    Abstract: A method and system for searching a graph in parallel which constructs an abstract representation of an AND/OR graph using state-space abstraction. The abstract representation of the graph includes one or more abstract nodes having duplicate detection scopes and one or more abstract edges having operator groups adjusted for AND node outcomes. The duplicate detection scopes of the abstract nodes are partitioned into smaller duplicate detection scopes using edge partitioning, wherein the abstract edges are used to define the smaller duplicate detection scopes. Nodes in the current search layer are expanded by a processing unit using the adjusted operator groups of outgoing abstract edges of the abstract nodes mapped into by the nodes, wherein the nodes expanded in parallel use adjusted operator groups associated with abstract edges having disjoint duplicate detection scopes.
    Type: Application
    Filed: October 14, 2011
    Publication date: April 18, 2013
    Applicant: Palo Alto Research Center Incorporated
    Inventors: Rong Zhou, Minh Binh Do, Tim C. Schmidt, Serdar Uckun
  • MEMORY EFFICIENT STATE-SET REPRESENTATION FOR PLANNING
    Publication number: 20130018922
    Abstract: A method for encoding state sets which encodes a binary prefix tree representation as a level ordered edge sequence (LOES) where the inner tree nodes are ordered from left to right, and top to bottom order and coded as bit pairs which represent the presence of leaf nodes.
    Type: Application
    Filed: July 13, 2011
    Publication date: January 17, 2013
    Applicant: PALO ALTO RESEARCH CENTER INCORPORATED
    Inventors: Tim C. Schmidt, Rong Zhou