# Patent

## Title
System and method for demand driven network topology management

## Abstract

Methods, systems, and devices are disclosed to facilitate operation of a network. First network state data descriptive of a first network state is received. The first network data includes network demand associated with nodes of a dynamic network, where the nodes of the dynamic network include at least one movable node. The first network data also includes a node state of each node of the dynamic network. At least one first link is automatically established between two or more nodes of the dynamic network to satisfy at least a portion of the network demand. Link data is generated where the link data is descriptive of node utilization, the at least one first link, and assignment of the portion of the network demand to the at least one first link. One or more changes to the dynamic network are modeled based on the link data to identify a second network state, wherein the second network state satisfies a greater quantity of the network demand than the first network state.

## Background
RELATED CASE
The present application is a continuation-in-part of previously-filed U.S. patent application Ser. No. 12/494,089 for “APPLICATION OF POTENTIAL FIELD METHODS IN DIRECTING AGENTS,” filed on Jun. 29, 2009. The present application claims the filing date and priority of the previously-filed application.


FIELD OF THE DISCLOSURE
The present disclosure is generally related to demand-driven positioning of nodes and establishing of links in network topology management.
BACKGROUND
Agents or nodes that participate in performance of a task, whether the agents or nodes are autonomous devices or human-controlled devices relying on automated control systems, may seek to dynamically coordinate their movements and positions to aid in the collective performance of the task. There are myriad examples of systems in which agents manually coordinate their movements to act in harmony with a group of similarly-situated agents. To take just one example, in landing at commercial airports, pilots rely on instructions from air traffic control to provide a course that allows the aircraft to land while providing a reasonable safety margin between the aircraft and other aircraft in the same airspace.
The coordination task of landing the aircraft is complex. In coordinating the approach and landing of aircraft, what constitutes a reasonable safety margin may depend on the types of aircraft in the airspace and how the aerodynamics of each type of aircraft affects nearby aircraft. Changing atmospheric and visibility conditions affect what constitutes a safe margin between aircraft. Variance in numbers of aircraft entering the airspace and the approach vectors the aircraft use to enter the airspace constantly changes the conditions. As soon as a plan has been established for coordinating the approach landing of the aircraft, additional aircraft may enter the airspace and the added aircraft may change the prior plan. Furthermore, unexpected events may occur, such as a runway being closed, that would involve altering the original plan. Notwithstanding the coordination problems to be resolved, operators of all aircraft in the airspace desire landing as soon as possible to save fuel and to meet schedules so that cargo can be routed on time and so that passengers can make connections.
With coordinating the approach and landing of aircraft as just one example of the difficulty in coordinating complex group operations, it would be desirable to automate processes to coordinate movement of vehicles and analogous coordinated deployments. Furthermore, it would be desirable to identify a robust system for dynamically coordinating deployments and movements of a plurality of nodes in a manner that is reliable, adaptable, and capable of being distributed.
Another example of systems in which agents coordinate their movements to act in harmony with a group of similarly-situated agents is when the agents are nodes in a communication system. The nodes may be senders and receivers of transmissions or the nodes may be intermediate nodes that relay communications from one node to another. To service communications needs of the nodes in the network, it may be desirable to reposition the nodes to expand or otherwise change the coverage area. For example, if there is relatively high network demand between a particular group of nodes, it may be desirable to reposition the nodes to enable more direct communication between the group of nodes, such as by enabling direct point-to-point communications between the nodes or to enable communication between particular nodes with fewer intermediate nodes. In addition to repositioning the nodes, it may be desirable to establish or change links between nodes to service network demand.
SUMMARY
Embodiments disclosed herein include methods, apparatuses, and devices to facilitate operation of a network. The network includes a plurality of nodes, one or more of which are movable nodes. The position of the nodes is part of a continuous domain in which the one or more movable nodes may be repositioned to adjust network coverage to facilitate communications in the network. The network also includes a plurality of links established between the nodes. The plurality of links is part of a discrete domain. The plurality of links in the discrete domain may be established, broken, and re-established to, for example, reduce a number of intermediate links to make more efficient use of communications resources in the network. The links are established, broken, and re-established in response to an event or on an epochal basis. The repositioning of nodes and re-establishing of links facilitates changing the configuration of the network to provide optimal service and to efficiently utilize available resources.
In a particular illustrative embodiment, first network state data descriptive of a first network state is received. The first network data includes network demand associated with nodes of a dynamic network, where the nodes of the dynamic network include at least one movable node. The first network data also includes a node state of each node of the dynamic network. At least one first link is automatically established between two or more nodes of the dynamic network to satisfy at least a portion of the network demand. Link data is generated where the link data is descriptive of node utilization, the at least one first link, and assignment of the portion of the network demand to the at least one first link. One or more changes to the dynamic network are modeled based on the link data to identify a second network state, wherein the second network state satisfies a greater quantity of the network demand than the first network state.
In another particular illustrative embodiment, a system includes a plurality of nodes of a communication network. Each of the nodes is configured to receive and transmit signals and at least one of the plurality of nodes is a movable node. A link management system is configured to dynamically establish one or more communication links between at least a portion of the plurality of nodes to accommodate at least a first portion of network demand. A network topology modeling system is configured to determine a position of the movable node that supports establishing one or more second communication links to accommodate a second portion of the network demand where the second portion of the network demand is different than the first portion of the network demand.
In still another particular illustrative embodiment, a communication network node device includes a processor, a network interface coupled to the processor, and at least one memory accessible to the processor. The node device is a node of a dynamic network. The at least one memory includes instructions that are executable by the processor to cause the processor to receive first network state data descriptive of a first network state of the dynamic network. The first network state data includes network demand associated with nodes of the dynamic network and a node state of each node of the dynamic network. The instructions also cause the processor to interact with at least one other node of the dynamic network via the network interface. The instructions cause the processor to establish at least one link between nodes of the dynamic network to satisfy at least a portion of network demand of the dynamic network. The instructions also cause the processor to generate link data, wherein the link data is descriptive of node utilization, the at least one first link, and assignment of the portion of the network demand to the at least one first link. The instructions further cause the processor to execute at least a portion of a model of the dynamic network based on the link data. The model of the dynamic network models one or more changes to the dynamic network to identify a second network state, where the second network state satisfies more of the network demand than the first network state.
The features, functions, and advantages that have been described can be achieved independently in various embodiments or may be combined in yet other embodiments, further details of which are disclosed with reference to the following description and drawings.



BRIEF DESCRIPTION OF THE DRAWINGS
FIG. 1 is a diagram of a system of agents moving toward a specified goal as part of a shared operation;
FIGS. 2A and 2B are diagrams of the system of agents of FIG. 1 exhibiting desired end behaviors upon reaching the specified goal;
FIG. 3 is a diagram of a plurality of agents having operational characteristics represented by potential fields;
FIGS. 4A and 4B are diagrams of systems where the plurality of agents of FIG. 2 communicate information to allow for trajectories to be determined for each of the plurality of agents;
FIG. 5 is a diagram of the plurality of agents of FIG. 2 proceeding to a specified goal through a course including boundaries, terrain changes, atmospheric issues, and an obstacle;
FIG. 6 is a block diagram of a representative agent;
FIG. 7 is a diagram of an environment 700 in which potential fields result in operational conflict;
FIG. 8 shows a network enforcement field used to identify at least one communication path between each of a plurality of agents in a network of agents;
FIG. 9 shows a circle formation field used to align agents as a result of assigned potential fields;
FIG. 10 is a diagram of a system including different types of communication agents that may support a communication network;
FIGS. 11A and 11B show a system of communication nodes that are reconfigured to continue to provide communication coverage when a communication node fails;
FIGS. 12A and 12B show systems of aircraft in a defined airspace where the aircraft are repositioned when some of the aircraft are removed from the defined airspace;
FIGS. 13A-13B show systems of aircraft being repositioned in the defined airspace when a new aircraft enters the defined airspace;
FIG. 14 is a flow diagram of an illustrative embodiment of a method to coordinate a plurality of agents using potential field methods;
FIG. 15 is a flow diagram of an illustrative embodiment of a method to collect information from and disseminate information to a plurality of agents;
FIG. 16 is a flow diagram of an illustrative embodiment of a method to disseminate information to a plurality of agents;
FIG. 17 is a flow diagram of an illustrative embodiment of a method to collect information from a plurality of agents;
FIG. 18 is a flow diagram of an illustrative embodiment of a method to coordinate deployment of a plurality of communication nodes;
FIG. 19 is a flow diagram of an illustrative embodiment of a method to manage air traffic for a plurality of aircraft in a defined airspace;
FIG. 20 is a flow diagram of an illustrative embodiment of a method to coordinate movement of a plurality of vehicles;
FIGS. 21A and 21B are diagrams of positions of nodes in a continuous domain and of links between the nodes in a discrete domain, respectively;
FIGS. 22A and 22B are diagrams of links between nodes being changed in response to network demand;
FIGS. 23A and 23B are diagrams of nodes being repositioned in response to network demand;
FIGS. 24A and 24B are diagrams of exemplary movements of a node being made using perturbation analysis;
FIG. 25 is a flow diagram of an illustrative embodiment of a method to adapt a network state according to network demand;
FIG. 26 is a flow diagram of an illustrative embodiment of a method to configure a network using a network topology modeling system and a link management system;
FIG. 27 is a flow diagram of an illustrative embodiment of a method to position nodes according to the network topology modeling system of FIG. 26;
FIG. 28 is a flow diagram of an illustrative embodiment of a method to establish links between nodes according to the link management system of FIG. 26; and
FIG. 29 is a block diagram of a general purpose computer system operable to implement embodiments of computer-implemented methods and computer-executable program instructions in coordinating a plurality of agents in a shared operation.



