Model predictive control for stochastic resource allocation

IEEE Transactions on Automatic Control

Volumn 54, Issue 8, 2009, Pages 1739-1750

  Castañón, David A ^a   Wohletz, Jerry M ^b  

^a BOSTON UNIVERSITY   (United States)

^b BAE SYSTEMS   (United States)

Author keywords

Optimization; Resource allocation; Stochastic control

Indexed keywords

ACHIEVABLE PERFORMANCE; ADMISSIBLE CONTROL; CARDINALITIES; COMPUTATION TIME; COMPUTATIONAL EXPERIMENT; CONTROL PROBLEMS; CONTROL SPACES; DISCRETE STATE SPACE; EFFICIENT ALGORITHM; FOUR-ORDER; MODEL PREDICTIVE CONTROL ALGORITHM; MULTIPLE RESOURCES; OPTIMAL CONTROL PROBLEM; OPTIMAL DYNAMICS; PERFORMANCE BOUNDS; RESOURCE ALLOCATION PROBLEM; STOCHASTIC CONTROL;

APPROXIMATION ALGORITHMS; COMPUTATION THEORY; DYNAMIC PROGRAMMING; OPTIMIZATION; PLANNING; PREDICTIVE CONTROL SYSTEMS; RESOURCE ALLOCATION; STOCHASTIC CONTROL SYSTEMS; STOCHASTIC MODELS; SYSTEMS ENGINEERING;

MODEL PREDICTIVE CONTROL;

EID: 68949181598     PISSN: 00189286     EISSN: None     Source Type: Journal    
DOI: 10.1109/TAC.2009.2024562     Document Type: Article

References (28)

1. D. P. Bertsekas, Dynamic Programming and Optimal Control. Belmont, MA: Athena Scientific, 2000.
2. D. A. Castañón, Advanced Weapon Target Assignment Algorithms Burlington, MA, ALPHATECH report TR 428, 1989.
3. D. A. Castañón, "Optimal search strategies in dynamic hypothesis testing," IEEE Trans. Syst., Man Cybern., vol. 25, no. 7, pp. 1130-1138, Jul. 1995.
4. D. A. Castañón, "Approximate dynamic programming for sensor management," in Proc. 36th IEEE Conf. Decision Control, San Diego, CA, Dec. 1997, pp. 1202-1207.
5. D. A. Castañón and J.Wohletz, "Moldel predictive control for dynamic unreliable resource allocation," in Proc. 41st IEEE Conf. Decision Control, Las Vegas, NV, Dec. 2002, pp. 3754-3759.
6. R. Chen and G. L. Blankenship, "Dynamic programming equations for discounted constrained stochastic control," IEEE Trans. Automat. Control, vol. 49, no. 5, pp. 699-709, May 2004.
7. G. G. denBroder, R. E. Ellison, and L. Emerling, "On optimum target assignment," Oper. Res., vol. 7, pp. 322-326, 1959.
8. A. R. Eckler and S. A. Burr, Mathematical Models of Target Coverage and Missile Allocation. Alexandria, VA: Military Operations Research Society, 1972.
9. P. C. Gilmore and R. E. Gomory, "A linear programming approach to the cutting stock problem," Oper. Res., vol. 9, pp. 849-859, 1961.
10. K. Glazebrook and A.Washburn, "Shoot-look-shoot: A review and extension," Oper. Res., vol. 52, no. 3, pp. 454-463, May-Jun. 2004.
11. P. Hosein, "A Class of Nonlinear Resource Allocation Problems," Ph.D. dissertation, Electrical and Computer Engineering, MIT, Cambridge, MA, 1989.
12. S. P. Lloyd and H. S. Witsenhausen, "Weapons allocation is NP-complete," in Proc. Summer Conf. Simul., Reno, NV, 1986, pp. 1054-1058.
13. S. Matling, "A review of the literature on the missile allocation problem," Oper. Res., vol. 18, no. 2, pp. 334-373, Mar./Apr. 1970.
14. D. Q. Mayne, J. B. Rawlings, C. V. Rao, and P. O. M. Skocaert, "Constrained model predictive control: Stability and optimality," Automatica, vol. 36, pp. 789-814, 2000.
15. R. A. Murphey, "An approximate algorithm for a weapon target assignment program," in Approximation and Complexity in Numerical Optimization: Continuous and Discrete Problems, P. Pardalos, Ed. Dordrecht, The Netherlands: Kluwer Academic, 1999.
16. R. A. Murphey, "Target-based weapon target assignment problems," in Nonlinear Assignment Problems: Algorithms and Applications, P. M. Pardalos and L. S. Pitsoulis, Eds. Dordrecht, The Netherlands: Kluwer Academic, 2000.
17. R. T. Rockafellar and R. J.-B.Wets, "Stochastic convex programming: Kuhn-Tucker conditions," J. Math. Econom., vol. 2, pp. 349-370, 1975.
18. R. T. Rockafellar, Network Flows and Monotropic Programming. New York: Wiley, 1984.
19. S. C. Chang, R. M. James, and J. J. Shaw, "Assignment algorithms for kinetic energy weapons in boost phase defense," in Proc. 26th IEEE CDC, Los Angeles, CA, 1987, pp. 1678-1683.
20. F. A. Miercourt and R. M. Soland, "Optimal allocation of missiles against area and point defenses," Oper. Res., vol. 19, pp. 605-617, 1971.
21. R. M. Soland, "Optimal terminal defense tactics when several sequential engagements are possible," Oper. Res., pp. 537-542, 1988.
22. N. T. O'Meara and R. M. Soland, "Optimal strategies for problems of simultaneous attack against an area defense with impact point prediction," Naval Res. Logistics, vol. 39, pp. 1-28, 1992.
23. L. D. Stone, Theory of Optimal Search. New York: Academic Press, 1975.
24. L. Stone and A. Washburn, Eds., "Special issue on search theory," Naval Research Logistics, vol. 38, 1991.
25. A. Washburn and L. Thomas, "Dynamic search games," Oper. Res., vol. 39, pp. 422-425, 1991.
26. K. A. Yost, "Solution of Large-Scale Allocation Problems with Partially Observed Outcomes," Ph.D. dissertation, Naval Postgraduate School, Monterey, CA, 1998.
27. K. A. Yost and A. R.Washburn, "The LP/POMDP marriage: Optimization with imperfect information," Naval Research Logistics, vol. 47, no. 8, pp. 607-619, 2000.
28. K. A. Yost and A. R. Washburn, "Optimizing assignments of air-to-Ground assets and BDA sensors," Military Oper. Res., vol. 5, no. 2, pp. 77-91, 2000.