Sciweavers

408 search results - page 33 / 82
» A lookahead strategy for solving large planning problems
Sort
View
77
Voted
IROS
2006
IEEE
165views Robotics» more  IROS 2006»
15 years 3 months ago
Learning Relational Navigation Policies
— Navigation is one of the fundamental tasks for a mobile robot. The majority of path planning approaches has been designed to entirely solve the given problem from scratch given...
Alexandru Cocora, Kristian Kersting, Christian Pla...
77
Voted
COMCOM
2006
168views more  COMCOM 2006»
14 years 9 months ago
Relay node placement in large scale wireless sensor networks
Scalability and extended lifetime are two critical design goals of any large scale wireless sensor network. A two-tiered network model has been proposed recently for this purpose....
Jian Tang, Bin Hao, Arunabha Sen
ICCBR
2009
Springer
15 years 4 months ago
Using Meta-reasoning to Improve the Performance of Case-Based Planning
Case-based planning (CBP) systems are based on the idea of reusing past successful plans for solving new problems. Previous research has shown the ability of meta-reasoning approac...
Manish Mehta, Santiago Ontañón, Ashw...
84
Voted
ICCBR
2005
Springer
15 years 3 months ago
Combining Case-Based Memory with Genetic Algorithm Search for Competent Game AI
We use case-injected genetic algorithms for learning how to competently play computer strategy games. Case-injected genetic algorithms combine genetic algorithm search with a case-...
Sushil J. Louis, Chris Miles
ICRA
2002
IEEE
187views Robotics» more  ICRA 2002»
15 years 2 months ago
Trajectory Planning using Reachable-State Density Functions
:This paper presents a trajectory planning algorithm for mobile robots which may be subject to kinodynamic constraints. Using computational methods from noncommutative harmonic ana...
Richard Mason, Joel W. Burdick