Saved in:
| Main Authors: | , , , , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2405.07541 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866917774403567616 |
|---|---|
| author | Shinohara, Shuji Morita, Daiki Hirai, Hayato Kuribayashi, Ryosuke Manome, Nobuhito Moriyama, Toru Okamoto, Hiroshi Nakajima, Yoshihiro Gunji, Yukio-Pegio Chung, Ung-il |
| author_facet | Shinohara, Shuji Morita, Daiki Hirai, Hayato Kuribayashi, Ryosuke Manome, Nobuhito Moriyama, Toru Okamoto, Hiroshi Nakajima, Yoshihiro Gunji, Yukio-Pegio Chung, Ung-il |
| contents | The Lévy walk, a type of random walk characterized by linear step lengths that follow a power-law distribution, is observed in the migratory behaviors of various organisms, ranging from bacteria to humans. Notably, Lévy walks with power exponents close to two, also known as Cauchy walks, are frequently observed, though their underlying causes remain elusive. This study proposes a walk model in which agents move toward a destination in multi-dimensional space and their movement strategy is parameterized by the extent to which they pursue the shortest path to the destination. This parameter is taken to represent the attractiveness of the destination to the agents. Our findings reveal that if the destination is very attractive, agents intensively search the area around it using Brownian walks, whereas if the destination is unattractive, they explore a distant region away from the point using Lévy walks with power exponents less than two. In the case where agents are unable to determine whether the destination is attractive or unattractive, Cauchy walks emerge. The Cauchy walker searches the region with a probability inversely proportional to the distance from the destination. This suggests that it preferentially searches the area close to the destination, while concurrently having the potential to extend the search area much further. Our model, which can change the search method and search area depending on the attractiveness of the destination, has the potential to be utilized for exploring the parameter space of optimization problems. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2405_07541 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Walk model that continuously generates Brownian walks to Lévy walks depending on destination attractiveness Shinohara, Shuji Morita, Daiki Hirai, Hayato Kuribayashi, Ryosuke Manome, Nobuhito Moriyama, Toru Okamoto, Hiroshi Nakajima, Yoshihiro Gunji, Yukio-Pegio Chung, Ung-il Multiagent Systems Artificial Intelligence Neural and Evolutionary Computing The Lévy walk, a type of random walk characterized by linear step lengths that follow a power-law distribution, is observed in the migratory behaviors of various organisms, ranging from bacteria to humans. Notably, Lévy walks with power exponents close to two, also known as Cauchy walks, are frequently observed, though their underlying causes remain elusive. This study proposes a walk model in which agents move toward a destination in multi-dimensional space and their movement strategy is parameterized by the extent to which they pursue the shortest path to the destination. This parameter is taken to represent the attractiveness of the destination to the agents. Our findings reveal that if the destination is very attractive, agents intensively search the area around it using Brownian walks, whereas if the destination is unattractive, they explore a distant region away from the point using Lévy walks with power exponents less than two. In the case where agents are unable to determine whether the destination is attractive or unattractive, Cauchy walks emerge. The Cauchy walker searches the region with a probability inversely proportional to the distance from the destination. This suggests that it preferentially searches the area close to the destination, while concurrently having the potential to extend the search area much further. Our model, which can change the search method and search area depending on the attractiveness of the destination, has the potential to be utilized for exploring the parameter space of optimization problems. |
| title | Walk model that continuously generates Brownian walks to Lévy walks depending on destination attractiveness |
| topic | Multiagent Systems Artificial Intelligence Neural and Evolutionary Computing |
| url | https://arxiv.org/abs/2405.07541 |