题名 | Bidirectional Search Strategy for Incremental Search-based Path Planning |
作者 | |
通讯作者 | Jiankun Wang; Max Q.-H. Meng |
DOI | |
发表日期 | 2023
|
会议名称 | 2023 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)
|
ISSN | 2153-0858
|
ISBN | 978-1-6654-9191-4
|
会议录名称 | |
页码 | 7311-7317
|
会议日期 | 1-5 Oct. 2023
|
会议地点 | Detroit, MI, USA
|
出版地 | 345 E 47TH ST, NEW YORK, NY 10017 USA
|
出版者 | |
摘要 | Planning a collision-free path efficiently among obstacles is crucial in robotics. Conventional one-shot unidirectional path planning algorithms work well in the static environment, but cannot respond to the environment changes timely in the dynamic environment. To tackle this issue and improve the search efficiency, we propose a bidirectional incremental search method, Bidirectional Lifelong Planning A* (BLPA*), which searches in the forward and backward directions and performs incremental search bidirectionally when the environment changes. Furthermore, inspired by the robot perception range limitation and BLPA*, we propose the fractional bidirectional D* Lite (fBD* Lite(dp)), which constraints the forward search to the robot perception range and uses the backward search to expand the rest area. Our simulation results demonstrate BLPA* and fBD* Lite(dp) can achieve superior performance in the dynamic environment. It reveals that the bidirectional incremental search strategy can be a general and efficient technique for graph-search-based robot path planning methods. |
关键词 | |
学校署名 | 通讯
|
语种 | 英语
|
相关链接 | [IEEE记录] |
收录类别 | |
资助项目 | National Key Research and Development Program of China[2019YFB1312400]
; Shenzhen Outstanding Scientific and Technological Innovation Talents Training Project[RCBS20221008093305007]
; National Natural Science Foundation of China[62103181]
|
WOS研究方向 | Computer Science
; Robotics
|
WOS类目 | Computer Science, Artificial Intelligence
; Computer Science, Information Systems
; Computer Science, Theory & Methods
; Robotics
|
WOS记录号 | WOS:001136907801105
|
EI入藏号 | 20240315412786
|
EI主题词 | Robot Programming
|
EI分类号 | Computer Programming:723.1
; Robotics:731.5
|
来源库 | IEEE
|
全文链接 | https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10342039 |
引用统计 | |
成果类型 | 会议论文 |
条目标识符 | http://sustech.caswiz.com/handle/2SGJ60CL/619950 |
专题 | 工学院_电子与电气工程系 |
作者单位 | 1.Department of Electronic Engineering, The Chinese University of Hong Kong, Shatin, N.T., Hong Kong SAR, China 2.Department of Electronic and Electrical Engineering, Shenzhen Key Laboratory of Robotics Perception and Intelligence, Southern University of Science and Technology, Shenzhen, China |
通讯作者单位 | 电子与电气工程系 |
推荐引用方式 GB/T 7714 |
Chenming Li,Han Ma,Jiankun Wang,et al. Bidirectional Search Strategy for Incremental Search-based Path Planning[C]. 345 E 47TH ST, NEW YORK, NY 10017 USA:IEEE,2023:7311-7317.
|
条目包含的文件 | 条目无相关文件。 |
|
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。
修改评论