An Efficient and Lightweight Multi-Goal Path Planning Based on Enhanced Sampling Planner

TY - JOUR

T1 - An Efficient and Lightweight Multi-Goal Path Planning Based on Enhanced Sampling Planner

AU - Zhang, Runda

AU - Chai, Runqi

AU - Chai, Senchun

AU - Xia, Yuanqing

N1 - Publisher Copyright: © 2016 IEEE. All rights reserved.

PY - 2026/5/1

Y1 - 2026/5/1

N2 - In this work, we propose a novel lightweight and efficient multi-goal path planning (MGPP) framework tailored for complex environments with obstacles. The framework adopts a hierarchical architecture consisting of two layers: a visiting order decision layer and an incremental sampling-based planning layer. In the visiting order decision layer, a lightweight feature node graph (FNG) is constructed to capture the connectivity structure of the environment. Based on the FNG, a multi-query strategy is employed to efficiently build the goal-to-goal cost matrix, achieving both computational efficiency and completeness. Given this cost matrix, a near-optimal Hamiltonian path with fixed start and end points is computed to determine the visiting order of the goal set. In the path planning layer, an enhanced sampling-based path planner is developed to perform efficient goal-to-goal path planning. The proposed enhanced sampling method explores multiple homotopy classes of interest, which improves planning efficiency and helps avoid local minima. Finally, extensive simulations and experiments validate the effectiveness and advantages of the proposed method.

AB - In this work, we propose a novel lightweight and efficient multi-goal path planning (MGPP) framework tailored for complex environments with obstacles. The framework adopts a hierarchical architecture consisting of two layers: a visiting order decision layer and an incremental sampling-based planning layer. In the visiting order decision layer, a lightweight feature node graph (FNG) is constructed to capture the connectivity structure of the environment. Based on the FNG, a multi-query strategy is employed to efficiently build the goal-to-goal cost matrix, achieving both computational efficiency and completeness. Given this cost matrix, a near-optimal Hamiltonian path with fixed start and end points is computed to determine the visiting order of the goal set. In the path planning layer, an enhanced sampling-based path planner is developed to perform efficient goal-to-goal path planning. The proposed enhanced sampling method explores multiple homotopy classes of interest, which improves planning efficiency and helps avoid local minima. Finally, extensive simulations and experiments validate the effectiveness and advantages of the proposed method.

KW - (MGPP)

KW - Motion planning, multi-goal path planning

KW - robotics

KW - sampling-based planning

UR - https://www.scopus.com/pages/publications/105032771711

U2 - 10.1109/LRA.2026.3671564

DO - 10.1109/LRA.2026.3671564

M3 - Article

AN - SCOPUS:105032771711

SN - 2377-3766

VL - 11

SP - 5462

EP - 5469

JO - IEEE Robotics and Automation Letters

JF - IEEE Robotics and Automation Letters

IS - 5

ER -