Loading…

Efficient decision-making for multiagent target searching and occupancy in an unknown environment

Target searching in an unknown environment is a traditional research issue in the multiagent area. In some real cases, the agents do not only discover the targets; instead, they have subsequent tasks that must be completed before a deadline. In this paper, these cases are abstracted as the agents se...

Full description

Saved in:
Bibliographic Details
Published in:Robotics and autonomous systems 2019-04, Vol.114, p.41-56
Main Authors: Yan, Fuhan, Di, Kai, Jiang, Jiuchuan, Jiang, Yichuan, Fan, Hui
Format: Article
Language:English
Subjects:
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Target searching in an unknown environment is a traditional research issue in the multiagent area. In some real cases, the agents do not only discover the targets; instead, they have subsequent tasks that must be completed before a deadline. In this paper, these cases are abstracted as the agents searching for target locations in an unknown environment and then occupying these target locations within a limited time. The agents can obtain rewards by occupying the target locations, and the goal of this problem is to maximize net income, defined as total reward minus the moving cost of the agents. This problem can be transformed into the traditional problems, and then be solved by previous related algorithms. However, this approach is not optimal. In this paper, we present a method that combines previous algorithms and a decision-making algorithm. The experiments demonstrate that the method containing our decision-making algorithm can lead to higher net income than simply using previous algorithms. •The multiagent target searching and occupancy problem is analyzed.•Previous algorithms are combined with a new decision-making algorithm.•The method containing our decision-making algorithm can lead to better results.
ISSN:0921-8890
1872-793X
DOI:10.1016/j.robot.2019.01.017