Virtual Manufacturing Automation Competition: Historical Overview

A DeltaSpark publication. Not affiliated with the original Virtual Manufacturing Automation Competition or its organizers.

The Virtual Manufacturing Automation Competition (VMAC) used simulated manufacturing tasks to study robot planning and performance. This is a newly written historical reference, published in 2026. It connects surviving records; it is not a restored competition website, an event announcement, or a complete archive.

For the old test-case address and the distinction between 2010 examples and the unverified 2011 package, use the test-case source and availability guide.

What the surviving records establish

NIST’s January 2010 announcement described mixed-size box stacking, identified this domain as the information site, and discussed evaluating pallet quality. It announced a planned competition and demonstration. That announcement alone does not establish who later attended or which demonstration was completed.

The IEEE-hosted ICRA 2013 page describes two tracks: planning mixed pallets and moving completed pallets through a simulated warehouse. XML, Pallet Viewer, and USARSim appear in its description. These are historical task descriptions, not current software compatibility statements.

A timeline with different kinds of evidence

Record	Date or subject year	What you can establish	What it cannot establish
NIST announcement	January 26, 2010	Historical purpose and the domain’s role	Final results or a complete file inventory
Pallet Viewer ReadMe	Identifies ICRA VMAC 2010	The software’s stated competition context	That its examples are the 2011 distribution
Participant account	May 21, 2012; refers to 2011 cases	A participant’s use of the older test-case link	Completeness, checksums, or organizer approval of a recovered package
IEEE ICRA page	2013	Challenge scope for that conference	Availability of every linked tool or download today

The participant account and the software repository answer different questions. The former helps identify a missing resource; the latter contains inspectable related code and example files. Matching subject matter is insufficient to equate their versions.

What a reader can access now

The four source pages are accessible, and we inspected the repository’s ReadMe, copyright notice, and two example order/packing-list pairs. We have not established a complete original 2011 test-case distribution. We have not executed the historical software or reproduced competition scores.

The file availability table names the files inspected and separates them from missing material. Links lead to the source holders. This publication does not offer an authenticated official archive download.

Reading historical performance material

Keep the inputs, evaluator, and rules together when interpreting a reported result. A packing algorithm may optimize one set of objectives while assuming a particular arrival sequence or permitted box rotation. That result does not establish the performance of a modern robot, gripper, or packaging line.

If you are evaluating a present-day project, the simulation guide explains how to document model assumptions and compare outputs with physical observations. It does not turn historical competition results into acceptance criteria.

Help improve this reference

Use the current publication contact page to submit a source URL, dated file, release note, or correction. For a file, include its original filename, where and when it was obtained, and any redistribution permission. Please identify whether the item is an organizer release, a participant copy, or a later modification. Those distinctions determine how we can describe it.

The broader research index separates historical records from current planning resources.