.png){kind=icon}
返回
Multiagent Autonomous Source Search Using Submodularity and Branch-and-Bound
.png){kind=icon}
PRE
AI
DOI：10.1142/S230138502450002X.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper is concerned with near-optimal source search problem using a multiagent system in cluttered indoor environments. The goal of the problem is to maximize the detection probability within the minimum search time. We propose a two-stage strategy to achieve this goal. In the first stage, a greedy approach is used to define a set of grid cells with the aim of maximizing the detection probability. In the second stage, an iterative branch-and-bound procedure is used to design the search paths of all agents so that all grid cells are visited by one agent and the largest search path among all agents is minimized. Simulation results show that the proposed search algorithm has better performance in terms of exploration time compared to other existing methods.
Keyword:
Multiagent system
source search
submodularity
branch-and-bound
indoor exploration
期刊
IF:
2.4
论文数:
302
被引数:
705
机构
引用论文
A real-time quadrotor trajectory planning framework based on B-spline and nonuniform kinodynamic search基于b样条和非均匀动力学搜索的实时四旋翼轨迹规划框架
.png){kind=icon}
PREAI
分享收藏分享收藏分享收藏分享收藏Architecture Based Model Driven Software and System Development for Real-Time Embedded Systems基于架构的模型驱动实时嵌入式软件与系统开发
PREAI
分享收藏Study on Discriminant Matrices of Commonly-used Fisher Discriminant Functions常用Fisher判别函数的判别矩阵研究
PREAI
分享收藏
查看更多内容