目标规避传感器路径规划的离散优化方法
A discrete optimisation approach for target path planning whilst evading sensors
摘要:
在本文中,我们讨论了军事任务规划中出现的一个实际问题。问题是为一个或多个智能体规划一条到达目标而不被敌方传感器发现的路径。代理人不是被动的,相反,他们可以发起帮助逃避的行动。它们能破坏传感器。这里,敲除传感器意味着完全禁用传感器。它们也会混淆传感器。这里,混淆传感器意味着降低传感器可以检测到代理的概率。代理操作是路径相关的,并且有时间限制。路径依赖是指智能体需要足够接近传感器才能将其击倒。通过时间限制,我们的意思是对传感器在恢复到其原始操作状态之前被击倒或混淆的时间施加限制。所采用的方法打破了连续空间,其中代理人进入一个离散空间。这使得问题被公式化为具有线性约束的0 - 1整数规划。以这种方式表示问题的优点是存在强大的商业软件优化包来解决问题以证明全局最优性。提出了一种基于连续最短路径的启发式算法。一些随机生成的测试问题,公开提供的计算结果。
英文摘要:
In this paper we deal with a practical problem that arises in military mission planning. The problem is to plan a path for one, or more, agents to reach a target without being detected by enemy sensors. Agents are not passive, rather they can initiate actions which aid evasion. They can knockout sensors. Here to knockout a sensor means to completely disable the sensor. They can also confuse sensors. Here to confuse a sensor means to reduce the probability that the sensor can detect an agent. Agent actions are path dependent and time limited. By path dependent we mean that an agent needs to be sufficiently close to a sensor to knock it out. By time limited we mean that a limit is imposed on how long a sensor is knocked out or confused before it reverts back to its original operating state. The approach adopted breaks the continuous space in which agents move into a discrete space. This enables the problem to be formulated as a zero-one integer program with linear constraints. The advantage of representing the problem in this manner is that powerful commercial software optimisation packages exist to solve the problem to proven global optimality. A heuristic for the problem based on successive shortest paths is also presented. Computational results are presented for a number of randomly generated test problems that are made publicly available.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。