An iterative learning process based on Bayesian principle in pursuit-evasion games

In a pursuit-evasion game, a pursuer tries to capture evader while the evader is trying to avoid capture. During the pursuit and evasion, pursuer longs for minimizing the distance from evader at any time while evader wants to the maximal distance. Although the relevant information of each side is un...

Full description

Saved in:
Bibliographic Details
Main Authors: Fan, Jiancong, Ruan, Jiuhong, Liang, Yongquan, Tang, Leiyu
Format: Conference Proceeding
Language:English
Subjects:
Algorithm design and analysis
Bayesian methods
Bayesian principle
Collision avoidance
Games
Iteration
Iterative algorithm
Nash equilibrium
Pursuit-evasion games
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In a pursuit-evasion game, a pursuer tries to capture evader while the evader is trying to avoid capture. During the pursuit and evasion, pursuer longs for minimizing the distance from evader at any time while evader wants to the maximal distance. Although the relevant information of each side is unknown for each other, the initial information about pursuer and evader's locations and transition directions can be presented according to the prior probability. Then a Bayesian iterative process can be used to modify the probability of opponent's actions and to maximize the probability. It can make the pursuer and evader satisfy their min and max needs respectively. Simulations show that with the increase of pursuit-evasion area, capture frequency has robust convergence, and average capture time and iterative frequency increase faster.
ISSN:1934-1768
2161-2927