TY - GEN
T1 - Learning of activity cycle length based on battery limitation in multi-agent continuous cooperative patrol problems
AU - Sugiyama, Ayumi
AU - Wu, Lingying
AU - Sugawara, Toshiharu
N1 - Funding Information:
This work was partly supported by JSPS KAKENHI Grant Number 17KT0044 and Grant-in-Aid for JSPS Research Fellow (JP16J11980).
Publisher Copyright:
© 2019 by SCITEPRESS - Science and Technology Publications, Lda.
PY - 2019
Y1 - 2019
N2 - We propose a learning method that decides the appropriate activity cycle length (ACL) according to environmental characteristics and other agents' behavior in the (multi-agent) continuous cooperative patrol problem. With recent advances in computer and sensor technologies, agents, which are intelligent control programs running on computers and robots, obtain high autonomy so that they can operate in various fields without pre-defined knowledge. However, cooperation/coordination between agents is sophisticated and complicated to implement. We focus on the ACL which is time length from starting patrol to returning to charging base for cooperative patrol when agents like robots have batteries with limited capacity. Long ACL enable agent to visit distant location, but it requires long rest. The basic idea of our method is that if agents have long-life batteries, they can appropriately shorten the ACL by frequently recharging. Appropriate ACL depends on many elements such as environmental size, the number of agents, and workload in an environment. Therefore, we propose a method in which agents autonomously learn the appropriate ACL on the basis of the number of events detected per cycle. We experimentally indicate that our agents are able to learn appropriate ACL depending on established spatial divisional cooperation.
AB - We propose a learning method that decides the appropriate activity cycle length (ACL) according to environmental characteristics and other agents' behavior in the (multi-agent) continuous cooperative patrol problem. With recent advances in computer and sensor technologies, agents, which are intelligent control programs running on computers and robots, obtain high autonomy so that they can operate in various fields without pre-defined knowledge. However, cooperation/coordination between agents is sophisticated and complicated to implement. We focus on the ACL which is time length from starting patrol to returning to charging base for cooperative patrol when agents like robots have batteries with limited capacity. Long ACL enable agent to visit distant location, but it requires long rest. The basic idea of our method is that if agents have long-life batteries, they can appropriately shorten the ACL by frequently recharging. Appropriate ACL depends on many elements such as environmental size, the number of agents, and workload in an environment. Therefore, we propose a method in which agents autonomously learn the appropriate ACL on the basis of the number of events detected per cycle. We experimentally indicate that our agents are able to learn appropriate ACL depending on established spatial divisional cooperation.
KW - Battery Limitation
KW - Continuous Cooperative Patrol Problem
KW - Cycle Learning
KW - Division of Labor
KW - Multi-agent
UR - http://www.scopus.com/inward/record.url?scp=85064628024&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85064628024&partnerID=8YFLogxK
U2 - 10.5220/0007567400620071
DO - 10.5220/0007567400620071
M3 - Conference contribution
AN - SCOPUS:85064628024
T3 - ICAART 2019 - Proceedings of the 11th International Conference on Agents and Artificial Intelligence
SP - 62
EP - 71
BT - ICAART 2019 - Proceedings of the 11th International Conference on Agents and Artificial Intelligence
A2 - Rocha, Ana
A2 - Steels, Luc
A2 - van den Herik, Jaap
PB - SciTePress
T2 - 11th International Conference on Agents and Artificial Intelligence, ICAART 2019
Y2 - 19 February 2019 through 21 February 2019
ER -