RTTES: Real-time search in dynamic environments

Date

2007-10-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

240
views

0
downloads

In this paper we propose a real-time search algorithm called Real-Time Target Evaluation Search (RTTES) for the problem of searching a route in grid worlds from a starting point to a static or dynamic target point in real-time. The algorithm makes use of a new effective heuristic method which utilizes environmental information to successfully find solution paths to the target in dynamic and partially observable environments. The method requires analysis of nearby obstacles to determine closed directions and estimate the goal relevance of open directions in order to identify the most beneficial move. We compared RTTES with other competing real-time search algorithms and observed a significant improvement on solution quality.

Subject Keywords

Artificial Intelligence

URI

https://hdl.handle.net/11511/40390

Journal

APPLIED INTELLIGENCE

DOI

https://doi.org/10.1007/s10489-006-0023-1

Collections

Department of Computer Engineering, Article

Suggestions

OpenMETU
Core

LinGraph: a graph-based automated planner for concurrent task planning based on linear logic Kortik, Sitar; Saranlı, Uluç (Springer Science and Business Media LLC, 2017-10-01) In this paper, we introduce an automated planner for deterministic, concurrent domains, formulated as a graph-based theorem prover for a propositional fragment of intuitionistic linear logic, relying on the previously established connection between intuitionistic linear logic and planning problems. The new graph-based theorem prover we introduce improves planning performance by reducing proof permutations that are irrelevant to planning problems particularly in the presence of large numbers of objects and a...
Nuclear Fission-Nuclear Fusion algorithm for global optimization: a modified Big Bang-Big Crunch algorithm YALÇIN, YAĞIZER; Pekcan, Onur (Springer Science and Business Media LLC, 2020-04-01) This study introduces a derivative of the well-known optimization algorithm, Big Bang-Big Crunch (BB-BC), named Nuclear Fission-Nuclear Fusion-based BB-BC, simply referred to as N2F. Broadly preferred in the engineering optimization community, BB-BC provides accurate solutions with reasonably fast convergence rates for many engineering problems. Regardless, the algorithm often suffers from stagnation issues. More specifically, for some problems, BB-BC either converges prematurely or exploits the promising r...
CNNFOIL: convolutional encoder decoder modeling for pressure fields around airfoils Duru, Cihat; Alemdar, Hande; Baran, Özgür Uğraş (Springer Science and Business Media LLC, 2020-01-01) In this study, we propose an encoder–decoder convolutional neural network-based approach for estimating the pressure field around an airfoil. The developed tool is one of the early steps of a machine-learning-based aerodynamic performance prediction tool. Network training and evaluation are performed from a set of computational fluid dynamics (CFD)-based solutions of the 2-D flow field around a group of known airfoils involving symmetrical, cambered, thick and thin airfoils. Reynolds averaged Navier Stokes-...
Improving reinforcement learning by using sequence trees Girgin, Sertan; Polat, Faruk; Alhajj, Reda (Springer Science and Business Media LLC, 2010-12-01) This paper proposes a novel approach to discover options in the form of stochastic conditionally terminating sequences; it shows how such sequences can be integrated into the reinforcement learning framework to improve the learning performance. The method utilizes stored histories of possible optimal policies and constructs a specialized tree structure during the learning process. The constructed tree facilitates the process of identifying frequently used action sequences together with states that are visit...
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...

Citation Formats

C. Undeger and F. Polat, “RTTES: Real-time search in dynamic environments,” APPLIED INTELLIGENCE, pp. 113–129, 2007, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/40390.