DETAILED DESCRIPTION
According to illustrative embodiments of the present disclosure, a plurality of agents or nodes participating in a shared operation may be cooperatively moved or placed so as to satisfy specified constraints through the use of potential field methods. Potential field methods are used to model physical/virtual gravitational or magnetic fields by depicting how an object is affected by a plurality of forces to which the object is subjected. Potential fields may be created to model desired forces imputed to the nodes. For example, instead of using a potential field to model a magnetic force between two nodes, a potential field may be used to model a desired repulsion and a desired attraction to maintain the two nodes at a desirable communication distance where the nodes are neither too close together as to cause communication interference nor too far apart so that the nodes are beyond communication range of each other. By applying potential fields to model various constraints, such as communications parameters and object avoidance parameters, movement of each of a plurality of nodes may be calculated to control movement of the plurality of nodes as a group. Potential field methods involve relatively low computational overhead. Thus, nodes that communicate status information to each other can each compute desired trajectories for each of the nodes, and each of the nodes may honor each of the imposed constraints.
In addition, when the nodes are nodes of a communications system, the nodes may be deployed and communications links established between the nodes to enable efficient communications between the nodes. A communication link between nodes may be defined as a first node communicating directly with a second node, or the first node may communicate with the second node using links through one or more intermediate nodes. Position and movement of the nodes is considered to be a continuous domain. Establishment and change of links between the nodes is part of a discrete domain, wherein links are added or modified in response to an event or on a periodic, epochal basis. The topology of the network, in both the continuous domain and in the discrete domain, is demand-driven.
FIG. 1 is a diagram of a system 100 of a plurality of agents, Agent A 110, Agent B 120, and Agent C 130 moving toward a specified goal 140 as part of a shared operation. Constraints imposed on the agents are represented as potential fields 112, 122, 132. The potential fields 112, 122, 132, as described further below, are used to model constraints such as desired or maximum communication ranges, collision avoidance tolerances, and other constraints that may be imposed to preserve the agents 110, 120, 130, respectively, and to facilitate success of the shared operation. The potential fields 112, 122, 132 enable each of the agents 110, 120, 130 or an extrinsic system (not shown in FIG. 1) to compute trajectories 114, 124, and 134, respectively, for each of the agents 110, 120, 130 to reach the specified goal 140 while observing the constraints represented by the potential fields 112, 122, 132.
In this detailed description, the term trajectory is used to describe the dynamic course of an agent because a trajectory connotes time sequences of positions on a course through a potentially complex space. The space through which the trajectory passes may include a three-dimensional geometric space. Instead of or in addition to geometric space, the space may also include non-geometric parameters. For example, in the case of applying potential fields to directing the positioning or movement of communication nodes as described with reference to FIGS. 11A, 11B, and 18, the communication nodes may operate in geometrical spaces as well as non-geometric spaces of transmission power, battery life, and other non-geometric parameters. Thus, a trajectory of a communication node may include changing geometric coordinates, changing speed, and changing transmission power to cover a desired communication area subject to available power constraints.
FIGS. 2A and 2B are diagrams of the plurality of agents 110, 120, 130 of FIG. 1 exhibiting desired end behaviors upon reaching the specified goal 140. FIG. 2A shows an end behavior 200 wherein one or more of the agents 110, 120, 130 proceeds to the specified goal 140 and stops at the specified goal 140. FIG. 2A shows Agent A 110 having reached the specified goal 140 and parking at the specified goal 140. Alternatively, FIG. 2B shows an end behavior 250 wherein the plurality of agents 110, 120, and 130 may be directed to circle or orbit the specified goal 140. For example, if the shared operation is to monitor the specified goal 140, the agents 110, 120, 130 may be programmed or otherwise instructed to circle the specified goal 140. Stopping upon reaching the specified goal 140, as in FIG. 2A, and circling the specified goal 140, as in FIG. 2B, are only two potential forms of end behavior. For example, the agents 110, 120, 130 may be directed to position themselves equidistantly from each other in a circle around the specified goal and stop there to monitor or protect the specified goal 140. Other embodiments may conform to any other selected end behavior.
FIG. 3 is a diagram of a system 300 of the plurality of agents 110, 120, 130 having operational characteristics represented by potential fields defining minimum distances 316, 326, 336 (represented in FIG. 3 by dotted lines) and maximum distances 318, 328, 338 between agents 110, 120, 130 (represented in FIG. 3 by dashed lines). Potential fields may be used to model attractive forces and repulsive forces. Thus, potential fields may be used to cause nodes represented by the potential fields to attract each other so that the nodes 110, 120, 130 gravitate toward each other so that the nodes 110, 120, 130 will be within a maximum distance 318, 328, 338 of one another. At the same time, potential fields may be configured such that, at a predetermined distance, the nodes 110, 120, 130 repel each other so that they do not get too close together. In other words, potential fields may be configured such that the nodes 110, 120, 130 will remain apart from each other by a predetermined minimum distance 316, 326, 336, but not operate at more than a maximum distance 318, 328, 338.
The potential fields may establish minimum distances 316, 326, 336 and maximum distances 318, 328, 338 to model various constraints. For example, the minimum distances 316, 326, 336 and maximum distances 318, 328, 338 may model communication parameters by which the nodes 110, 120, 130 are within a specified maximum distance 318, 328, 338 to maintain communications with adjacent nodes. At the same time, the nodes 110, 120, 130 may be kept apart by a predetermined minimum distance 318, 328, 338 so that the nodes 110, 120, 130 are not so close together so as for communications systems to interfere with each other as may happen when transceivers are too close to one another at a given transmit power level.
As further explained below, constraints may be modeled for specified minimum distances 314, 324, 334 to provide a safety margin for collision avoidance to avoid others of the agents 110, 120, 130 or obstacles (not shown in FIG. 3). Unlike the minimum and maximum communication distances 316, 326, 336 and 318, 328, 338, respectively, the specified minimum distances for collision avoidance 314, 324, 334 may not have a countervailing specified maximum distance. In other words, for purposes of preventing aircraft from colliding or otherwise interfering with one another, there is specified minimum distance 314, 324, 334 that is imposed between aircraft, but there is no maximum specified distance between the aircraft that would create a safety problem. Thus, while potential fields for some constraints may have minima and maxima, some potential fields may have minima or maxima, but not both.
It should be noted that some constraints may automatically respect other constraints, which may simplify the overall modeling process. For example, with reference to FIG. 3, the minimum separation distance for collision avoidance 314, 324, 328 is larger than the minimum communication distance 316, 326, 336. Thus, for a system in which the agents 110, 120, 130 are aerial communication nodes that are in flight when they are supporting a communication network, honoring the minimum separation distance for collision avoidance 314, 324, 334 inherently maintains the smaller minimum communication distance 316, 326, 336 between communication nodes, so the minimum communication distance 316, 326, 336 may not be included in the application of potential fields. On the other hand, if the agents 110, 120, 130 are to support a communication network when the agents 110, 120, 130 are in motion or are stationary, when the agents 110, 120, 130 are stationary, the potential fields may address the minimum communication distance 316, 326, 336 when the minimum separation distance 314, 324, 334 is rendered moot because the agents 110, 120, 130 are stationary. Alternatively, the minimum separation distances for collision avoidance 314, 324, 334 may be less than the minimum distances for communications interference 316, 326, 336, such that the minimum separation distances for collision avoidance 314, 324, 328 are moot whenever the communications network is in operation. Furthermore, any potentially competing constraints may be prioritized to enable resolution of potential conflicts, as described further below.
Using potential fields to model constraints provides flexibility as compared to trying to fix the nodes 110, 120, 130 at fixed distances from each other. Specifying fixed distances may be difficult or unworkable in light of competing constraints. For example, if the nodes 110, 120, 130 are moving between boundaries (not shown in FIG. 3), collision avoidance constraints may drive the nodes 110, 120, 130 closer to each other to avoid the boundaries. To avoid collisions with the boundaries, the nodes 110, 120, 130 may be driven toward each other inside a minimum distance 116, 126, 136 established to avoid communications interference. Collision avoidance may be prioritized over avoiding communications interference to enable the nodes 110, 120, 130 to enable flexibility, for example, to protect the nodes 110, 120, 130 from collisions first, and then to adjust to prevent communications interference.
FIGS. 4A and 4B are diagrams of various embodiments of systems 400 and 450 where the plurality of agents 110, 120, 130 of FIG. 2 communicate information to allow for trajectories to be determined for each of the plurality of agents 110, 120, 130. FIG. 4A shows an embodiment of a system 400 in which the agents 110, 120, 130 are directed by a central control system 402. In the system 400, the agents 110, 120, 130 exchange telemetry 410, 420, 430, respectively, with the central control system 402. The telemetry 410, 420, 430 sent by each of the agents 110, 120, 130 provides information to the central control system 402 about the position of each of the agents and other operating conditions monitored by the agents 110, 120, 130. In turn, the central control system 402 re-computes potential fields for the agents 110, 120, 130 and directs the agents 110, 120, 130 to move to account for changes in the potential fields.
FIG. 4B shows another embodiment of a system 450 in which the agents 110, 120, 130 compute and maintain local archive databases 460, 470, 480, respectively, storing data regarding each of the agents 110, 120, 130. Given information about the goals of the shared operation for each of the agents 110, 120, 130 and parameters that determine the potential fields for each of the agents 110, 120, 130 in the local archive databases 460, 470, 480, each of the agents 110, 120, 130 can re-compute their own trajectories and those of the other agents 110, 120, and 130. By re-computing the trajectory for itself and the trajectories for others of the agents 110, 120, 130, each of the agents 110, 120, and 130 can re-compute potential fields for all of the agents 110, 120, and 130. As a result, each of the agents 110, 120, 130 can direct itself to observe the constraints of the potential fields for the system of agents 110, 120, 130.
In order to maintain local archive databases 460, 470, 480, the agents 110, 120, 130 may transmit updates to each other. Not every agent may directly communicate with all of the other agents 110, 120, 130, but each of the agents may communicate with each of the other agents 110, 120, 130 using one or more of the other agents as intermediaries. Each of the agents 110, 120, 130 may relay updates received from other agents. For purposes of the example of FIG. 4B, it is assumed that Agent B 120 is in communication range of Agent A 110 and Agent C 130, but that Agent A 110 and Agent C 130 are not in communication range of each other. Agent A 110 transmits an update 462 to Agent B 120 to update Agent B 120 and other agents on its position and to update other operating parameters. Agent B 120 transmits an update 472 to Agent A 110 and to Agent C 130. Agent B 120 also sends a relay 464 of the update 462 from Agent A 110 to Agent C 130. Agent C 130 sends an update 482 to Agent B 120 that Agent B 120 relays to Agent A 110 (not shown). Upon receiving updates 462, 464, 472, 482 from others of the agents 110, 120, 130, each of the agents 110, 120, 130 stores the information included in the updates 462, 464, 472, 482 in their respective local archive databases 460, 470, 480. Then, using the updated information stored in the local archive databases 460, 470, 480, the agents 110, 120, 130 may recalculate potential fields to control their operations to observe the constraints imposed on the system 450 of agents 110, 120, 130 modeled by the potential fields.
Two operational details should be noted about the systems 400 and 450. First, telemetry with a central control system 402 (FIG. 4A) and updates exchanged between agents 110, 120, 130 (FIG. 4B) are not transmitted continually. According to a particular illustrative embodiment, the agents 110, 120, 130 may be configured to transmit updates based on the occurrence of predetermined discrete events. For example, the agents 110, 120, 130 may be configured to transmit updates upon receiving updated data from another of the agents 110, 120, 130 when one of the other agents reports operational considerations potentially affecting dynamics or communication capabilities of the reporting agent, such as the reporting agent has malfunctioned or has encountered an external condition that it cannot overcome. An update may be sent after passage of a specified time interval. An update may be sent when a predetermined time has been reached. An update may be sent when an agent 110, 120, 130 has reached a predetermined position.
In addition, an update may be sent when one of the agents 110, 120, 130 identifies that a predetermined value of an external condition has been reached, such as a certain ambient temperature or that a certain altitude has been reached. An update may be sent when one of the agents 110, 120, 130 identifies that a predetermined value of an operational parameter has been reached, such as a certain communication signal strength condition. An update also may be sent upon receiving an extrinsic command from an external command source. This list of predetermined discrete events is illustrative, but not limiting. Other predetermined discrete events may result in the communication of updates between agents 110, 120, 130.
According to an illustrative embodiment, the predetermined discrete events may be dynamically re-determined. For example, when agents 110, 120, 130 are configured to send updates upon reaching a predetermined position, if conditions cause the agents 110, 120, 130 to progress more slowly than anticipated, the predetermined positions that trigger updates may be recomputed. Similarly, if communication signal strength parameters are less than anticipated, updates may be sent after the passage of shorter periods of time so that communications between agents 110, 120, 130 is maintained.
Second, according to a particular illustrative embodiment, the agents 110, 120, 130 may support two different communication systems. For example, if the agents 110, 120, 130 are communication nodes used to create a communication system, the agents 110, 120, 130 may maintain a first communication system used for communication of updates as described with reference to FIG. 4B. The first communication system used for updates may be separate from a second communication system that the agents 110, 120, 130 deploy for the benefit of other systems and users. Alternatively, the agents 110, 120, 130 may support only a single network. Using a single network, the agents 110, 120, 130 transmit updates to other agents using packets that are sent between packets of other data carried across the network formed by the agents 110, 120, 130.
FIG. 5 a diagram of an environment 500 in which a plurality of agents proceed to a specified goal 140 through a course including boundaries 520, 522, terrain changes 530, atmospheric issues 540, and one or more obstacles 550. As previously described, the agents 110, 120, 130 may be tasked with moving toward a specified goal 140. As described with reference to FIGS. 2A-2B, the agents 110, 120, 130 may stop upon reaching the goal 140, may circle the goal 140, or engage in another form of end behavior. The agents 110, 120, 130 may act based on transmissions 502 from an external control source 402 as described with reference to FIG. 4A or the agents 110, 120, 130 may act autonomously as described with reference to FIG. 4B. Alternatively, the agents 110, 120, 130 may act autonomously but may be programmed by the external control source 402 and be subject to changed instructions sent via transmissions 502 from the external control source 402 that may change constraints reflected in the potential fields, change the specified goal 140, abort the shared operation, or change other parameters.
In the process of reaching the specified goal 140, the agents 110, 120, 130 may encounter and have to adjust for unforeseen or changing conditions to observe the constraints modeled by assigned potential fields. The agents 110, 120, 130 may have to navigate between boundaries 520, 522 that may force the agents 110, 120, 130 to adjust their courses to avoid collisions with the boundaries 520, 522 or with others of the agents 110, 120, 130. The agents 110, 120, 130 also may have to adapt for terrain changes 530 that impede or possibly aid the movement of the agents 110, 120, 130. The terrain changes 530 may represent changes in ground-based terrain, underwater terrain, or conditions caused by changing atmospheric layers. Terrain changes 530 that affect movement of the agents may, for example, require the agents to change course to avoid some terrains or to adjust the velocities or trajectories of the agents 110, 120, 130 to maintain communications while navigating through the terrain changes 530. The agents 110, 120, 130 may have to adjust for atmospheric issues 540, such as wind, current, or other changes. Gusting winds or shifting currents may involve an increased minimum collision avoidance range or possibly may reduce a maximum communications range that affects computation of the potential fields.
The agents 110, 120, 130 also may adjust for the presence of one or more obstacles, such as obstacle 550. The obstacle 550 may include any type of object that may interfere with operation of, movement of, or communications between the agents 110, 120, 130. For example, the obstacle 550 may include a physical object, such as an outcropping of rock or a body of vegetation. The obstacle 550 also may include an electromagnetic field source that might interfere with the operation of or communications between the agents 110, 120, 130. The obstacle 550 also may include a thermal source, such as a vent or a spring that might adversely affect an operating temperature of the agents 110, 120, 130. In any case, the agents 110, 120, 130 may have to adjust for the presence of obstacles to observe the constraints represented by assigned potential fields.
FIG. 6 is a block diagram of a representative agent 600. The agent 600 may be a self-deploying robotic agent or the agent 600 may be a system that provides direction to a human operator. The agent 600 includes a control system 620 that, for example, may include a general purpose computing system as described with reference to FIG. 21 adapted for controlling the agent 600. Alternatively, the control system 620 also may include a special purpose computing system adapted for controlling the agent 600. The control system 620 may support a memory 630 or other storage configured to maintain operating instructions for the agent 600, such as the specified goal of the shared operation, the constraints to be modeled by assigned potential fields, and operating programming. The memory 630 also may be used to store instructions received from an external control source 402 (FIGS. 4A and 5) or updates from others of the agents 110, 120, 130 (FIG. 4B).
According to particular embodiments, the agent 600 may support one or more communication systems 640 and 650. As previously described with reference to FIG. 4B, a group of agents may maintain one communication system, such as an agent communication system 640 that is used to communicate with other agents and with an external control source 402. When the agent 600 is to serve as a node in a communications network, the agent 600 also may include a network communication system 650 that is used to support communication between devices and users of the network deployed through the use of the agent 600. Alternatively, as also previously described with reference to FIG. 4B, the agent 600 may maintain a single communication system that is used for both control communications between agents and to conduct communications between external devices and users.
According to a particular embodiment, the agent 600 may support one or more sensors 660. The sensors 660 may be used to monitor the operation of the agent 600, for example, to monitor the power reserves and operating parameters of the agent 600, to monitor external conditions that identify boundaries 520, 522, terrain changes 530, atmospheric issues 540, and obstacles 550 (FIG. 5). The sensors 660 also may monitor communication conditions that may affect the communication systems 640 or 650, or communication conditions may be monitored by the communication systems 640 and 650 themselves.
The agent 600 also may include a propulsion system 670. The agent 600 may be a ground-based agent that includes a ground-based propulsion system. Alternatively, the agent 600 may be configured to operate in water or may be configured to fly over a surface. The agent 600 may include any type of propulsion system configured to move the agent 600 over a trajectory or to allow the agent 600 to hover or float in a predetermined location. Alternatively, the agent 600 may not include a propulsion system. The agent 600 may be a stationary agent, such as a fixed communications relay station or communications buoy that, once deployed, remains in place. It will be appreciated that even if the agent 600 is stationary, the agent 600 still may use potential fields and communicate with other agents with regard to parameters that affect the potential fields for the agents in the group. For example, a stationary agent may communicate with other agents regarding separation constraints so that a group of agents observes the constraints modeled by the assigned potential fields. As another example, a stationary agent may also communicate with other agents regarding parameters that affect parameters that do not involve motion or physical position, but that affect other operational functions, such as communication signal strength and communication directionality such as achieved with phased array antennae. Thus, application of potential fields is applicable to both moving and stationary agents.
The illustrative operation of the potential fields will be described in detail. In coordinating the behavior of a plurality of agents, which may include a plurality of communication nodes, a plurality of aircraft, a plurality of agents, etc., potential field methods are employed. In implementing potential field methods, a dynamic model is assigned to the group. For example, the vector of generalized coordinates for the two-dimension positions of n agents may be given by Eq. (1):

