System and method for reuse of command and control software components

• US 20040007121A1
• Filed: 05/23/2003
• Published: 01/15/2004
• Est. Priority Date: 05/23/2002
• Status: Abandoned Application

• Current Assignee: Harris Corporation (L3Harris Technologies, Inc.)
• Original Assignee: Harris Corporation (L3Harris Technologies, Inc.)
• Inventors: Roy, Ronald, Graves, Kenneth P., Miller, Darius F.
• Application Number:
  US10/444,920
• Publication Number:
  US 20040007121A1
• Time in Patent Office: Days
• US Class Current: 89/1.11
• CPC Class Codes: F41G 3/04 for dispersing fire from a battery ; for controlling spread of shots; for coordinating fire from spaced weapons
• CPC Class Codes: F41G 9/00 Systems for controlling missiles or projectiles, not provided for elsewhere
• CPC Class Codes: G01C 21/20 Instruments for performing navigational calculations G01C21/24, G01C21/26 take precedence
• CPC Class Codes: G06Q 30/0283 Price estimation or determination

Abstract

A module combat command and control system is disclosed having a concrete layer and a plurality of abstracted layers. Various components can be interchangeably associated with the abstracted layers to form different applications, such as a terrain mapping application, a netted fires applications, and the like.

Claims

1. A travel planning method comprising:

defining areas to be traversed;

specifying terrain feature characteristics;

identifying terrain feature characteristics within the area to be traversed;

applying terrain feature mobility modifier values including rank, multiplier or a combination thereof to the terrain feature characteristics; and

calculating, based on the terrain feature mobility values, one or more of the following;

vehicle speed, travel time and travel distance.

2. The travel planning method of claim 1 further comprising:

performing a slope mobility analysis to determine relative mobility values of areas to be traversed; and

including the slope mobility values in the speed, time or distance calculations.

3. The travel planning method of claim 1 wherein calculating vehicle speed comprises:

specifying one or more vehicle speeds;

selecting a vehicle speed;

modifying the selected vehicle speed using the terrain feature mobility modifier values.

4. The travel planning method of claim 1 wherein calculating the travel time comprises:

specifying one or more vehicle speeds;

selecting a vehicle speed;

modifying the selected vehicle speed using the terrain feature mobility modifier values; and

dividing a distance to be traveled by the modified selected vehicle speed.

5. The travel planning method of claim 4 further comprising:

performing a slope mobility analysis to determine relative mobility values of areas; and

including the slope mobility values in the speed, time or distance calculations.

6. The travel planning method of claim 1 wherein calculating the travel distance comprises:

specifying one or more vehicle speeds;

selecting a vehicle speed;

modifying the selected vehicle speed by the terrain feature mobility modifier values; and

multiplying the modified vehicle speed by a time.

7. The travel planning method of claim 6 further comprising:

performing a slope mobility analysis to determine relative mobility values of areas; and

including the slope mobility values in the speed, time or distance calculations.

8. The travel planning method of claim 1 wherein at least a portion of the terrain feature characteristics are external to travel planning algorithms so they can be inputted/edited by a user.

9. The travel planning method of claim 1 wherein at least a portion of the vehicle characteristics are external to travel planning algorithms so they can be inputted/edited by a user.

32. The method of defining mobility cost factors of claim 2 further comprising:

dividing areas into cells;

calculating a path traverse time for each cell; and

determining a total path traverse time by summing the path traverse times of each cell.

46. The method of defining mobility cost factors of claim 1 further comprising:

generating a plurality of polygons, each associated with a particular mobility cost factor;

expanding each polygon from its edges toward adjacent polygons to form mobility corridors.

47. The method of defining mobility cost factors of claim 46 further comprising:

specifying requirements for corridor characteristics; and

eliminating any corridors not meeting the corridor requirements.

48. The method of defining mobility cost factors of claim 46 further comprising:

specifying a direction of travel.

10. A path traverse time calculation method comprising:

specifying vehicle characteristics;

defining areas to be traversed;

specifying terrain feature characteristics;

identifying terrain features within the area to be traversed;

applying terrain feature mobility modifier values to the terrain features; and

