SYMMETRICAL CONNECTION PROBLEMS AND THEIR SOLUTION BY BIDIRECTIONAL SEARCH

被引：1

作者：

MULLER, D

机构：

[1] Institut für Informatik, Universität Hannover, Welfengarten 1, Hannover

来源：

INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS | 1990年 / 37卷 / 3-4期

关键词：

BIDIRECTIONAL SEARCH; OPTIMALITY THEOREM; PASSENGER INFORMATION SYSTEMS;

D O I：

10.1080/00207169008803942

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

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 problem. A modified ordered search algorithm SCO* is discussed. This algorithm is admissible if the heuristic estimate used is an optimistic one. © 1990, Taylor & Francis Group, LLC. All rights reserved.

引用

页码：137 / 152

页数：16