Abstract We study routing and searching decisions of a search-and-detection (SDT) team on road network under online uncertainty setting. Given an undirected edge-weighted bounded graph, static target is positioned at unknown vertex among potential vertices in the graph. A non-negative search cost given each vertices. The detected once SDT searches its corresponding vertex. There may be some non...