Optimal obstacle placement with disambiguations

DOI10.1214/12-AOAS556zbMath1454.62280arXiv1201.5076OpenAlexW3099274836MaRDI 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 optimizationspatial point processCanadian traveler's problemrepeated measures analysis of variancestochastic obstacle scene

Mathematics Subject Classification ID

Inference from spatial processes (62M30) Combinatorial optimization (90C27) Point processes (e.g., Poisson, Cox, Hawkes processes) (60G55)

Related Items (5)

An optimal algorithm for the obstacle neutralization problem ⋮ A penalty search algorithm for the obstacle neutralization problem ⋮ Optimal obstacle placement with disambiguations ⋮ Penalty-Based Algorithms for the Stochastic Obstacle Scene Problem ⋮ An AO^* Based Exact Algorithm for the Canadian Traveler 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

This page was built for publication: Optimal obstacle placement with disambiguations