As increasingly large-scale multiagent simulations are being implemented, new methods are becoming necessary to make sense of the results of these simulations. Even concisely summarizing the results of a given simulation run is a challenge. Here we pose this as the problem of simulation summarization: how to extract the causally-relevant descriptions of the trajectories of the agents in the simulation. We present a simple algorithm to compress agent trajectories through state space by identifying the state transitions which are relevant to determining the distribution of outcomes at the end of the simulation. We present a toyexample to illustrate the working of the algorithm, and then apply it to a complex simulation of a major disaster in an urban area.
CITATION STYLE
Parikh, N., Marathe, M., & Swarup, S. (2016). Summarizing simulation results using causally-relevant states. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10003 LNAI, pp. 88–103). Springer Verlag. https://doi.org/10.1007/978-3-319-46840-2_6
Mendeley helps you to discover research relevant for your work.