Invited Paper: One Bit Agent Memory is Enough for Snap-Stabilizing Perpetual Exploration of Cactus Graphs with Distinguishable Cycles.
Kohei ShimoyamaYuichi SudoHirotsugu KakugawaToshimitsu MasuzawaPublished in: SSS (2022)
Keyphrases
- invited paper
- exploration strategy
- multi agent
- action selection
- multi agent systems
- random access memory
- intelligent agents
- software agents
- multiagent systems
- autonomous agents
- agent model
- decision making
- mobile agents
- main memory
- graph matching
- agent architecture
- agent technology
- autonomous learning
- multiple agents
- reinforcement learning
- virtual memory
- past experience
- graph databases
- graph mining
- graph theory
- dynamic environments
- data analysis
- computer science
- dynamically created