Real-time bidirectional search: Coordinated problem solving in uncertain situations

Research output: Contribution to journalArticle

12 Citations (Scopus)

Abstract

This paper investigates real-time bidirectional search (RTBS) algorithms, where two problem solvers, starting from the initial and goal states, physically move toward each other. To evaluate the RTBS performance, two kinds of algorithms are proposed and are compared to real-time unidirectional search. One is called centralized RTBS where a supervisor always selects the best action from all possible moves of the two problem solvers. The other is called decoupled RTBS where no supervisor exists and the two problem solvers independently select their next moves. Experiments on mazes and n-puzzles 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 real-time unidirectional search for 15-and 24-puzzles but not for randomly generated mazes. It will be shown that the selection of the problem solving organization is the selection of the problem space, which determines the baseline of the organizational efficiency; once a difficult problem space is selected, the local coordination among problem solvers hardly overcome the deficit.

Original languageEnglish
Pages (from-to)617-628
Number of pages12
JournalIEEE Transactions on Pattern Analysis and Machine Intelligence
Volume18
Issue number6
DOIs
Publication statusPublished - 1996 Dec 1
Externally publishedYes

Fingerprint

Supervisory personnel
Real-time
Experiments
Search Algorithm
Baseline
Evaluate

Keywords

  • Bidirectional search
  • Heuristic depression
  • Organizational problem solving
  • Problem solving
  • Real-time problem solving
  • Real-time search
  • Search

ASJC Scopus subject areas

  • Software
  • Computer Vision and Pattern Recognition
  • Computational Theory and Mathematics
  • Artificial Intelligence
  • Applied Mathematics

Cite this

@article{a68ca5baa8f54a9ca4250d0f222acb24,
title = "Real-time bidirectional search: Coordinated problem solving in uncertain situations",
abstract = "This paper investigates real-time bidirectional search (RTBS) algorithms, where two problem solvers, starting from the initial and goal states, physically move toward each other. To evaluate the RTBS performance, two kinds of algorithms are proposed and are compared to real-time unidirectional search. One is called centralized RTBS where a supervisor always selects the best action from all possible moves of the two problem solvers. The other is called decoupled RTBS where no supervisor exists and the two problem solvers independently select their next moves. Experiments on mazes and n-puzzles 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 real-time unidirectional search for 15-and 24-puzzles but not for randomly generated mazes. It will be shown that the selection of the problem solving organization is the selection of the problem space, which determines the baseline of the organizational efficiency; once a difficult problem space is selected, the local coordination among problem solvers hardly overcome the deficit.",
keywords = "Bidirectional search, Heuristic depression, Organizational problem solving, Problem solving, Real-time problem solving, Real-time search, Search",
author = "Toru Ishida",
year = "1996",
month = "12",
day = "1",
doi = "10.1109/34.506412",
language = "English",
volume = "18",
pages = "617--628",
journal = "IEEE Transactions on Pattern Analysis and Machine Intelligence",
issn = "0162-8828",
publisher = "IEEE Computer Society",
number = "6",

}

TY - JOUR

T1 - Real-time bidirectional search

T2 - Coordinated problem solving in uncertain situations

AU - Ishida, Toru

PY - 1996/12/1

Y1 - 1996/12/1

N2 - This paper investigates real-time bidirectional search (RTBS) algorithms, where two problem solvers, starting from the initial and goal states, physically move toward each other. To evaluate the RTBS performance, two kinds of algorithms are proposed and are compared to real-time unidirectional search. One is called centralized RTBS where a supervisor always selects the best action from all possible moves of the two problem solvers. The other is called decoupled RTBS where no supervisor exists and the two problem solvers independently select their next moves. Experiments on mazes and n-puzzles 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 real-time unidirectional search for 15-and 24-puzzles but not for randomly generated mazes. It will be shown that the selection of the problem solving organization is the selection of the problem space, which determines the baseline of the organizational efficiency; once a difficult problem space is selected, the local coordination among problem solvers hardly overcome the deficit.

AB - This paper investigates real-time bidirectional search (RTBS) algorithms, where two problem solvers, starting from the initial and goal states, physically move toward each other. To evaluate the RTBS performance, two kinds of algorithms are proposed and are compared to real-time unidirectional search. One is called centralized RTBS where a supervisor always selects the best action from all possible moves of the two problem solvers. The other is called decoupled RTBS where no supervisor exists and the two problem solvers independently select their next moves. Experiments on mazes and n-puzzles 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 real-time unidirectional search for 15-and 24-puzzles but not for randomly generated mazes. It will be shown that the selection of the problem solving organization is the selection of the problem space, which determines the baseline of the organizational efficiency; once a difficult problem space is selected, the local coordination among problem solvers hardly overcome the deficit.

KW - Bidirectional search

KW - Heuristic depression

KW - Organizational problem solving

KW - Problem solving

KW - Real-time problem solving

KW - Real-time search

KW - Search

UR - http://www.scopus.com/inward/record.url?scp=0030168653&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0030168653&partnerID=8YFLogxK

U2 - 10.1109/34.506412

DO - 10.1109/34.506412

M3 - Article

AN - SCOPUS:0030168653

VL - 18

SP - 617

EP - 628

JO - IEEE Transactions on Pattern Analysis and Machine Intelligence

JF - IEEE Transactions on Pattern Analysis and Machine Intelligence

SN - 0162-8828

IS - 6

ER -