Optimal obstacle placement with disambiguations

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.

[1]  Rupert G. Miller.  Simultaneous Statistical Inference , 1966 .

[2]  D. C. Howell.  Fundamental Statistics for the Behavioral Sciences , 1985 .

[3]  Mihalis Yannakakis,et al.  Shortest Paths Without a Map , 1989, Theor. Comput. Sci..

[4]  Noel A Cressie,et al.  Statistics for Spatial Data. , 1992 .

[5]  Mike Rees,et al.  5. Statistics for Spatial Data , 1993 .

[6]  Robert R. Muise,et al.  Linear density algorithm for patterned minefield detection , 1995, Defense, Security, and Sensing.

[7]  Ned H. Witherspoon,et al.  Coastal battlefield reconnaissance and analysis program for minefield detection , 1995, Defense, Security, and Sensing.

[8]  Carey E. Priebe,et al.  Exploiting stochastic partitions for minefield detection , 1997, Defense, Security, and Sensing.

[9]  R. Kuehl.  Design of Experiments: Statistical Principles of Research Design and Analysis , 1999 .

[10]  N. Cressie,et al.  Hierarchical probability models and Bayesian analysis of mine locations , 2000, Advances in Applied Probability.

[11]  Mark Anderson,et al.  Design of Experiments: Statistical Principles of Research Design and Analysis , 2001, Technometrics.

[12]  V. Carey,et al.  Mixed-Effects Models in S and S-Plus , 2001 .

[13]  Noel A Cressie,et al.  Patterns in spatial point locations: Local indicators of spatial association in a minefield with clutter , 2001 .

[14]  Adrian E. Raftery,et al.  Detecting Mines in Minefields With Linear Characteristics , 2002, Technometrics.

[15]  Carey E. Priebe,et al.  A likelihood-MPEC approach to target classification , 2003, Math. Program..

[16]  David R. Anderson,et al.  Model selection and multimodel inference : a practical information-theoretic approach , 2003 .

[17]  J. Scott Provan,et al.  A polynomial‐time algorithm to find shortest paths with recourse , 2003, Networks.

[18]  C. Priebe,et al.  Random disambiguation paths for traversing a mapped hazard field , 2005 .

[19]  Adrian Baddeley,et al.  spatstat: An R Package for Analyzing Spatial Point Patterns , 2005 .

[20]  Barbara G. Tabachnick,et al.  Experimental designs using ANOVA , 2006 .

[21]  Carey E. Priebe,et al.  Disambiguation Protocols Based on Risk Simulation , 2007, IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans.

[22]  R. Waagepetersen,et al.  Modern Statistics for Spatial Point Processes * , 2007 .

[23]  Vural Aksakalli,et al.  The BAO* algorithm for stochastic shortest path problems with dynamic learning , 2007, 2007 46th IEEE Conference on Decision and Control.

[24]  Ranga Muhandiramge.  Maritime manoeuvring optimization: path planning in minefield threat environments , 2008 .

[25]  David R. Karger,et al.  Route Planning under Uncertainty: The Canadian Traveller Problem , 2008, AAAI.

[26]  Anthony Stentz,et al.  Probabilistic planning with clear preferences on missing information , 2009, Artif. Intell..

[27]  Yin-Feng Xu,et al.  The canadian traveller problem and its competitive analysis , 2009, J. Comb. Optim..

[28]  D. Parkinson,et al.  Bayesian Methods in Cosmology: Model selection and multi-model inference , 2009 .

[29]  Zhe Jiang,et al.  Spatial Statistics , 2013 .

[30]  Malte Helmert,et al.  High-Quality Policies for the Canadian Traveler's Problem , 2010, SOCS.

[31]  Xugang Ye,et al.  A Graph-Search Based Navigation Algorithm for Traversing A Potentially Hazardous Area with Disambiguation , 2010, Int. J. Oper. Res. Inf. Syst..

[32]  Xugang Ye,et al.  Sensor information monotonicity in disambiguation protocols , 2011, J. Oper. Res. Soc..

[33]  C. Priebe,et al.  The reset disambiguation policy for navigating stochastic obstacle fields , 2011 .