|
JAIST Repository >
School of Knowledge Science >
Articles >
Journal Articles >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/10119/8835
|
| Title: | Designing an algorithm for swarm behavior using the concept of Umwelt |
| Authors: | Fujisawa, Ryusuke
Hashimoto, Takashi |
| Keywords: | Umwelt
Swarm behavior
Pheromone communication |
| Issue Date: | 2009-03 |
| Publisher: | Springer |
| Magazine name: | Artificial Life and Robotics |
| Volume: | 13 |
| Number: | 2 |
| Start page: | 575 |
| End page: | 584 |
| DOI: | 10.1007/s10015-008-0601-x |
| Abstract: | In this study, we propose a methodology for designing a swarm behavior. The difficulty in designing the swarm behavior is a gap between the object of evaluation and that of design. The former is the performance of a group, but the latter is the action of each individual. We utilize the concept “Umwelt” in ethology for bridging the gap. The advantage of this concept is that all actions necessary for the swarm behavior can he derived from the purpose of each individual. Using this concept, the swarm behavior can he built into the action algorithm of the individuals. In order to evaluate the proposed method, we construct the swarm algorithm for a search and collection task. Using a computer simulation, we confirmed that the swarm successfully achieved the task with flexibility and parallelism, and also robustness in part. These results support the effectiveness of the proposed methodology. |
| Rights: | This is the author-created version of Springer, Ryusuke Fujisawa and Takashi Hashimoto, Artificial Life and Robotics, 13(2), 2009, 575-584. The original publication is available at www.springerlink.com, http://dx.doi.org/10.1007/s10015-008-0601-x |
| URI: | http://hdl.handle.net/10119/8835 |
| Material Type: | author |
| Appears in Collections: | a10-1. 雑誌掲載論文 (Journal Articles)
|
Files in This Item:
| File |
Description |
Size | Format |
|---|
| C14065.pdf | | 477Kb | Adobe PDF | View/Open |
|
All items in DSpace are protected by copyright, with all rights reserved.
|
