×

System and method for resource allocation and management

  • US 8,634,982 B2
  • Filed: 08/19/2009
  • Issued: 01/21/2014
  • Est. Priority Date: 08/19/2009
  • Status: Active Grant
First Claim
Patent Images

1. A method of planning sensor platform movement, comprising:

  • dividing an area of interest into a grid of grid cells, each grid cell having a target probability and the sensor platform having a starting point corresponding to one of the grid cells;

    determining, via a computer system, a heuristic for the sensor platform by;

    iteratively searching a subset of the grid cells within incrementing respective search distances, from a search depth equal to one to a search depth defined by a look ahead depth, for a predetermined number of iterations defined by the look ahead depth,selecting, in each iteration, the grid cell having the highest target probability of the grid cells searched,logging the respective target probabilities of the selected grid cells and logging the respective search distances associated with the respective selected grid cells,wherein the search distance for the sensor platform in each iteration is measured from the starting point of the sensor platform, thereby ignoring feasibility of moves from the selected grid cell of one iteration to the selected grid cell of a subsequent iteration;

    determining, via the computer system, a current best path through the grid cells of the area of interest for a number of moves up to the look ahead depth;

    pruning, via the computer system, possible sensor platform movements by iterating a beginning branch and bound function for the predetermined number of steps in the look ahead depth, by comparing potential branches with the current best path, and eliminating potential branches that are not better than the current best path, wherein the potential branches each include a current node corresponding to the current step in the look ahead depth and ancestor and successor nodes collectively equal to the look ahead depth minus one, the current node having a value corresponding to a target probability of a feasible move, each ancestor node having a value corresponding to a target probability of a feasible move and each successor node having a value corresponding to a target probability of the heuristic; and

    tasking the sensor platform in accordance with the pruned possible sensor platform movements.

View all claims
  • 1 Assignment
Timeline View
Assignment View
    ×
    ×