Sciweavers

408 search results - page 11 / 82
» A lookahead strategy for solving large planning problems
Sort
View
83
Voted
AIPS
2007
14 years 12 months ago
Planning with Respect to an Existing Schedule of Events
Decomposition has proved an effective strategy in planning, with one decomposition-based planner, SGPLAN, exhibiting strong performance in the last two IPCs. By decomposing planni...
Andrew Coles, Maria Fox, Derek Long, Amanda Smith
97
Voted
ICTAI
2005
IEEE
15 years 3 months ago
Subgoal Ordering and Granularity Control for Incremental Planning
In this paper, we study strategies in incremental planning for ordering and grouping subproblems partitioned by the subgoals of a planning problem when each subproblem is solved b...
Chih-Wei Hsu, Yixin Chen
ICDT
1999
ACM
97views Database» more  ICDT 1999»
15 years 1 months ago
Optimizing Large Join Queries in Mediation Systems
In data integration systems, queries posed to a mediator need to be translated into a sequence of queries to the underlying data sources. In a heterogeneous environment, with sour...
Ramana Yerneni, Chen Li, Jeffrey D. Ullman, Hector...
AAAI
2011
13 years 9 months ago
A Switching Planner for Combined Task and Observation Planning
From an automated planning perspective the problem of practical mobile robot control in realistic environments poses many important and contrary challenges. On the one hand, the p...
Moritz Göbelbecker, Charles Gretton, Richard ...
ATAL
2010
Springer
14 years 10 months ago
Adversarial planning for large multi-agent simulations
We investigate planning for self-interested agents in large multi-agent simulations. We present two heuristic algorithms that exploit different domain-specific properties in order...
Viliam Lisý