Onur İnan

Dr. Onur İnan

orcid

Research Focus & Metrics

Academic Career Length

15Years (2012-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
16 April 2014 in Journal of Medical Systems
Verified
Journal Article
Closed access
PDF file
NYNihat Yilmaz
Nihat Yilmaz
OİOnur İnan
Onur İnan
MUMustafa Serter Uzer
Mustafa Serter Uzer

1 March 2023 in Neural Computing and Applications
Verified
Journal Article
Closed access
PDF file
MUMustafa Serter Uzer
Mustafa Serter Uzer
OİOnur İnan
Onur İnan

12 June 2012 in Neural Computing and Applications
Verified
Journal Article
Closed access
PDF file
MUMustafa Serter Uzer
Mustafa Serter Uzer
OİOnur İnan
Onur İnan
NYNihat Yılmaz
Nihat Yılmaz

20 March 2025 in Sensors
Verified
Journal Article
Open access
PDF file
MBMehmet Bilban
Mehmet Bilban
OİOnur İnan
Onur İnan
Autonomous vehicles must make quick and accurate decisions to operate efficiently in complex and dynamic urban traffic environments, necessitating a reliable and stable learning mechanism. The proximal policy optimization (PPO) algorithm stands out among reinforcement learning (RL) methods for its consistent learning process, ensuring stable decisions under varying conditions while avoiding abrupt deviations during execution. However, the PPO algorithm often becomes trapped in a limited search space during policy updates, restricting its adaptability to environmental changes and alternative strategy exploration. To overcome this limitation, we integrated Lévy flight’s chaotic and comprehensive exploration capabilities into the PPO algorithm. Our method helped the algorithm explore larger solution spaces and reduce the risk of getting stuck in local minima. In this study, we collected real-time data such as speed, acceleration, traffic sign positions, vehicle locations, traffic light statuses, and distances to surrounding objects from the CARLA simulator, processed via Apache Kafka. These data were analyzed by both the standard PPO and our novel Lévy flight-enhanced PPO (LFPPO) algorithm. While the PPO algorithm offers consistency, its limited exploration hampers adaptability. The LFPPO algorithm overcomes this by combining Lévy flight’s chaotic exploration with Apache Kafka’s real-time data streaming, an advancement absent in state-of-the-art methods. Tested in CARLA, the LFPPO algorithm achieved a 99% success rate compared to the PPO algorithm’s 81%, demonstrating superior stability and rewards. These innovations enhance safety and RL exploration, with the LFPPO algorithm reducing collisions to 1% versus the PPO algorithm’s 19%, advancing autonomous driving beyond existing techniques.

28 January 2023 in The Journal of Supercomputing
Verified
Journal Article
Closed access
PDF file
MUMustafa Serter Uzer
Mustafa Serter Uzer
OİOnur İnan
Onur İnan

2 April 2021 in An International Journal of Optimization and Control: Theories & Applications (IJOCTA)
Verified
Journal Article
Open access
PDF file
AMAyşe Nagehan Mat
Ayşe Nagehan Mat
OİOnur İnan
Onur İnan
MKMurat Karakoyun
Murat Karakoyun
Clustering, which is handled by many researchers, is separating data into clusters without supervision. In clustering, the data are grouped using similarities or differences between them. Many traditional and heuristic algorithms are used in clustering problems and new techniques continue to be developed today. In this study, a new and effective clustering algorithm was developed by using the Whale Optimization Algorithm (WOA) and Levy flight (LF) strategy that imitates the hunting behavior of whales. With the developed WOA-LF algorithm, clustering was performed using ten medical datasets taken from the UCI Machine Learning Repository database. The clustering performance of the WOA-LF was compared with the performance of k-means, k-medoids, fuzzy c-means and the original WOA clustering algorithms. Application results showed that WOA-LF has more successful clustering performance in general and can be used as an alternative algorithm in clustering problems.