Back to Results
First PageMeta Content
Applied mathematics / Combinatorial optimization / Routing algorithms / A* search algorithm / Game artificial intelligence / Motion planning / Breadth-first search / Induced path / Heuristic function / Graph theory / Search algorithms / Mathematics


Anytime Incremental Planning with E-Graphs Mike Phillips1 and Andrew Dornbush1 and Sachin Chitta2 and Maxim Likhachev1 Abstract— Robots operating in real world environments need to find motion plans quickly. Robot moti
Add to Reading List

Document Date: 2013-02-26 12:06:48

Open Document

File Size: 3,21 MB

Share Result on Facebook

City

Cambridge / Zaragoza / /

Company

Neural Information Processing Systems / MIT Press / PA 2 Willow Garage Inc. / Experience Graphs / GE / /

Country

Spain / /

Facility

Carnegie Mellon University / Willow Garage / Open Motion Planning Library / /

IndustryTerm

actual search / heuristic search / search tree changes / search-based planning method / given search iteration / search starting / feasible solution / highdimensional systems / search-based planners / final solution / real-time replanning / closer to optimal solutions / particular search iteration / search tree / Search-based / search iteration / focussed d* algorithm / search efforts / /

Organization

Robotics Institute / MIT / US Federal Reserve / Carnegie Mellon University / Pittsburgh / /

Position

D* planner / anytime randomized planner / representative / RRT* planner / dishwasher / planner / /

Technology

Incremental sampling-based algorithms / AD* algorithm / ARA* algorithm / machine learning / A* algorithm / simulation / focussed d* algorithm / anytime replanning algorithm / /

URL

http /

SocialTag