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

Research outputs

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

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

2 مُخرَج نتائج البحث عن «motion 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
ورقة مؤتمروصول مغلق20251استشهاد· Semantic Scholar

Deep Reinforcement Learning-Based Multi-Robotic Agent Motion Planning

OPJU International Technology Conference on Smart Computing for Innovation and Advancement in Industry (OTCON) · 1-6

The deep Q-network (DQN) technique, as a classic value-based deep reinforcement learning process, has been widely applied in fields such as multi-robotic agent motion planning. However, the DQN method faces a series of tasks, such as overestimating Q-values, complex Q-value computations, neural networks lacking historical memory proficiencies, and inefficient exploration when using ε-greedy strategies. This paper proposes a DQN-based multi-robot agent deep reinforcement learning motion planning approach to solve these problems. To accomplish their objectives without colliding with one another, agents can acquire stable and efficient motion planning techniques with the aid of this method. Initially, a Dueling-based optimization tool is suggested, which is based on the DQN approach. It simplifies and improves the calculation of Q-values by calculating state values and advantage function values, and by choosing the appropriate action based on the parameters of the presently updating Q-value network. Additionally, we provide a GRU-based memory mechanism that incorporates GRU modules to facilitate the network's temporal data acquisition and handling of agents' historical information. And lastly, we offer a noise-based exploration technique that works. By introducing parameterized noise, the exploration technique in DQN is modified, improving the examination efficiency of agents, and achieving a balance between exploration and exploitation in multi-robotic agent systems. Tests were conducted in six different simulation scenarios on the PyBullet simulation platform. Experimental results show that the proposed method enables efficient collaboration among multi-robotic agent teams, agreeing them to go where they're going without running into each other, and the methods' training is steady.

multi-robot motion planningdeep Q-networkdueling DQNexploration-exploitation balance