Sciweavers

97 search results - page 10 / 20
» Near-Optimal Search in Continuous Domains
Sort
View
ICRA
2010
IEEE
130views Robotics» more  ICRA 2010»
13 years 8 months ago
Multi-robot coordination with periodic connectivity
Abstract— We consider the problem of multi-robot coordination subject to constraints on the configuration. Specifically, we examine the case in which a mobile network of robots...
Geoffrey Hollinger, Sanjiv Singh
EWCBR
2004
Springer
14 years 1 months ago
MINLP Based Retrieval of Generalized Cases
The concept of generalized cases has been proven useful when searching for configurable and flexible products, for instance, reusable components in the area of electronic design au...
Alexander Tartakovski, Martin Schaaf, Rainer Maxim...
AIM
2004
13 years 9 months ago
An AI Planning-based Tool for Scheduling Satellite Nominal Operations
Satellite domains are becoming a fashionable area of research within the AI community due to the complexity of the problems that these domains need to solve. With the current US a...
María Dolores Rodríguez-Moreno, Dani...
GECCO
2010
Springer
180views Optimization» more  GECCO 2010»
14 years 2 months ago
Comparing results of 31 algorithms from the black-box optimization benchmarking BBOB-2009
This paper presents results of the BBOB-2009 benchmarking of 31 search algorithms on 24 noiseless functions in a black-box optimization scenario in continuous domain. The runtime ...
Nikolaus Hansen, Anne Auger, Raymond Ros, Steffen ...
JAIR
2010
167views more  JAIR 2010»
13 years 8 months ago
The LAMA Planner: Guiding Cost-Based Anytime Planning with Landmarks
LAMA is a classical planning system based on heuristic forward search. Its core feature is the use of a pseudo-heuristic derived from landmarks, propositional formulas that must b...
Silvia Richter, Matthias Westphal