1 citations · 1 across the 5 of their papers we have counts for
Showing eess.SYShow all
2 papers · 1 filter
eess.SY2024
Almost Sure Convergence of Networked Policy Gradient over Time-Varying Networks in Markov Potential Games
Sarper Aydin, Ceyhun Eksin
We propose networked policy gradient play for solving Markov potential games with continuous and/or discrete state-action pairs. During the game, agents use parametrized and differ…
eess.SY2020
A Best-Response Algorithm with Voluntary Communication and Mobility Protocols for Mobile Autonomous Teams Solving the Target Assignment Problem
Sarper Aydin, Ceyhun Eksin
We consider a team of mobile autonomous robots with the aim to cover a given set of targets. Each robot aims to select a target to cover and physically reach it by the final time i…