USING CAUSAL-LINK GRAPHS TO DETECT CONFLICTS AMONG GOALS
Because of some inherent limitations, such as specifications of initial state or structures of domain actions, some goals cant be arrived together, which we call a planning task with goal conflicts.This planning task can hardly be resolved until goal conflicts are eliminated.And in such cases, people often need to know which goal conflicts a planning task contains and choose a new set of goals.In this paper, we present a technique for automatically detecting conflicts among goals by construction of a causal-link graph that captures the interactions between actions relevant to a given goal.By statically analyzing competitive preconditions of actions in a causal-link graph, we may inference which goals cant be reached together, without trying all best to resolve such an irresolvable planning task.Our method is sound and scaleable, but not complete; however, it may provide important information when people think about how to reconstruct an appropriate goal set.
Artificial intelligence Automated planning Goal conflicts Causal-link graph
DONG-NING RAO ZHI-HUA JIANG YUN-FEI JIANG
Department of Computer Science, Sun Yat-Sen University, Guangzhou 510275, P.R.China Department of Computer Science, Sun Yat-Sen University, Guangzhou 510275, P.R.China;Department of Co
国际会议
2007 International Conference on Machine Learning and Cybernetics(IEEE第六届机器学习与控制论国际会议)
香港
英文
3087-3092
2007-08-19（万方平台首次上网日期，不代表论文的发表时间）