Dynamic set-covering for real-time multiple fault diagnosis

IEEE Aerospace Conference Proceedings

Volumn , Issue , 2008, Pages

  Kodali, Anuradha ^a   Singh, Satnam ^a   Choi, Kihoon ^a   Pattipati, Krishna ^a   Namburu, Setu Madhavi ^b   Chigusa, Shunsuke ^b   Prokhorov, Danil V ^b   Qiao, Liu ^b  

^a UNIVERSITY OF CONNECTICUT   (United States)

^b TOYOTA TECHNICAL CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COLUMNS (STRUCTURAL); DECODING; DIFFERENTIAL SCANNING CALORIMETRY; DIGITAL CAMERAS; ELECTRIC FAULT CURRENTS; HEALTH; HEURISTIC ALGORITHMS; HEURISTIC PROGRAMMING; LAGRANGE MULTIPLIERS; LASER INTERFEROMETRY; MATRIX ALGEBRA; NUCLEAR PROPULSION; SOLUTIONS; TESTING; VITERBI ALGORITHM;

COUPLED SET; DIAGNOSTIC MODELING; DUALITY GAPS; DYNAMIC SET; FAULT DIAGNOSIS PROBLEM; FEASIBLE SOLUTIONS; MINIMUM COSTS; MULTIPLE FAULT DIAGNOSIS; MULTIPLE FAULTS; NP-HARD; OPTIMIZATION FRAMEWORK; PRIMAL-DUAL; REAL-WORLD; REAL-WORLD APPLICATIONS; SET COVERING PROBLEM; SET-COVERING PROBLEMS; SUB-PROBLEMS; SUBGRADIENT METHODS; SUBOPTIMALITY; TEMPORAL DEPENDENCE; TIME-DEPENDENT; VITERBI; VITERBI DECODING;

SET THEORY;

EID: 49349089742     PISSN: 1095323X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/AERO.2008.4526617     Document Type: Conference Paper

References (21)

1. V. Chvatal, "A greedy heuristic for the set covering problem," Mathematics of Operations Research, vol. 4, no. (3), pp. 233-235, 1979.
2. E. Balas and A. Ho, "Set covering algorithms using cutting planes, heuristics, and subgradient optimization: a computational study," Mathematical Programming, vol. 12, pp. 37-60, 1980.
3. J. E. Beasley, "An algorithm for set covering problem," European journal of operations research, vol. 31, pp. 85-93, 1987.
4. J. E. Beasley and K. Jornsten, "Enhancing an algorithm for set covering problems," European journal of Operations Research, vol. 58, pp. 293-300, 1992.
5. A. Caprara, M. Fischetti, and P. Toth, "Algorithms for the set covering problems," Annals of Operation Research, vol. 98, no.1-4, pp. 352-371, December 2000.
6. L. A. N. Lorena and F. B. Lopes, "A surrogate heuristic for set covering problems," European Journal of Operational Research, vol. 79, pp. 138-150, 1994.
7. J. E. Beasley and P. C. Chu, "A genetic algorithm for the set covering problem," European Journal of Operational Research, vol. 94, pp. 392-404, 1996.
8. N. Christofides and S. Korman, "A computational survey of methods for the set covering problem," Management Science, vol. 21, no. 5, January 1975.
9. E. Balas and M. C. Carrera, "A dynamic subgradient-based branch-arid-bound procedure for set covering," Operations Research, vol.44, no. 6, pp.875-890, 1996.
10. M. Rahoual, R. Hadji, and V. Bachelet, "Parallel ant system for the set covering problem," Proceedings of the Third International Workshop on Ant Algorithms, pp. 262-267, 2002.
11. D. Bertsekas, Nonlinear programming, Athena Scientific, Belmont, MA, USA, 2nd Edition, 2003.
12. J.E.Beasley, "OR-Library: distributing test problems by electronic mail", Journal of the Operational Research Society, vol. 41, no. 11, pp. 1069-1072, 1990.
13. F. Tu, K. R. Patlipati, S. Deb, and V. N. Malepati, "Multiple fault diagnosis in graph-based systems," SPIE Conference on Fault Diagnosis, Prognosis and System Health Management, Orlando, Florida, April 2002.
14. J. L. Moore, M. Folkmann, A. Balmford, T. Brooks, N. Burgess, C. Rahbek, P. H. Williams, and J. Krarup, "Heuristic and optimal solutions for set-covering problems in conservation biology," Ecography, vol. 26, pp. 595-601, 2003.
15. Y. Bejerano and R. Rastogi, "Robust monitoring of link delays and faults in IP networks," IEEE/ACM Transactions on Networking, vol. 14, no. 5, October 2006.
16. T. Sawa and L. O. Machado, "Generation of dynamically configured check lists for intra-operative problems using a set covering algorithm," J Am Med Inform Association, vol. 9, 2002.
17. N. Alon, B. Awerbuch, Y. Azar, A. Buchbinder, and J.S. Naor, "The online set cover problem," Proceedings of the thirty-fifth annual ACM symposium on Theory of computing, pp. 100-105, 2003.
18. Z. Ghahramani and M. I. Jordan, Factorial hidden Markov models, Machine Learning, Kluwer Academic Publishers, Boston, 1997.
19. S. Singh, K. Choi, A. Kodali, K. Patripati, J. Sheppard, S. M. Namburu, S. Chigusa, D. V. Prokhorov and L. Qiao, "Dynamic multiple fault diagnosis problem formulations and solution techniques," DX-07 International Workshop on Principles of Fault Diagnosis, Nashville, TN, May 2007 and also under review at the IEEE Transactions of Systems, Man and Cybernetics (SMC): Part A, August 2007.
20. M. Gary and D. Johnson, Computers and intractability: A guide to the theory of NP-completeness, Freeman, Newyork, 1979.
21. S. Singh, S. Ruan, K. Choi, K. Patripati, P. Willett, S. M. Namburu, S. Chigusa, D. V. Prokhorov and L. Qiao, "An optimization-based method for dynamic multiple fault diagnosis problem," IEEE Aerospace Conference, Big Sky, Montana, March 2007.