AN OPTIMAL INVESTIVATION IN TWO STAGE SEARCH WITH RECOGNITION ERRORS

DOI10.15807/JORSJ.49.130MaRDI QIDQ5490362zbMATH OpenOpenAlexFDO

Authors Toru Komiya, Koji Iida, Ryusuke Hohzaki

Publication date 4 October 2006

Published in Journal of the Operations Research Society of Japan (Search for Journal in Brave)

Full work available at URL https://doi.org/10.15807/jorsj.49.130

zbMATH Keywords

dynamic programmingsearchtwo stage search

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Search theory (90B40) Dynamic programming (90C39)

Recommendations

• scientific article; zbMATH DE number 1003301
• Optimal Two-Stage Search for Sparse Targets Using Convex Criteria
• An extended two-stage sequential optimization approach: properties and performance
• scientific article; zbMATH DE number 4102815
• Optimal comparison strategies in Ulam's searching game with two errors
• Optimal strategies for a model of combinatorial two-sided search
• scientific article; zbMATH DE number 4023173
• Two-stage models of the optimization
• Optimal order of accuracy of search algorithms in stochastic optimization

Cited in

(3)

• An optimal two-stage graphical search planning procedure for submerged targets.
• scientific article; zbMATH DE number 4102815 (Why is no real title available?)
• When is information sufficient for action? search with unreliable yet informative intelligence

This page was built for publication: AN OPTIMAL INVESTIVATION IN TWO STAGE SEARCH WITH RECOGNITION ERRORS

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5490362)