A discrete optimisation approach for target path planning whilst evading sensors
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.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Iterative Hybrid Discrete-Continuous Viewpoint Planning for UAV Photogrammetry
Unmanned aerial vehicle (UAV) photogrammetry requires camera networks that provide sufficient surface coverage, image overlap, parallax, and resolution, yet conventional flight patterns are often poorly adapted to scene …
Retrosynthesis Planning via Worst-path Policy Optimisation in Tree-structured MDPs
Retrosynthesis planning aims to decompose target molecules into available building blocks, forming a synthetic tree where each internal node represents an intermediate compound and each leaf ideally corresponds to a purc…
Fast-Spanning Ant Colony Optimisation (FaSACO) for Mobile Robot Coverage Path Planning
Coverage Path Planning (CPP) aims at finding an optimal path that covers the whole given space. Due to the NP-hard nature, CPP remains a challenging problem. Bio-inspired algorithms such as Ant Colony Optimisation (ACO) …
CPUReaching Through Latent Space: From Joint Statistics to Path Planning in Manipulation
We present a novel approach to path planning for robotic manipulators, in which paths are produced via iterative optimisation in the latent space of a generative model of robot poses. Constraints are incorporated through…
Self-Supervised On-Policy Reinforcement Learning via Contrastive Proximal Policy Optimisation
Contrastive reinforcement learning (CRL) learns goal-conditioned Q-values through a contrastive objective over state-action and goal representations, removing the need for hand-crafted reward functions. Despite impressiv…
Self-Supervised LearningReinforcement Learning