Vision-based Detection of Autonomous Vehicles for Pursuit-evasion Games
نویسندگان
چکیده
We present a vision-based algorithm for the detection of multiple autonomous vehicles for a pursuit-evasion game scenario. Our algorithm computes estimates of the pose of multiple moving evaders from visual information collected by multiple moving pursuers, without previous knowledge of the segmentation of the image measurements or the number of moving evaders. We evaluate our algorithm in pursuit-evasion games with unmanned ground and aerial vehicles.
منابع مشابه
Probabilistic pursuit-evasion games: theory, implementation, and experimental evaluation
We consider the problem of having a team of Unmanned Aerial Vehicles (UAV) and Unmanned Ground Vehicles (UGV) pursue a second team of evaders while concurrently building a map in an unknown environment. We cast the problem in a probabilistic game theoretic framework and consider two computationally feasible greedy pursuit policies: local-max and global-max. To implement this scenario on real UA...
متن کاملPursuit-Evasion Games with Unmanned Ground and Aerial Vehicles
This paper presents the implementation of a hierarchical architecture for the coordination and control of a heterogeneous team of autonomous agents. We consider the problem of having a team of agents pursue a second team of evaders while building a map of the environment. The control architecture emphasizes the autonomy of each agent yet allows for coordinated efforts among them. We address the...
متن کاملStochastic multi-player pursuit–evasion differential games
Autonomous aerial vehicles play an important role in military applications such as in search, surveillance and reconnaissance. Multi-player stochastic pursuit–evasion (PE) differential game is a natural model for such operations involving intelligent moving targets with uncertainties. In this paper, some fundamental issues of stochastic PE games are addressed. We first model a general stochasti...
متن کاملMultiple-Agent Probabilistic Pursuit-Evasion Games
In this paper we develop a probabilistic framework for pursuit-evasion games. We propose a “greedy” policy to control a swarm of autonomous agents in the pursuit of one or several evaders. At each instant of time this policy directs the pursuers to the locations that maximize the probability of finding an evader at that particular time instant. It is shown that, under mild assumptions, this pol...
متن کاملMultiple - Agent Probabilistic Pursuit - Evasion Games 1
In this paper we develop a probabilistic framework for pursuit-evasion games. We propose a \greedy" policy to control a swarm of autonomous agents in the pursuit of one or several evaders. At each instant of time this policy directs the pursuers to the locations that maximize the probability of nding an evader at that particular time instant. It is shown that, under mild assumptions, this polic...
متن کامل