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

Research outputs

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

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

2 مُخرَج نتائج البحث عن «dueling DQN»

مقالوصول مغلق202512استشهاد· Semantic Scholar

Consumer Technology in Task Offloading and Edge Resource Allocation: AIoT and Edge Computing for Next-Generation Communication

IEEE Transactions on Consumer Electronics · مجلد 71 (2) · 5356-5365

Artificial Intelligence of Things (AIoT) edge computing has emerged as a critical enabler for consumer technology, easing the load on distribution grid networks through enhanced data transmission and processing capabilities. The Internet of Things (IoT), a modern network paradigm, connects devices using sensors and communication mediums to enable seamless information exchange. However, the limited computational capacity of edge nodes poses challenges in optimizing AIoT edge resources compared to cloud computing. To address this, a cloud-edge three-layer framework for task offloading and edge resource allocation is proposed in the context of consumer technology and distribution grids. This model incorporates random tasks, limited resources, unequal processing power, and high latency requirements. It features two key phases: a resource auction using a multi-round iterative process and compute offloading managed by a Deep Reinforcement Learning (DRL) approach. Enhanced algorithms such as Double DQN and Dueling DQN are integrated into the job offloading process to improve performance. Simulations validate the convergence of the task offloading algorithm and demonstrate that the proposed methods significantly enhance computational efficiency and resource utilization for edge nodes. These advancements offer promising solutions for the dynamic needs of consumer technology and future communication networks.

task offloadingedge resource allocationAIoTedge computing
ورقة مؤتمروصول مغلق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