University of Virginia Patent Foundation

Honda Motor Co., Ltd.

Gholamreza Rahimi

Kevin Skadron

Elaheh Sadredini

Kikuo Fujimura

David Francis Isele

Mircea R Stan

Ke Wang

Kaushik Subramanian

Akansel Cosgun

Systems and methods for generating instructions for a vehicle to navigate an unsignaled intersection are provided. The method may include: generating an expected return over a sequence of actions of the vehicle; determining an optimal policy by selecting an action with a maximum value for the vehicle; executing dynamic frame skipping to expedite learning a repeated action of the vehicle; prioritize an experience replay by utilizing an experience replay buffer to break correlations between sequential steps of the vehicle; generate a plurality of state-action representations based on at least one of the expected return, the optimal policy, the dynamic frame skipping, or the prioritized experience replay; generate the instructions for navigating the unsignaled intersection based on the plurality of state-action representations; and transmit the instructions for navigating the unsignaled intersection to the vehicle such that the vehicle executes the instructions to navigate the unsignaled intersection.

Systems and methods for generating instructions for navigating intersections with autonomous vehicles

A method of searching tree-structured data can be provided by identifying all labels associated with nodes in a plurality of trees including the tree-structured data, determining which of the labels is included in a percentage of the plurality of trees that exceeds a frequent threshold value to provide frequent labels, defining frequent candidate sub-trees for searching within the plurality of trees using combinations of only the frequent labels, and then searching for the frequent candidate sub-trees in the plurality of trees including the tree-structured data using a plurality of pruning kernels instantiated on a non-deterministic finite state machine to provide a less than exact count of the frequent candidate sub-trees in the plurality of trees.

Methods, circuits, and articles of manufacture for frequent sub-tree mining using non-deterministic finite state machines

A finite state machine circuit can include a plurality of rows of gain cell embedded Dynamic Random Access Memory (GC-eDRAM) cells that can be configured to store state information representing all N states expressed by a finite state machine circuit. A number of eDRAM switch cells can be electrically coupled to the plurality of rows of the GC-eDRAM cells, where the number of eDRAM switch cells can be arranged in an M&#xd7;M cross-bar array where M is less than N, and the number of eDRAM switch cells can be configured to provide interconnect for all transitions between the all N states expressed by the finite state machine circuit.

Methods, circuits, systems, and articles of manufacture for state machine interconnect architecture using embedded DRAM

Growing community of inventors

Charlottesville, VA, United States of America

Gholamreza Rahimi