p=p1x,p1y,p2x,p2y, . . . ,pnx,pny  (1)

To apply field potentials to the agents, a dynamic model characterizing behavior of the plurality of agents is assigned, where the dynamic model may be given by Eq. (2):

M{umlaut over (p)}=Γ  (2)

In Eq. (2), Γ is a 2n dimension vector of generalized forces applied to the group, M multi-agent group 2n×2n diagonal matrix of agent masses, and {umlaut over (p)} is the 2n vector of agent accelerations. The model of Eq. (2) enables agents to be treated as physical objects subject to generalized forces. The generalized forces may be translated into trajectories by numerical integration as given by Eq. (3):




  
    
      
        
          
            
              
                
                  p
                   ̈
                
                des
              
              =
              
                
                  M
                  
                    -
                    1
                  
                
                ⁢
                Γ
              
            
          
        
        
          
            
              
                
                  p
                  .
                
                des
              
              =
              
                
                  
                    p
                    .
                  
                  0
                
                +
                
                  
                    ∫
                    0
                    
                      Δ
                      ⁢
                      
                        
                      
                      ⁢
                      t
                    
                  
                  ⁢
                  
                    
                      
                        p
                         ̈
                      
                      des
                    
                    ⁢
                    
                      
                    
                    ⁢
                    
                      d
                      τ
                    
                  
                
              
            
          
        
        
          
            
              
                p
                des
              
              =
              
                
                  p
                  0
                
                +
                
                  
                    ∫
                    0
                    
                      Δ
                      ⁢
                      
                        
                      
                      ⁢
                      t
                    
                  
                  ⁢
                  
                    
                      
                        
                          p
                          .
                        
                        des
                      
                      ⁢
                      
                        
                      
                      (
                      τ
                      )
                    
                    ⁢
                    
                      d
                      τ
                    
                  
                
              
            
          
        
      
    
    
      
        (
        3
        )
      
    
  




In Eq. (3), po and {dot over (p)}o represent the current generalized position and velocity trajectories, respectively, and pdes, {dot over (p)}des, and {umlaut over (p)} des represent the estimated output trajectories or output trajectories of the agents.
A task criterion in the framework defines a function from 2n agent coordinates to m task coordinates. The task coordinates are chosen to represent functional quantities as part of the desired action. An m dimensional task with coordinates is represented as given by Eq. (4):

xx1,x2, . . . xm  (4)

In Eq. (4), each set of coordinates xn is defined as a transformation T on a position p, i.e., x=T[p].
A differential representation involving a group-wide Jacobian transformation of task coordinates, i.e., J=∂x/∂p, is associated to create task forces derived from the potential field and apply them on the agent actuators. Based on the principle of virtual work, forces that produce work in systems in motion may be translated into generalized forces using a duality given by Eq. (5):

Γ=JTF  (5)

In Eq. (5), F is a control force that may be used to optimize gradient descent policy.
Potential fields, as applied in a particular illustrative embodiment, are defined as quadratic functions such as given by Eq. (6):




  
    
      
        
          V
          criterion
        
        ⁢
        
          =
          △
        
        ⁢
        
          
            
            
              x
              -
              
                x
                des
              
            
            
          
          2
        
      
    
    
      
        (
        6
        )
      
    
  




An objective is to develop control policies that minimize the potential field and thus satisfy the previously established criteria. To that end, the criteria x are related to the forces F associated with the potentials by developing a dynamic model of task behavior. Left-multiplying Eq. (2) by JM−i yields {dot over (J)}{dot over (p)}=JM−iΓ. Using Eq. (5) yields the dynamic equation given by Eq. (7):

Λ{umlaut over (x)}+μ=F  (7)

In Eq. (7), Λ(JM−iJT)−i may be used as a mass/inertial factor and μJ{dot over (p)} so as to be analogous to a Coriolis/centrifugal velocity. In view of Eq. (7), the choice of the control policy F enables the ability to instantaneously guide the task toward a specified goal.
According to a particular embodiment, {umlaut over (x)} may be controlled to achieve the goal established by the potential field. Combining Eq. (5) and Eq. (7), the control equation is given by Eq. (8):

Γ=JT(ΛF*+μ)  (8)

In Eq. (8), F* is a desired control law that implements the potential field. Thus, a resulting linear feedback control is given by Eq. (9):

{umlaut over (x)}=F*  (9)

To cause the task field to converge, proportional derivative control laws are achieved by performing a closed-form gradient descent on the potential field.
To combine multiple objectives, K independent fields are defined where each field characterizes a simple stand-alone goal.
According to a particular illustrative embodiment, a prioritized architecture is used in which multidimensional systems address redundancy by imposing priorities between the control fields.
According to a particular embodiment, groups of agents, including agents or other agents, are treated as multi-dimensional systems. The prioritized architecture is used to resolve the multi-agent problem. Priorities are used as a mechanism to temporarily override certain non-critical fields in order to fulfill critical constraints. In this approach, fields are ordered according to their relative importance in the safe and successful accomplishment of the instantaneous actions. This methodology may be used to solve the problem of coordinating large numbers of agents. By designing behaviors that assign high priority to geographical and network enforcement fields, these may be satisfied while accomplishing the mission goals.
To establish priorities between fields, a prioritized control structure may be defined as given by Eq. (10):




  
    
      
        Γ
        =
        
          
            
              Γ
              1
            
            +
            
              Γ
              
                2
                |
                1
              
            
            +
            
              Γ
              
                3
                ⁢
                
                  
                  2
                  
                
                ⁢
                1
              
            
            +
            ⋯
            +
            
              Γ
              
                P
                K
              
            
          
          =
          
            
              ∑
              
                j
                =
                1
              
              K
            
            ⁢
            
              
            
            ⁢
            
              Γ
              
                P
                j
              
            
          
        
      
    
    
      
        (
        10
        )
      
    
  




In Eq. (10), the piped notation i|j| indicates a prioritized ordering from left to right. Also in Eq. (10), Pj{j|j−1| . . . |1} is the prioritized ordering of the jth priority level, and ΓPj represents the projection of the generalized forces of the jth field onto a null space of higher priority fields. The control structure for a given field is given by Eq. (11) where the value of JPj is given by Eq. (12):




  
    
      
        
          Γ
          Pj
        
        ⁢
        
          =
          △
        
        ⁢
        
          
            J
            Pj
            T
          
          ⁢
          
            F
            Pj
          
        
      
    
    
      
        (
        11
        )
      
    
  








  
    
      
        
          J
          Pj
        
        ⁢
        
          =
          △
        
        ⁢
        
          
            J
            j
          
          ⁢
          
            N
            Pj
          
        
      
    
    
      
        (
        12
        )
      
    
  




JPj is the prioritized Jacobian of the jth field and NPj is the prioritized null-space associated with all higher priority fields.
To demonstrate that Eq. (11) provides desired decoupling behavior, the dynamic equation of each field is determined and their mutual coupling is studied. Similar to the manipulation of Eq. (7), left-multiplying Eq. (2) by JPjM−1 yields the dynamic equation given by Eq. (13):

{umlaut over (x)}Pj−JPjhj=JPjM−1Γ  (13)

To design controllers that optimize the gradient descent of the potential fields, control structures are chosen of the form of Eq. (14) where the value of ΛPj is given by Eq. (15):




  
    
      
        
          Γ
          Pj
        
        =
        
          
            J
            Pj
            T
          
          ⁡
          
            (
            
              
                
                  Λ
                  Pj
                
                ⁢
                
                  F
                  Pj
                  *
                
              
              +
              
                μ
                Pj
              
              -
              
                
                  Λ
                  Pj
                
                ⁢
                
                  J
                  Pj
                
                ⁢
                
                  M
                  
                    -
                    1
                  
                
                ⁢
                
                  
                    ∑
                    
                      l
                      =
                      1
                    
                    
                      j
                      -
                      1
                    
                  
                  ⁢
                  
                    
                  
                  ⁢
                  
                    Γ
                    Pi
                  
                
              
            
            )
          
        
      
    
    
      
        (
        14
        )
      
    
  








  
    
      
        
          Λ
          Pj
        
        ⁢
        
          =
          △
        
        ⁢
        
          
            (
            
              
                J
                Pj
              
              ⁢
              
                M
                
                  -
                  1
                
              
              ⁢
              
                J
                Pj
                T
              
            
            )
          
          +
        
      
    
    
      
        (
        15
        )
      
    
  




