Palo Alto Research Center Inc.

Other

Tim C Schmidt

Rong Zhou

Johan De Kleer

Robert Roy Price

Juan Liu

Lukas Daniel Kuhn

Minh Binh Do

Serdar Uckun

Johan Dekleer

Lukas Kuhn

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. The method progresses to the next search layer once all the adjusted operator groups in the current search layer have been used for node expansions.

System and method for parallel edge partitioning in and/or graph search

A method and system for performing a graph search, includes constructing an abstract representation of the 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. The duplicate detection scopes of the abstract nodes are partitioned into smaller duplicate detection scopes using edge partitioning. The abstract edges include the smaller duplicate detection scopes. Nodes in the current search layer are expanded using the operator groups of outgoing abstract edges of the abstract nodes the nodes map to. The operator groups associated with abstract edges having disjoint duplicate detection scopes are used to expand the nodes in parallel. Once all the operator groups in the current search layer have been used for node expansion the method progresses to the next search layer.

System and method for parallel graph searching utilizing parallel edge partitioning

Compressed Level-Ordered Edge Sequence (CLOES) encodings are described. These techniques enable more aggressive compression of a state-set representation.

System and method for compressed level-ordered edge sequence encoding

A model-based control system for controlling a production system is disclosed. The production system provides jobs and objectives to the model-based control system. The model-based control system includes, a planner operative to provide the production system with a plan, the planner generating the plan using a depth-first target value search. The depth-first target value search being configured to generate the plan with a failure probability most closely approximating a target value. Also provided is a system model operative to model the behavior of the production system. Another aspect of the model-based control system is a diagnosis engine operative to estimate failure probabilities for plans and provide diagnostic guidance to the planner. The model-based control system including the planner, the system model and diagnosis engine are implemented via a digital processing device.

Depth-first search for target value problems

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.

Memory efficient state-set representation for planning

Methods and systems for solving a target value search problem using a multi-interval heuristic are presented. The methods and system identity a path, or paths, in a graph, whereby a connection graph is created and range sets are generated for each vertex in the connection graph. Range sets include one or more intervals. Thereafter, a best search is performed to identify a path, or paths, from a starting vertex to a goal vertex having a path value closest to a target value.

Multi-interval heuristics for accelerating target-value search

A method for determining a target path for a model-based control system. The model-based control system includes a directed acyclic graph, where the directed acyclic graph includes a plurality of vertices interconnected by a plurality of edges. The method includes the steps of performing a depth-first search of the directed acyclic graph for the target path. The depth-first search is operative to return an explicit solution or an implicit solution, wherein the implicit solution is determined using a heuristic. The method further includes determining if the depth-first search returned an explicit solution or an implicit solution, and if the depth-first search returned an implicit solution, constructing the target path from the implicit solution. The method may further include constructing a pattern database.

Target value search methods and systems are presented for solving a target value path problem to identify a path or paths in a graph in which a connection graph is created and upper and lower bound values are determined for each node in the connection graph, and a first best search is performed to identify a path or paths from a starting node to a goal node having a path value closest to the target value.

Methods and systems for target value path identification

An infant carrying system including a bag defining an interior compartment and having an opening for selectively providing access to the interior compartment. A pair of wheels are rotatably attached to the bag so that the bag can be rolled along the ground. A handle is attached to the bag so that the bag can be moved by rolling the wheels along the ground. An attachment is provided for removably securing a child seat at least partially located within the interior compartment and facing the opening. Whereby the bag is moved while a child is secured in the child seat which is secured in the bag and the bag is also used to store and carry the empty child seat or other items.

Growing community of inventors

Campbell, CA, United States of America

Tim C Schmidt