نتایج جستجو برای: exploring random trees

تعداد نتایج: 469733  

Journal: :CoRR 2017
Yuying Chen Ming Liu

Challenges persist in nonholonomic robot navigation for dynamic environments. This paper presents a framework for nonholonomic robot navigation in dynamic environment based on the model of Generalized Velocity Obstacles (GVO). The idea of velocity obstacles has been well studied and developed for obstacle avoidance since proposed in 1998. Though proved to be successful, most studies assume equa...

2014
Woo-Young Go Jong-Hwan Kim

This paper proposes real time wireless remote control of robot dual arms and hands using IMUs (Inertial measurement unit). The remote control system is developed for robots to learn various complex tasks from operator’s demonstration. The control system helps robots to make human-like motion planning directly through operator’s demonstration rather than the RRT (Rapidly-Exploring Random Tree) a...

2011
Vidal Alcázar Manuela M. Veloso Daniel Borrajo

Rapidly-exploring random trees (RRTs) are data structures and search algorithms designed to be used in continuous path planning problems. They are one of the most successful state-of-the-art techniques as they offer a great degree of flexibility and reliability. However, their use in other search domains has not been thoroughly analyzed. In this work we propose the use of RRTs as a search algor...

2013
Ernesto Homar Teniente Avilés Juan Andrade-Cetto

We propose HRA*, a new randomized path planner for complex 3D environments. The method is a modified A* algorithm that uses a hybrid node expansion technique that combines a random exploration of the action space meeting vehicle kinematic constraints with a cost to goal metric that considers only kinematically feasible paths to the goal. The method includes also a series of heuristics to accele...

Journal: :Random Structures and Algorithms 2007

2014
Didier Devaurs Thierry Siméon Juan Cortés

Sampling-based algorithms for path planning have achieved great success during the last 15 years, thanks to their ability to efficiently solve complex high-dimensional problems. However, standard versions of these algorithms cannot guarantee optimality or even high-quality for the produced paths. In recent years, variants of these methods, taking cost criteria into account during the exploratio...

Journal: :The Electronic Journal of Combinatorics 2018

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید