Results 231 to 240 of about 142,389 (277)
Some of the next articles are maybe not open access.
EB-RRT: Optimal Motion Planning for Mobile Robots
IEEE Transactions on Automation Science and Engineering, 2020In a human–robot coexisting environment, it is pivotal for a mobile service robot to arrive at the goal position safely and efficiently. In this article, an elastic band-based rapidly exploring random tree (EB-RRT) algorithm is proposed to achieve real ...
Jiankun Wang, M. Meng, O. Khatib
semanticscholar +1 more source
Design, optimization, and application of multiplex rRT-PCR in the detection of respiratory viruses
Critical reviews in clinical laboratory sciences, 2022Viral respiratory infections are common and serious diseases. Because there is no effective treatment method or vaccine for respiratory tract infection, early diagnosis is vital to identify the pathogen so as to determine the infectivity of the patient ...
Jing Yang +4 more
semanticscholar +1 more source
2015 IEEE International Conference on Robotics and Automation (ICRA), 2015
Reachable volumes are a new technique that allows one to efficiently restrict sampling to feasible/reachable regions of the planning space even for high degree of freedom and highly constrained problems. However, they have so far only been applied to graph-based sampling-based planners.
McMahon, Troy; id_orcid 0009-0003-6910-7383 +2 more
openaire +3 more sources
Reachable volumes are a new technique that allows one to efficiently restrict sampling to feasible/reachable regions of the planning space even for high degree of freedom and highly constrained problems. However, they have so far only been applied to graph-based sampling-based planners.
McMahon, Troy; id_orcid 0009-0003-6910-7383 +2 more
openaire +3 more sources
Proceedings 2006 IEEE International Conference on Robotics and Automation, 2006. ICRA 2006., 2006
We present a replanning algorithm for repairing rapidly-exploring random trees when changes are made to the configuration space. Instead of abandoning the current RRT, our algorithm efficiently removes just the newly-invalid parts and maintains the rest. It then grows the resulting tree until a new solution is found.
D. Ferguson, N. Kalra, A. Stentz
openaire +1 more source
We present a replanning algorithm for repairing rapidly-exploring random trees when changes are made to the configuration space. Instead of abandoning the current RRT, our algorithm efficiently removes just the newly-invalid parts and maintains the rest. It then grows the resulting tree until a new solution is found.
D. Ferguson, N. Kalra, A. Stentz
openaire +1 more source
RRT-based path planning for an intelligent litchi-picking manipulator
Computers and Electronics in Agriculture, 2019Aiming to realize the obstacle avoidance of the litchi-picking robot in dynamic and unstructured environments, an improved rapidly exploring random tree (RRT) algorithm is presented in this study.
Xiaoman Cao +4 more
semanticscholar +1 more source
Dynamic RRT: Fast Feasible Path Planning in Randomly Distributed Obstacle Environments
Journal of Intelligent and Robotic Systems, 2023Penglei Zhao +12 more
semanticscholar +1 more source
Stack-RRT*: A Random Tree Expansion Algorithm for Smooth Path Planning
International Journal of Control, Automation and Systems, 2023Bin Liao +5 more
semanticscholar +1 more source
Narrow passage RRT*: a new variant of RRT*
International Journal of Computational Vision and Robotics, 2022Amine Belaid +2 more
openaire +1 more source
Cloud RRT*: Sampling Cloud based RRT*
2014 IEEE International Conference on Robotics and Automation (ICRA), 2014Donghyuk Kim +2 more
openaire +1 more source