calculating path traverse time based on vehicle and terrain feature characteristics, modified by the mobility modifier values.

11. The path traverse time calculation method of claim 10 wherein the terrain feature mobility modifier values include rank, multiplier or a combination thereof.

12. The path traverse time calculation method of claim 10 wherein applying terrain feature mobility modifier values to the terrain features comprises:

assigning rankings to the terrain features based on their characteristics;

determining a dominant terrain feature among the identified terrain features by comparing terrain feature rankings; and

determining a mobility multiplier for the dominant terrain feature.

13. The path traverse time calculation method of claim 10 wherein one or more mobility modifier values are external to an algorithm comprising the path traverse time calculation method so they can be inputted/edited by a user.

14. The path traverse time calculation method of claim 10 further comprising:

dividing areas into cells;

calculating a path traverse time for each cell; and

determining a total path traverse time by summing the path traverse times of each cell.

15. The path traverse time calculation method of claim 10 wherein calculating path traverse time comprises:

assigning rankings to the terrain features based on their characteristics;

determining a dominant terrain feature among the identified terrain features by comparing terrain feature rankings

determining a mobility multiplier for the dominant terrain feature;

modifying a designated vehicle speed obtained from the specified vehicle characteristics by the mobility modifier; and

multiplying a distance by the modified vehicle speed to obtain a path traverse time.

16. The path traverse time calculation method of claim 10 wherein the vehicle characteristics are selected from the group consisting of width, road speed, cross country speed, ford depth.

17. The path traverse time calculation method of claim 10 wherein the terrain features are selected from the group consisting of road, river, trees.

18. The path traverse time calculation method of claim 17 wherein terrain features are ranked according to the relative speed at which they can be traversed.

19. The path traverse time calculation method of claim 10 wherein the terrain features include two or more features ranked in the following order:

20. A terrain categorization method comprising:

extracting elevation values from an elevation raster for an area;

calculating a slope for each area;

assigning a relative mobility value to each area based on the calculated slope;

generating a polygon to define each area; and

categorizing the areas defined by the polygons according to relative mobility based on the calculated slopes.

21. The terrain categorization method of claim 20 wherein generating polygons comprises:

expanding each polygon from its edges to absorb smaller areas into proximate larger areas; and

shrinking each polygon inwardly from its edges.

22. The terrain categorization method of claim 21 wherein the polygons are expanded by n iterations and shrunk by n−

2 iterations.

23. The terrain categorization method of claim 20 wherein a step algorithm is used to expand each polygon.

24. The terrain categorization method of claim 20 wherein each polygon is shrunk to approximately half the distance by which it was originally expanded.

25. The terrain categorization method of claim 20 wherein elevation values are extracted at geographical postings spaced apart in a range of about 30 meters to 100 meters.

26. A method of defining mobility cost factors comprising:

specifying terrain feature characteristics;

identifying terrain features within an area to be traversed;

modifying terrain feature characteristics by mobility modifier values;

performing a slope mobility analysis to determine relative mobility values of areas; and

creating mobility cost factors based on the modified terrain feature characteristics and the relative mobility values.

27. The method of defining mobility cost factors of claim 26 further comprising:

specifying vehicle characteristics; and

calculating path traverse time based on the vehicle characteristics and the mobility cost factors.

28. The method of defining mobility cost factors of claim 26 wherein the slope mobility analysis comprises:

extracting elevation values from an elevation raster for an area;

calculating a slope for each area;

assigning a relative mobility value to each area based on the calculated slope;

generating a polygon to define each area; and

categorizing the areas defined by the polygons according to relative mobility based on the calculated slopes.

29. The method of defining mobility cost factors of claim 26 further comprising:

expanding each polygon from its edges to absorb smaller areas into proximate larger areas; and

shrinking each polygon from its edges.

30. The method of defining mobility cost factors of claim 26 wherein the relative mobility values include passable or not passable.

31. The method of defining mobility cost factors of claim 26 wherein modifying terrain feature characteristics by mobility modifier values comprises:

specifying terrain feature characteristics; and

specifying terrain feature mobility modifier values including rank, multiplier or a combination thereof.

