skip to main content
research-article

CORALS: A real-time planner for anti-air defense operations

Published:03 December 2010Publication History
Skip Abstract Section

Abstract

Forces involved in modern conflicts may be exposed to a variety of threats, including coordinated raids of advanced ballistic and cruise missiles. To respond to these, a defending force will rely on a set of combat resources. Determining an efficient allocation and coordinated use of these resources, particularly in the case of multiple simultaneous attacks, is a very complex decision-making process in which a huge amount of data must be dealt with under uncertainty and time pressure. This article presents CORALS (COmbat Resource ALlocation Support), a real-time planner developed to support the command team of a naval force defending against multiple simultaneous threats. In response to such multiple threats, CORALS uses a local planner to generate a set of local plans, one for each threat considered apart, and then combines and coordinates them into a single optimized, conflict-free global plan. The coordination is performed through an iterative process of plan merging and conflict detection and resolution, which acts as a plan repair mechanism. Such an incremental plan repair approach also allows adapting previously generated plans to account for dynamic changes in the tactical situation.

References

  1. Ahuja, K., Kumar, A., Jha, K., and Orlin, J. 2003. Exact and heuristic algorithms for the weapon target assignment problem. MIT Sloan Working Paper No. 4464-03.Google ScholarGoogle Scholar
  2. Benaskeur, A., Kabanza, F., Beaudry, E., and Beaudoin, M. 2008. A probabilistic planner for the combat power management problem. In Proceedings of the International Conference on Automated Planning and Scheduling (ICAPS). 12--19.Google ScholarGoogle Scholar
  3. Bertsekas, D., Homer, M., Logan, D., Patek, S., and Sandell, N. 1999. Missile defence and interceptor allocation by neuro-dynamic programming. IEEE Trans. Sys. Man Cybernet. A 30, 1, 42--51. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Bohachevsky, I. and Johnson, M. 1993. Optimal deployment of missile interceptors. Amer. J. Math. and Manag. Sci. 13, 1-2, 53--82. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Bos, J., Rehak, L., Keeble, A., and Lamoureaux, T. 2005. Tactical planning and response management: Investigating a cognitive work analysis approach to the development of support concepts. Tech. rep., DRDC Atlantic.Google ScholarGoogle Scholar
  6. Brucker, P. and Knust, S. 2006. Complex Scheduling. Springer. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Buffet, O. and Aberdeen, D. 2006. The factored policy gradient planner. In 5th International Planning Competition.Google ScholarGoogle Scholar
  8. Estlin, F. F. T., Mutz, D., and Chien, S. 1999. Artificial intelligence planning to generate antenna tracking plans. In Proceedings of the Conference on Innovative Applications of Artificial Intelligence (IAAI). 856--863. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Fox, M. and Long, D. 2003. PDDL 2.1: An extension to PDDL for expressing temporal planning domains. J. Artif. Intel. Res. 20, 61--124. Google ScholarGoogle ScholarCross RefCross Ref
  10. Hadj-Alouane, A., Bean, J., and Murty, K. 1999. A hybrid genetic/optimization algorithm for a task allocation problem. J. Schedul. 2, 189--201.Google ScholarGoogle ScholarCross RefCross Ref
  11. Hoffmann, J. and Nebel, B. 2001. The ff planning system: Fast plan generation through heuristic search. J. Artif. Intel. Res. 14, 253--302. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Hosein, P. and Athans, M. 1990. Some analytical results for the dynamic weapon-target allocation problem. Naval Res. Logis. J.Google ScholarGoogle Scholar
  13. Lloyd, S. and Witsenhausen, H. 1986. Weapons allocation is np-complete. In Proceedings of the IEEE Summer Conference on Simulation.Google ScholarGoogle Scholar
  14. Matlin, S. 1970. A review of the literature of the missile-allocation problem. Oper. Res. 334--373.Google ScholarGoogle Scholar
  15. Mausam and Weld, D. S. 2006. Probabilistic temporal planning with uncertain durations. In Proceedings of the National Conference on Artificial Intelligence (AAAI). Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. Meuleau, N., Hauskrecht, M., Kim, K.-E., Peshkin, L., Kaelbling, L., Dean, T., and Boutilier, C. 1998. 15th national conference on artificial intelligence (AAAI). Oper. Res. 165--172. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Ousborne, D. 1993. Ship self-defence against air threats. Johns Hopkins APL Tech. Digest 12, (2):125-140.Google ScholarGoogle Scholar
  18. Younes, H. and Simmons, R. 2004. Policy generation for continuous-time stochastic domains with concurrency. In Proceedings of the International Conference on Automated Planning and Scheduling (ICAPS). 325--334.Google ScholarGoogle Scholar

Index Terms

  1. CORALS: A real-time planner for anti-air defense operations

              Recommendations

              Comments

              Login options

              Check if you have access through your login credentials or your institution to get full access on this article.

              Sign in

              Full Access

              • Published in

                cover image ACM Transactions on Intelligent Systems and Technology
                ACM Transactions on Intelligent Systems and Technology  Volume 1, Issue 2
                November 2010
                153 pages
                ISSN:2157-6904
                EISSN:2157-6912
                DOI:10.1145/1869397
                Issue’s Table of Contents

                Copyright © 2010 ACM

                Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

                Publisher

                Association for Computing Machinery

                New York, NY, United States

                Publication History

                • Published: 3 December 2010
                • Accepted: 1 July 2010
                • Revised: 1 June 2010
                • Received: 1 March 2010
                Published in tist Volume 1, Issue 2

                Permissions

                Request permissions about this article.

                Request Permissions

                Check for updates

                Qualifiers

                • research-article
                • Research
                • Refereed

              PDF Format

              View or Download as a PDF file.

              PDF

              eReader

              View online with eReader.

              eReader