IDEAS home Printed from https://ideas.repec.org/a/wly/navres/v58y2011i4p389-399.html
   My bibliography  Save this article

The reset disambiguation policy for navigating stochastic obstacle fields

Author

Listed:
  • Vural Aksakalli
  • Donniell E. Fishkind
  • Carey E. Priebe
  • Xugang Ye

Abstract

The problem we consider is a stochastic shortest path problem in the presence of a dynamic learning capability. Specifically, a spatial arrangement of possible obstacles needs to be traversed as swiftly as possible, and the status of the obstacles may be disambiguated (at a cost) en route. No efficiently computable optimal policy is known, and many similar problems have been proven intractable. In this article, we adapt a policy which is optimal for a related problem and prove that this policy is indeed also optimal for a restricted class of instances of our problem. Otherwise, this policy is generally suboptimal but, nonetheless, it is both effective and efficiently computable. Examples/simulations are provided in a mine countermeasures application. Of central use is the Tangent Arc Graph, a polynomially sized topological superimposition of exponentially many visibility graphs. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011

Suggested Citation

  • Vural Aksakalli & Donniell E. Fishkind & Carey E. Priebe & Xugang Ye, 2011. "The reset disambiguation policy for navigating stochastic obstacle fields," Naval Research Logistics (NRL), John Wiley & Sons, vol. 58(4), pages 389-399, June.
    • Handle: RePEc:wly:navres:v:58:y:2011:i:4:p:389-399
    DOI: 10.1002/nav.20454
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nav.20454
    Download Restriction: no
    File URL: https://libkey.io/10.1002/nav.20454?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
    ---><---

    References listed on IDEAS

    as
    1. Carey E. Priebe & Donniell E. Fishkind & Lowell Abrams & Christine D. Piatko, 2005. "Random disambiguation paths for traversing a mapped hazard field," Naval Research Logistics (NRL), John Wiley & Sons, vol. 52(3), pages 285-292, April.
    2. Priebe, Carey E. & Naiman, Daniel Q. & Cope, Leslie M., 2001. "Importance sampling for spatial scan analysis: computing scan statistic p-values for marked point processes," Computational Statistics & Data Analysis, Elsevier, vol. 35(4), pages 475-485, February.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Vural Aksakalli & O. Furkan Sahin & Ibrahim Ari, 2016. "An AO* Based Exact Algorithm for the Canadian Traveler Problem," INFORMS Journal on Computing, INFORMS, vol. 28(1), pages 96-111, February.
    2. Vural Aksakalli & Ibrahim Ari, 2014. "Penalty-Based Algorithms for the Stochastic Obstacle Scene Problem," INFORMS Journal on Computing, INFORMS, vol. 26(2), pages 370-384, May.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. X Ye & D E Fishkind & L Abrams & C E Priebe, 2011. "Sensor information monotonicity in disambiguation protocols," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(1), pages 142-151, January.
    2. Carey E. Priebe & Donniell E. Fishkind & Lowell Abrams & Christine D. Piatko, 2005. "Random disambiguation paths for traversing a mapped hazard field," Naval Research Logistics (NRL), John Wiley & Sons, vol. 52(3), pages 285-292, April.
    3. Vural Aksakalli & O. Furkan Sahin & Ibrahim Ari, 2016. "An AO* Based Exact Algorithm for the Canadian Traveler Problem," INFORMS Journal on Computing, INFORMS, vol. 28(1), pages 96-111, February.
    4. Vural Aksakalli & Ibrahim Ari, 2014. "Penalty-Based Algorithms for the Stochastic Obstacle Scene Problem," INFORMS Journal on Computing, INFORMS, vol. 26(2), pages 370-384, May.
    5. Porter, Michael D. & Brown, Donald E., 2007. "Detecting local regions of change in high-dimensional criminal or terrorist point processes," Computational Statistics & Data Analysis, Elsevier, vol. 51(5), pages 2753-2768, February.

    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:wly:navres:v:58:y:2011:i:4:p:389-399. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1520-6750 .

    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.