33. The method of defining mobility cost factors of claim 27 wherein calculating path traverse time comprises:

assigning rankings to terrain features;

determining a dominant terrain feature among the identified terrain features by comparing terrain feature rankings;

determining a mobility multiplier for the dominant terrain feature;

specifying vehicle characteristics;

modifying a designated vehicle speed obtained from the specidfied vehicle characteristics by the mobility modifier; and

multiplying a distance by the modified vehicle speed to obtain a path traverse time.

34. The method of defining mobility cost factors of claim 28 wherein a step algorithm is used to expand each polygon.

35. The method of defining mobility cost factors of claim 28 wherein each polygon is shrunk to approximately half the distance by which it was originally expanded.

36. The method of defining mobility cost factors of claim 28 wherein elevation values are extracted at geographical postings spaced apart in a range of about 30 meters to 100 meters.

37. The method of defining mobility cost factors of claim 27 further comprising:

specifying a travel time;

comparing the calculated path traverse time to the specified travel time, and if the specified travel time is greater than the calculated path traverse time, then repeating the time calculation process for one or more second areas adjacent to the first defined area;

adding the first calculated path traverse time separately to each of the second defined areas; and

repeating the process until the total time is approximately equal to the specified travel time, thereby determining the maximum distance of travel.

38. The method of defining mobility cost factors of claim 37 wherein the terrain characteristics are identified in an area extending to a distance approximately twice the maximum distance the vehicle can travel in a specified time.

39. The method of defining mobility cost factors of claim 37 wherein an eight-direction stepping algorithm is used to perform the calculation iterations.

40. The method of defining mobility cost factors of claim 37 wherein time summations containing retraversed areas are rejected.

41. The method of defining mobility cost factors of claim 37 wherein generating terrain characteristic mobility modifier values comprises one or both of the following:

performing a slope mobility analysis to determine relative mobility of areas; and

modifying terrain feature characteristics by mobility modifier values.

42. The method of defining mobility cost factors of claim 27 further comprising:

selecting a starting point and ending point;

calculating path traverse times for a plurality of paths from the starting point to the end point;

comparing the path traverse times calculated to one another; and

selecting the shortest path traverse time.

43. The method of defining mobility cost factors of claim 42 wherein calculating path traverse times for the plurality of paths comprises:

determining a center point of a line connecting the starting point to the end point;

generating mobility values for each cell along and to a specified distance from the line connecting the starting point to the end point;

generating paths through the cells;

calculating path traverse times by summing times to traverse each cell in a path.

44. The method of defining mobility cost factors of claim 43 wherein paths are obtained using an eight-direction step algorithm.

45. The method of defining mobility cost factors of claim 43 wherein the traverse times are calculated by creating paths simultaneously from the end point toward the starting point and from the starting point toward the end point until the two simultaneously created paths meet.

49. A method of determining visibility of a location from a vantage point comprising:

(a)specifying a vantage point A;

(b) specifying a point B of questionable visibility;

(c) moving an incremental distance along the ground from vantage point A toward point B to point A₁;

(d) calculating a slope of a line from vantage point A to point A₁;

(e) moving an incremental distance from point A₁ along the ground toward point B to point A₂;

(f) calculating a slope of a line from vantage point A to point A₂;

(g) save the greater of the slope of line AA₂ and the slope of line AA₁;

(h) repeat steps (c) through (g) until within a specified distance from point B;

(i) if the last saved slope is greater than the slope of a line from vantage point A to point B, then point B is not visible from vantage point A, and if the last saved slope is less than or equal to the slope of the line from vantage point A to point B, then point B is visible from point A.

50. The method of determining visibility of a location from a vantage point of claim 49 wherein the increments are in the range of about 20 meters to 40 meters.

51. A system for allowing networked processing of fire missions with fire control processes and automated utilities for processing of fire missions comprising:

automated weapon-target pairing processes which are capable of being integrated into an implementation framework during an operation of the system, the algorithms account for shared information about targets, available weapon systems, attack guidance, munitions effectiveness, target and weapon systems locations, attack angles, commander guidance on attack methods, logistics states, maintenance states, and munitions availability from databases available to the system.

