17.04.2015 Views

DARPA ULTRALOG Final Report - Industrial and Manufacturing ...

DARPA ULTRALOG Final Report - Industrial and Manufacturing ...

DARPA ULTRALOG Final Report - Industrial and Manufacturing ...

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

Manuscript for IEEE Transactions on Automatic Control 5<br />

the horizon of an operation <strong>and</strong> thous<strong>and</strong>s of tasks to process as the root tasks are propagated. As<br />

the scale of operation increases there can be thous<strong>and</strong>s of agents (tens of thous<strong>and</strong>s of<br />

components) working together to generate a logistics plan. The system makes initial planning<br />

<strong>and</strong> continuous replanning to cope with logistics plan deviations or operational plan changes.<br />

Initial planning <strong>and</strong> replanning are the instances of the current research problem.<br />

QoS of these networks is determined by the quality of logistics plan (value of solution) <strong>and</strong><br />

(plan) completion time. These two metrics directly affect the performance of an operation. As the<br />

networks are working in a military environment, they are especially vulnerable to malicious<br />

attacks <strong>and</strong> accidental failures. Now, the question is how can we make this system survivable to<br />

generate high quality logistics plans in a timely manner in the presence of such adverse events?<br />

3. Problem specification<br />

In this section we formally define the problem by detailing network configuration, control<br />

action, <strong>and</strong> stress environment. We focus on computational CPU resources assuming that the<br />

system is computation-bounded.<br />

3.1 Network configuration<br />

A network is composed of a set of components A <strong>and</strong> each component resides in its own<br />

machine 1 . Task flow structure of the network, which defines precedence relationship between<br />

components, is an arbitrary directed acyclic graph. A problem given to the network is<br />

decomposed in terms of root tasks for some components <strong>and</strong> those tasks are propagated through<br />

the task flow structure. Each component processes one of the tasks in its queue (which has root<br />

1 For simplicity we consider the cases where there is one component in a machine. Though the designed control<br />

mechanism is also applicable to resource sharing environments, we may need to consider resource allocation in<br />

addition as will be discussed in Section 9.

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!