The Annals of Applied Statistics

Optimal obstacle placement with disambiguations

Vural Aksakalli and Elvan Ceyhan

Full-text: Open access

Abstract

We introduce the optimal obstacle placement with disambiguations problem wherein the goal is to place true obstacles in an environment cluttered with false obstacles so as to maximize the total traversal length of a navigating agent (NAVA). Prior to the traversal, the NAVA is given location information and probabilistic estimates of each disk-shaped hindrance (hereinafter referred to as disk) being a true obstacle. The NAVA can disambiguate a disk’s status only when situated on its boundary. There exists an obstacle placing agent (OPA) that locates obstacles prior to the NAVA’s traversal. The goal of the OPA is to place true obstacles in between the clutter in such a way that the NAVA’s traversal length is maximized in a game-theoretic sense. We assume the OPA knows the clutter spatial distribution type, but not the exact locations of clutter disks. We analyze the traversal length using repeated measures analysis of variance for various obstacle number, obstacle placing scheme and clutter spatial distribution type combinations in order to identify the optimal combination. Our results indicate that as the clutter becomes more regular (clustered), the NAVA’s traversal length gets longer (shorter). On the other hand, the traversal length tends to follow a concave-down trend as the number of obstacles increases. We also provide a case study on a real-world maritime minefield data set.

Article information

Source
Ann. Appl. Stat., Volume 6, Number 4 (2012), 1730-1774.

Dates
First available in Project Euclid: 27 December 2012

Permanent link to this document
https://projecteuclid.org/euclid.aoas/1356629058

Digital Object Identifier
doi:10.1214/12-AOAS556

Mathematical Reviews number (MathSciNet)
MR3058682

Zentralblatt MATH identifier
06141546

Keywords
Canadian traveler’s problem repeated measures analysis of variance spatial point process stochastic optimization stochastic obstacle scene

Citation

Aksakalli, Vural; Ceyhan, Elvan. Optimal obstacle placement with disambiguations. Ann. Appl. Stat. 6 (2012), no. 4, 1730--1774. doi:10.1214/12-AOAS556. https://projecteuclid.org/euclid.aoas/1356629058


Export citation

References

  • Aksakalli, V. (2007). The $BAO^*$ algorithm for stochastic shortest path problems with dynamic learning. In Proceedings of IEEE Conference on Decision and Control, New Orleans.
  • Aksakalli, V. and Ceyhan, E. (2012). Optimal obstacle placement with disambiguations. Technical Report #SEHIR-IE-VA-12-1, Istanbul Şehir University, Istanbul 34662, Turkey. Available at arXiv:1201.5076 [stat.AP].
  • Aksakalli, V., Fishkind, D. E., Priebe, C. E. and Ye, X. (2011). The reset disambiguation policy for navigating stochastic obstacle fields. Naval Res. Logist. 58 389–399.
  • Baddeley, A. (2010). Analysing spatial point patterns in R. Workshop notes Ver. 4.1.
  • Baddeley, A. and Turner, R. (2005). Spatstat: An R package for analyzing spatial point patterns. Journal of Statistical Software 12 1–42.
  • Burnham, K. P. and Anderson, D. (2003). Model Selection and Multi-Model Inference. Springer, New York.
  • Cressie, N. A. C. (1993). Statistics for Spatial Data. Wiley, New York.
  • Cressie, N. and Collins, L. B. (2001). Patterns in spatial point locations: Local indicators of spatial association in a minefield with clutter. Naval Res. Logist. 48 333–347.
  • Cressie, N. and Lawson, A. B. (2000). Hierarchical probability models and Bayesian analysis of mine locations. Adv. in Appl. Probab. 32 315–330.
  • Daley, D. J. and Vere-Jones, D. (2002). An Introduction to the Theory of Point Processes, 2nd ed. Springer, New York.
  • Eyerich, P., Keller, T. and Helmert, M. (2009). High-quality policies for the Canadian traveler’s problem. In Proceedings of the 24th AAAI Conference on Artificial Intelligence, Atlanta, Georgia.
  • Fishkind, D. E., Priebe, C. E., Giles, K., Smith, L. N. and Aksakalli, V. (2007). Disambiguation protocols based on risk simulation. IEEE Transactions on Systems, Man, and Cybernetics, Part A 37 814–823.
  • Howell, D. C. (2010). Fundamental Statistics for the Behavioral Sciences. Wadsworth Publishing, Belmont, CA.
  • Kuehl, R. O. (2000). Design of Experiments: Statistical Principles of Research Design and Analysis, 2nd ed. Brooks/Cole, Pacific Grove, CA.
  • Likhachev, M. and Stentz, A. (2009). Probabilistic planning with clear preferences on missing information. Artificial Intelligence 173 696–721.
  • Miller, R. G. Jr. (1981). Simultaneous Statistical Inference, 2nd ed. Springer, New York.
  • Møller, J. and Waagepetersen, R. P. (2007). Modern statistics for spatial point processes. Scand. J. Stat. 34 643–684.
  • Muhandiramge, R. (2008). Maritime manoeuvring optimization: Path planning in minefield threat environments. Ph.D. thesis, Univ. Western Australia.
  • Muise, R. R. and Smith, C. M. (1995). A linear density algorithm for patterned minefield detection. Proceedings of the SPIE 2496 586–593.
  • Nikolova, E. and Karger, D. R. (2008). Route planning under uncertainty: The Canadian traveller problem. In Proceedings of the 23rd AAAI Conference on Artificial Intelligence, Chicago, Illinois.
  • Olson, T., Pang, J.-S. and Priebe, C. (2003). A likelihood-MPEC approach to target classification. Math. Program. 96 1–31.
  • Papadimitriou, C. H. and Yannakakis, M. (1991). Shortest paths without a map. Theoret. Comput. Sci. 84 127–150.
  • Pinheiro, J. C. and Bates, D. M. (2000). Mixed-Effects Models in S and S-PLUS. Springer, New York.
  • Priebe, C. E., Olson, T. E. and Healy, D. M. (1997). Exploiting stochastic partitions for minefield detection. Proceedings of the SPIE 3079 508–518.
  • Priebe, C. E., Fishkind, D. E., Abrams, L. and Piatko, C. D. (2005). Random disambiguation paths for traversing a mapped hazard field. Naval Res. Logist. 52 285–292.
  • Provan, J. S. (2003). A polynomial-time algorithm to find shortest paths with recourse. Networks 41 115–125.
  • Rippley, B. D. (2004). Spatial Statistics. Wiley, Hoboken, NJ.
  • Tabachnick, G. G. and Fidell, L. S. (2006). Experimental Designs Using ANOVA. Duxbury, Belmont, CA.
  • Walsh, D. C. I. and Raftery, A. E. (2002). Detecting mines in minefields with linear characteristics. Technometrics 44 34–44.
  • Witherspoon, N. H., Holloway, J. H., Davis, K. S., Miller, R. W. and Dubey, A. C. (1995). The coastal battlefield reconnaissance and analysis (COBRA) program for minefield detection. Proceedings of the SPIE 2496 500–508.
  • Xu, Y., Hu, M., Su, B., Zhu, B. and Zhu, Z. (2009). The Canadian traveller problem and its competitive analysis. J. Comb. Optim. 18 195–205.
  • Ye, X., Fishkind, D. E. and Priebe, C. E. (2011). Sensor information monotonicity in disambiguation protocols. Journal of the Operational Research Society 62 142–151.
  • Ye, X. and Priebe, C. E. (2010). A graph-search based navigation algorithm for traversing a potentially hazardous area with disambiguation. International Journal of Operations Research and Information Systems 1 14–27.