6693 search results - page 9 / 1339 » On an anytime algorithm for control |
AAAI
2007
13 years 10 months ago
2007
Developing scalable coordination algorithms for multi-agent systems is a hard computational challenge. One useful approach, demonstrated by the Coverage Set Algorithm (CSA), explo...
CEC
2003
IEEE
14 years 1 months ago
2003
IEEE
Abstract- This paper describes an approach to continuous coevolution of form (the morphology) and function (the control behavior) for autonomous vehicles. This study focuses on coe...
PAAMS
2010
Springer
14 years 19 days ago
2010
Springer
In this paper, we introduce a new heuristic search algorithm based on mean values for anytime planning, called MHSP. It consists in associating the principles of UCT, a bandit-base...
ICRA
2007
IEEE
14 years 2 months ago
2007
IEEE
— We present a sampling-based path planning and replanning algorithm that produces anytime solutions. Our algorithm tunes the quality of its result based on available search time...
AAAI
2008
13 years 10 months ago
2008
Most former studies of Distributed Constraint Optimization Problems (DisCOPs) search considered only complete search algorithms, which are practical only for relatively small prob...