Abstract: A system and method of coordinating team members, each team member having a mission processor, in real time for continued coordinated operation in the absence of reliable communications between team members. Prior to a mission, each team member is provided with common programs and data for a mission, the data including identity of programs and data supplied to other team members and providing to each team member a pseudo random seed for use in conjunction with random functions. Each team member is provided with an initial set of conditions, whereby each team member performs deterministically to generate a same plan for itself and each of the other team members. Each team member monitors for a transmission event and responds to a transmission event by generating a re-planning operation, whereby each team member will produce a coordinated replan for itself and each other team member, whereby the team members remain coordinated.

Abstract: A system and method for efficient intervisibility determination. The intervisibility determination method of the present invention provides a multiple threat processing capability within a specified area of terrain using a common database. Computation is simplified through the method of processing data posts in the terrain elevation database. By taking integer steps and incrementing distance, x or y, and a predicted elevation value at each step, a small number of operations may be performed. Recomputing a change in elevation value may be reduced. An umbra database provides an enhanced look-up capability for displaying and updating the intervisibility display information. The systems and methods of the present invention may be suitable for use on a vehicle and in mission management activities.

Abstract: A distributed data processing system and method are presented herein for purposes of controlling allocation of resources and task execution. The system includes a communication network that passes messages between computers connected to the network. A plurality of computers are connected to the network and run programs thereon including a central authority and at least first and second autonomous agents. The central authority generates a graph associated with each agent and wherein each graph represents for the associated agent what resources that agent has and what task or tasks that agent may perform. Each agent employs the associated graph to determine what resource or resources are needed by that agent to carry out the task of tasks to be performed by that agent. The agents negotiate with each other for the resources needed to carry out the task or tasks to be performed by the agents.

Abstract: A distributed data processing system employing negotiation among autonomous agents for allocation of resources is presented herein. The system includes a communications network for passing messages between computers connected thereto, a plurality of computers connected to the network for running programs thereon including at least first and second autonomous agents. Each agent receives a graph associated therewith and wherein the graph represents for the associated agent what resources that agent has and what task or tasks that agent may perform. Each agent employs the associated graph to determine what resource or resources are needed by that agent to carry out the task or tasks to be performed by that agent. The agents negotiate with each other for the resources needed to carry out the task or tasks to be performed by the agents.

Abstract: A distributed data processing system and method are presented herein for purposes of controlling allocation of resources and task execution. The system includes a communication network that passes messages between computers connected to the network. A plurality of computers are connected to the network and run programs thereon including a central authority and at least first and second autonomous agents. The central authority generates a graph associated with each agent and wherein each graph represents for the associated agent what resources that agent has and what task or tasks that agent may perform. Each agent employs the associated graph to determine what resource or resources are needed by that agent to carry out the task of tasks to be performed by that agent. The agents negotiate with each other for the resources needed to carry out the task or tasks to be performed by the agents.

Abstract: A distributed data processing system employing negotiation among autonomous agents for allocation of resources is presented herein. The system includes a communications network for passing messages between computers connected thereto, a plurality of computers connected to the network for running programs thereon including at least first and second autonomous agents. Each agent receives a graph associated therewith and wherein the graph represents for the associated agent what resources that agent has and what task or tasks that agent may perform. Each agent employs the associated graph to determine what resource or resources are needed by that agent to carry out the task or tasks to be performed by that agent. The agents negotiate with each other for the resources needed to carry out the task or tasks to be performed by the agents.