Multi-goal path finding (MGPF) aims to find a closed and collision-free path to visit a sequence of goals orderly. As a physical travelling salesman problem, an undirected complete graph with accurate weights is crucial for determining the visiting order. Lack of prior knowledge of local paths between vertices poses challenges in meeting the optimality and efficiency requirements of algorithms. In this study, a multi-task learning model designated Prior Knowledge Extraction (PKE), is designed to estimate the local path length between pairwise vertices as the weights of the graph. Simultaneously, a promising region and a guideline are predicted as heuristics for the path-finding process. Utilizing the outputs of the PKE model, a variant of Rapidly-exploring Random Tree (RRT) is proposed known as PKE-RRT. It effectively tackles the MGPF problem by a local planner incorporating a prioritized visiting order, which is obtained from the complete graph. Furthermore, the predicted region and guideline facilitate efficient exploration of the tree structure, enabling the algorithm to rapidly provide a sub-optimal solution. Extensive numerical experiments demonstrate the outstanding performance of the PKE-RRT for the MGPF problem with a different number of goals, in terms of calculation time, path cost, sample number, and success rate.
Multi-goal Rapidly Exploring Random Tree with Safety and Dynamic Constraints for UAV Cooperative Path Planning
Vietnam National University, Hanoi(越南河内国家大学);Thai Nguyen University of Technology, Thai Nguyen University(太原大学太原工业学院);University of Transport and Communications(交通通信大学);Fulbright University Vietnam(越南富布赖特大学)
Autonomous Underwater Vehicle-Manipulator Systems Path Planning with RRTAUVMS Algorithm
Zhejiang University(浙江大学);Shenzhen Sensetime Technology CO.,LTD(深圳商汤科技有限公司);Shenzhen Institutes of Advanced Technology, Chinese Academy of Sciences(中国科学院深圳先进技术研究院)
Multi-UAV Formation Cooperative Obstacle Avoidance and Adaptive Shape Deformation Control in Complex Environments Based on BI-APF-RRT and Affine Transformation
College of Marine Information Engineering(海洋信息工程学院)
Multi-Risk-RRT: An Efficient Motion Planning Algorithm for Robotic Autonomous Luggage Trolley Collection at Airports
Southern University of Science and Technology(南方科技大学);Jiaxing Research Institute, Southern University of Science and Technology(南方科技大学嘉兴研究院);University of Pennsylvania(宾夕法尼亚大学);Shanghai Jiao Tong University(上海交通大学);Yanshan University(燕山大学)
Research on UAV Applications in Public Administration: Based on an Improved RRT Algorithm
Faculty of Humanities and Social Sciences(人文与社会科学学院);College of Animal Science and Technology(动物科学与技术学院);Faculty of Applied Sciences(应用科学学院);School of Economics and Management(经济与管理学院)
Planning Nonlinear Access Paths for Temporal Bone Surgery
Department of Computer Science, Technische Universität Darmstadt, Germany(德国达姆施塔特工业大学计算机科学系)
目的:耳底的干预在颞骨的狭窄区域中进行,在该区域中,几个高度敏感的器官以最小的手术器械间隙限定障碍物。潜在微创干预的非线性轨迹可以提供更大的风险结构距离和手术器械的优化方向,从而与现有线性方法相比改善临床结局。在本文中,我们提出了快速和准确的规划方法,这种非线性访问路径。研究方法:我们在SE(3)= R3 x SO(3)中定义了一个特定的运动规划问题,在计算时间和目标姿势方面具有显着的约束,反映了颞骨手术的要求。然后我们提出了k-RRT-Connect:两个合适的运动规划器基于双向快速探索随机树(RRT)来有效地解决这个问题。结果:在患者的真实CT数据上证明了k-RRT-Connect的受益。它们的一般性能在大量逼真的合成解剖结构上显示出来。我们还表明,这些新的算法优于最先进的方法,圆弧或Bezier样条曲线的基础上,应用到这个特定的问题。结论:通过这项工作,我们证明了术前和术中规划的非线性访问路径是可能的微创手术在耳底。
Southern University of Science and Technology(南方科技大学);The Chinese University of Hong Kong(香港中文大学);Shenzhen Research Institute, The Chinese University of Hong Kong(香港中文大学深圳研究院)
The Bulldozer Technique: Efficient Elimination of Local Minima Traps for APF-Based Robot Navigation
Smart Automation and Communication Technologies (SACT), Research Institute of Sciences and Engineering, University of Sharjah, UAE(智能自动化与通信技术(SACT)、科学与工程研究院、沙迦大学,阿联酋);Computer Engineering Department, University of Sharjah, UAE(计算机工程系、沙迦大学,阿联酋)
Relevant Region Sampling Strategy with Adaptive Heuristic for Asymptotically Optimal Path Planning
The Chinese University of Hong Kong(香港中文大学);Southern University of Science and Technology(南方科技大学);Shenzhen Research Institute of the Chinese University of Hong Kong(香港中文大学深圳研究院)
Local Path Planning and Obstacle Avoidance for an Omnicopter Platform
Faculty of Aerospace Engineering, Delft University of Technology(代尔夫特理工大学航空航天工程学院);Mohamed Bin Zayed University of Artificial Intelligence(穆罕默德·本·扎耶德人工智能大学);Center for Artificial Intelligence and Robotics, New York University Abu Dhabi(纽约大学阿布扎比分校人工智能与机器人中心)