A Tree-based Next-best-trajectory Method for 3D UAV Exploration

July 05, 2024 Β· Entered Twilight Β· πŸ› IEEE Transactions on robotics

πŸ’€ TWILIGHT: Eternal Rest
Repo abandoned since publication

Repo contents: .gitignore, CMakeLists.txt, LICENSE, README.md, config, controller, docker, launch, nmpc_test.py, package.xml, rrt_costgen.py, rviz, scripts, src, trajectory.py

Authors Bjârn Lindqvist, Akash Patel, Kalle Lâfgren, George Nikolakopoulos arXiv ID 2407.04386 Category cs.RO: Robotics Citations 28 Venue IEEE Transactions on robotics Repository https://github.com/LTU-RAI/ExplorationRRT ⭐ 206 Last Checked 1 month ago
Abstract
This work presents a fully integrated tree-based combined exploration-planning algorithm: Exploration-RRT (ERRT). The algorithm is focused on providing real-time solutions for local exploration in a fully unknown and unstructured environment while directly incorporating exploratory behavior, robot-safe path planning, and robot actuation into the central problem. ERRT provides a complete sampling and tree-based solution for evaluating "where to go next" by considering a trade-off between maximizing information gain, and minimizing the distances travelled and the robot actuation along the path. The complete scheme is evaluated in extensive simulations, comparisons, as well as real-world field experiments in constrained and narrow subterranean and GPS-denied environments. The framework is fully ROS-integrated, straight-forward to use, and we open-source it at https://github.com/LTU-RAI/ExplorationRRT.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Robotics