Search problems with switching costs

This article is a simple survey on search problems on a finite and linear graph, in which switching costs are considered as well as examination costs, there is no possibility of overlooking when the right vertex is searched, and the searcher is at a specified vertex at the beginning of the search. It presents a summary of papers written by the same author. Propositions are about minimax solutions and Bayes’ solutions, and they are given without proofs. It ends with brief comments on related problems which remain to be solved. [In Japanese.]