Maintaining Arc-consistency over Mutex Relations in Planning Graphs during Search

Abstract

We deal with the search process of the GraphPlan algorithm in this paper. We concentrate on a problem of finding supports for a sub-goal which arises during the search.

We model the problem of finding supports as a constraint satisfaction problem in which arc-consistency is maintained.

Keywords

• Maintaining
• Arc-consistency
• Mutex
• Relations
• Planning
• Graphs
• during
• Search