首页> 外文会议>International Symposium on Combinatorial Search >Measuring the Vulnerability of a Multi-Agent Pathfinding Solution
【24h】

Measuring the Vulnerability of a Multi-Agent Pathfinding Solution

机译:测量多助理路径求解解决方案的漏洞

获取原文

摘要

In the future, it is expected that autonomous agents will take a major role in our life. They will be delivering goods, serving as a transportation solution, and maintaining surveillance and security. A fundamental task such agents will have to perform is path planning, where agents aim to reach their goals as fast as possible but without colliding with each other. This is known as the Multi-Agent Pathfinding (MAPF) problem, and has been studied extensively in recent years (Sharon et al. 2015; Felner et al. 2017; Ma et al. 2019, inter alia).
机译:未来,预计自治代理将在我们的生活中作出重大作用。 他们将送货,作为运输解决方案,维护监测和安全性。 此类代理人必须执行的基本任务是路径规划,其中代理人旨在尽可能快地达到目标,但不互相碰撞。 这被称为多代理路径(MAPF)问题,并且近年来已经广泛研究(Sharon等,2015; Felner等,2017; Ma等人。2019,除其他外)。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号