Result 1 to 20 of 133 total
Generalized reaction functions for solving complex-task allocation problems (English)
IJCAI, 478-483 (2011).
1
Incremental DCOP search algorithms for solving dynamic dcops (English)
AAMAS, 1069-1070 (2011).
2
Tree adaptive A (English)
AAMAS, 123-130 (2011).
3
Theta$^*$: any-angle path planning on grids. (English)
J. Artif. Intell. Res. (JAIR) 39, 533-579 (2010).
4
BnB-ADOPT: an asynchronous branch-and-bound DCOP algorithm. (English)
J. Artif. Intell. Res. (JAIR) 38, 85-133 (2010).
5
Localization: approximation and performance bounds to minimize travel distance (English)
IEEE Transactions on Robotics 26, No. 2, 320-330 (2010).
6
Multirobot forest coverage for weighted and unweighted terrain (English)
IEEE Transactions on Robotics 26, No. 6, 1018-1031 (2010).
7
Lazy theta*: any-angle path planning and path length analysis in 3D (English)
SOCS (2010).
8
Moving target D* lite (English)
AAMAS, 67-74 (2010).
9
Generalized fringe-retrieving A*: faster moving target search on state lattices (English)
AAMAS, 1081-1088 (2010).
10
ESP: pursuit evasion on series-parallel graphs (English)
AAMAS, 1519-1520 (2010).
11
Open problem: analyzing ant robot coverage (English)
COLT, 312-313 (2010).
12
Lazy theta*: any-angle path planning and path length analysis in 3D (English)
AAAI (2010).
13
Sequential incremental-value auctions (English)
AAAI (2010).
14
Progress on agent coordination with cooperative auctions (English)
AAAI (2010).
15
Comparing real-time and incremental heuristic search for real-time situated agents. (English)
Auton. Agents Multi-Agent Syst. 18, No. 3, 313-341 (2009).
16
A near-tight approximation algorithm for the robot localization problem. (English)
SIAM J. Comput. 39, No. 2, 461-490 (2009).
17
IDB-ADOPT: a depth-first search DCOP algorithm. (English)
Oddi, Angelo (ed.) et al., Recent advances in constraints. 13th annual ERCIM international workshop on constraint solving and constraint logic programming, CSCLP 2008, Rome, Italy, June 18‒20, 2008. Revised selected papers. Berlin: Springer (ISBN 978-3-642-03250-9/pbk). Lecture Notes in Computer Science 5655. Lecture Notes in Artificial Intelligence, 132-146 (2009).
18
Efficient incremental search for moving target search (English)
IJCAI, 615-620 (2009).
19
Incremental phi*: incremental any-angle path planning on grids (English)
IJCAI, 1824-1830 (2009).
20
Result 1 to 20 of 133 total