Probabilistic Search and Pursuit Evasion on a Graph
Journal Title: Transactions on Machine Learning and Artificial Intelligence - Year 2015, Vol 3, Issue 3
Abstract
This paper presents an approach to locate an adversarial, mobile evader in an indoor environment using motion planning of mobile pursuers. The approach presented in this paper uses motion planning of mobile robots to search a target in a graph and clear the workspace. The algorithm used is Partially Observable Markov Decision Process (POMDP), a probabilistic search method to clear the indoor workspace in a pursuit evasion domain. In this paper, the indoor environment is assumed to be known beforehand and the mobile evader to be adversarial with no motion model given. The workspace is first discretized and then converted to a graph, whose nodes represent the rooms and corridors and edges represent connection between them. The task of pursuer is to clear the whole graph with no contaminated node left in minimum possible steps. Such path planning problems are NP-hard and the problem scales exponentially with increased number of pursuers and complex graph.
Authors and Affiliations
E. Ehsan, F. Kunwar
Keywords
Related Articles
- EP ID EP278881
- DOI 10.14738/tmlai.33.1313
- Views 78
- Downloads 0
Robust Multiple Watermarking Technique for Medical Applications using DWT, DCT and SVD
The security of medical data plays an important role in preserving their integrity and confidentiality. This paper presents a robust multiple watermarking algorithm based on a combination of discrete wavelet transform (D...
Mobile Agent Life Cycle Demystified using Formal Method
Underlying technique for mobile agent development is often mystified. Existing research sometimes ignore unveiling the details of the mobility and autonomy of the agent system. This paper exposes using formal methods the...
Robot-Server Architecture for Optimizing Solar Panel Power Output
Solar panel facilities for generating electricity have increased exponentially in the recent years. Dust and bird droppings on the solar panels inhibit the energy production. Having people to inspect them and, if needed,...
Generic Platform to Generate Educational Components
In this research, we will present all the concepts necessary for the implementation of a warehouse of educational components. We define three classes of educational components: Learning components, services components an...
Random Key Cuckoo Search for the Quadratic Assignment Problem
This paper proposes an adaptation of the RandomKey Cuckoo Search (RKCS) algorithm for solving the famous Quadratic Assignment Problem (QAP). We used a simplified and efficient randomkey encoding scheme to convert a conti...