Avoiding Dense Pedestrian Regions: A New Rapidly-Exploring Random Tree (RRT ∗) Algorithm for Shortest Travel Time
Currently, regardless of the algorithm used, motion planners for dealing with dynamic obstructions need to rely on high-precision sensors and high performance processors. The requirements for hardware increase as the density of dynamic obstructions in an area becomes higher. Additionally, motion pla...
Saved in:
Main Authors: | H. S. Zhen, W. A. Kang, X. Y. Liu, Z. L. Wei |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2024-01-01
|
Series: | Journal of Robotics |
Online Access: | http://dx.doi.org/10.1155/2024/1592587 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Obstacle Avoidance Path Planning for UAV Based on Improved RRT Algorithm
by: Fan Yang, et al.
Published: (2022-01-01) -
A novel RRT*-Connect algorithm for path planning on robotic arm collision avoidance
by: Miaolong Cao, et al.
Published: (2025-01-01) -
NPQ-RRT∗: An Improved RRT∗ Approach to Hybrid Path Planning
by: Zihan Yu, et al.
Published: (2021-01-01) -
Algorithms for Searching the Shortest Path and Its Modification
by: N. I. Listopad, et al.
Published: (2016-06-01) -
Simulation of Pedestrian Behavior in the Collision-Avoidance Process considering Their Moving Preferences
by: Zhilu Yuan, et al.
Published: (2017-01-01)