52. The netted fire system according to claim 52, wherein the fire control processes are automatic processes whereby the current processing state of any fire mission within the system may be identified, observed, and modified from any computer in the system.

53. The netted fire system according to claim 52, wherein the weapon-target pairing processes are externally developed automated processes for determining whether it is safe to fire, or whether other constraints should prevent firing, can be integrated into an implementation framework of the netted fires component, such that firing can be blocked until the constraints or safety factors are no longer present or required.

54. The netted fire system according to claim 52, wherein users may select large numbers of individual targets for batch processing, automated assignment of weapon systems and munitions to targets, and automated firing of targets.

55. The netted fire system according to claim 52, wherein each component of the sytem has componentized functionality and is portability allowing the component to be removed from the implementation framework and inserted into other external implementation frameworks for reuse in fire control applications.

56. The netted fire system according to claim 52, further comprising processes that allow selection of large arrays of hostile targets for attack while filtering out friendly or other non-targetable entities, and processes which perform multi-target, multi-weapon system pairing in order to obtain optimal target-weapon system pairing for large target arrays.

57. The netted fire system according to claim 52, further comprising means for performing target assessment within CDAS, and comparison of target arrays against current attack guidance and means for providing advice to users for changing attack guidance when target array is not appropriate to current attack guidance.

58. The netted fire system according to claim 52, further comprising means for allowing users to specify weapon systems and munitions with which to attack different types of targets in the form of attack guidance.

59. Network bridge services supporting the communication between applications within a combat decision support system which provide the capability to share synchronized databases across a network comprising:

delivery of data in either peer-to-peer or client-server topology such that all data is duplicated on each system, the topology is dynamically modifiable during operation to reflect peer-to-peer or client-server operation.

60. The network bridge services of claim 59, wherein data is redisseminated to all new network clients, which prevents the loss of data and allows for full data restoration and consistency.

61. The network bridge services of claim 59, wherein the network is a self healing data network allowing synchronization of systems, and allowing any system to act as server for a synchronized database if a primary database server fails, whereby ensuring that no data is lost if a server fail;

the network serving as a serverless, peer-to-peer data sharing function.

62. The network bridge services of claim 59, further comprising a graphical database management system which allows creation, deletion, hiding, showing, loading, unloading, and sharing of databases with a single user action with a pointing device;

the databases being managed within an architecture backplane.

69. The network bridge services of claim 59, further comprising means for allowing a user to manage the activation, loading, unloading, and destruction of the components in the architecture component repository to cause the display and creation of all tabs, monitors, and toolbars within the architecture in order to create different applications using components.

63. A system allowing the ordering and display in sequence of orders assigned to any real or simulated unit in a combat decision support system, comprising:

means for deletion and interruption of orders;

means for use in conjunction with real world operations, or for direction of simulated units during course of action simulation;

means for sharing orders across systems such that orders are visible to all systems;

means for permitting point and click assignment of orders to subordinate units in real world or simulation of course of action; and

means for causing both a text message frag order and a graphic to be sent to the unit giving an order.

64. A reusable modeling and simulation system of a combat decision support system which is a reusable component within an architecture component repository, and which integrates into a extensibility framework thereof, comprising

at least one component being a collection of methods and local data stores that allow a user to produce a dynamic and interactive simulation of a tactical course of action for both red and blue forces, comprising

an engine which defines actors which can be either fully synthetic, partially synthetic, or which can act as an interface for a human operator, the engine including a capability to manage interactive orders simulation actors, and to perform attrition and ammunition consumption calculations for engagements during the simulation.

65. A reusable modeling and simulation system of claim 64, wherein the engine allows simulations and live exercises of command and control to be modeled simultaneously.

66. A reusable modeling and simulation system of claim 64, wherein the engine allows new simulation actor behaviors to added through a well-defined implementation interface.

67. A reusable modeling and simulation system of claim 64, wherein the engine allows dynamic assignment or reassignment of behavioral roles to an actor during the course of the simulation.

68. A reusable modeling and simulation system of claim 64, wherein current and pending orders or behaviors assigned to actors represented graphically.