View Document Preview and Link
Document Date: 2003-12-15 05:10:20 Open Document File Size: 334,04 KB Share Result on Facebook
City A∗ / Path Coordination A∗ / Freiburg / Boston / Berlin / Prioritized A∗ / / Company IEEE International / IEEE International ConAutonomous Systems / / Country Germany / / Facility Carnegie Mellon University / University of Freiburg / University of Southern California / / IndustryTerm restricted search space / search process / randomized search / approach algorithm / randomized search starting / unconstrained randomized search / plain randomized search technique / search graph / constrained search leads / constrained search unconstrained search / search number / constrained search / constrained-based search / unconstrained search / sub-optimal solution / constrained search technique / randomized hill-climbing search / search algorithm / multi-robot systems / unconstrained search needs / random priority scheme priority scheme satisfying constraints unconstrained search / search scheme / robot systems / constrained search unconstrained search combinig / predominant algorithms / valid solutions / search space / arbitrary randomized search / baseline path planning algorithm / search time / unconstrained search leads / / Organization G8 / Wolfram Burgard† Sebastian Thrun‡ Department of Computer Science / Pittsburgh PA / School of Computer Science / University of Southern California / G7 / Carnegie Mellon University / University of Freiburg / / Person Donnell Lozano-Perez / T. Lozano-Perez / Thilo Weigel / Maren Bennewitz / Sebastian Thrun / M. Erdmann / / ProvinceOrState Southern California / New York / Massachusetts / / Region Southern California / / Technology predominant algorithms / search algorithm / 3.1 The Randomized Search Technique Our algorithm / baseline path planning algorithm / artificial intelligence / approach algorithm / simulation / / SocialTag