Sciweavers

310 search results - page 11 / 62
» A General Technique for Plan Repair
Sort
View
AAAI
2004
13 years 9 months ago
Effective Approaches for Partial Satisfaction (Over-Subscription) Planning
In many real world planning scenarios, agents often do not have enough resources to achieve all of their goals. Consequently, they are forced to find plans that satisfy only a sub...
Menkes van den Briel, Romeo Sanchez Nigenda, Minh ...
IPPS
1998
IEEE
13 years 11 months ago
Capturing the Connectivity of High-Dimensional Geometric Spaces by Parallelizable Random Sampling Techniques
Abstract. Finding paths in high-dimensional gemetric spaces is a provably hard problem. Recently, a general randomized planning scheme has emerged as an e ective approach to solve ...
David Hsu, Lydia E. Kavraki, Jean-Claude Latombe, ...
COMPGEOM
2000
ACM
13 years 12 months ago
Fast computation of generalized Voronoi diagrams using graphics hardware
: We present a new approach for computing generalized Voronoi diagrams in two and three dimensions using interpolation-based polygon rasterization hardware. The input primitives ma...
Kenneth E. Hoff III, Tim Culver, John Keyser, Ming...
AAAI
1994
13 years 8 months ago
The Automated Mapping of Plans for Plan Recognition
To coordinate with other agents in its environment, an agent needs models of what the other agents are trying to do. When communication is impossible or expensive, this informatio...
Marcus J. Huber, Edmund H. Durfee, Michael P. Well...
WSCG
2003
163views more  WSCG 2003»
13 years 8 months ago
Constructing Approximate Voronoi Diagrams from Digital Images of Generalized Polygons and Circular Objects
In this paper we present the geometrical construction of an approximate generalized Voronoi diagram for generalized polygons and circular objects based on their minimum geometrica...
W. L. Roque, D. Doering