TY - JOUR
T1 - Robot Navigation in Dynamic and Crowded Environments
AU - Tao, Xiuye
AU - Li, Huiping
AU - Chen, Zhang
AU - Xu, Demin
N1 - Publisher Copyright:
© 1993-2012 IEEE.
PY - 2025
Y1 - 2025
N2 - Mobile robots are increasingly implemented in various scenarios. However, navigating in crowded environments with moving obstacles and uncertain intentions poses significant challenges for robots. To address this challenge, we propose a novel social-based planning framework, which integrates behavior planning and motion planning to generate safe and efficient paths for robot navigation. In the behavior planning part, we first design an efficient method based on the graph to construct frozen areas to increase safety. Then, we build the cost function and propose the social behavior sampling strategy to adaptively generate behavior paths for dynamic environments. Next, we design the backward optimization algorithm that can directly optimize behavior paths in the continuous space efficiently. In the motion planning part, we develop the forward reachable set (FRS)-based algorithm to sample paths that can satisfy kinematic constraints. Furthermore, we design a collision-risk evaluation method to determine the optimal motion path by considering the interactions. Experiments and comparison studies verify the advantages of the proposed path-planning method in terms of average moving speed and collision risk.
AB - Mobile robots are increasingly implemented in various scenarios. However, navigating in crowded environments with moving obstacles and uncertain intentions poses significant challenges for robots. To address this challenge, we propose a novel social-based planning framework, which integrates behavior planning and motion planning to generate safe and efficient paths for robot navigation. In the behavior planning part, we first design an efficient method based on the graph to construct frozen areas to increase safety. Then, we build the cost function and propose the social behavior sampling strategy to adaptively generate behavior paths for dynamic environments. Next, we design the backward optimization algorithm that can directly optimize behavior paths in the continuous space efficiently. In the motion planning part, we develop the forward reachable set (FRS)-based algorithm to sample paths that can satisfy kinematic constraints. Furthermore, we design a collision-risk evaluation method to determine the optimal motion path by considering the interactions. Experiments and comparison studies verify the advantages of the proposed path-planning method in terms of average moving speed and collision risk.
KW - Backward optimization algorithm
KW - collision-risk evaluation method
KW - crowded environments
KW - forward reachable set (FRS)-based algorithm
KW - uncertain intentions
UR - http://www.scopus.com/inward/record.url?scp=105008031531&partnerID=8YFLogxK
U2 - 10.1109/TCST.2025.3575687
DO - 10.1109/TCST.2025.3575687
M3 - 文章
AN - SCOPUS:105008031531
SN - 1063-6536
JO - IEEE Transactions on Control Systems Technology
JF - IEEE Transactions on Control Systems Technology
ER -