tailieunhanh - Efficient collective search by BRT algorithm using fast rising threshold agent

In this paper, we aim to shorten this search time by introducing a few agents whose threshold increases faster than the normal one to achieve higher scalability of the BRT algorithm. The results show that the search time is reduced, and the variance is improved, especially under challenging problems where robots are required to make decisions out of a large number of options. |

TÀI LIỆU LIÊN QUAN