Faruk Polat

E-mail

polatf@metu.edu.tr

Department

Department of Computer Engineering

ORCID

0000-0003-0509-9153

Scopus Author ID

7003321824

Web of Science Researcher ID

ABA-3585-2020

Relative distances approach for multi-traveling salesmen problem Ergüven, Emre; Polat, Faruk (2024-09-01)
Potential-based reward shaping using state–space segmentation for efficiency in reinforcement learning Bal, Melis İlayda; Aydın, Hüseyin; İyigün, Cem; Polat, Faruk (2024-08-01) Reinforcement Learning (RL) algorithms encounter slow learning in environments with sparse explicit reward structures due to the limited feedback available on the agent's behavior. This problem is exacerbated particularly ...
Faster MIL-based Subgoal Identification for Reinforcement Learning by Tuning Fewer Hyperparameters Sunel, Saim; Çilden, Erkin; Polat, Faruk (2024-4-20) Various methods have been proposed in the literature for identifying subgoals in discrete reinforcement learning (RL) tasks. Once subgoals are discovered, task decomposition methods can be employed to improve the learning ...
Population-based exploration in reinforcement learning through repulsive reward shaping using eligibility traces Bal, Melis Ilayda; İyigün, Cem; Polat, Faruk; Aydın, Hüseyin (2024-01-01) Efficient exploration plays a key role in accelerating the learning performance and sample efficiency of reinforcement learning tasks. In this paper we propose a framework that serves as a population-based repulsive reward...
Solving an industry-inspired generalization of lifelong MAPF problem including multiple delivery locations Polat, Faruk (2023-08-01)
Landmark based guidance for reinforcement learning agents under partial observability Demir, Alper; Çilden, Erkin; Polat, Faruk (2022-01-01) Under partial observability, a reinforcement learning agent needs to estimate its true state by solely using its observation semantics. However, this interpretation has a drawback, which is called perceptual aliasing, avoi...
LIMP: Incremental Multi-agent Path Planning with LPA* Yorganci, Mucahit Alkan; Semiz, Fatih; Polat, Faruk (2022-01-01) The multi-agent pathfinding (MAPF) problem is defined as finding conflict-free paths for more than one agent. There exist optimal and suboptimal solvers for MAPF, and most of the solvers focus on the MAPF problem in static...
Multiagent Pickup and Delivery for Capacitated Agents Çilden, Evren; Polat, Faruk (2022-01-01) In Multi-Agent Pickup and Delivery (MAPD), multiple robots continuously receive tasks to pick up packages and deliver them to predefined destinations in an automated warehouse. If the capacity of agents is increased, agent...
Incremental multi-agent path finding Semiz, Fatih; Polat, Faruk (Elsevier BV, 2021-03-01) Existing multi-agent path finding (MAPF) algorithms are offline methods that aim at finding conflict-ree paths for more than one agent. In many real-life applications it is possible that a multi-agent plan cannot be fully ...
Compact Frequency Memory for Reinforcement Learning with Hidden States. Polat, Faruk; Cilden, Erkin (2019-10-28) Memory-based reinforcement learning approaches keep track of past experiences of the agent in environments with hidden states. This may require extensive use of memory that limits the practice of these methods in a real-li...

Citation Formats