Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
Multi-agent real-time pursuit
Date
2010-07-01
Author
Undeger, Cagatay
Polat, Faruk
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
87
views
0
downloads
Cite This
In this paper, we address the problem of multi-agent pursuit in dynamic and partially observable environments, modeled as grid worlds; and present an algorithm called Multi-Agent Real-Time Pursuit (MAPS) for multiple predators to capture a moving prey cooperatively. MAPS introduces two new coordination strategies namely Blocking Escape Directions and Using Alternative Proposals, which help the predators waylay the possible escape directions of the prey in coordination. We compared our coordination strategies with the uncoordinated one against a prey controlled by Prey A*, and observed an impressive reduction in the number of moves to catch the prey.
Subject Keywords
Path planning
,
Real-time search
,
Multi-agent search
,
Real-time pursuit
URI
https://hdl.handle.net/11511/42956
Journal
AUTONOMOUS AGENTS AND MULTI-AGENT SYSTEMS
DOI
https://doi.org/10.1007/s10458-009-9102-0
Collections
Department of Computer Engineering, Article
Suggestions
OpenMETU
Core
Real-Time Moving Target Search
Undeger, Cagatay; Polat, Faruk (2007-11-23)
In this paper, we propose a real-time moving target search algorithm for dynamic and partially observable environments, modeled as grid world. The proposed algorithm, Real-time Moving Target Evaluation Search (MTES), is able to detect the closed directions around the agent, and determine the best direction that avoids the nearby obstacles, leading to a moving target which is assumed to be escaping almost optimally. We compared our proposal with Moving Target Search (NITS) and observed a significant improvem...
Single and multi agent real-time path search in dynamic and partially observable environments
Ündeğer, Çağatay; Polat, Faruk; Department of Computer Engineering (2007)
In this thesis, we address the problem of real-time path search in partially observable grid worlds, and propose two single agent and one multi-agent search algorithm. The first algorithm, Real-Time Edge Follow (RTEF), is capable of detecting the closed directions around the agent by analyzing the nearby obstacles, thus avoiding dead-ends in order to reach a static target more effectively. We compared RTEF with a well-known algorithm, Real-Time A* (RTA*) proposed by Korf, and observed significant improvemen...
Time series classification with feature covariance matrices
Ergezer, Hamza; Leblebicioğlu, Mehmet Kemal (2018-06-01)
In this work, a novel approach utilizing feature covariance matrices is proposed for time series classification. In order to adapt the feature covariance matrices into time series classification problem, a feature vector is defined for each point in a time series. The feature vector comprises local and global information such as value, derivative, rank, deviation from the mean, the time index of the point and cumulative sum up to the point. Extracted feature vectors for the time instances are concatenated t...
Time Series Classification Using Point-wise Features
Ergezer, Hamza; Leblebicioğlu, Mehmet Kemal (2017-05-18)
In this work, a novel approach utilizing feature covariance matrices is proposed for time series classification. In order to adapt the feature covariance matrices for time series classification, a feature vector is defined for each point in a time series. The feature vector comprises local and global information such as value, derivative, rank, deviation from the mean, time index of the point and cumulative sum up to the point. Instead of representing the whole time series with a single covariance matrix, t...
Comparison of 3D Versus 4D Path Planning for Unmanned Aerial Vehicles
Cicibas, Halil; Demir, Kadir Alpaslan; ARICA, NAFİZ (2016-11-01)
This research compares 3D versus 4D (three spatial dimensions and the time dimension) multi-objective and multi-criteria path-planning for unmanned aerial vehicles in complex dynamic environments. In this study, we empirically analyse the performances of 3D and 4D path planning approaches. Using the empirical data, we show that the 4D approach is superior over the 3D approach especially in complex dynamic environments. The research model consisting of flight objectives and criteria is developed based on int...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
C. Undeger and F. Polat, “Multi-agent real-time pursuit,”
AUTONOMOUS AGENTS AND MULTI-AGENT SYSTEMS
, pp. 69–107, 2010, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/42956.