ΛPj is a prioritized mass matrix. (.)+ represents the Moore-Penrose pseudoinverse, and μPj is a prioritized Coriolis/centrifugal factor.
Substituting Eq. (14) into Eq. (13) via Eq. (10), a decoupled set of linear behaviors is obtained, as given by Eq. (16):




  
    
      
        
          ∀
          j
        
        ⁢
        
          ,
          
            
              
                x
                 ̈
              
              Pj
            
            =
            
              F
              Pj
              *
            
          
        
      
    
    
      
        (
        16
        )
      
    
  




The decoupled set of linear behaviors is used to implement feedback controllers that optimize the desired gradient descent policies for the objectives.
The derived behaviors are workable when all of the agents, whose situation is represented by one of the potential fields, can reach their goals. Allowances may have to be made when two or more fields have conflicting goals.
FIG. 7 is a diagram of an environment 700 in which potential fields result in operational conflict. For example, a field imposing network separation constraints can conflict with a field that attracts agents 710 to a geometric centroid 720, as illustrated in FIG. 7. In such a case, ordinarily a higher control priority would be assigned to the network constraint because the network constraint guarantees communication at all times. During conflicting scenarios, higher priority fields leave too few degrees of freedom available for the full execution of low priority fields, and the low priority fields are considered only partially feasible. In the representation given in Eq. (12), this situation occurs if the null-space matrix NPj does not span the lower priority field coordinates represented by Ji. In turn, a prioritized Jacobian JPj becomes ill conditioned causing the mass matrix given in Eq. (15) to become singular.
The singular value decomposition of the term of the prioritized mass matrix of Eq. (15) is given by Eq. (17):




  
    
      
        
          
            J
            Pj
          
          ⁢
          
            M
            
              -
              1
            
          
          ⁢
          
            J
            Pj
            T
          
        
        =
        
          
            
              [
              
                
                  U
                  r
                
                ⁢
                
                  
                
                ⁢
                
                  U
                  n
                
              
              ]
            
            ⁡
            
              [
              
                
                  
                    
                      Σ
                      r
                    
                  
                  
                    0
                  
                
                
                  
                    0
                  
                  
                    0
                  
                
              
              ]
            
          
          ⁡
          
            [
            
              
                
                  
                    U
                    r
                    T
                  
                
              
              
                
                  
                    U
                    n
                    T
                  
                
              
            
            ]
          
        
      
    
    
      
        (
        17
        )
      
    
  




In Eq. (17), Ur and Un are eigenvectors that span rank and null kernels and Σr are non-zero eigenvalues. Substituting the result of Eq. (17) into Eq. (15) reduces the value of ΛPj as given by Eq. (18):




  
    
      
        
          Λ
          Pj
        
        =
        
          
            U
            r
          
          ⁢
          
            Σ
            r
            
              -
              1
            
          
          ⁢
          
            U
            r
            T
          
        
      
    
    
      
        (
        18
        )
      
    
  




Combining Eq. (14) with Eq. (13) by means of Eq. (10) yields a set of partially controlled dimensions given by Eq. (19):




  
    
      
        
          U
          r
          T
        
        ⁡
        
          (
          
            
              
                x
                 ̈
              
              Pj
            
            =
            
              F
              Pj
              *
            
          
          )
        
      
    
    
      
        (
        19
        )
      
    
  




Because Ur corresponds to the rank eigenspace, Eq. (19) achieves a linear mapping within the controllable directions. As a result, the potential field acts in the subspace of Ur descending the gradient optimally until it reaches the minimum energy within that space.
According to a particular embodiment, action primitives are used to encapsulate multiple criteria for executing meaningful group behaviors. An action primitive defines a complete ordering in which more critical objectives take precedence over less important objectives. The criteria are represented by reactive control fields with three types of parameters, including coordinates, goals, and control policies.
For example, one potential action primitive is an “exploration primitive” used to coordinate an exploration mission in a complex geographical environment. Table (1) lists six criteria incorporated in the exploration primitive that characterize the design specifications for the exploration example:











TABLE 1







Control Field
Coordinates
Priority









Obstacle Avoidance
Distance to obstacles
1



Network Topology
Distance between agents
2



Network Graph
Distance between clusters
3



Goal Pursuit
Distance from centroid to goal
4



Formation
Formation coordinates
5



Friction
Generalized coordinates
6










According to a particular illustrative embodiment, the fields to which the highest priorities are assigned concern preserving the group and maintaining network connectivity. Thus, as indicated in Table (1), the highest priorities are assigned to Obstacle Avoidance, Network Topology, and Network Graph. Succeeding in reaching an ultimate object, represented by the Goal Pursuit field, is assigned a next highest priority. A simple criterion for controlling the group's centroid will naturally result in agent distributions that comply with network and geographical constraints. After the Goal Pursuit field, a next to last priority is assigned to a Formation field that optimizes geometry of a formation of agents by monitoring and managing residual redundancy of the agents. A lowest priority in the present example is assigned to a Friction field that is used to dampen uncontrolled modes. The fields are explained in more detail below.
The Obstacle Avoidance field is directed to ensuring that agents react to geometric constraints in the terrain or other environment that the agents confront. The coordinates defining the Obstacle Avoidance field are represented as given by Eq. (20):

x=[ . . . dij . . . ]  (20)

A distance from an agent i to a perimeter of an obstacle (obs) is represented as given by Eq. (21):




  
    
      
        
          d
          
            i
            ,
            obs
          
        
        ⁢
        
          =
          △
        
        ⁢
        
          
          
            
              p
              i
            
            -
            
              p
              
                obs
                ,
                i
              
            
          
          
        
      
    
    
      
        (
        21
        )
      
    
  




The Obstacle Avoidance field operates on the principle of repulsion effected by repulsion goals represented as given by Eq. (22):

dij,des=ri+daway  (22)

In Eq. (22), ddes is a desired distance for a center of the agent i to be from the obstacle where ri is the radius of the agent i and daway is a predetermined safe distance for the agent to be from the perimeter of the obstacle. To control the Obstacle Avoidance field effectively, an activation threshold dclose is set to specify when agents are too close to the obstacle such that daway>dclose. Causing the agent to remain beyond the activation threshold dclose prevents agents from permanently bonding the agent to the obstacle.
One way to position the agent i away from the obstacle is to cause the agent to be repelled in a direction of a distance vector between the agent and the obstacle. Another preferable approach is to add a tangential component to the avoidance field in the direction of the flow toward a goal such that the agent is repulsed away from the obstacle along a course that will drive the agent toward its intended goal.
The Network Topological field prevents agents from violating proximity conditions that result in communication interference between agents. The Network Topological field applies repulsion forces between pairs of agents within a specified proximity of one another. An activation threshold for the Network Topological field is defined based on network communication specifications, which may vary for different agents. A repulsion goal is imposed on every pair of agents within a specified range of one another.
Coordinates defining the Network Topological field are given by Eq. (23):

x=[ . . . dij . . . ]  (23)

Eq. (23) is similar to Eq. (20) for the Obstacle Avoidance field except that, instead of representing a distance to an obstacle, dij, represents distances between close pairs of agents, as given by Eq. (24):




  
    
      
        
          d
          ij
        
        ⁢
        
          =
          △
        
        ⁢
        
          
          
            
              p
              i
            
            -
            
              p
              j
            
          
          
        
      
    
    
      
        (
        24
        )
      
    
  




The Network Topological field operates on the principle of repulsion between agents with repulsion goals given by Eq. (24):

dij,des=ri+rj+dpush  (25)

In Eq. (25), ri and rj are the radii of the agents in the pair of agents to be repulsed from each other and dpush is a predetermined distance between the agents that will enable communications between the agents free of effects of being too close to each other. To control the Network Topological field effectively, dpush>dinterference, where dinterference is the threshold that determines when a pair of agents is too close such that interference would result from the proximity of the two agents.
The Network Connected Graph field imposes a condition that there be at least one path of communication links between any two agents in the network.
FIG. 8 shows a network enforcement field 800 used to ensure the existence of at least one communications path between each of a plurality of agents in a network of agents 810. According to one embodiment, a communication network of agents is represented using an undirected, weighted graph. A communication threshold, drange, is defined to monitor when agents are nearing the limits of communication range 820. A predetermined, desired optimal communication distance between neighboring agents, doptimal, is established. Each agent 810 in the Network Connected Graph field represents a cluster of agents that form a connected sub-network with communication links no greater than drange. Between each pair of agents, an edge is created with a weight equal to the distance between neighbors. The goal is to attract the agents to each other so that none of the edges between the agents exceed drange. A minimum spanning tree (MST) algorithm is applied to the Network Connected Graph to minimize a length of a longest edge. In minimizing the length of the longest edge, the MST assures that the entire group of agents is reconfigured in a minimal time.
A Network Connected Graph field is defined that imposes attraction forces between each of the agents. The Network Connected Graph field includes coordinates for each pair of agents that are joined in the MST. For each pair of attracted agents, i and j, dij represents a distance between the agents. The coordinates of agents in the Network Connected Graph field is given by Eq. (26):

x=[ . . . dij . . . ]  (26)

The distance between agents dij also may be represented as given by Eq. (27):




  
    
      
        
          d
          ij
        
        ⁢
        
          =
          △
        
        ⁢
        
          
          
            
              p
              
                i
                *
              
            
            -
            
              p
              
                j
                *
              
            
          
          
        
      
    
    
      
        (
        27
        )
      
    
  




In Eq. (27), dij represents the distance between the closest pair of agents i* and j* in each agent. The field operates based on the principle of attraction with attraction goals as given by Eq. (28):

dij,des=doptimal  (28)

When the agents exceed drange, the Network Connected Graph field becomes active so as to cause the agents to attract each other before a breach opens in communication ranges that would sever any of the paths between agents.
A Goal Pursuit field is used to maneuver a group of agents around the terrain or other geography of the zone in which the agents operate. The Goal Pursuit field uses only a single coordinate x to represent the distance from the group's geometric centroid, where a desired distance to the geometric centroid is pgoal. The coordinate defining the field is given by Eq. (29):




  
    
      
        x
        =
        
          
          
            
              p
              cog
            
            -
            
              p
              goal
            
          
          
        
      
    
    
      
        (
        29
        )
      
    
  




The field operates on a principle of attraction with an attraction goal xdes given by Eq. (30):

xdes=0  (30)

As the desired centroid represented by the Goal Pursuit field is moved, the constraint fields provide that the group locally adapts to geometric and network changes.
A Formation field is used to distribute agents in geometric topologies. A principle underlying the Formation field is to enhance group performance measured according to a specified metric. For example, to maximize the area swept in an exploration mission, a circle formation field may be used.
FIG. 9 shows a circle formation field 900 used to align agents 910 as a result of assigned potential fields. Using the circle formation field 900 uniformly distributes agents 910 around a geometric centroid 920 of the agents 910 where the agents 910 surround the geometric centroid 920 at a maximum possible radius. The coordinates defining the Formation field are given by Eq. (31):

x=[ . . . ∥pi−pcircle,i∥ . . . ]  (31)

In




  
    
      
        
          
            p
            
              circle
              ,
              
                
              
              ⁢
              i
            
          
          =
          
            
              p
              cog
            
            +
            
              
                y
                circle
              
              ⁡
              
                [
                
                  cos
                  ⁢
                  
                    i
                    
                      2
                      ⁢
                      
                        
                      
                      ⁢
                      πn
                    
                  
                  ⁢
                  sin
                  ⁢
                  
                    i
                    
                      2
                      ⁢
                      
                        
                      
                      ⁢
                      πn
                    
                  
                
                ]
              
            
          
        
        ,
      
    
    
      
        Eq
        .
        
          
        
        ⁢
        
          (
          31
          )
        
      
    
  




is chosen such that each agent positions itself to a closest point on the circumference. A value of γcircle may be computed offline based on a number of agents participating in the shared operation and optimal network ranges between agents. The Formation field operates on a principle of attraction where the attraction goal is given by Eq. (32):

xi,des=0  (32)

The Friction field is designed to dampen uncontrolled modes. Coordinates defining the Friction field are the generalized agent coordinates given by Eq. (33):

x=[p1,x p1,y . . . pn,x pn,y]  (33)

An object of the Friction field is to minimize the uncontrolled movement of the agents while pursuing higher priority objectives. The Friction field operates on the velocities {dot over (x)} by imposing a damped behavior given by Eq. (34):

