Theoretical and experimental results on the goal-plan tree problem
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 3
Towards alternative approaches to reasoning about goals
DALT'07 Proceedings of the 5th international conference on Declarative agent languages and technologies V
An Alternative Approach for Reasoning about the Goal-Plan Tree Problem
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
An alternative approach for reasoning about the goal-plan tree problem
LADS'10 Proceedings of the Third international conference on Languages, methodologies, and development tools for multi-agent systems
| Hi-index | 0.00 |
Recent research has provided methods for coordinating the individually formed concurrent hierarchical plans (CHiPs) of a group of agents in a shared environment. A reasonable criticism of this technique is that the summary information can grow exponentially as it is propagated up a plan hierarchy. This paper analyzes the complexity of the coordination problem to show that in spite of this exponential growth, coordinating CHiPs at higher levels is still exponentially cheaper than at lower levels. In addition, this paper offers heuristics, including 驴fewest threats first驴 (FTF) and 驴expand most threats first驴 (EMTF), that take advantage of summary information to smartly direct the search for a global plan. Experiments show that for a particular domain these heuristics greatly improve the search for the optimal global plan compared to a 驴fewest alternatives first驴 (FAF) heuristic that has been successful in Hierarchical Task Network (HTN) Planning.