×

Activity recognition in multi-entity environments

  • US 9,460,350 B2
  • Filed: 06/29/2012
  • Issued: 10/04/2016
  • Est. Priority Date: 07/01/2011
  • Status: Active Grant
First Claim
Patent Images

1. A method comprising:

  • defining a graph including vertices and edges, wherein each vertex corresponds to a sensor in a physical environment and each edge represents a direct path between two vertices with no other vertices between the two vertices along the path;

    defining a set of logical rules for identifying and tracking entities within the physical environment based on the graph, wherein the rules include;

    a rule for determining that an entity has moved from one location in the physical environment to another location within the physical environment based at least in part on the edges of the graph; and

    a rule for determining that the entity has moved from the one location in the physical environment to the another location within the physical environment based at least in part on the entity moving more recently within the physical environment than another entity that is a candidate for a detected move to the another location;

    receiving first data from a first sensor in the physical environment, the first sensor corresponding to a first vertex in the graph, the first sensor including a first type of sensor;

    determining a current location of a first entity based at least in part on the first data;

    receiving second data from a second sensor in the physical environment, the second sensor corresponding to a second vertex in the graph;

    determining a current location of a second entity based at least in part on the second data;

    receiving third data from a third sensor in the physical environment, the third sensor corresponding to a third vertex in the graph, the third sensor including a second, different type of sensor, wherein the third vertex is connected to the first vertex by a first edge of the graph and the third vertex is connected to the second vertex by a second edge of the graph; and

    executing instructions on a computer processor to update the current location of the first entity within the physical environment based at least in part on the first vertex being connected to the third vertex by the first edge of the graph and the first entity moving more recently in the physical environment than the second entity.

View all claims
  • 2 Assignments
Timeline View
Assignment View
    ×
    ×