Almaarefa University
The authoritative source for research information and outputs is Elsevier Scopus, with researcher profile verification from the Deanship of Scientific Research.

المخرجات

Research outputs

Articles, reviews, conference papers and book chapters, indexed by DOI and linked to University researchers.

6 output Results for «Q-learning»

ArticleOpen access202518citation· Semantic Scholar

Novel deep reinforcement learning based collision avoidance approach for path planning of robots in unknown environment

PLoS ONE · vol. 20 (1) · e0312559-e0312559

Reinforcement learning is a remarkable aspect of the artificial intelligence field with many applications. Reinforcement learning facilitates learning new tasks based on action and reward principles. Motion planning addresses the navigation problem for robots. Current motion planning approaches lack support for automated, timely responses to the environment. The problem becomes worse in a complex environment cluttered with obstacles. Reinforcement learning can increase the capacity of robotic systems due to the reward system's capability and feedback to the environment. This could help deal with a complex environment. Existing algorithms for path planning are slow, computationally expensive, and less responsive to the environment, which causes late convergence to a solution. Furthermore, they are less efficient for task learning due to post-processing requirements. Reinforcement learning can address these issues using its action feedback and reward policies. This research presents a novel Q-learning-based reinforcement algorithm with deep learning integration. The proposed approach is evaluated in a narrow and cluttered passage environment. Further, improvements in the convergence of reinforcement learning-based motion planning and collision avoidance are addressed. The proposed approach's agent converged in 210th episodes in a cluttered environment and 400th episodes in a narrow passage environment. A state-of-the-art comparison shows that the proposed approach outperformed existing approaches based on the number of turns and convergence of the path by the planner.

collision avoidancerobot path planningdeep reinforcement learningQ-learning
ArticleOpen access202411citation· Semantic Scholar

IR-QLA: Machine Learning-Based Q-Learning Algorithm Optimization for UAVs Faster Trajectory Planning by Instructed- Reinforcement Learning

IEEE Access · vol. 12 · 91300-91315

Trajectory planning for unmanned aerial vehicles (UAVs) presents a formidable challenge, particularly in environments where details about the terrain and objectives are not known beforehand. This uncertainty has propelled the adoption of UAVs across diverse sectors such as logistics, weather forecasting, security surveillance, and autonomous driving, where their ability to navigate autonomously is crucial. Recent advancements have leveraged deep learning for robust object detection and tracking, significantly enhancing data acquisition from aerial imagery and UAV-based applications. Despite numerous innovations, the critical issue of optimizing UAV trajectories in unknown environments remains largely unaddressed. This paper introduces a novel approach, the Instructed Reinforcement Q-Learning Algorithm (IR-QLA), which utilizes Received Signal Strength (RSS) as a dynamic reward metric to refine trajectory planning continuously. By integrating a unique instructed reinforcement principle, this method significantly accelerates the learning process, improving the UAVs’ navigational efficiencies. Our findings demonstrate that IR-QLA not only surpasses traditional algorithms like Ant Colony and Particle Swarm Optimization in terms of convergence speed but also minimizes the path length and iteration counts needed for trajectory optimization. Future studies will explore alternative reward sources and advanced algorithms to further enhance the precision and speed of UAV trajectory planning, aiming to establish new benchmarks in the field.

UAV trajectory planningQ-learningreceived signal strengthreward function design
Conference paperOpen (repository)20244citation· Semantic Scholar

Genetic and Deep Reinforcement Learning-Based Intelligent Course Scheduling for Smart Education

International Conference on Artificial Intelligence and Teacher Education (ICAITE) · 117-124

Scheduling courses is a routine yet important task in Smart educational activities. Traditional manual scheduling is time-consuming and labor-intensive, prone to errors, and unable to meet the demands of large-scale scheduling. Classic genetic algorithms for scheduling have issues such as rapid convergence and decreased scheduling efficiency as constraint factors increase. To address these problems in existing scheduling genetic algorithms, we propose a self-learning genetic algorithm for scheduling based on deep reinforcement learning (GAGDRL). The GAGDRL algorithm utilizes the Q-learning algorithm to achieve adaptive adjustment of crossover and mutation parameters, enhancing the search capability of the genetic algorithm. Establishing a parameter dynamic adjustment model for the Markov decision process (MDP) analyzes the state set of the population fitness function to achieve a comprehensive evaluation of the overall performance of the population. Additionally, the deep Q-network (DQN) algorithm is introduced into the scheduling problem to address issues related to the large number of population states and the volume of Q-table data in scheduling. Experimental results show that, compared to classical and improved genetic algorithms for scheduling, the GAGDRL algorithm improves accuracy and optimization capability. The proposed algorithm can also be applied to problems such as exam scheduling, cinema seating arrangements, and airline route planning.

course schedulingsmart educationgenetic algorithmdeep reinforcement learning
ArticleOpen (repository)20224citation· Semantic Scholar

Enhanced Route Discovery Mechanism Using Improved CH Selection Using Q-Learning to Minimize Delay

Scientific Programming · vol. 2022 · 1-25

With the technological advancements, practical challenges of establishing long-distance communication should be addressed using hop-oriented routing networks. However, long-distance data transmissions usually deteriorate the quality of service (QoS) especially in terms of considerable communication delay. Therefore, in the presented work, a reward-based routing mechanism is proposed that aims at minimizing the overall delay which is evaluated under various scenarios. The routing process involved a refined CH selection mechanism based on a mathematical model until a threshold simulation is not attained. The illustrations for the coverage calculations of CH in the route discovery are also provided for possible routes between the source and the destination to deliver quality service. Based on this information, the data gathered from the past simulations is passed to the learning mechanism using the Q-learning model. The work is evaluated in terms of throughput, PDR, and first dead node in order to achieve minimal transmission delay. Furthermore, area variation is also involved to investigate the effect of an increase in the deployment area and number of nodes on a Q-learning-based mechanism aimed to minimize the delay. The comparative analysis against four existing studies justifies the success of the proposed mechanism in terms of throughput, first dead node, and delay analysis.

route discoverycluster head selectionQ-learningdelay reduction