IDEAS home Printed from https://ideas.repec.org/a/taf/uiiexx/v43y2011i8p566-574.html
   My bibliography  Save this article

Security agent allocation to partially observable heterogeneous frontier segments

Author

Listed:
  • Michael Hassoun
  • Gad Rabinowitz
  • Noam Reshef

Abstract

This article proposes a stochastic attention allocation and reactive scheduling model to prevent illegal border crossings. To intercept infiltrators, a limited pool of security agents is dynamically assigned to heterogeneous frontier segments that transmit erratic signals of crossing attempts by independent trespassers. The frontier segments may differ in terms of rates of crossing attempts, ease of crossing, and reliability of the detection systems. Due to the huge complexity of the agent scheduling decision, a relaxed Markovian model is proposed whose solution is a set of optimal steady-state allocation rates for sending security agents to any frontier segment where a crossing attempt is apparently taking place. This solution is used to derive a heuristic policy for dispatching security agents among the frontier segments based on the evolving signals. Simulation experiments demonstrate that the proposed heuristic outperforms other scheduling policies. Border crossing is just one example of a viable application for this attention allocation model, which can be extended and customized for a wide variety of other scenarios.

Suggested Citation

  • Michael Hassoun & Gad Rabinowitz & Noam Reshef, 2011. "Security agent allocation to partially observable heterogeneous frontier segments," IISE Transactions, Taylor & Francis Journals, vol. 43(8), pages 566-574.
  • Handle: RePEc:taf:uiiexx:v:43:y:2011:i:8:p:566-574
    DOI: 10.1080/0740817X.2010.532852
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/0740817X.2010.532852
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/0740817X.2010.532852?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:taf:uiiexx:v:43:y:2011:i:8:p:566-574. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/uiie .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.