Distributed Ant Colony Clustering Using Mobile Agents and Its Effects

Oikawa, Ryotaro; Mizutani, Manabu; Takimoto, Munehiro; Kambayashi, Yahiko

doi:10.1007/978-3-642-15387-7_24

Cited by 5 publications

(6 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We defer this investigation to our future work. For another investigation, we are designing a completely different intelligent cart assembly system where entire multiple mobile robot system performs the ACC by using mobile software agents (Oikawa, Mizutani, Takimoto & Kambayashi, 2010;Abe, Takimoto & Kambayashi, 2011). We call the system distributed ant colony clustering where two new mobile software agents are introduced to control the driving agents.…”

Section: Discussionmentioning

confidence: 99%

“…We have employed a simple, non-higher-order mobile agent system for our intelligent cart control system. We previously implemented a team of cooperative search robots to show the effectiveness of such a framework, and demonstrated that that framework contributes to energy savings for a task achieved by multiple robots (Takimoto, Mizuno, Kurio & Kambayashi, 2007;Nagata, Takimoto & Kambayashi, 2009;Oikawa, Mizutani, Takimoto & Kambayashi, 2010;Abe, Takimoto & Kambayashi, 2011). Our simple agent system should achieve similar performance.…”

Section: Introductionmentioning

confidence: 97%

“…We realize that for such a system cost is a significant issue and we address one of those costs, the power source. A big, powerful battery is heavy and expensive; therefore such intelligent cart systems with small batteries are desirable to save energy (Takimoto, Mizuno, Kurio & Kambayashi, 2007;Nagata, Takimoto & Kambayashi, 2009;Oikawa, Mizutani, Takimoto & Kambayashi, 2010;Abe, Takimoto & Kambayashi, 2011). Travelers pick up carts at designated points and leave them in arbitrary places.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Location of Intelligent Carts Using RFID

Kambayashi¹,

Takimoto²

2011

Deploying RFID - Challenges, Solutions, and Open Issues

Self Cite

View full text Add to dashboard Cite

Section: Discussionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 97%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Location of Intelligent Carts Using RFID

Kambayashi¹,

Takimoto²

2011

Deploying RFID - Challenges, Solutions, and Open Issues

Self Cite

View full text Add to dashboard Cite

“…In a new algorithm for serializing robots, an Ant agent and a robot respectively corresponds to an ant and an object of ACC. The Ant agent traverse robots through repeating migrations to find a free robot with no task, as it does in the previous approach (Mizutani et al, 2010;Oikawa et al, 2010). Once the Ant agent finds a free robot A, it behaves along the following steps.…”

Section: Basic Properties Of a Pheromone Agentmentioning

confidence: 99%

“…We previously proposed an ACC approach using mobile software agents. We call it distributed ACC (Mizutani et al, 2010;Oikawa et al, 2010). In the approach, some Ant agents, which is mobile software agents corresponding to ants, iteratively traverse robots, which correspond to objects picked up by ants.…”

Section: Introductionmentioning

confidence: 99%

Synthesizing Pheromone Agents for Serialization in the Distributed Ant Colony Clustering

Shintani

Lee

Takimoto

et al. 2011

Proceedings of the International Conference on Evolutionary Computation Theory and Applications

View full text Add to dashboard Cite

This paper presents effective extensions of our previously proposed algorithm for controlling multiple robots. The robots are connected by communication networks, and the controlling algorithm is based on a specific Ant Colony Clustering (ACC) algorithm. Unlike traditional ACC, we implemented the ants as actual mobile software agents that control the mobile robots which are corresponding to objects. The ant agent migrates among robots to look for an available one. Once the ant agent finds an available robot, the robot physically moves along the instructions of the ant agent, instead of being conveyed. We also implemented pheromone as mobile software agents, which attract many robots to some clusters by diffusing themselves through the migration, so that the pheromone agents enable the robots to be efficiently assembled. In our new approach, we take advantage of the pheromone agents not only to assemble the robots but also to serialize them. The serializing property is desirable for particular applications such as gathering carts in the airports. We achieve the property through migrations of the pheromone agents within a cluster and synthesizing them. We have built a simulator based on our algorithm, and conducted numerical experiments to demonstrate the feasibility of our approach.

show abstract