Computation of routes for bounding overwatch operations

• US 6,175,804 B1
• Filed: 03/11/1999
• Issued: 01/16/2001
• Est. Priority Date: 03/11/1999
• Status: Expired due to Term

• Current Assignee: Lockheed Martin Corporation (Martin Marietta Corporation)
• Original Assignee: Lockheed Martin Corporation (Martin Marietta Corporation)
• Inventors: Szczerba, Robert Joseph
• Primary Examiner(s): Lobo, Ian J.
• Application Number:
  US09/266,624
• Time in Patent Office: 677 Days
• Field of Search: 701/200, 701/202, 701/209, 701/201, 731/78.R, 434/11, 342/13, 342/357.08, 342/357.17
• US Class Current: 701/209
• CPC Class Codes: G01C 21/3438 Rendez-vous, i.e. searching a destination where several users can meet, and the routes to this destination for these users; Ride sharing, i.e. searching a route such that at least two users can share a vehicle for at least part of the route

Abstract

A processor-based system performs overwatch location and routing determinations for plural independent entities acting as a team. The system accepts data representing a “map” and uses that portion including the objective location or direction, together with data about known features of the environment and the capabilities of the team entities. An initial coarse route is inputted. The data is processed by designation of one of the team members as the overwatcher, and the other as the bounder. The procedure includes the steps of determination of an area to which bounding is permitted, and pruning out those grid cells in that area which cannot be seen from the first overview location. For the remaining grid cells of the pruned set, a cost function is determined for each remaining grid location. The cost function takes into account the minimum cost to reach the cell under consideration from the current bounding entity location, together with a function which relates to how many other grid cells can be seen from the cell under consideration. When all relevant cells have been evaluated, the cell having the minimum value of the cost function is deemed to be the next overwatch location, and therefore the terminus of the first bounding operation.

Claims

1. A computer method for determining the routes of at least first and second entities, operating as a team, toward an objective location in a threat environment having topological features, said method comprising the steps of:

obtaining a data representation of the environment in a region including the present location of said first and second entities, and including a particular objective location in said environment, said data representation including any threats lying within said environment;

reading a selected initial coarse route through said environment;

obtaining data relating to some characteristics of said first and second entities;

designation of one of said first and second entities to be the bounding entity, and the other one of said first and second entities to be the overwatching entity;

determining the next overwatch location;

determining the route of said bounding entity to said next overwatch location;

commanding the movement of said bounding entity to said overwatch location;

if said overwatch location is not said objective location, redesignating said one of said first and second entities to be said bounding entity and the other one of said first and second entities to be the overwatch entity; and

repeating said steps of determining the next overwatch location, determining the route, commanding the movement, and redesignating until said objective location is reached.

2. A method according to claim 1, wherein said step of obtaining data relating to some characteristics of said first and second entities includes the obtaining of information relating to at least one of (a) the range of the communications devices with which said first and second entities are fitted and (b) the maximum effective range of their relevant respective weapons.