Sciweavers

161 search results - page 9 / 33
» Efficiently Executing Information-Gathering Plans
Sort
View
AUSAI
2007
Springer
15 years 1 months ago
Planning as Satisfiability with Relaxed $-Step Plans
Planning as satisfiability is a powerful approach to solving domain independent planning problems. In this paper, we consider a relaxed semantics for plans with parallel operator a...
Martin Wehrle, Jussi Rintanen
ATAL
2008
Springer
14 years 11 months ago
Multi-agent plan diagnosis and negotiated repair
In the complex, dynamic domain of Air Traffic Control (ATC) many unexpected events can happen during the execution of a plan. Sometimes these disruptions make the plan infeasible ...
Huib Aldewereld, Pieter Buzing, Geert Jonker
PVLDB
2008
122views more  PVLDB 2008»
14 years 9 months ago
Identifying robust plans through plan diagram reduction
Estimates of predicate selectivities by database query optimizers often differ significantly from those actually encountered during query execution, leading to poor plan choices a...
Harish D., Pooja N. Darera, Jayant R. Haritsa
SIGMOD
2006
ACM
232views Database» more  SIGMOD 2006»
15 years 9 months ago
To search or to crawl?: towards a query optimizer for text-centric tasks
Text is ubiquitous and, not surprisingly, many important applications rely on textual data for a variety of tasks. As a notable example, information extraction applications derive...
Panagiotis G. Ipeirotis, Eugene Agichtein, Pranay ...
ATAL
2009
Springer
14 years 10 months ago
Efficient physics-based planning: sampling search via non-deterministic tactics and skills
Motion planning for mobile agents, such as robots, acting in the physical world is a challenging task, which traditionally concerns safe obstacle avoidance. We are interested in p...
Stefan Zickler, Manuela M. Veloso