In this paper, we describe a new flexible framework for state space exploration based on cooperating agents. The idea is to let various agents with different search patterns explore the state space individually and communicate information about fruitful subpaths of the search tree to each other. That way very complex global search behavior is achieved with very simple local behavior. As an example agent behavior, we propose a novel anytime randomized search strategy called frustration search. The effectiveness of the framework is illustrated in the setting of priced timed automata on a number of case studies. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Rasmussen, J. I., Behrmann, G., & Larsen, K. G. (2007). Complexity in simplicity: Flexible agent-based state space exploration. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4424 LNCS, pp. 231–245). Springer Verlag. https://doi.org/10.1007/978-3-540-71209-1_19
Mendeley helps you to discover research relevant for your work.