Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Learning action models from plan examples using weighted MAX-SAT
Artificial Intelligence
Efficient learning of action schemas and web-service descriptions
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 2
New inference rules for Max-SAT
Journal of Artificial Intelligence Research
Learning subjective representations for planning
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Learning partially observable deterministic action models
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Learning HTN method preconditions and action models from partial observations
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
A general, fully distributed multi-agent planning algorithm
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Learning complex action models with quantifiers and logical implications
Artificial Intelligence
| Hi-index | 0.00 |
In multi-agent planning environments, action models for each agent must be given as input. However, creating such action models by hand is difficult and time-consuming, because it requires formally representing the complex relationships among different objects in the environment. The problem is compounded in multi-agent environments where agents can take more types of actions. In this paper, we present an algorithm to learn action models for multi-agent planning systems from a set of input plan traces. Our learning algorithm Lammas automatically generates three kinds of constraints: (1) constraints on the interactions between agents, (2) constraints on the correctness of the action models for each individual agent, and (3) constraints on actions themselves. Lammas attempts to satisfy these constraints simultaneously using a weighted maximum satisfiability model known as MAX-SAT, and converts the solution into action models. We believe this to be one of the first learning algorithms to learn action models in the context of multi-agent planning environments. We empirically demonstrate that Lammas performs effectively and efficiently in several planning domains.