Abstract:
This paper investigates real-time bidirectional search (RTBS) algorithms, where two problem solving agents, starting from the initial and goal states, physically move toward each other. To evaluate the RTBS performance, two kinds of algorithms, centralized RTBS and decoupled RTBS, are proposed and axe compared to real-time unidirectional search (RTUS). Experiments on mazes and n-puzales show that (1) in clear situations decoupled RTBS performs better, while in uncertain situations, centralized RTBS becomes more efficient, and that (2) RTBS is more efficient than RTUS for 15- and 24-puzzles but not for randomly generated mazes. It will be shown that the selection of the multi-agent organization is the selection of the problem space, which determines the baseline of the ozgamizational efficiency; once a difficult problem space is selected, the local coordination among problem solvers hardly overcomes the deficit.