DARPA ULTRALOG Final Report - Industrial and Manufacturing ...

for tracking the dependencies between agents incurred
during distributed planning under a particular society
configuration. The equivalence criteria for abstract nodes
and edges are defined as follows:
• Task nodes that are on the boundary (e.g. have a
parent from another agent) and have identical
verbs are considered equivalent.
• All task nodes with the identical verb allocated
to another agent are equivalent.
• All subgraphs linking boundary nodes of the two
types described above are mapped to the same
abstract edges
CLEAR-
PAYMENT
ORDERBOOKS
BOOKS-
FROM
WAREHOUSE
PACK
SHIP
CLEAR-
PAYMENT
ORDERBOOKS
CLEARPAYMENT
BOOKS-
FROM
WAREHOUSE
PACK
ORDERBOOKS
SHIP
ROUTE
BOOKS-
FROM
WAREHOUSE
0.6
PACK
SHIP
CLEAR-
PAYMENT
0.3
PUBLISH
ORDERBOOKS
BOOKS-
FROM
WAREHOUSE
PUBLISH
AND ( EXPANSION)
AGGREGATION
OR
An example of a workflow graph is shown in Figure 4,
with a detailed blowup in Figure 5. This particular graph
was extracted from an event trace consisting of more than
160,000 events and more thirty agents; however, it clearly
shows the input/output relationships between agents and
the number of each type of task transmitted between
agents. Each box contains abstract nodes belonging a
single agent. Here, the hexagonal nodes depict a set of
tasks with identical verbs which are generated in an
specific agent and subsequently forwarded to other agents
for planning, the light colored boxes depict abstract nodes
represented tasks which are inputs to the agent, and the
ovals represent tasks allocated to assets within the agent.
This type of graph is useful for deriving the dependencies
between agents by finding the types of tasks which are
inputs and outputs from agents and filtering out the
internal details of the plan graph within each agent. A
potential application of this system would be a smart load
balancer which anticipates the generation and allocation
of tasks and allocated higher priority accordingly.
ROUTE
Figure 2. Example of Task Aggregation
In summary, each of these provides a different logical
view of the overall task graph that is useful for different
purposes.
Figure 3. Example Task Aggregate Graph
Reduction