Supervisory control of a class of discrete event processes
SIAM Journal on Control and Optimization
Distributed control using finite state automata
Distributed control using finite state automata
Theory, Volume 1, Queueing Systems
Theory, Volume 1, Queueing Systems
A conceptual framework for network and client adaptation
Mobile Networks and Applications
Simulation of sensor nodes for energy conception in wireless sensor networks using finite automata
Proceedings of the International Conference on Advances in Computing, Communication and Control
New search algorithm for randomly located objects: a non-cooperative agent based approach
CISDA'09 Proceedings of the Second IEEE international conference on Computational intelligence for security and defense applications
Modeling with non-cooperative agents: destructive search for randomly located objects
Proceedings of the 2010 Summer Computer Simulation Conference
Empirical verification of a strategy for unbounded resolution in finite player goore games
AI'06 Proceedings of the 19th Australian joint conference on Artificial Intelligence: advances in Artificial Intelligence
Towards self-optimizing protocol stack for autonomic communication: initial experience
WAC'05 Proceedings of the Second international IFIP conference on Autonomic Communication
| Hi-index | 0.00 |
A simple game provides a framework within which agents can spontaneously self-organize. In this paper, we present this game, and develop basic theory underlying a robust method for distributed coordination based on this game. This method makes use of finite state automata-one associated with each agent-which guide the agents. We give a new, general method of analysis of these systems, which previously had been studied only in limited cases. We also provide a physical example, which should hint at the type of problems resolvable using this method.