{dot over (p)}i,des=0  (34)

Eq. (34) causes each agent to decrease velocity in any uncontrolled directions.
FIG. 10 is a diagram of a system 1000 including different types of communication agents 1010, 1020, 1030, 1040 that may support a communication network. The system 1000 may include one or more ground-based communication agents 1010. The ground-based communication agent 1010 may be a stationary agent that remains in a single position on the ground 1012 or the ground-based communication agent 1010 may be a mobile agent that moves over the ground 1012. The system 1000 may include one or more air-based communication agents 1020 that move through or hover in the air 1022 or another atmosphere. The system 1000 also may include one or more water-based communication agents 1030, 1040 that operate on or in water or another fluid. The system 1000 includes a water-based communication agent 1030 that operates on a surface 1034 of the water 1032 and a water-based communication agent 1040 that operates beneath the surface 1034 of the water 1032. The water-based communication agents 1030, 1040 may include stationary buoys or agents that are capable of movement over or through the water 1032. The system 1000 may use any or all of these agents 1010, 1020, 1030, 1040 to create a communications network that spans an area over ground 1012 and water 1032. The system 1000 may enable communication between stations and vehicles based on the ground 1012, vehicles in the air 1022, or stations or vehicles above the surface 1034 or under the surface 1034 of the water 1032.
FIGS. 11A and 11B show systems 1100, 1150 of communication nodes 1110, 1120, 1130, 1140 in which the communication nodes 1110, 1120, 1140 are reconfigured to continue to provide communication coverage when a communication node 1130 fails. Each of the communication nodes 1110, 1120, 1130, 1140 may be stationary or mobile nodes, as described with reference to FIG. 10. The mobile communication nodes may include self-deploying robotic agents configured to move themselves to a desired location to facilitate proliferation of a communication network supported by the plurality of communication nodes. Each of the communication nodes 1110, 1120, 1130, 1140 has a maximum communication range 1112, 1122, 1132, 1142 (minimum distances to prevent interference are not shown in FIGS. 11A and 11B). The communication nodes 1110, 1120, 1130, 1140 are positioned so that the maximum communication ranges 1112, 1122, 1132, 1142 of each of the communications nodes 1110, 1120, 1130, 1140 overlaps with at least one other maximum communication range of nodes 1110, 1120, 1130, 1140 to ensure a communication link between each of the communication nodes 1110, 1120, 1130, 1140.
As shown in FIG. 11A, Node 3 1130 has failed or reports an imminent failure (represented by an “X” 1134). Potential fields representing the communication ranges of the remaining nodes 1110, 1120, 1140 are recomputed upon realizing or assuming the failure of Node 3 1130 by removing Node 3 1130 from the system 1100. To maintain a communications link between the remaining communication nodes 1110, 1120, 1140, the positions or trajectories of the communication nodes 1110, 1120, 1140 are readjusted in response to the recomputed potential fields representing the communication ranges 1112, 1122, 1142 of the remaining communication nodes 1110, 1120, 1140.
FIG. 11B shows a result of the re-computation of the potential fields for the remaining communication nodes 1110, 1120, 1140. Some or all of the remaining communication nodes 1110, 1120, 1140 have moved so that the maximum communication ranges 1112, 1122, 1142 still overlap with at least one of the other maximum communication ranges 1112, 1122, 1142 of the remaining communication nodes 1110, 1120, 1140. The system may adapt for the loss or prospective loss of a communication node to provide coverage to at least a portion of the communication area to be served by the network serviced by the plurality of communication nodes. As a result, the remaining communication nodes 1110, 1120, 1140 continue to provide communication links across a system 1150 of the remaining communication nodes 1110, 1120, 1140.
FIGS. 12A and 12B show systems 1200, 1250 of aircraft 1210-1222 in a defined airspace 1202 where remaining aircraft 1210-1216 and 1220 are repositioned when some of the aircraft 1218, 1222 are removed from the defined airspace 1202. The defined airspace 1202 may represent an airspace assigned to a particular air traffic control zone such as may surround an airport with a control tower 1204 that manages takeoffs and landings at one or more runways 1206. According to illustrative embodiments of the present disclosure, based on telemetry with the aircraft 1210-1222, the control tower 1204 or another control source may receive telemetry from the aircraft, compute trajectories for the aircraft 1210-1222 to circle, approach, or land on the runway 1206 using potential fields, and transmit the trajectories to the aircraft 1210-1222. Alternatively, each of the aircraft 1210-1222 may communicate with others of the aircraft 1210-1222 and calculate the trajectories of all of the aircraft 1210-1222 to determine trajectories for each of the aircraft 1210-1222 to circle, approach, and land on the runway 1206. Using potential fields, the air traffic control of the aircraft 1210-1222 could be self-determined by the aircraft 1210-1222 independent of an external air traffic control system.
FIG. 12A shows a system 1200 in which seven aircraft 1210-1222 are present in the defined airspace. The aircraft 1210-1222 thus would be included on a monitored aircraft list that includes aircraft in the defined airspace 1202. Each of the aircraft 1210-1222 has a minimum separation distance 1230-1242, respectively, that may be modeled by potential fields assigned to the aircraft 1210-1222.
The potential fields for each of the aircraft 1210-1222 may be based in part on a present position of the aircraft and by dynamic properties, such as mass, airspeed, current acceleration, and other quantities that affect the motion of the aircraft. Each of the aircraft 1210-1222 is of a general type, including various types of propeller-powered and jet-powered aircraft. Each of the aircraft 1210-1222 also is of a specific type that is specified. For example, different types of commercial jet aircraft manufactured by The Boeing Company of Chicago, Ill., such as the 747 commercial jet aircraft, have different aerodynamic properties that significantly affect a minimum separation distance that is provided around the 747 aircraft as contrasted with, for example, 757 and 737 aircraft also manufactured by The Boeing Company.
The minimum separation distance 1230-1242 may be a two-dimensional area or a three-dimensional volume around each of the aircraft 1210-1222 that is not to be entered by others of the aircraft 1210-1222. As shown in FIG. 12A, the aircraft 1210-1222 are positioned so that none of the minimum separation distances 1230-1242 of the aircraft 1210-1222 overlap with the minimum separation distances 1230-1242 of any of the other aircraft 1210-1222. It should be noted that, in a particular embodiment, the minimum separation distances 1230-1242 of the aircraft 1210-1222, represented by the dotted lines in FIGS. 12A and 12B may overlap with each other provided that the aircraft 1210-1222 themselves do not encroach upon the minimum separation distances 1230-1242 of others of the aircraft 1210-1232.
The minimum separation distance 1230-1242 may vary for different types of aircraft. For example, small aircraft generally create less jet wash or cause less turbulence than larger aircraft. Further, some aircraft, as a result of the design of the aircraft, result in more surrounding turbulence than other aircraft of the same or larger size. Accordingly, in a particular embodiment, the aircraft type of each of the aircraft 1210-1222 should be considered in assigning and applying potential fields to model the minimum separation distance of the aircraft.
FIG. 12B shows a system 1250 in which two of the aircraft, Aircraft 5 1218 and Aircraft 7 1222 have been directed to land and thus have left the defined airspace 1202. According to a particular illustrative embodiment, just as potential field methods may be used to arrange the aircraft 1210-1222 at minimum separation distances, potential fields may be used to determine a landing solution of the aircraft 1210-1222. For example, based on a distance to the runway 1206, which also may be represented by a potential field, it may be determined which of the aircraft 1210-1222 should land first. Alternatively, potential field methods may consider other constraints that also may be represented by an assigned potential field, such as a lack of fuel or rate of fuel consumption, in prioritizing the landing of the aircraft 1210-1222. In any event, once aircraft 1218 and 1222 have been removed from the defined airspace 1202 by landing or otherwise, potential fields modeling the minimum separation distance 1230-1242 may be reapplied to model a new positioning plan used to reposition the aircraft in the defined airspace 1202. As shown in FIG. 12B, the remaining aircraft 1210-1216 and 1220 may cluster closer to the runway as compared to when additional aircraft were present in the defined airspace 1202.
FIGS. 13A-13B show systems 1300, 1350 of aircraft 1210-1216 and 1220 being repositioned in the defined airspace 1202 when a new aircraft 1334 enters the defined airspace 1202. As shown in FIG. 13A, before the new aircraft 1334 enters the defined airspace 1202, the other aircraft 1210-1216 and 1220 may act independently of the new aircraft 1334. Potential field methods only are applied to agents that affect constraints of other agents.
FIG. 13B shows that, when the new aircraft 1334 enters the defined airspace 1202, a potential field is assigned to the new aircraft 1334 to model a minimum separation distance 1344 for the new aircraft 1334. As previously described, the potential field modeling the minimum separation distance may depend on the size of the new aircraft 1334 and even the specific type of the new aircraft 1334. With the potential field assigned, the control tower 1204, the aircraft 1210-1216, 1220, and 1234, or another agent computing the potential fields solution can determine new trajectories for the aircraft 1210-1216, 1220, and 1234 so that all of the aircraft 1210-1216, 1220, and 1234 are safely accommodated in the defined airspace 1202.
FIG. 14 is a flow diagram of an illustrative embodiment of a method 1400 to coordinate a plurality of agents using potential field methods. A specified task for a first agent and a second agent for a shared operation is received, at 1402. Potential fields are applied to generate a first plan to direct movement of the first agent and a second plan to direct movement of the second agent, at 1404. The plans generated enable the agents to move toward a specified goal where the potential fields model generalized physical forces applied to the agents, dynamics of the agents, operational considerations of the agents, and communication ranges to maintain communication between the agents. A generalized acceleration is determined from the potential fields, at 1406, as previously described with reference to Eqs. (1-34). The generalized acceleration for the first and second agents is integrated to obtain a first plan including a first trajectory for the first agent and a second plan including a second trajectory for the second agent, at 1408. The first plan is executed by the first agent, at 1410. It is determined if a specified discrete event has occurred, at 1412, and as previously described with reference to FIG. 1. If it is determined at 1412 that a specified discrete event has not occurred, execution of the first plan continues, at 1410. Otherwise, if it is determined at 1412 that a specified discrete event has occurred, the first plan and the second plan are regenerated accordingly, at 1414.
It should be noted that the method 1400 results in the generation, and possible regeneration, of both a first plan for a first agent and a second plan for a second agent, although the method 1400 only describes the execution of the first plan. The method 1400 is directed to the operation of only the first agent. However, as should be appreciated based on the foregoing discussion, regardless of whether the potential fields representing the constraints of the agents are computed at a central point or by the agents themselves, the plan of each of the agents may affect the plan of other agents. Thus, while the method 1400 describes only execution of the first plan, the generation and regeneration of the first plan depends on the second plan for a second agent, as well as any additional plans for any other agents when the potential fields for the constraints of those agents interact with the potential fields of the first agent.
As previously described, agents may communicate with other agents to share information about the status of each of the agents. The information may include information about the capabilities of the agents to move or to communicate, information about terrain, atmospheric or other conditions, and other information that may affect the execution of the shared operation. With a large group of agents, it may not be possible to continually update other agents with status information. Instead, according to a particular illustrative embodiment, the agents collect or disseminate information upon the occurrence of predetermined discrete events. The discrete events may include passage of an interval of time, reaching a particular physical location, and other events. FIGS. 15-17 describe illustrative embodiments of methods for collecting and disseminating information between agents.
FIG. 15 is a flow diagram of an illustrative embodiment of a method 1500 to collect information from and disseminate information to a plurality of agents. A node state collection and dissemination process begins, at 1502. It is determined if a node motion planning process should continue, at 1504. When it is determined at 1504 that the node motion planning process should not continue, the method 1500 advances to 1506 where the node state collection and dissemination process stops. Otherwise, if it is determined at 1504 that the node motion planning process should continue, current goal and formation or cluster behavior that informs the application of the potential fields is retrieved, at 1508. A periodicity interval for node motion planning based on node state and dynamics of nodes in the formation or cluster of nodes is determined, at 1510, as previously described with reference to FIG. 5. The state of nodes is retrieved for the formation or cluster from a local database, such as maintained in a memory, at 1512. As previously described, a central node may compute the potential fields, in which case the local database is maintained in a local database of the central node. Alternatively, as also previously described, if the nodes themselves compute the potential fields, each of the nodes will maintain its own local database.
Potential field methods, using the retrieved state of nodes and retrieved goal and formation or cluster behavior, are invoked, at 1514. It is determined if a desired goal and desired formation or cluster behavior has been achieved, at 1516. If it is determined at 1516 that the desired behavior has not been achieved, updates for node motion position and communications and networking states are determined and applied, at 1518. The agent then waits for a predetermined discrete event to gather additional information, at 1520. If it is determined that desired goal and desired formation or cluster behavior has been achieved at 1516, achievement of desired behavior is indicated to a node-level network topology or management process, at 1522. After waiting for the predetermined discrete event, such as lapse of the periodicity interval, the method then moves to 1504 to determine if the node state collection and dissemination process should continue.
FIG. 16 is a flow diagram of an example of an illustrative embodiment of a method 1600 to disseminate information to other agents of a plurality of agents as described with reference to FIG. 15. A node state dissemination process is initiated, at 1602. It is determined if the node state dissemination process should continue, at 1604. If it is determined at 1604 that the node state dissemination process should not continue, the method 1600 ends, at 1606. Otherwise, if it is determined at 1604 that the node state dissemination process should continue, a periodicity interval may be determined for evaluation of node states based on node dynamics, at 1608. When a periodicity interval is determined, the periodicity interval acts as a discrete event that prompts one or more of the nodes to collect or disseminate information, as previously described.
Update thresholds for determining node states are determined, at 1610. The node states are determined, at 1612. It is determined if the node state updates are outside the thresholds, at 1614, indicating that dissemination of information is overdue. If it is determined at 1614 that the updates are not outside the thresholds, the periodicity interval for disseminating information is awaited, at 1616. Otherwise, if it is determined that the updates are outside the thresholds, the node states are disseminated to nodes in the formation or cluster, at 1618. In either case, from 1616 and 1618, the method then moves to 1604 to determine if the node state dissemination process should continue.
FIG. 17 is a flow diagram of an example of an illustrative embodiment of a method 1700 to collect information from a plurality of agents as described with reference to FIG. 15. A node state collection process is initiated, at 1702. It is determined if a node state collection process should continue, at 1704. If it is determined at 1704 that the node state collection process should not continue, for example, upon completing the shared operation, the node state collection process ends, at 1706. Otherwise, if it is determined at 1704 that the node state collection process should continue, reception of node states from peer nodes is awaited, at 1708. The node state information is received, at 1710. The node state information is archived in a local database, at 1712. The method 1700 then moves to 1704 to determine if node state information collection should continue.
The foregoing embodiments of directing a plurality of agents through the application of potential field methods and the collection of information from and the dissemination of information to other agents may be employed in a variety of contexts and applications. FIGS. 18-20 describe three different applications for the use of potential field methods in controlling agents: the deployment of communication nodes (FIG. 18); coordinating the approach and landing of aircraft (FIG. 19), and coordinating movement of a plurality of vehicles.
FIG. 18 is a flow diagram of an illustrative embodiment of a method 1800 to coordinate deployment of a plurality of communication nodes. A task is assigned for each of a plurality of mobile communication nodes, at 1802. A dynamic model characterizing a behavior of the plurality of communication nodes is assigned, at 1804. Potential fields are applied to direct movement of each of the plurality of mobile nodes based on operational considerations and maintaining communication between each of the plurality of mobile communication nodes, at 1806. A generalized acceleration for the plurality of mobile communication nodes from the potential fields is determined, at 1808. The generalized acceleration for each of the plurality of mobile communication nodes is integrated to generate trajectories for each of the plurality of mobile communication nodes, at 1810.
Once the communication nodes are deployed, as described with reference to FIG. 18, the communication nodes facilitate an end-to-end network across a region in which the communication nodes are positioned. As described, applying potential field methods to the deployment of the communication nodes positions each node so that it is within a maximum communication range of one or more other communication nodes while being far enough from the other nodes so as not to cause interference. Because the communication nodes are in communication with each other, the nodes can carry communications from other sources through the network of communication nodes to other parties. Because the communication nodes include mobile communication nodes, the communication nodes are reconfigurable to adjust for a failed node or other issues as described with reference to FIGS. 11A and 11B.
FIG. 19 is a flow diagram of an illustrative embodiment of a method 1900 to manage air traffic for a plurality of aircraft in a defined airspace. It is determined if a next aircraft, such as a new aircraft as described with reference to FIGS. 13A and 13B, has entered a defined airspace, at 1902. If it is determined that no next aircraft has entered the defined airspace at 1902, the method 1900 advances to select a specified aircraft to land, at 1904. Otherwise, it is determined at 1902 that a next aircraft has entered the airspace, an aircraft type of the next aircraft is determined, at 1906. The next aircraft is added to a monitored aircraft list of the plurality of aircraft in the defined airspace, at 1908. Potential fields are applied to model a positioning plan for the defined airspace to provide enough distance between the monitored aircraft based on position, dynamics, and the aircraft type of the new aircraft, at 1910. A generalized acceleration is determined for the plurality of aircraft on the monitored aircraft list from the potential fields, at 1912. The generalized acceleration for each of the plurality of aircraft on the monitored aircraft list is integrated to obtain trajectories for each of the plurality of aircraft on the monitored aircraft list, at 1914.
FIG. 20 is a flow diagram of an illustrative embodiment of a method 2000 to coordinate movement of a plurality of vehicles. Characteristics of a plurality of vehicles are identified, at 2002. A specified goal for the plurality of vehicles is received, at 2004. Information about conditions for movement of the plurality of vehicles is received, at 2006. Potential fields are applied to determine a plan for each of the plurality of vehicles based on the characteristics, the current specified goal, and the conditions for movement of each of the plurality of vehicles, at 2008. A generalized acceleration of the plurality of vehicles using the potential fields is determined, at 2010. The generalized acceleration for each of the plurality of vehicles is integrated to obtain a trajectory for each of the plurality of vehicles, at 2012. Each of the plurality of vehicles is directed to move toward the specified goal according to the trajectory determined for each of the plurality of vehicles, at 2014.
It is determined if a specified discrete event has occurred, at 2016. If it is determined at 2016 that no specified discrete event has occurred, the method 2000 continues to direct each of the plurality of vehicles to move toward the specified goal according to the trajectory determined for each of the plurality of vehicles, at 2014. Otherwise, if it is determined at 2016 that a specified discrete event has occurred, it is determined if a change has occurred that affects the movement of the vehicles, at 2018. If it is determined that no change has occurred that affects the movement of the vehicles at 2018, the method 2000 continues to direct each of the plurality of vehicles to move toward the specified goal according to the trajectory determined for each of the plurality of vehicles, at 2014. Otherwise, if it is determined at 2018 that a change that affects the movement of the vehicles has occurred, the method 2000 moves to 2008 to again apply potential fields to determine a plan for each of the plurality of vehicles. Thus, with reference to FIG. 5, a particular illustrative embodiment may be used for the movement of a plurality of vehicles between the boundaries 520, 522 and around an obstacle 550, overcoming terrain changes 530 and atmospheric issues 540, to reach a goal 140.
FIGS. 21A and 21B are diagrams representing positions of nodes in a continuous domain in which positions of nodes are determined and in a discrete domain in which links between the nodes are established and changed, respectively. Referring to FIG. 21A, a plurality of nodes 2100 is illustrated. The plurality of nodes 2100 illustrated corresponds to the continuous domain. The plurality of nodes 2100 includes representative nodes including a first node 2110, a second node 2120, a third node 2130, and a fourth node. The fourth node is initially in a former position at 2140 and is movable to a new position as represented by the fourth node at 2142. In addition, a new node may be added to the set of nodes. For example, a new fifth node 2150 may be added to the plurality of nodes 2100.
One or more nodes may be movable whereas one or more of the nodes may be stationary. Additional nodes may be included to complete coverage provided by the nodes in their entirety. Alternatively, although not shown in FIG. 21A, nodes may be removed from service. Each of the nodes may provide a variety of functions such as data storage, data communication, or other computer processing activities. In addition, the set of nodes and their movements may be controlled by a computer system in accordance with one or more algorithms. For example, either a centralized controller or distributed control logic may be deployed in order to control one or more of the positions of the various nodes in the plurality of nodes. Potential field methods, as previously described herein, may be used in the positioning of the nodes, where the processing of the potential field methods may be either performed centrally or distributed among the nodes.
Referring to FIG. 21B, a set of nodes having directed links therebetween is illustrated, as designated 2160. The set of nodes includes the first node 2110, the second node 2120, the third node 2130, and the fourth node 2142, as introduced in FIG. 21A. In a first configuration of links between the nodes 2110, 2120, 2130, and 2142, a set of links includes a first link 2211, a second link 2213, and a third link 2215 collectively comprise a communications channel from the first node 2110 to the fourth node 2142: the first link 2211 is link 1-to-4 a, the second link 2213 is link 1-to-4 b, and the third link 2215 is link 1-to-4 c.
However, given the position of the set of nodes as shown in FIG. 21B, the communications channel between the first node 2110 and the fourth node 2142 may be made more efficient. After processing logic analyzes the initial placement of directed links, a revised set of directed links may be determined. In particular, the second link 2213 (link 1-to-4 b 2213) and the third link 2215 (link 1-to-4 c) may be replaced by a new link 2217 (link 1-to-4 b′) between the second node 2120 and the fourth node 2142. Thus, two links, including the second link 2213 link (link 1-to-4 b) and the third link 2215 (link 1-to-4 c), may be replaced by one link, the new link 2217, making the communications between the first node 2110 and the fourth node 2142 more efficient by reducing the number of links from two to one and by eliminating the third node 2130 from the channel between the first node 2110 and the fourth node 2142. In other words, a shorter path between the first node 2110 and the fourth node 2142 may be provided by two links as opposed to the initial placement of three links. One algorithmic method to identify and determine revisions to link placement is a greedy search algorithm. Representative types of greedy search algorithms include a dynamic A*, a D*, and a D* light type of approach. Overall, a control processing element (or a plurality of distributed processing elements) may reposition certain nodes, change links between nodes, or reposition certain nodes and change the links between the nodes in order to enhance communications between the plurality of nodes participating in a network.
Although deployment of a network may begin with an initial placement of the plurality of nodes, the changing and establishment of links and the positioning and re-positioning of nodes are both ongoing processes. For example, given the initial position of the plurality of nodes, enhancement of the network may be performed by changing the routing of links between the nodes. Subsequently, operation of the network may be further enhanced by repositioning one or more of the plurality of nodes. Thus, enhancement of the network links and node positions is an ongoing process. Iterations of enhancing the network may begin in the continuous domain by changing the position of nodes or in the discrete domain with modifying routing of links between the nodes. The iterations may continue in either or both the continuous domain or the discrete domain.
Referring to FIG. 22A and FIG. 22B, a particular application of the discrete domain processing in order to modify routing of links is illustrated. A first arrangement of nodes and interconnecting links is shown at 2200. The plurality of nodes includes a first node 2210, a second node 2220, a third node 2230, a fourth node 2240, a fifth node 2250, a sixth node 2260, a seventh node 2270, and an eighth node 2280. In the example of FIGS. 22A and 22B, each of the nodes is configured to communicate wirelessly with other nodes that fall within communication ranges 2212, 2222, 2232, 2242, 2252, 2262, 2272, and 2282 of the respective nodes.
In particular, a first communications channel between the first node 2210 and the third node 2230 is implemented via a first link 2221 (1-to-3 a) between the first node 2210 and the second node 2220 and via a second link 2223 (1-to-3 b) between the second node 2222 and the third node 2230. A second communications channel between the fifth node 2250 and the fourth node 2240 is implemented via a third link 2251 (5-to-4 a) between the fifth node 2250 and the sixth node 2260, a fourth link 2253 (5-to-4 b) between the sixth node 2260 and the seventh node 2270, a fifth link 2255 (5-to-4 c) between the seventh node 2270 and the eighth node 2280, and an eighth link 2257 (5-to-4 d) between the eighth node 2280 and the fourth node 2242.
After evaluating link placements using the above described algorithms or similar methods, control logic may determine a revised placement of links. For example, referring to FIG. 22B, after performing processing to determine a revised set of links, the revised set of links may be as shown at 2202. For example, the two links 2221 and 2223 between the first node 2210 and the second node 2220 are replaced with a single link 2224 (1-to-3′). The four links 2251, 2253, 2255, and 2257 between the fifth node 2250 and the fourth node 2240 are replaced with three links, including links 2254 (5-to-4 a′), 2256 (5-to-4 b′), and 2258 (5-to-4 c′). Where there are six links in the illustrative example of FIG. 22A at 2200, the simplified routing of FIG. 22B at 2202 includes only four links, removing two intermediate links. Further, rerouting the links reduces routing demands by removing the second node 2220 and the sixth node 2260 from use in the existing communications channels. Thus, an improved placement of links between nodes may be determined and applied for economy and scale building.
Referring to FIG. 23A and FIG. 23B, a particular illustrative example of combining node placement and link routing is illustrated. In an initial configuration of nodes and links, at 2300, a set of nodes and interconnecting links are shown. The position of the nodes and the routing of the links is the same as that of FIG. 22B. In contrast to the example of FIGS. 22A and 22B, however, where communications between the nodes is modified solely by rearranging links, the example of FIGS. 23A and 23B depicts movement of a node to adjust communications between nodes.
The second communications channel between the fifth node 2250 and the fourth node 2240 is achieved (as in FIG. 22B) by three links including links 2154, 2156, and 2158. However, if there is significant demand for communications between the fifth node 2250 and the fourth node 2240 (either point-to-point or intermediate communications between the fifth node 2250 and the fourth node 2240), and if, for example, the fifth node 2250 is a movable node, communications may be further enhanced. In particular, by moving the fifth node 2250 along a vector 2390 toward the fourth node 2240, intermediate links and the resulting communications burdens on the intermediate nodes may be relieved.
As shown in FIG. 23B, moving the fifth node 2250 along the vector 2390 (FIG. 23A) brings the fifth node 2250 and the fourth node 2240 into communications range of each other. With the revised position of the fifth node 2150, FIG. 23B illustrates that three links from FIG. 23A (links 2154, 2156, 2158) may be replaced by a single link 2354 (link 5-to-4′) as shown. Thus, the node movement algorithm and link directing methods may significantly reduce the number of links and thereby improve processing and communications capabilities. As a further example, by moving the fifth node 2150 closer to the fourth node 2140, the fifth node 2150 and the fourth node 2140 may be in communications range of each other, enabling the fifth node 2150 to communicate directly with the fourth node 2140. An application of the potential fields method may be used to determine that the fifth node 2250 should be repositioned to enhance operation of the communications network.
Alternatively, perturbation analysis may be applied in evaluating a position of a particular node or in seeking whether a more effective position may exist for a particular node. Because perturbation analysis concerns a position of a node, perturbation analysis is part of the network topology management process (i.e., the continuous domain). For example, referring to FIG. 24A and FIG. 24B, a representative illustration 2410 shows application of perturbation analysis in moving the fifth node 2250. As shown in reference to FIG. 24A, the fifth node 2250 may move in a variety of directions as illustrated at 2420, 2430, 2440, and 2450. In one application of the perturbation method, each of these four directions may be evaluated to determine whether such a movement would improve or would decrease the communications capabilities or other performance aspects of the entire set of nodes. For example, the movement of the fifth node 2250 in the direction of 2430 may be determined not to improve the communications capabilities of the system of nodes and, in fact, may decrease performance such that movement in the direction of 2430 is not considered by the methodology. Similarly, a movement in the direction of 2440 is also determined not to enhance communications performance. By contrast, movements in the direction of 2420 and in the direction of 2450 (which are components of the vector 2390) were determined to be both found helpful or otherwise beneficial with respect to the overall performance of the set of nodes. Perturbation analysis may be iteratively applied to evaluate potential benefits of movement of a node, such as the fourth node 2420, in a plurality of directions.
As shown in FIG. 24A, three step movements in the direction of 2420, 2421, and 2422 are found to be beneficial. However, any further movement in such direction was found to be less beneficial so the movement ended at 2422. As a further example, movement in the direction of 2450 progressed to steps 2451 through 2454 and each such steps were found beneficial for performance. However, any further movement was found to either not improve performance or to decrease performance such that the termination point is at 2454. Upon evaluating a resulting vector formed by combining the final destination positions 2422 and 2454, the resulting vector of 2390 is formed. Moving the node 2250 alone, the vector 2390 enhances the communication performance of the system of nodes. Thus, an incremental perturbation analysis may be applied to identify how nodes may be repositioned to enhance network performance.
Perturbation analysis may be used to evaluate either linear movements or curved movements that may be required to accommodate obstacles situated adjacent to a movable node. Referring to FIG. 24B, a particular illustrative embodiment of a curved trajectory 2452 is shown. The curved trajectory 2452 may be broken down into linear trajectory segments 2454 permitting perturbation analysis to be performed on each of the trajectory segments of the curved trajectory 2452. Thus, the perturbation analysis method is applicable to a variety of paths including both straight lines and curves.
Because perturbation analysis is part of network topology management in the continuous domain, but determines whether repositioning of a node might provide for more effective linking of nodes, perturbation analysis relies on a model of link management in the discrete domain. In other words, in modeling whether a small movement of a node may improve inter-node communications, the node topology management process uses a model of the link management system management to determine whether the modeled movement may be beneficial in supporting inter-node communications. Thus, the perturbation analysis, in effect, performs a combined analysis of the continuous domain and discrete domain processes to enhance inter-node communications.
FIG. 25 is a flow diagram depicting a particular illustrative embodiment of a method for evaluating changes to be made to enhance network operation. First network state data descriptive of a first network state is received, at 2502. The first network state includes a network demand associated with nodes of a dynamic network including at least one movable node and a node state of each node of the dynamic network. The first network state data may include a position of each of the nodes and list the established communications links, such as depicted in FIGS. 22A and 22B. At least one first link is automatically established between two or more nodes of the dynamic network to satisfy a portion of the network demand, at 2504. For example, the links 2221 and 2223 may be established to satisfy network demand for communications between the first node 2210 and the third node 2230. Link data is generated, where the link data is descriptive of node utilization, the at least one link, and assignment of the portion of the network demand to the at least one first link, at 2506. Based on the link data generated at 2506, one or more changes to the dynamic network is modeled to identify a second network state, where the second network state satisfies a greater quantity of the network demand than the first network state, at 2508. For example, as depicted in FIGS. 22B and 23B, rerouting of one or more links or the movement of one or more nodes may enable satisfaction of network demand with fewer resources or satisfaction of greater network demand with existing network resources.
According to embodiments of the method illustrated in the flow diagram of FIG. 25, the second network state may be identified periodically. For example, the state may be evaluated at predetermined intervals, such as at a series of defined epochs. Alternatively, or in combination, the second network state may be identified in response to occurrence of an event such as a predetermined event. The modeling of the second network state may result in repositioning of one or more moveable nodes to new locations to implement the second network state, such as described with reference to FIGS. 23A and 23B. The new location or locations may be determined using potential field methods as applied to the nodes of the dynamic network. In addition to repositioning of one or more nodes, one or more second links may be established between nodes of the dynamic network, where the at least one second link satisfies network demand that was not satisfied by the at least one first link. The new location or locations of the one or more nodes may be determined using perturbation analysis as described with reference to FIGS. 24A and 24B. It may be determined that an additional node is needed to satisfy all of the network demand, as described with reference to FIG. 21A (i.e., the new fifth node 2150). A request for the additional node may be automatically sent. Further, the second network state may be implemented by automatically changing one or more links between the nodes of the dynamic network.
Referring to FIG. 26, a particular embodiment of a system 2600 is shown. The system includes a network topology modeling system 2610 and a link management system 2630. As previously described, for example, application of perturbation analysis to support network topology management relies on an embedded model of the link management system. FIG. 26 depicts the embedded model of the link management system 2630 operating in concert with the network topology management system 2610.
The system 2600 is applicable for use in connection with a plurality of nodes of a communication network where each of the nodes is configured to receive and transmit signals and/or each of the nodes is movable or at least a subset is movable. The network topology modeling system 2610 is a continuous domain system and is responsive to an input that defines an objective by creating a connection demand matrix for a particular network of nodes, as shown at 2602. The network topology modeling system 2610 performs a variety of actions including determining a position of nodes to determine whether nodes support connections indicated by the connection demand matrix, at 2612, determining whether connection demand matrix calls for additional or newly repositioned nodes to support connections, at 2614, and determining an update to node positions if a node is expected to leave in order to satisfy connection demand matrix requirements, at 2616. The network topology modeling system 2610 also includes processing logic to update node topology state periodically or in response to one or more events, at 2618, and to update the connection demand matrix periodically or based on one or more events, at 2622. Perturbation analysis may include modeling one or more changes to a connection demand matrix that result from positioning a node at each of a plurality of available locations.
The network topology modeling system 2610 is configured to determine a position of a movable node that supports establishing one or more second communication links to accommodate a second portion of network demand. The second portion of the network demand is different than a first portion of network demand that is accommodated or otherwise supported by the link management system 2630.
The link management system 2630 is associated with a discrete domain as described above. The link management system 2630 includes processing capabilities to determine, establish, and update network topology link connectivity based on a node topology/state update and connection demand matrix on a periodic output basis, at 2630. The link management system 2630 also includes processing capability to periodically update a demand matrix assignment state, at 2634, and to periodically update a node bandwidth and link capacity utilization state, at 2636. In addition, the link management system 2630 may iteratively perform the above illustrated processing steps. Further, after periodically updating the node bandwidth and link capacity utilization state, at 2636, processing may continue back at the input to the network topology modeling system 2610 as shown in FIG. 26. In addition, the link management system 2630 is configured to dynamically establish one or more communication links between nodes of the plurality of nodes to accommodate at least a first portion of network demand (i.e., the direct communications links formed between the first node 2210 and the third node 2230 in FIG. 22B and between the fifth node 2250 and the fourth node 2240 in FIG. 23B).
In a particular illustrative embodiment, the use of both the link management system 2630 in the discrete domain and the network topology modeling system in the continuous domain 2610 may be applied either separately or in various combinations to a set of a plurality of nodes. For example, with a plurality of nodes of a communication network where each of the nodes is configured to receive and transmit signals, one or more of the nodes may be movable. In this case, either the network topology modeling system 2610 may provide instructions to move a node, or the link management system 2630 may provide instructions to establish links, change links, or otherwise modify directional links between the plurality of nodes. Thus, as illustrated in FIGS. 21A-23B above, processing logic in either the continuous domain 2610 or the discrete domain 2630 may be applied to improve performance of the plurality of nodes by either directional positioning or link rearrangement for improved routing.
Thus, network demand may be divided into various portions that are satisfied by either the network topology modeling system 2610 or the link management system 2630. In addition, in a particular embodiment, the network topology modeling system 2610 and the link management system 2630 may be distributed among two or more of the plurality of nodes. In operation, the link management system 2630 is operable to dynamically reconfigure one or more communication links between various nodes in response to changes in network demand. In addition, the link management system 2630, in order to dynamically establish one or more communication links between nodes, may favor a first route from a sending node to a receiving node over a second route from the sending node to the receiving node based on the first route including fewer intermediate nodes. For example, by dynamically establishing communication links as described above, a total number of links between nodes of the set of the plurality of nodes may be reduced.
As an example of an applicable algorithm, the link management system 2630 may use a greedy allocation method to dynamically establish one or more communication links. The existing communication links may be given preference in the greedy allocation method. In addition, the system may further include a mission control system. In a particular example, the mission control system controls movement of one or more of the movable nodes based on a mission objective that is independent of communications of the communication network. An example of the objective is shown as a defined objective at 2602. The mission control system provides movement information related to the movable node to the network topology modeling system 2610 as shown in FIG. 26. In addition, the network topology modeling system 2610 determines the position of the movable node based at least in part on the movement information from the mission control system. Thus, a centralized mission control system may communicate with the network topology modeling system 2610 (that may be centralized or distributed) to have mission objectives defined and satisfied either centrally or in a distributed manner. Accordingly, improved mission control objectives may be distributed for further processing by distributive elements using either continuous domain or discrete domain techniques.
Referring to FIG. 27, a particular illustrative embodiment of a network topology management process 2700 is shown. The network topology management process 2700 may be implemented using the network topology modeling system 2610 of FIG. 26, for example. The method of performing network topology management includes receiving an initial link demand 2702 and an initial node position 2704. The method includes determining and updating current demand matrix based on a source/destination matrix. The source/destination matrix is derived both from the link management system (discrete domain, 2630 of FIG. 26) and the network topology modeling system (continuous domain 2610 of FIG. 26), at 2706. The network topology modeling system may include current node formation and cluster behavior. The method includes determining whether a demand has changed, at 2708. If no demand has changed, processing continues to 2710 where a formation/cluster behavior update comparison is made. If the formation/cluster behavior update did not occur then processing continues to 2712 where one or more new node positions including the position of one or more movable nodes is determined and communicated.
When a demand change occurs at 2708, processing continues back at 2706 to again determine an update current demand matrix as shown. Further, when the formation/cluster behavior has been updated at 2710, again processing is directed back to 2706 to determine and update the current domain matrix based on the updated information. Thus, the network topology management process detects changes in demand and changes in formulation and cluster behavior and responds dynamically by establishing new positions for one or more movable nodes, at 2712. Accordingly, where a plurality of nodes includes one or more movable nodes, based on updates to communication demand or changes in formulation and cluster behavior, the one or more movable nodes may be moved to better service the communications demand.
Referring to FIG. 28, the process of link management in the discrete domain is described. A link management system 2800 begins by receiving initial link demand, at 2802. The link management system 2800 begins by determining by a source/destination demand matrix for a current epoch based on connections demand matrix from a continuous domain network topology management process, at 2804. After determining the source/destination demand matrix, the link management system 2800 determines the estimated link cost for each peer to peer node based on node state from the continuous demand matrix topology management process, at 2806. The link management system 2800 configures links to satisfy bandwidth requirements with a connection demand matrix from the network topology management process, at 2808. The links are configured using greedy techniques and problem-specific heuristics followed by directed subgraph search to establish all the links.
After the link management system 2800 configures the links, the link management system determines whether the current node topology is capable of supporting the connection demand matrix requirements, at 2810. If the current node topology is capable of supporting the connection demand matrix requirements, then it is determined that all of the connection demand matrix requirements are satisfied, at 2812. If all the connection demand matrix requirements are not satisfied, processing returns to the link configuration of 2808. However, if it is determined at 2810 that the current node topology is not capable of supporting the connection demand matrix requirements, processing advances to 2814 to await a next event or a next epoch when link data is next generated. A next event may include arrival of or completion of repositioning of a node. Arrival or passing of an epoch may be the passing of an interval, such as may be determined by a timer or clock system. Processing also advances to 2814 to await the next event or passing of the next epoch when it is determined that of all the connection demand matrix requirements are satisfied, at 2812. At 2814, the current link data 2816 is generated.
Once current link data 2816 is generated at 2814, an update from continuous domain network topology is received or next epoch begins. If the update query indicates that the continuous domain network topology is received or next epoch has begun, processing continues back at determining the source/destination demand matrix, at 2804. If there is no update from the continuous domain network as determined at the decision block 2818, processing returns to 2814 to await an event or passing of an epoch, as previously described. Thus, the link determination process responds to updates to the domain network topology event or to a subsequent epoch scenario.
Thus, a particular method of updating positions of nodes and establishment of links has been shown. While a particular illustrative method for link control has been described, it should be understood that a number of other link control or update methodologies may also be applicable.
FIG. 29 is a block diagram of a general purpose computing environment 2900 operable to implement embodiments of computer-implemented methods and computer-executable program instructions in coordinating a plurality of agents in a shared operation as described with reference to FIGS. 1-20. In one illustrative embodiment, a computing system 2910 includes an agent, which may be autonomous, or the computing system 2910 may direct a human operator. The computing system 2910 includes at least one processor 2920. Within the computing system 2910, the processor 2920 communicates with a system memory 2930, one or more storage devices 2940, one or more input/output devices 2960, and one or more network interfaces 2970 through which the computing system 2910 communicates with one or more other computer systems 2980.
The system memory 2930 may include volatile memory devices, such as random access memory (RAM) devices and nonvolatile memory devices such as read-only memory (ROM), programmable read-only memory, and flash memory. The system memory 2930 typically includes an operating system 2932, which may include a basic/input output system for booting the computing system 2910 as well as a full operating system to enable the computing system 2910 to interact with users, other programs, and other computer systems 2980. The system memory 2930 also typically includes one or more application programs 2934, such as programs that direct the autonomous agent in the performance of actions that are part of the tasks that, in turn, may be part of a shared plan. The system memory 2930 also may include program data 2936, such as status information for the local agent or one or more other agents, as previously described.
The processor 2920 also communicates with one or more storage devices 2940. The storage devices 2940 may include nonvolatile storage devices such as magnetic disks, optical disks, or flash memory devices.
The processor 2920 communicates via one or more input/output interfaces 2950 with one or more input/output devices 2960 that enable the computing device 2910 to interact with a user. The input/output devices 2960 may include keyboards, pointing devices, microphones, speakers, and displays. The processor 2920 also communicates with one or more network interfaces 2970 that enable the computing device 2910, as used in an agent, to communicate with other agents.
Not all of the components or devices illustrated in FIG. 29 or otherwise described in the previous paragraphs are necessary to support implementations of the present disclosure. For example, a device may include an integrated system memory and storage device including a flash memory configured to store all programs and data for operation of a system. In addition, if all input and output is communicated via the network interfaces 2970, a system may not include any other input/output interfaces 2950 or input/output devices 2960.
The illustrations of the embodiments described herein are intended to provide a general understanding of the structure of the various embodiments. The illustrations are not intended to serve as a complete description of all of the elements and features of apparatus and systems that utilize the structures or methods described herein. Many other embodiments may be apparent to those of skill in the art upon reviewing the disclosure. Other embodiments may be utilized and derived from the disclosure, such that structural and logical substitutions and changes may be made without departing from the scope of the disclosure. For example, method steps may be performed in a different order than is shown in the figures or one or more method steps may be omitted. Accordingly, the disclosure and the figures are to be regarded as illustrative rather than restrictive.
Moreover, although specific embodiments have been illustrated and described herein, it should be appreciated that any subsequent arrangement designed to achieve the same or similar results may be substituted for the specific embodiments shown. This disclosure is intended to cover any and all subsequent adaptations or variations of various embodiments. Combinations of the above embodiments, and other embodiments not specifically described herein, will be apparent to those of skill in the art upon reviewing the description.
The Abstract of the Disclosure is submitted with the understanding that it will not be used to interpret or limit the scope or meaning of the claims. In addition, in the foregoing Detailed Description, various features may be grouped together or described in a single embodiment for the purpose of streamlining the disclosure. This disclosure is not to be interpreted as reflecting an intention that the claimed embodiments require more features than are expressly recited in each claim. Rather, as the following claims reflect, the claimed subject matter may be directed to less than all of the features of any of the disclosed embodiments.

