Inter-agent cooperative communication method using TupleSpace for guiding users to alternative actions

Authors:
Nobuo Sato;Kazumasa Takami
Affiliations:
Graduate School of Engineering, Soka University, Hachioji-shi, Tokyo, Japan;Graduate School of Engineering, Soka University, Hachioji-shi, Tokyo, Japan
Venue:
NEW2AN'11/ruSMART'11 Proceedings of the 11th international conference and 4th international conference on Smart spaces and next generation wired/wireless networking
Year:
2011

Citing 5
Cited 0

Linda implementations in Java for concurrent systems: Research Articles

Concurrency and Computation: Practice & Experience
Navitime: Supporting Pedestrian Navigation in the Real World

IEEE Pervasive Computing
Multi-level Experience Retrieval for the Personal Lifelog Media System

SITIS '07 Proceedings of the 2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System
Modeling and Analyzing Individual's Daily Activities using Lifelog

ICESS '08 Proceedings of the 2008 International Conference on Embedded Software and Systems
dRuby and Rinda: implementation and application of distributed Ruby and its parallel coordination mechanism

International Journal of Parallel Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose an agent construction method that can identify action models from user action histories, propose alternative actions if users encounter situations different from their normal action models, and guide the users to those alternative actions. In addition, to realize an alternative action guidance service, we present a selection of terminal agents and network agents as well as an allocation of their functions and roles. Furthermore, we propose a steadyaction model definition for realizing the service, a tuple classification and element constructions for TupleSpace-based inter-agent cooperative communication, and an alternative-action extraction algorithm. Next, we present a prototype system-based operation check of inter-agent cooperative communication and an evaluation of tuple-matching processing time.