Back to Results
First PageMeta Content
Robot control / Theoretical computer science / Rapidly-exploring random tree / Operations research / Motion planning / Shortest path problem / Heuristic function / Simulated annealing / Mathematical optimization / Mathematics / Search algorithms / Applied mathematics


Transition-Based RRT for Path Planning in Continuous Cost Spaces
Add to Reading List

Document Date: 2008-10-26 12:55:11


Open Document

File Size: 983,17 KB

Share Result on Facebook

City

Palo Alto / T RANSITION / New York / /

Company

Cambridge University Press / MIT Press / Tioga Publishing Company / Authorized / bottom- 2148 Authorized / /

Country

France / /

Currency

USD / /

/

Event

FDA Phase / /

Facility

Iowa State University / /

IndustryTerm

active site / search process / rough terrain applications / search progresses / equal mechanical energy / path planning software / robot systems / molecular energy landscapes / post processing / respective computing times / manufacturing / computational biology applications / energy landscapes / graph search algorithms / low cost search / possible applications / search space / energy / /

Organization

Cambridge University / MIT / Iowa State University / /

Person

Juan Cort / Thierry Sim´eon / /

Position

RRT-Connect planner / Executive / proposed planner / RANSITION - BASED RRT A. General / planner / T-RRT planner / /

Product

T-RRT solution / RRT solution / /

ProgrammingLanguage

R / /

Technology

minimal Algorithm / T-RRT algorithms / Transition-based RRT algorithm / RRT-like algorithms / molecular modeling / artificial intelligence / A∗ algorithm / basic Extend-RRT algorithm / basic RRT algorithm / 148 processor / classical RRT algorithm / graph search algorithms / T-RRT algorithm / Simulation / animation / classic RRT algorithm / RRT algorithm / TRRT algorithm / computed using the A∗ algorithm / /

SocialTag