Aug 2026· International Conference on Methods & Models in Automation & Robotics· pp. 70-75· 0 citations· 11 references
Abstract
This paper presents an RL (Reinforcement Learning) inspired pairwise path selection framework for multi-agent navigation in an offline setting. Path performance is quantified using interaction metrics derived from artificial potential field (APF)-based collision avoidance, together with overall task completion time. These metrics are incorporated into a reward formulation that captures both safety and efficiency. A neural network model is trained using pairwise comparisons of path executions, enabling the system to learn relative preferences among candidate path. This formulation eliminates the need for continuous environment interaction during training while preserving key characteristics of reward-driven optimization. The framework is validated through simulations implemented in ROS 2 (Robot Operating System) using TurtleBot4 platforms in a warehouse environment. Multiple path combinations are evaluated under varying interaction conditions. Results demonstrate stable training convergence, high ranking accuracy, and clear discrimination between efficient and conflict-prone paths.
Simulations indicate that the SHPP framework can establish a stable policy in approximately 625 episodes, and benefiting from the hierarchical architecture's smooth optimization in continuous space, the average flight path length is 138.3 meters, a reduction of approximately 19% compared to traditional discrete decisio...
Fei Wang, Jun-Yong Shi, Zhao-Kun Chen et al.· International Conference on...· 0 citations
This paper proposes a reinforcement learning (RL)-guided multi-objective trajectory planning framework, termed RL-MOP-HNE, for a 6-DOF UR5 manipulator, which simultaneously minimizes path length, energy consumption, and execution time while satisfying collision-avoidance, kinematic, and dynamic constraints.
Zhen-Long Zhao, Shu-Tao Hao, Bi-Hao Jin et al.· Scientific Reports· 0 citations
Multi-agent path planning remains a challenging problem in deep reinforcement learning due to inefficient coordination, excessive exploration, and unstable training dynamics. Although Multi-Agent Deep Deterministic Policy Gradient (MADDPG) has been widely adopted for cooperative decision-making tasks, its performance i...
Fei-Fan Fang, Guo-Liang Jing, Qi Wang et al.· Applied Sciences· 0 citations
Autonomous navigation in mobile robotics faces significant challenges in dynamic, unstructured environments, as re-planning strategies often lack time efficiency when recomputing around new obstacles. Traditional path-planning algorithms typically rely on static, pre-mapped environments and rigid geometric rules, which...
Luis Angel Castañeda Barron, Miguel Andres Meillon Ramirez, Cristóbal Armiñan Ibarra et al.· Optics and Photonics for Inf...· 0 citations
Path planning is essential to autonomous navigation in mobile robots, and its performance directly affects task execution efficiency and operational safety. To address the limited convergence accuracy, susceptibility to local optima, and limited late-stage exploitation capability of the walrus optimizer (WO) in path pl...
Min Wu, Bing-Xing Liu, Kun-Ting Zhao et al.· Measurement science and tech...· 0 citations
An Enhanced Competition of Tribes and Cooperation of Members Method based on the competition-cooperation search framework of the Competition of Tribes and Cooperation of Members Method (CTCM) can improve path quality, convergence accuracy, and search stability, providing a competitive optimization method for agent path...
Xiao-Yuan Li, Guang-Hui Li, Tai-Hua Zhang et al.· Journal of King Saud Univers...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.