Real-time team coordination system for reconnaissance and surveillance missions

• US 7,647,232 B2
• Filed: 02/21/2002
• Issued: 01/12/2010
• Est. Priority Date: 02/21/2002
• Status: Active Grant

• Current Assignee: General Electric Company
• Original Assignee: Lockheed Martin Corporation (Martin Marietta Corporation)
• Inventors: Moitra, Abha, Didomizio, Virginia A., Yamrom, Boris, Hoebel, Louis J., Mattheyses, Robert M., Szczerba, Robert J.
• Primary Examiner(s): Mooneyham; Janice A.
• Assistant Examiner(s): Fisher; Michael J
• Application Number:
  US10/079,630
• Publication Number:
  US 20030158744A1
• Time in Patent Office: 2,882 Days
• Field of Search: 705/1, 342/70, 342/25.A
• US Class Current: 705/1.1
• CPC Class Codes: G05D 1/0202 specially adapted to aircraft
• CPC Class Codes: G06Q 10/047 Optimisation of routes or paths, e.g. travelling salesman problem
• CPC Class Codes: G06Q 30/0283 Price estimation or determination

Abstract

A method routes a predefined number of entities (200) through a predetermined area for scanning the content of the predetermined area. The method comprises the steps of: partitioning the predetermined area into a first set of cells (100); grouping the first set of cells (100) into a number of corridors (201) equal to the number of entities (200); determining a starting cell for each entity (200) in each corridor (201); initiating a scan of cells of each of the corridors (201) from the starting cell of each of the entities (200) and determining the content of each of the scanned cells; and determining a total cost for each entity (200) to travel to each of the scanned cells scanned by each entity (200) and performing a scan from each of the scanned cells by each entity (200).

Claims

1. A computer-implemented method for routing a predetermined number of entities through a predetermined area for scanning the content of the predetermined area, said method comprising the steps of:

partitioning the predetermined area into a first set of cells;

grouping the first set of cells into a number of corridors, the number of corridors being equal to the predetermined number of entities;

the computer determines a starting cell for each entity in a corresponding corridor;

initiating a scan of a number of cells from the starting cell of a portion of each of the corridors from the starting cell of each of the entities and determining the content of each of the number of cells; and

the computer determines a total cost for each entity to travel to each of the cells scanned by each entity and performing a scan from each of the cells scanned by each entity.

2. The computer-implemented method as set forth in claim 1 wherein said cost determining step comprises:

determining a travel cost for each entity to travel to each of the cells scanned by each associated entity;

determining a scan cost for each entity to perform a scan from each of the scanned cells in each corresponding corridor; and

adding the travel cost and scan cost to compute the total cost.

3. The computer-implemented method as set forth in claim 1 further including the step of determining a next scan with a minimum total cost for each entity.

4. The computer-implemented method as set forth in claim 3 further including a step determining movement of one of the entities to one of the next scan cells.

5. The computer-implemented method as set forth in claim 3 further including the step of redesignating the next scan cells as a starting cell for an entity.

6. The computer-implemented method as set forth in claim 1 further including the step of starting said method over again.

7. The computer-implemented method as set forth in claim 2 further comprising the step of algebraically transforming the cost of traveling to a next scan cell.

8. The computer-implemented method as set forth in claim 2 further comprising the step of algebraically transforming a scan cost at each scan.

9. The computer-implemented method as set forth in claim 1 further comprising the step of subtracting a benefit amount from the total cost.

10. A computer program product for determining a route for each of a plurality of entities through a predetermined area and for analyzing the content of the predetermined area, said product comprising:

a first procedure that partitions the predetermined area into cells;

a second procedure that groups the cells into corridors;

a third procedure that determines a starting cell for each entity, each starting cell being located in a corresponding corridor;

a fourth procedure that initiates a scan of a number of the cells from each starting cell and determines the content of each of the number of cells; and

a fifth procedure that determines a total cost for each entity to travel to each of the cells scanned in that corresponding corridor and for each entity to perform a scan from each of the cells scanned in that corresponding corridor.

11. The computer program product as set forth in claim 10 further including a sixth procedure that selects a next scan cell with the minimum total cost.

12. The computer program product as set forth in claim 10 further including a sixth procedure for determining movement of that entity to a next scan cell.

13. The computer program product as set forth in claim 10 further including a sixth procedure that redesignates a next scan cell for each entity as a starting cell for that entity.

14. The computer program product as set forth in claim 10 further including a sixth procedure that returns to the fourth procedure.

15. The computer program product as set forth in claim 10 wherein said fifth procedure further includes algebraically transforming the total cost.

16. The computer program product as set forth in claim 15 wherein said fifth procedure further includes subtracting a benefit amount from the total cost in each corridor.