Planken, L.R.(Léon); James C. Boerkoel Jr. (2013): BDH agent problem instances. Version 1. 4TU.ResearchData. dataset. https://doi.org/10.4121/uuid:ce3ad00b-d905-4be3-8785-228ae19e371a

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.

MaSTN files for the BDH agent problems, which use Boerkoel and Durfee’s (2011) multiagent adaptation of Hunsberger’s (2002) original random STP generator. Number of agents N taken from the set {2,4,8,12,16,20}; number of external constraints X=50(N-1). 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

• http://www.aaai.org/Library/AAAI/2002/aaai02-071.php
• http://www.ifaamas.org/Proceedings/aamas2011/papers/B1_G43.pdf

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