qRRT: Quality-Biased Incremental RRT for Optimal Motion Planning in Non-Holonomic Systems
This paper presents a sampling-based method for optimal motion planning in non-holonomic systems in the absence of known cost functions. It uses the principle of learning through experience to deduce the cost-to-go of regions within the workspace. This cost information is used to bias an incremental graph-based search algorithm that produces solution trajectories. Iterative improvement of cost information and search biasing produces solutions that are proven to be asymptotically optimal. The proposed framework builds on incremental Rapidly-exploring Random Trees (RRT) for random sampling-based search and Reinforcement Learning (RL) to learn workspace costs. A series of experiments were performed to evaluate and demonstrate the performance of the proposed method.
Code (0)
등록된 구현이 없습니다.
Tasks
Motion PlanningOptimal Motion Planningreinforcement-learningReinforcement Learning (RL)Similar Papers 제목 키워드 기반
Rapidly-Exploring Quotient-Space Trees: Motion Planning using Sequential Simplifications
Motion planning problems can be simplified by admissible projections of the configuration space to sequences of lower-dimensional quotient-spaces, called sequential simplifications. To exploit sequential simplifications,…
Motion Planning3D Reconstruction via Incremental Structure From Motion
Accurate 3D reconstruction from unstructured image collections is a key requirement in applications such as robotics, mapping, and scene understanding. While global Structure from Motion (SfM) techniques rely on full ima…
Scene Understanding3D ReconstructionIncremental Sampling-based Motion Planners Using Policy Iteration Methods
Recent progress in randomized motion planners has led to the development of a new class of sampling-based algorithms that provide asymptotic optimality guarantees, notably the RRT* and the PRM* algorithms. Careful analys…
Motion PlanningUnbiased and Efficient Sampling of Dependency Trees
Most computational models of dependency syntax consist of distributions over spanning trees. However, the majority of dependency treebanks require that every valid dependency tree has a single edge coming out of the ROOT…
validRevisiting Replanning from Scratch: Real-Time Incremental Planning with Fast Almost-Surely Asymptotically Optimal Planners
Robots operating in changing environments either predict obstacle changes and/or plan quickly enough to react to them. Predictive approaches require a strong prior about the position and motion of obstacles. Reactive app…