Planken, L.R.(Léon); James C. Boerkoel Jr.; Ronald J. Wilcox (2013): WS agent problem instances. Version 1. 4TU.ResearchData. dataset. https://doi.org/10.4121/uuid:1ce5c684-dbe1-423b-8f07-91ffb32a3a62

Dataset

• Computer Software
• Distributed Computing

Distributed Incremental Partial Path Consistency, Multiagent Scheduling and Coordination, Multiagent Simple Temporal Network, Temporal Reasoning

CC BY-NC-SA 3.0

• Multiagent STN benchmark instances

RefWorks, BibTeX, Reference Manager, Endnote, DataCite, NLM, DC, CFF

by L.R.(Léon) Planken , James C. Boerkoel Jr. , Ronald J. Wilcox

MaSTN files for the WS task problems, derived from a multiagent factory scheduling domain (Wilcoxand Shah 2012). Number of agents N taken from the set {2,4,8,12,16,20}; number of tasks T=20N. Parent item: Multiagent STN benchmark instances

• 2013-03-18 first online, published, posted

MIT ‒ Massachusetts Institute of Technology; Computer Science and Artificial Intelligence Laboratory

Extended DIMACS graph format allowing infinite arc weights media types: application/zip

• https://doi.org/10.2514/6.2012-2535

MIT ‒ Massachusetts Institute of Technology; Computer Science and Artificial Intelligence Laboratory;
TU Delft - Delft University of Technology; Faculty EEMCS; Algorithmics group