中文版 | English
Title

Focused Bidirectional Search Trees: A Bidirectional Optimal Fast Matching Method for Robot Path Planning

Author
DOI
Publication Years
2023
ISBN
979-8-3503-2719-9
Source Title
Pages
638-643
Conference Date
17-20 July 2023
Conference Place
Datong, China
Keywords
SUSTech Authorship
Others
URL[Source Record]
Data Source
IEEE
PDF urlhttps://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10249227
Citation statistics
Cited Times [WOS]:0
Document TypeConference paper
Identifierhttp://kc.sustech.edu.cn/handle/2SGJ60CL/567758
DepartmentDepartment of Electrical and Electronic Engineering
Affiliation
1.Department of Electronic Engineering, The Chinese University of Hong Kong, 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
Recommended Citation
GB/T 7714
Chenming Li,Jiankun Wang,Max Q.-H. Meng. Focused Bidirectional Search Trees: A Bidirectional Optimal Fast Matching Method for Robot Path Planning[C],2023:638-643.
Files in This Item:
There are no files associated with this item.
Related Services
Fulltext link
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Export to Excel
Export to Csv
Altmetrics Score
Google Scholar
Similar articles in Google Scholar
[Chenming Li]'s Articles
[Jiankun Wang]'s Articles
[Max Q.-H. Meng]'s Articles
Baidu Scholar
Similar articles in Baidu Scholar
[Chenming Li]'s Articles
[Jiankun Wang]'s Articles
[Max Q.-H. Meng]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Chenming Li]'s Articles
[Jiankun Wang]'s Articles
[Max Q.-H. Meng]'s Articles
Terms of Use
No data!
Social Bookmark/Share
No comment.

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.