Optimal obstacle placement with disambiguations

DOI10.1214/12-AOAS556zbMath1454.62280arXiv1201.5076MaRDI QIDQ1940016

Elvan Ceyhan, Vural Aksakalli

Publication date: 5 March 2013

Published in: The Annals of Applied Statistics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1201.5076

zbMATH Keywords

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

Mathematics Subject Classification ID

62M30: Inference from spatial processes

90C27: Combinatorial optimization

60G55: Point processes (e.g., Poisson, Cox, Hawkes processes)

Related Items

A penalty search algorithm for the obstacle neutralization problem, Optimal obstacle placement with disambiguations, An optimal algorithm for the obstacle neutralization problem, An AO^* Based Exact Algorithm for the Canadian Traveler Problem, Penalty-Based Algorithms for the Stochastic Obstacle Scene Problem

Uses Software

• S-PLUS
• spatstat
• MEMSS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Shortest paths without a map
• Probabilistic planning with clear preferences on missing information
• The Canadian Traveller Problem and its competitive analysis
• Simultaneous statistical inference. 2nd ed
• An introduction to the theory of point processes
• A likelihood-MPEC approach to target classification
• Optimal obstacle placement with disambiguations
• Patterns in spatial point locations: Local indicators of spatial association in a minefield with clutter
• The reset disambiguation policy for navigating stochastic obstacle fields
• Mixed-Effects Models in S and S-PLUS
• Hierarchical probability models and Bayesian analysis of mine locations
• A polynomial-time algorithm to find shortest paths with recourse
• Random disambiguation paths for traversing a mapped hazard field