Back to Results
First PageMeta Content
Robot / Mobile robot / Cognitive robotics / Applied mathematics / Computer science / Technology / Outline of robotics / Robotics / Motion planning / Theoretical computer science


Exploiting Constraints During Prioritized Path Planning for Teams of Mobile Robots  Maren Bennewitz
Add to Reading List

Document Date: 2003-12-15 05:10:20


Open Document

File Size: 166,56 KB

Share Result on Facebook

City

Boston / /

Company

Autonomous Systems / /

Currency

USD / /

Facility

University of Southern California / Carnegie Mellon University / University of Freiburg / /

IndustryTerm

search process / randomized search method / randomized search technique / randomized search / random priority scheme priority scheme satisfying constraints unconstrained search / search starting / optimization algorithm / randomized search starting / geometric algorithm / robot systems / search procedure / unconstrained randomized search / plain randomized search technique / constrained search / constrained-based search / search techniques / unconstrained search / predominant algorithms / valid solutions / constrained search technique / search space / monte-carlo algorithm / search algorithm / basic algorithm / multi-robot systems / /

Organization

Germany School of Computer Science / Maren Bennewitz Wolfram Burgard Sebastian Thrun Department of Computer Science / G8 / University of Southern California / G7 / Carnegie Mellon University / Pittsburgh PA / University of Freiburg / /

Person

Donnell Lozano-Perez / Sebastian Thrun / M. Erdmann / T. Lozano-Perez / Maren Bennewitz Wolfram Burgard Sebastian / Albert Ludwig / /

Position

left end / /

ProgrammingLanguage

RC / /

ProvinceOrState

Southern California / Massachusetts / /

Region

Southern California / /

Technology

predominant algorithms / search algorithm / geometric algorithm / monte-carlo algorithm / simulation / optimization algorithm / 4 Experimental Results The algorithm / /

SocialTag