返回
Multi-agent informed path planning using the probability hypothesis density
DOI:10.1007/s10514-020-09904-1.png)
摘要
En 中文
An Informed Path Planning algorithm for multiple agents is presented. It can be used to efficiently utilize available agents when surveying large areas, when total coverage is unattainable. Internally the algorithm has a Probability Hypothesis Density (PHD) representation, inspired by modern multi-target tracking methods, to represent unseen objects. Using the PHD, the expected number of observed objects is optimized. In a sequential manner, each agent maximizes the number of observed new targets, taking into account the probability of undetected objects due to previous agents' actions and the probability of detection, which yields a scalable algorithm. Algorithm properties are evaluated in simulations, and shown to outperform a greedy base line method. The algorithm is also evaluated by applying it to a sea ice tracking problem, using two datasets collected in the Arctic, with reasonable results. An implementation is provided under an Open Source license.
Keyword:
Path planning
Target tracking
Probability hypothesis density (PHD)
Multi-agent
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.3
论文数:
1.7K
被引数:
5.0K
机构
引用论文
Effects of the model PAH phenanthrene on immune function and oxidative stress in the haemolymph of the temperate scallop Pecten maximus
Chemosphere
IF0

