不确定定时多机器人任务分配中的资源竞争模型
Modelling resource contention in multi-robot task allocation problems with uncertain timing
摘要:
本文提出了一个分析框架,用于建模多机器人系统中的资源竞争,其中的行程时间和任务持续时间是不确定的。它使用几种近似方法来快速准确地计算描述任务开始和完成时间的概率分布。具体贡献包括用于计算一组独立正态分布随机事件以给定顺序发生的概率的精确和快速近似方法,用于计算具有相等标准偏差的一组独立正态分布随机事件的最可能和第n最可能发生顺序的方法,以及一种用于在给定事件的特定顺序的情况下近似事件的条件概率分布的方法。在两个多机器人任务分配问题中,完整的框架被证明是比蒙特卡洛方法更快的相同精度。此外,通过与确定性方法的比较,证明了纳入不确定性的重要性。这是一个通用的框架,是不可知的优化方法和目标函数,并适用于广泛的问题。
英文摘要:
This paper proposes an analytical framework for modelling resource contention in multi-robot systems, where the travel times and task durations are uncertain. It uses several approximation methods to quickly and accurately calculate the probability distributions describing the times at which the tasks start and finish. Specific contributions include exact and fast approximation methods for calculating the probability of a set of independent normally distributed random events occurring in a given order, a method for calculating the most likely and n-th most likely orders of occurrence for a set of independent normally distributed random events that have equal standard deviations, and a method for approximating the conditional probability distributions of the events given a specific order of the events. The complete framework is shown to be faster than a Monte Carlo approach for the same accuracy in two multi-robot task allocation problems. In addition, the importance of incorporating uncertainty is demonstrated through a comparison with a deterministic method. This is a general framework that is agnostic to the optimisation method and objective function used, and is applicable to a wide range of problems.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。