Back to Results
First PageMeta Content
Mathematics / Combinatorial optimization / Applied mathematics / Routing algorithms / A* search algorithm / Heuristic function / Motion planning / Admissible heuristic / Heuristic / Search algorithms / Heuristics / Artificial intelligence


Anytime Search-Based Footstep Planning with Suboptimality Bounds Armin Hornung Andrew Dornbush
Add to Reading List

Document Date: 2013-01-08 04:27:51


Open Document

File Size: 555,01 KB

Share Result on Facebook

Company

Neural Information Processing Systems / Intel / Honda / /

Country

Germany / United States / /

Facility

Carnegie Mellon University / Search-based Planning Library / Robotics Institute / University of Freiburg / /

IndustryTerm

found solution / search variant / post-processing step / heuristic search / dense search / search-based motion / non-optimal initial solution / local search / local wA* search / search-based planners / dense search graph / pre-computing footstep transitions / search-based footstep / A* search / search-based / local deterministic search / suboptimal solution / search space / sub-optimal solutions / search methods / /

Organization

Humanoid Robots Lab / Robotics Institute / German Research Foundation / Carnegie Mellon University / Pittsburgh / U.S. Securities and Exchange Commission / University of Freiburg / /

Person

Maren Bennewitz / /

Position

improved hierarchical motion planner / footstep planner / ROS footstep planner / DENSELY CLUTTERED ENVIRONMENT Planner / adaptive action model for legged navigation planning / second planner / planner / walking controller / http /

RadioStation

Core / /

Technology

heuristic Algorithm / /

URL

http /

SocialTag