## Claims

1. A method comprising:
receiving, at a processor, first network state data descriptive of a first network state, the first network state data comprising:
network demand associated with nodes of a dynamic network, wherein the nodes of the dynamic network include a movable node; and
node state of each node of the dynamic network;

automatically establishing a first link between two nodes of the dynamic network to satisfy a portion of the network demand;
generating link data, wherein the link data is descriptive of node utilization, the first link, and assignment of the portion of the network demand to the first link; and
modeling one or more changes to the dynamic network based on the link data to identify a second network state, wherein the dynamic network in the second network state satisfies a greater quantity of the network demand than the dynamic network in the first network state,
wherein modeling the one or more changes to the dynamic network includes:
determining a first destination position based on modeling a first movement of the movable node in a first direction, wherein a further movement of the movable node in the first direction beyond the first destination position results in a same or lower quantity of network demand satisfied than in the first destination position,
determining a second destination position based on modeling a second movement of the movable node in a second direction, and
determining a velocity vector of the movable node based on the first destination position and the second destination position.

2. The method of claim 1, wherein the second network state is identified periodically.

3. The method of claim 1, wherein the second network state is identified in response to occurrence of an event.

4. The method of claim 1, further comprising causing the movable node to be repositioned to a new location based on the velocity vector.

5. The method of claim 4, further comprising determining the new location of the movable node based on modified potential fields applied to the nodes of the dynamic network.

