Abstract
A special search problem, the symmetric connection problem arising in passenger information systems, is defined formally. Bidirectional search is a natural solution strategy for this probiem. A modified ordered search algorithm SCO∗ is discussed. This algorithm is admissible if the heuristic estimate used is an oplimistic one.
C.R. Categories: