DARPA ULTRALOG Final Report - Industrial and Manufacturing ...

More documents

Recommendations

Info

Manuscript for IEEE Transactions on Automatic Control 26 Proc. DARPA Information Survivability Conference and Exposition, 2000, pp. 271-283. [5] O. F. Rana and K. Stout, “What is scalability in multi-agent systems?,” in Proc. 4th Int. Conf. Autonomous Agents, 2000, pp. 56-63. [6] B. Meyer, “On to components,” IEEE Computer, vol. 32, no. 1, pp. 139-140, 1999. [7] P. Clements, “From subroutine to subsystems: Component-based software development,” in Component Based Software Engineering, A. W. Brown, Ed. IEEE Computer Society Press, pp. 3-6, 1996. [8] M. O. McCracken, A. Snavely, and A. Malony, “Performance modeling for dynamic algorithm selection,” in Proc. Int. Conf. Computational Science, 2003, pp. 749-758. [9] P. Oreizy, M. M. Gorlick, R. N. Taylor, D. Heimbigner, G. Johnson, N. Medvidovic, A. Quilici, D. S. Rosenblum, and A. L. Wolf, “An architecture-based approach to self-adaptive software,” IEEE Intelligent Systems, vol. 14, no. 3, pp. 54-62, 1999. [10] F. M. T. Brazier, C. M. Jonker, and J. Treur, “Principles of component-based design of intelligent agents,” Data and Knowledge Engineering, vol. 41, no. 1, pp. 1-28, 2002. [11] H. J. Goradia and J. M. Vidal, “Building blocks for agent design,” in Proc. 4th Int. Workshop on Agent-Oriented Software Engineering, 2003, pp. 17-30. [12] R. Krutisch, P. Meier, and M. Wirsing, “The AgentComponent approach, combining agents and components,” in Proc. 1st German Conf. Multiagent System Technologies, 2003, pp. 1- 12. [13] D. Moore, W. Wright, and R. Kilmer, “Control surfaces for Cougaar,” in Proc. First Open Cougaar Conference, 2004, pp. 37-44. [14] W. Peng, V. Manikonda, and S. Kumara, “Understanding agent societies using distributed monitoring and profiling,” in Proc. First Open Cougaar Conference, 2004, pp. 53-60.
Manuscript for IEEE Transactions on Automatic Control 27 [15] H. Gupta, Y. Hong, H. P. Thadakamalla, V. Manikonda, S. Kumara, and W. Peng, “Using predictors to improve the robustness of multi-agent systems: Design and implementation in Cougaar,” in Proc. First Open Cougaar Conference, 2004, pp. 81-88. [16] D. Moore, A. Helsinger, and D. Wells, “Deconfliction in ultra-large MAS: Issues and a potential architecture,” in Proc. First Open Cougaar Conference, 2004, pp. 125-133. [17] R. D. Snyder and D. C. Mackenzie, “Cougaar agent communities,” in Proc. First Open Cougaar Conference, 2004, pp. 143-147. [18] A. P. Moore, R. J. Ellison, and R. C. Linger, “Attack modeling for information security and survivability,” Software Engineering Institute, Carnegie Mellon University, Pittsburg, PA, Tech. Note CMU/SEI-2001-TN-001, 2001. [19] F. Moberg, “Security analysis of an information system using an attack tree-based methodology,” M.S. thesis, Automation Engineering Program, Chalmers University of Technology, Sweden, 2000. [20] G. Barto, S. J. Bradtke, and S. P. Singh, “Learning to act using real-time dynamic programming,” Artificial Intelligence, vol. 72, no. 1-2, pp. 81-138, 1995. [21] R. S. Sutton, A. G. Barto, and R. J. Williams, “Reinforcement learning is direct adaptive optimal control,” IEEE Control Systems, vol. 12, no. 2, pp. 19-22, 1992. [22] L. P. Kaelbling, M. L. Littman, and A. W. Moore, “Reinforcement learning: A survey,” J. Artificial Intelligence Research, vol. 4, pp. 237-285, 1996. [23] J. B. Rawlings, “Tutorial overview of model predictive control,” IEEE Control Systems, vol. 20, no. 3, pp. 38-52, 2000. [24] M. Morari and J. H. Lee, “Model predictive control: Past, present and future,” Computers and Chemical Engineering, vol. 23, no. 4, pp. 667-682, 1999.
Page 1 and 2:
Ultra*Log PSU/IAI Final Report for
Page 3 and 4:
Contents Contents .................
Page 5:
Executive Summary Ultra*Log is a De
Page 8 and 9:
2.3 Gnanasambandam, N., Lee, S., Ku
Page 10 and 11:
6 Characterization and analysis of
Page 12 and 13:
timizing simultaneously the link de
Page 14 and 15:
where ∆ 1 (j) ≥ 0 and ∆ 2 (i,
Page 16 and 17:
Table 2. GA Results Agent N A D max
Page 18 and 19:
connected component, in which a pat
Page 20 and 21:
Random Small-world Scale-free with
Page 22 and 23:
Growth mechanisms Start with a smal
Page 24 and 25:
Table 2. The proposed network’s c
Page 26 and 27:
¡ ¡ ¢ £ ¤ ¥ ¦ £ § ¨ © ¥
Page 28 and 29:
© © ¤ ¢ ¨ ¤ £ ¦ ¨ © §
Page 30 and 31:
DMAS Controller. The functional uni
Page 32 and 33:
1000 500 0 -500 -1000 0.2 0.4 0.6 0
Page 34 and 35:
tems. Proceedings of the Second Joi
Page 36 and 37:
Proceedings of the 1st Open Cougaar
Page 38 and 39:
Page 40 and 41:
Page 42 and 43:
Page 44 and 45:
1 SITUATION IDENTIFICATION USING DY
Page 46 and 47:
3 3.2 Behavior In SSC society an ag
Page 48 and 49:
5 All the behavior parameters may n
Page 50 and 51:
Estimating Global Stress Environmen
Page 52 and 53: chaotic deterministic time series.
Page 54 and 55: 100% 1 95% 2 14 15 64% TAO 4 64% 62
Page 56 and 57: interactions as a dynamical system
Page 58 and 59: ehavior states under varying system
Page 60 and 61: Extensive testing and validation of
Page 62 and 63: 5 Conclusions and Future Research T
Page 64 and 65: 2 to function critically even under
Page 66 and 67: 4 points into a corresponding inner
Page 68 and 69: 6 stresses well. The Warehouse 1 ag
Page 70 and 71: © £ ¨ ¥ ¤ § ¢ ¥ ©
Page 72 and 73: Table 1: Notation Symbol Descriptio
Page 74 and 75: 4 Conclusions and Future Work 4.1 C
Page 76 and 77: O, U Stresses Physical/Infrastructu
Page 78 and 79: Manuscript for IEEE Transactions on
Page 106 and 107: 2 discuss problem domain and in Sec
Page 108 and 109: 4 t Si t ∫ + ( ) i ) t When RA i
Page 110 and 111: 6 S UB i ∑ = P LI / LI . (16) i p
Page 112 and 113: 8 policies while underutilizing in
Page 114 and 115: architecture based on both the Grid
Page 116 and 117: to machines (network topology) and
Page 118 and 119: component is a member of one of the
Page 120 and 121: denotes the immediate predecessors
Page 122 and 123: limit of large number of tasks. If
Page 124 and 125: Min-min heuristic algorithm Step 1:
Page 126 and 127: We set up eight different experimen
Page 128 and 129: 0. 4 8057 8237 0.5 6439 6635 0.6 53
Page 130 and 131: pp. 191-200. [3] I. Foster, C. Kess
Page 132 and 133: Technology, Cambridge, MA, 1995. [2
Page 134 and 135: Manuscript for IEEE TRANSACTIONS ON
Page 152 and 153:
Manuscript for IEEE TRANSACTIONS ON
Page 154 and 155:
Manuscript for IEEE TRANSACTIONS ON
Page 156 and 157:
Coordinating Control Decisions of S
Page 158 and 159:
directly. It has coarser scale. It
Page 160 and 161:
Understanding Agent Societies Using
Page 162 and 163:
• For tasks, the UID of the direc
Page 164 and 165:
for tracking the dependencies betwe
Page 166 and 167:
within the monitored enclave. With
Page 168 and 169:
Figure 1. Agent Hierarchy in CPE So
Page 170 and 171:
Figure 3. The World Model CPY Agent
Page 172 and 173:
Table 2. TechSpecs: Infrastructure
Page 174 and 175:
terms of the average waiting times
Page 176 and 177:
Acknowledgements The work described
Page 178 and 179:
key realization to tackle this prob
Page 180 and 181:
are or ignored perturbations. The e
Page 182 and 183:
sustained oscillations. If the inst
Page 184 and 185:
solved by biological systems for li
Page 186 and 187:
non-linear and non-stationarity. Ne
Page 188 and 189:
D k : Outflow from high priority qu
Page 190 and 191:
the system starts to perform self-s
Page 192 and 193:
sustained in a supply chain. Resour
Page 194 and 195:
which are necessary to make good mo
Page 196 and 197:
focusing on the computational compl
Page 198 and 199:
line of research that deals with ne
Page 200 and 201:
ealizable. But the inherent complex
Page 202 and 203:
Min, H. and Zhou, G., 2002, Supply
Page 204 and 205:
In the rest of this paper we report
Page 206:
shows relatively irregular behavior
show all

DARPA ULTRALOG Final Report - Industrial and Manufacturing ...

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

Delete template?

Save as template?