Rendezvous Search with Examination Cost on a Finite Graph (Mathematical Theory and Applications of Uncertainty Sciences and Decision Making)
William H. Ruckle, Kensaku Kikuta · Kyoto University Research Information Repository (Kyoto University) · 2005
In a rendezvous search on a finite graph, two agents are placed randomly on nodes, At each step each moves to an adjacent node or stays where he is.It costs an amount for each step and when each agent moves from a node to an adjacent node and also when each exan ines a node.Their common purpose is to minimize the expected cost required to meet.We analyze a case where the graph is a star graph and the examination cost is the same for every node.Then we try to extend our study to the case where the graph is a star graph and the examination cost for every terminal node is the same.