Dynamic Asset Allocation Approaches for Counter-Piracy Operations

Simple item page
dc.contributor.authorAn, Woosun
dc.contributor.authorAyala, Diego Fernando Martinez
dc.contributor.authorSidoti, David
dc.contributor.authorMishra, Manisha
dc.contributor.authorHan, Xu
dc.contributor.authorPattipati, Krishna R.
dc.contributor.authorRegnier, Eva D.
dc.contributor.authorKleinman, David L.
dc.contributor.authorHansen, James A.
dc.contributor.corporateNaval Postgraduate School
dc.contributor.departmentGraduate School of Defense Management (GSDM)
dc.date2012-07
dc.date.accessioned2020-07-31T00:16:59Z
dc.date.available2020-07-31T00:16:59Z
dc.date.issued2012-07
dc.descriptionPresented at the 15th International Conference on Information Fusion held in Sinapore on 9-12 July 2012. Sponsored in part by Office of Naval Research and Office of Naval Research Global.en_US
dc.description.abstractPiracy on the high seas is a problem of world-wide concern. In response to this threat, the US Navy has developed a visualization tool known as the Pirate Attack Risk Surface (PARS) that integrates intelligence data, commercial shipping routes, and meteorological and oceanographic (METOC) information to predict regions where pirates may be present and where they may strike next. This paper proposes an algorithmic augmentation or add-on to PARS that allocates interdiction and surveillance assets so as to minimize the likelihood of a successful pirate attack over a fixed planning horizon. This augmentation, viewed as a tool for human planners, can be mapped closely to the decision support layer of the Battlespace on Demand (BonD) framework [32]. Our solution approach decomposes this NP- hard optimization problem into two sequential phases. In Phase I, we solve the problem of allocating only the interdiction assets, such that regions with high cumulative probability of attack over the planning horizon are maximally covered. In Phase II, we solve the surveillance problem, where the area not covered by interdiction assets is partitioned into non-overlapping search regions (e.g., rectangular boxes) and assigned to a set of surveillance assets to maximize the cumulative detection probability over the planning horizon. In order to overcome the curse of dimensionality associated with Dynamic Programming (DP), we propose a Gauss-Seidel algorithm coupled with a rollout strategy for the interdiction problem. For the surveillance problem, we propose a partitioning algorithm coupled with an asymmetric assignment algorithm for allocating assets to the partitioned regions. Once the surveillance assets are assigned to search regions, the search path for each asset is determined based on a specific search strategy. The proposed algorithms are illustrated using a hypothetical scenario for conducting counter- piracy operations in a given Area of Responsibility (AOR).en_US
dc.description.funderThe work reported in this paper was supported by Office of Naval Resesarch (ONR) under contract N00014-12-1-0238.en_US
dc.description.sponsorshipOffice of Naval Resesarch (ONR)en_US
dc.format.extent9 p.
dc.identifier.citationAn, Woosun, et al. "Dynamic asset allocation approaches for counter-piracy operations." 2012 15th International Conference on Information Fusion. IEEE, 2012.en_US
dc.identifier.urihttps://hdl.handle.net/10945/65269
dc.language.isoen_US
dc.publisherIEEEen_US
dc.rightsThis publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.en_US
dc.titleDynamic Asset Allocation Approaches for Counter-Piracy Operationsen_US
dc.typeConference Paperen_US
dspace.entity.typePublication
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Regnier-Kleinman-Hansen_Dynamic_Assets.pdf
Size:
1.55 MB
Format:
Adobe Portable Document Format
Download
Collections
Publications