scientific article; zbMATH DE number 1929179
From MaRDI portal
Publication:4708237
Recommendations
- Efficient and distributable method for solving the multiagent plan coordination problem
- Plan-Coordination Mechanisms and the Price of Autonomy
- Plan coordination by revision in collective agent based systems.
- Extending SATPLAN to multiple agents
- Plan decoupling of agents with qualitatively constrained tasks
Cited in
(23)- A heuristic technique for multi-agent planning
- Plan coordination by revision in collective agent based systems.
- A resource logic for multi-agent plan merging
- The multiagent planning problem
- On the complexity of planning for agent teams and its implications for single agent planning
- Multi-agent plan based information gathering
- Modelling multi-agent coordination
- Computing convex coverage sets for multi-objective coordination graphs
- Distributed heuristic forward search for multi-agent planning
- Extending SATPLAN to multiple agents
- scientific article; zbMATH DE number 3887416 (Why is no real title available?)
- Plan decoupling of agents with qualitatively constrained tasks
- Efficient and distributable method for solving the multiagent plan coordination problem
- scientific article; zbMATH DE number 4153912 (Why is no real title available?)
- Plan-Coordination Mechanisms and the Price of Autonomy
- A Bilinear Programming Approach for Multiagent Planning
- scientific article; zbMATH DE number 1948972 (Why is no real title available?)
- scientific article; zbMATH DE number 2080351 (Why is no real title available?)
- scientific article; zbMATH DE number 2080354 (Why is no real title available?)
- scientific article; zbMATH DE number 2090943 (Why is no real title available?)
- A single-agent approach to multiagent planning
- Bounded approximate decentralised coordination via the max-sum algorithm
- Agent planning programs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4708237)
