Dynamic cooperation using resource based planning
Abstract
References
Recommendations
On the complexity of planning for agent teams and its implications for single agent planning
If the complexity of planning for a single agent is described by some function f of the input, how much more difficult is it to plan for a team of n cooperating agents? If these agents are completely independent, we can simply solve n single agent ...
Multi-agent planning by plan reuse
AAMAS '13: Proceedings of the 2013 international conference on Autonomous agents and multi-agent systemsGenerating plans for a single agent has been shown to be a difficult task. If we generalize to a multi-agent setting, the problem becomes exponentially harder in general. The centralized approach where a plan is jointly generated for all agents is only ...
Theoretic study of distributed graph planning
AAMAS '09: Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2In situations where it needs the actions of different agents to accomplish a task, the planning for the task involves selecting and organizing the actions belonging to multiple agents. Most existing multi-agent planning approaches to solving such a ...
Comments
Information & Contributors
Information
Published In
- General Chairs:
- Hideyuki Nakashima,
- Michael Wellman,
- Program Chairs:
- Gerhard Weiss,
- Peter Stone
Sponsors
- IFMAS: The International Foundation for Multiagent Systems
- SIGAI: ACM Special Interest Group on Artificial Intelligence
- ATAL: The International Workshop on Agent Theories, Architectures, and Languages
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Author Tags
Qualifiers
- Article
Conference
- IFMAS
- SIGAI
- ATAL
Acceptance Rates
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 229Total Downloads
- Downloads (Last 12 months)1
- Downloads (Last 6 weeks)0
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in