Efficient and distributable method for solving the multiagent plan coordination problem

DOI10.3233/MGS-2009-0134MaRDI QIDQ3400463zbMATH OpenFDO

Authors Jeffrey S. Cox, Edmund H. Durfee

Publication date 5 February 2010

Published in Multiagent and Grid Systems (Search for Journal in Brave)

zbMATH Keywords

coordination problemDistributed Constraint Optimization Problem

Mathematics Subject Classification ID

Agent technology and artificial intelligence (68T42)

Recommendations

• scientific article; zbMATH DE number 1929179
• Extending SATPLAN to multiple agents
• Plan-Coordination Mechanisms and the Price of Autonomy
• scientific article; zbMATH DE number 1773058
• Plan coordination by revision in collective agent based systems.

Cited in

(12)

• Plan coordination by revision in collective agent based systems.
• scientific article; zbMATH DE number 2222691 (Why is no real title available?)
• scientific article; zbMATH DE number 1974066 (Why is no real title available?)
• scientific article; zbMATH DE number 2080354 (Why is no real title available?)
• scientific article; zbMATH DE number 1929179 (Why is no real title available?)
• A single-agent approach to multiagent planning
• Computing convex coverage sets for multi-objective coordination graphs
• Extending SATPLAN to multiple agents
• A Bilinear Programming Approach for Multiagent Planning
• Plan decoupling of agents with qualitatively constrained tasks
• scientific article; zbMATH DE number 1773058 (Why is no real title available?)
• Plan-Coordination Mechanisms and the Price of Autonomy

This page was built for publication: Efficient and distributable method for solving the multiagent plan coordination problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3400463)