Algorithms for Generating Ordered Solutions for Explicit AND/OR Structures

by   Priyankar Ghosh, et al.

We present algorithms for generating alternative solutions for explicit acyclic AND/OR structures in non-decreasing order of cost. The proposed algorithms use a best first search technique and report the solutions using an implicit representation ordered by cost. In this paper, we present two versions of the search algorithm -- (a) an initial version of the best first search algorithm, ASG, which may present one solution more than once while generating the ordered solutions, and (b) another version, LASG, which avoids the construction of the duplicate solutions. The actual solutions can be reconstructed quickly from the implicit compact representation used. We have applied the methods on a few test domains, some of them are synthetic while the others are based on well known problems including the search space of the 5-peg Tower of Hanoi problem, the matrix-chain multiplication problem and the problem of finding secondary structure of RNA. Experimental results show the efficacy of the proposed algorithms over the existing approach. Our proposed algorithms have potential use in various domains ranging from knowledge based frameworks to service composition, where the AND/OR structure is widely used for representing problems.


page 1

page 2

page 3

page 4


Lazy Incremental Search for Efficient Replanning with Bounded Suboptimality Guarantees

We present a lazy incremental search algorithm, Lifelong-GLS (L-GLS), al...

Greedy Harmony Search Algorithm for the Hop Constrained Connected Facility Location

We present a simple, robust and efficient harmony search algorithm for t...

On the Decidability of the Ordered Structures of Numbers

The ordered structures of natural, integer, rational and real numbers ar...

A Stochastic Process Model of Classical Search

Among classical search algorithms with the same heuristic information, w...

3D Pathfinding and Collision Avoidance Using Uneven Search-space Quantization and Visual Cone Search

Pathfinding is a very popular area in computer game development. While t...

GRASP for the Coalition Structure Formation Problem

The coalition structure formation problem represents an active research ...

GRASP and path-relinking for Coalition Structure Generation

In Artificial Intelligence with Coalition Structure Generation (CSG) one...

Please sign up or login with your details

Forgot password? Click here to reset