6. The method of claim 5, further comprising automatically causing a second link to be established between a pair of the nodes of the dynamic network after the movable node is repositioned, wherein the second link satisfies at least a portion of network demand not satisfied by the first link.

7. The method of claim 4, wherein the new location of the movable node is determined by modeling one or more changes to a connection demand matrix that results from positioning the movable node at each of a plurality of available locations.

8. The method of claim 1, further comprising:
determining that the nodes of the dynamic network are insufficient to satisfy all of the network demand; and
automatically sending a request for an additional node.

9. The method of claim 1, further comprising implementing the second network state by automatically causing one or more links between the nodes of the dynamic network to be changed.

10. A system comprising:
a link management system configured to dynamically establish one or more communication links between a portion of a plurality of nodes of a communication network to accommodate a first network demand, wherein each of the nodes is configured to receive and transmit signals and wherein the plurality of nodes includes a movable node;
a network topology modeling system configured to determine a position of the movable node that supports establishing one or more second communication links to accommodate a second network demand, wherein the second network demand is different than the first network demand, wherein the network topology modeling system is further configured to determine a first destination position based on modeling a first movement of the movable node in a first direction, wherein a further movement of the movable node in the first direction beyond the first destination position results in a same or lower quantity of network demand satisfied than the first destination position, wherein the network topology modeling system is further configured to determine a second destination position based on modeling a second movement of the movable node in a second direction, and wherein the network topology modeling system is further configured to determine a velocity vector of the movable node based on the first destination position and the second destination position; and
a mission control system configured to control movement of the movable node based on a mission objective that is independent of communications of the communication network.

