A planning problem is k-dependent if each action has at most k pre-conditions on variables unaffected by the action. This concept is well-founded since k is a constant for all but...
Some domains, such as real-time strategy (RTS) games, pose several challenges to traditional planning and machine learning techniques. In this paper, we present a novel on-line ca...
This paper investigates decision-theoretic planning in sophisticated autonomous agents operating in environments of real-world complexity. An example might be a planetary rover ex...
This paper studies the problem of multi-agent planning in the environment where agents may need to cooperate in order to achieve their individual goals but they do so only if the c...
Wei Huang, Dongmo Zhang, Yan Zhang, Laurent Perrus...
Planning techniques recorded a significant progress during recent years. However, many planning problems remain still hard even for modern planners. One of the most promising appro...