Sciweavers

860 search results - page 116 / 172
» Biased Random Walks
Sort
View
IROS
2009
IEEE
227views Robotics» more  IROS 2009»
15 years 4 months ago
Cell-RRT: Decomposing the environment for better plan
— In order to define an architecture for task and motion planning of a mobile robot, we propose the CellRRT path planner that combines the advantages of planning approaches by d...
Julien Guitton, Jean-Loup Farges, Raja Chatila
EUROPAR
2009
Springer
15 years 4 months ago
Zero-Day Reconciliation of BitTorrent Users with Their ISPs
Abstract. BitTorrent users and consumer ISPs are often pictured as having opposite interests, with end-users aggressively trying to improve their download times, while ISPs throttl...
Marco Slot, Paolo Costa, Guillaume Pierre, Vivek R...
ICRA
2007
IEEE
156views Robotics» more  ICRA 2007»
15 years 4 months ago
Multipartite RRTs for Rapid Replanning in Dynamic Environments
Abstract— The Rapidly-exploring Random Tree (RRT) algorithm has found widespread use in the field of robot motion planning because it provides a single-shot, probabilistically c...
Matthew Zucker, James J. Kuffner, Michael S. Brani...
GECCO
2007
Springer
166views Optimization» more  GECCO 2007»
15 years 4 months ago
Comparison of tree and graph encodings as function of problem complexity
In this paper, we analyze two general-purpose encoding types, trees and graphs systematically, focusing on trends over increasingly complex problems. Tree and graph encodings are ...
Michael D. Schmidt, Hod Lipson
GECCO
2005
Springer
153views Optimization» more  GECCO 2005»
15 years 3 months ago
Finding needles in haystacks is harder with neutrality
This research presents an analysis of the reported successes of the Cartesian Genetic Programming method on a simplified form of the Boolean parity problem. We show the method of...
M. Collins