11. The system of claim 10, wherein the mission control system is further configured to send movement information related to the movable node to the network topology modeling system, and wherein the network topology modeling system is configured to determine the position of the movable node based at least in part on the movement information.

12. The system of claim 10, wherein the network topology modeling system and the link management system are distributed among two or more of the plurality of nodes.

13. The system of claim 10, wherein the mission objective includes a distance from a goal location, a formation, or a combination thereof.

14. The system of claim 10, wherein dynamically establishing the one or more communication links includes prioritizing a first route from a sending node to a receiving node over a second route from the sending node to the receiving node when the first route includes fewer intermediate nodes than the second route.

15. The system of claim 10, wherein the link management system uses a greedy allocation method to dynamically establish the one or more communication links.

16. The system of claim 15, wherein existing communication links are given priority by the greedy allocation method.

17. A device comprising:
a processor;
a network interface coupled to the processor; and
a memory accessible to the processer, the memory storing instructions that are executable by the processor to cause the processor to perform operations including:
receiving, at a first node of a dynamic network, first network state data descriptive of a first network state of the dynamic network, the first network state data comprising:
network demand associated with nodes of the dynamic network, wherein the nodes of the dynamic network include the first node; and
node state of each node of the dynamic network;

interacting with a second node of the dynamic network, via the network interface, to establish a first link between a pair of nodes of the dynamic network to satisfy at least a portion of network demand of the dynamic network;
generating link data, wherein the link data is descriptive of node utilization, the first link, and assignment of the portion of the network demand to the first link; and
executing, at the first node, a portion of a model of the dynamic network based on the link data, wherein the model of the dynamic network models one or more changes to the dynamic network to identify a second network state, wherein the dynamic network in the second network state satisfies more of the network demand than the dynamic network in the first network state, wherein the model of the dynamic network models a topological configuration of the nodes of the dynamic network to determine whether repositioning one or more nodes of the dynamic network would enable an additional portion of the network demand to be supported, wherein the model of the dynamic network is generated by determining a first destination position based on modeling a first movement of the first node in a first direction, wherein a further movement of the first node in the first direction beyond the first destination position results in a same or lower quantity of network demand satisfied than in the first destination position, wherein the model of the dynamic network is generated by determining a second destination position based on modeling a second movement of the first node in a second direction, and wherein the model of the dynamic network is generated by determining a velocity vector of the second node based on the first destination position and the second destination position.

18. The device of claim 17, wherein the model of the dynamic network further models links between the nodes of the dynamic network by:
evaluating a first configuration of the links subject to a link cost associated with each link to determine the portion of the network demand that is satisfied by the first configuration; and
in response to the first configuration not being able to satisfy all of the network demand, evaluating a second configuration of the links to determine the portion of the network demand that is satisfied by the second configuration.

19. The device of claim 17, further comprising a motivating system to move the first node from a first position to a second position based on the model, wherein at the second position, the first node supports a third network state of the dynamic network, and wherein the dynamic network in the third network state supports the additional portion of the network demand.

20. The device of claim 17, wherein the second network state is identified periodically.