Generalized A* for Cyclic AND/OR Graphs

Supriyo Ghose

The A* algorithm has been the cornerstone of state-space search methods. Simultaneously, the vexing problem of cycles in AND/OR graphs has received considerable attention in recent times. We propose a generalization of A* to search AND/OR graphs that may contain cycles.

This page is copyrighted by AAAI. All rights reserved. Your use of this site constitutes acceptance of all of AAAI's terms and conditions and privacy policy.