Socially Adaptive Path Planning Based on Generative Adversarial Network

The natural interaction between robots and pedestrians in the process of autonomous navigation is crucial for the intelligent development of mobile robots, which requires robots to fully consider social rules and guarantee the psychological comfort of pedestrians. Learning-based socially adaptive algorithms have shown promise in specific human-robot interaction environments, yet generalization of robot path planning requires improvement. This work combines the generative adversarial network (GAN) with the Optimal Rapidly-exploring Random Tree (RRT*) navigation algorithm. It proposes a GAN model with strong generalization performance and a GAN-RRT* algorithm for path generation in human-robot interaction environments. Additionally, a socially adaptive path planning framework named GAN-RTIRL is presented, which combines GAN with Rapidly-exploring random Trees Inverse Reinforcement Learning (RTIRL) to enhance the homotopy rate between planned and demonstration paths. The GAN-RRT* path planner can update the GAN model from the demonstration path, enabling the robot to generate more anthropomorphic paths and have stronger generalization in complex environments. Experimental results indicate that the proposed method effectively improves the anthropomorphic degree of robot motion planning and the homotopy rate.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Intelligent Vehicles
Published
2024-10-10
DOI
https://doi.org/10.1109/tiv.2024.3478219
Citations
4
Primary Topic
Robotic Path Planning Algorithms
Type
article
Field-Weighted Citation Impact
1.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Socially Adaptive Path Planning Based on Generative Adversarial Network

Wenzheng Chi, Jiajie Yu, Yuqi Kong, Jiankun Wang et al.
4 citations
IEEE Transactions on Intelligent Vehicles
Robotic Path Planning Algorithms
1.00
article

Socially Adaptive Path Planning Based on Generative Adversarial Network

Wenzheng Chi, Jiajie Yu, Yuqi Kong, Jiankun Wang, Yao Wang, Lining Sun, Chao Liu
article en
4 citations

Abstract

The natural interaction between robots and pedestrians in the process of autonomous navigation is crucial for the intelligent development of mobile robots, which requires robots to fully consider social rules and guarantee the psychological comfort of pedestrians. Learning-based socially adaptive algorithms have shown promise in specific human-robot interaction environments, yet generalization of robot path planning requires improvement. This work combines the generative adversarial network (GAN) with the Optimal Rapidly-exploring Random Tree (RRT*) navigation algorithm. It proposes a GAN model with strong generalization performance and a GAN-RRT* algorithm for path generation in human-robot interaction environments. Additionally, a socially adaptive path planning framework named GAN-RTIRL is presented, which combines GAN with Rapidly-exploring random Trees Inverse Reinforcement Learning (RTIRL) to enhance the homotopy rate between planned and demonstration paths. The GAN-RRT* path planner can update the GAN model from the demonstration path, enabling the robot to generate more anthropomorphic paths and have stronger generalization in complex environments. Experimental results indicate that the proposed method effectively improves the anthropomorphic degree of robot motion planning and the homotopy rate.

IEEE Transactions on Intelligent VehiclesVol. 10(8)
Southern University of Science and Technology (CN), Soochow University (CN)
Openalex Percentile: Top 22%
Robotic Path Planning Algorithms
1.00
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.