Sciweavers

810 search results - page 128 / 162
» Solving Time-Dependent Planning Problems
Sort
View
ICRA
2010
IEEE
161views Robotics» more  ICRA 2010»
13 years 6 months ago
DisCoverage: A new paradigm for multi-robot exploration
— The main aspect in multi-robot exploration is the efficient coordination of a group of robots. Inspired by previous results on the coverage problem, we propose a novel, fronti...
A. Dominik Haumann, Kim D. Listmann, Volker Willer...
ATAL
2008
Springer
13 years 10 months ago
Exploiting locality of interaction in factored Dec-POMDPs
Decentralized partially observable Markov decision processes (Dec-POMDPs) constitute an expressive framework for multiagent planning under uncertainty, but solving them is provabl...
Frans A. Oliehoek, Matthijs T. J. Spaan, Shimon Wh...
SIGMOD
1996
ACM
116views Database» more  SIGMOD 1996»
14 years 2 days ago
Optimizing Queries over Multimedia Repositories
Repositories of multimedia objects having multiple types of attributes e.g., image, text are becoming increasingly common. A selection on these attributes will typically produce n...
Surajit Chaudhuri, Luis Gravano
PUK
2001
13 years 9 months ago
Realizing a Global Hyperpolyhedron Constraint via LP Techniques
Combination of AI/OR methods is gaining a great deal of attention because many combinatorial problems especially in planning and scheduling areas can be solved by means of combined...
Miguel A. Salido, Adriana Giret, Federico Barber
COMPGEOM
2004
ACM
13 years 11 months ago
Continuous path verification in multi-axis NC-machining
We introduce a new approach to the problem of collision detection between a rotating milling-cutter of an NC-machine and a model of a solid workpiece, as the rotating cutter conti...
Ron Wein, Oleg Ilushin, Gershon Elber, Dan Halperi...