جامعة المعرفة
المصدر المعتمد للمعلومات البحثية والمخرجات هو قاعدة بيانات سكوبس (Elsevier Scopus) مع تدقيق بيانات الباحثين من عمادة البحث العلمي.

Research outputs

المخرجات البحثية

مقالات ومراجعات وأوراق مؤتمرات وفصول كتب، مفهرسة برقم DOI ومربوطة بباحثي الجامعة.

2 مُخرَج نتائج البحث عن «robot path planning»

مقالوصول مفتوح202518استشهاد· Semantic Scholar

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

PLoS ONE · مجلد 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
مقالوصول مفتوح202210استشهاد· Semantic Scholar

A Generalized Laser Simulator Algorithm for Mobile Robot Path Planning with Obstacle Avoidance

Sensors · مجلد 22 (21) · 8177-8177

This paper aims to develop a new mobile robot path planning algorithm, called generalized laser simulator (GLS), for navigating autonomously mobile robots in the presence of static and dynamic obstacles. This algorithm enables a mobile robot to identify a feasible path while finding the target and avoiding obstacles while moving in complex regions. An optimal path between the start and target point is found by forming a wave of points in all directions towards the target position considering target minimum and border maximum distance principles. The algorithm will select the minimum path from the candidate points to target while avoiding obstacles. The obstacle borders are regarded as the environment's borders for static obstacle avoidance. However, once dynamic obstacles appear in front of the GLS waves, the system detects them as new dynamic obstacle borders. Several experiments were carried out to validate the effectiveness and practicality of the GLS algorithm, including path-planning experiments in the presence of obstacles in a complex dynamic environment. The findings indicate that the robot could successfully find the correct path while avoiding obstacles. The proposed method is compared to other popular methods in terms of speed and path length in both real and simulated environments. According to the results, the GLS algorithm outperformed the original laser simulator (LS) method in path and success rate. With application of the all-direction border scan, it outperforms the A-star (A*) and PRM algorithms and provides safer and shorter paths. Furthermore, the path planning approach was validated for local planning in simulation and real-world tests, in which the proposed method produced the best path compared to the original LS algorithm.

mobile robot path planningobstacle avoidancedynamic obstaclesstatic obstacles