Asset Details
Do you wish to reserve the book?
An Efficient Sampling-Based Path Planning for the Lunar Rover with Autonomous Target Seeking
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
An Efficient Sampling-Based Path Planning for the Lunar Rover with Autonomous Target Seeking
Do you wish to request the book?
An Efficient Sampling-Based Path Planning for the Lunar Rover with Autonomous Target Seeking
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Journal Article
An Efficient Sampling-Based Path Planning for the Lunar Rover with Autonomous Target Seeking
2022
Overview
This paper presents an efficient path planning method for the lunar rover to improve the autonomy and exploration ability in the complex and unstructured lunar surface environment. Firstly, the safe zone for the rover’s motion is defined, based on which a detecting point selection strategy is proposed to choose target positions that meet the rover’s constraints. Secondly, an improved sampling-based path planning method is proposed to get a safe path for the rover efficiently. Thirdly, a map extension strategy for the unstructured and continually varying environment is included to update the roadmap, which takes advantage of the historical planning information. Finally, the proposed method is tested in a complex lunar surface environment. Numerical results show that the appropriate detecting positions can be selected autonomously, while a safe path to the selected detecting position can be obtained with high efficiency and quality compared with the Probabilistic Roadmap (PRM) and A* search algorithm.
Publisher
MDPI AG
Subject
