计算机科学
运动规划
粒子群优化
路径(计算)
移动机器人
任务(项目管理)
人工智能
避障
群体行为
树(集合论)
障碍物
机器人
最短路径问题
实时计算
机器学习
数学
工程类
地理
程序设计语言
图形
考古
理论计算机科学
数学分析
系统工程
作者
Muhammet Fatih Aslan,Akif Durdu,Kadir Sabancı
标识
DOI:10.1016/j.asoc.2023.110156
摘要
The basic conditions for mobile robots to be autonomous are that the mobile robot localizes itself in the environment and knows the geometric structure of the environment (map). After these conditions are met, this mobile robot is given a specific task, but how the robot will navigate for this task is an important issue. Especially for Unmanned Aerial Vehicles (UAV), whose application has increased recently, path planning in a three-dimensional (3D) environment is a common problem. This study performs three experimental applications to discover the most suitable path for UAV in 3D environments with large and many obstacles. Inspired by Rapidly Random-Exploring Tree Star (RRT*), the first implementation develops the Goal Distance-based RRT* (GDRRT*) approach, which performs intelligent sampling taking into account the goal distance. In the second implementation, the path discovered by GDRRT* is shortened using Particle Swarm Optimization (PSO) (PSO-GDRRT*). In the final application, a network with a Bidirectional Long/Short Term Memory (BiLSTM) layer is designed for fast estimation of optimal paths found by PSO-GDRRT* (BiLSTM-PSO-GDRRT*). As a result of these applications, this study provides important novelties: GDRRT* converges to the goal faster than RRT* in large and obstacle-containing 3D environments. To generate groundtruth paths for training the learning-based network, PSO-GDRRT* finds the shortest paths relatively quickly. Finally, BiLSTM-PSO-GDRRT* provides extremely fast path planning for real-time UAV applications. This work is valuable for real-time autonomous UAV applications in a complex and large environment, as the new methods it offers have fast path planning capability.
科研通智能强力驱动
Strongly Powered by AbleSci AI