1480 search results - page 145 / 296 » Ants can solve constraint satisfaction problems |
215
click to vote
AAAI
2008
15 years 8 months ago
2008
When controlling dynamic systems, such as mobile robots in uncertain environments, there is a trade off between risk and reward. For example, a race car can turn a corner faster b...
163
click to vote
IV
2003
IEEE
15 years 11 months ago
2003
IEEE
In this paper, we present a new framework for the use of Virtual Reality (VR) in engineering design for configuration applications. Traditional VR systems support the visual explo...
192
click to vote
CDC
2009
IEEE
15 years 11 months ago
2009
IEEE
Abstract— We study the problem of maximizing the aggregated revenue in sensor networks with deadline constraints. Our model is that of a sensor network that is arranged in the fo...
162
click to vote
ATAL
2006
Springer
15 years 10 months ago
2006
Springer
Distributed Constraint Satisfaction Problems (DCSPs) provide a model to capture a broad range of cooperative multiagent problem solving settings. Researchers have generally propos...
169
click to vote
ICRA
2009
IEEE
16 years 1 months ago
2009
IEEE
Abstract— We present the Constrained Bi-directional RapidlyExploring Random Tree (CBiRRT) algorithm for planning paths in configuration spaces with multiple constraints. This al...