2796 search results - page 166 / 560 » The coolest path problem |
169
click to vote
ICRA
2009
IEEE
16 years 28 days ago
2009
IEEE
Abstract— We present a novel approach to compute collisionfree paths for multiple robots subject to local coordination constraints. More specifically, given a set of robots, the...
151
click to vote
TARK
2007
Springer
16 years 11 days ago
2007
Springer
We introduce ATLES – a variant of ATL with explicit names for strategies in the object language. ATLES makes it possible to refer to the same strategy in different occurrences o...
170
click to vote
SIGMOD
2004
ACM
15 years 11 months ago
2004
ACM
Clustering is one of the most important analysis tasks in spatial databases. We study the problem of clustering objects, which lie on edges of a large weighted spatial network. Th...
160
click to vote
ICRA
1999
IEEE
15 years 10 months ago
1999
IEEE
In future planetary exploration missions, rovers will be required to autonomously traverse challenging environments. Much of the previous work in robot motion planning cannot be s...
157
click to vote
JAIR
2002
15 years 6 months ago
2002
We consider the problem of designing the the utility functions of the utility-maximizing agents in a multi-agent system (MAS) so that they work synergistically to maximize a globa...