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

Robust Fuzzy Neural Network Sliding Mode Control for Wind Turbine with a Permanent Magnet Synchronous Generator

In the present paper, we are interested in the contribution of wind power to the electricity supply in power systems of small sized isolated communities. A robust fuzzy neural sliding control (FNSC) is proposed to track...

Inference-Based user’s Recommendation in E-Learning Systems

This paper proposes a technique of user’s recommendation for Elearning systems, which makes it possible to identify the best qualified profiles in a given field, the method is based on artificial intelligence in order to...

Bio-Inspired Temporal-Decoding Network Topologies for the Accurate Recognition of Spike Patterns

In this paper will be presented simple and effective temporal-decoding network topologies, based on a neuron model similar to the classic Leaky Integrate-and-Fire, but including the spike latency effect, a neuron propert...

Design of a Smart Model For Geolocalisation and E-commerce in the Semantic Web

Currently, ecommerce has become a pillar of the economy; there are huge growths of websites that offer different products to sell.This variety of web portals and products requires intelligent and autonomous operation to...

Optimal Design of Continuous Reinforced Concrete Beams Using Neural Networks

This paper aims to build a neural network model to optimally design two-span continuous reinforced concrete beams. The training and checking data of the neural network are obtained by genetic algorithms, whose constraint...

Download PDF file
  • EP ID EP278881
  • DOI 10.14738/tmlai.33.1313
  • Views 77
  • Downloads 0

How To Cite

E. Ehsan, F. Kunwar (2015). Probabilistic Search and Pursuit Evasion on a Graph. Transactions on Machine Learning and Artificial Intelligence, 3(3), 56-65. https://europub.co.uk/articles/-A-278881