Back to Results
First PageMeta Content
Network theory / Robot control / Probabilistic roadmap / Motion planning / Shortest path problem / Graph / Geometric spanner / Widest path problem / Mathematics / Theoretical computer science / Graph theory


Asymptotically Near-Optimal Planning with Probabilistic Roadmap Spanners James D. Marble and Kostas E. Bekris I. I NTRODUCTION Roadmap planners [1] utilize an off-line phase to build
Add to Reading List

Document Date: 2012-12-20 19:29:50

Open Document

File Size: 140,60 KB

Share Result on Facebook

City

New York City / Sampling / /

Company

Reno NV / /

/

Facility

University of Nevada / /

IndustryTerm

graph search / spanner algorithm / motion planning algorithms / online query resolution / na¨ıve greedy spanner algorithm / Online queries / /

Organization

Department of Computer Science and Engineering / Internal Revenue Service / University of Nevada / Reno / /

Person

James D. Marble / /

ProvinceOrState

Nevada / New York / /

Technology

Sampling-based algorithms / na¨ıve greedy spanner algorithm / k-PRM∗ algorithm / spanner algorithm / motion planning algorithms / /

SocialTag