Sciweavers

4894 search results - page 101 / 979
» Dynamic Abstraction Planning
Sort
View
AIIA
2011
Springer
13 years 10 months ago
Over-Subscription Planning with Boolean Optimization: An Assessment of State-of-the-Art Solutions
Abstract. In this work we present an assessment of state-of-the-art Boolean optimization solvers from different AI communities on over-subscription planning problems. The goal of t...
Marco Maratea, Luca Pulina
PKDD
2009
Springer
102views Data Mining» more  PKDD 2009»
15 years 4 months ago
Relevance Grounding for Planning in Relational Domains
Probabilistic relational models are an efficient way to learn and represent the dynamics in realistic environments consisting of many objects. Autonomous intelligent agents that gr...
Tobias Lang, Marc Toussaint
ICRA
2005
IEEE
119views Robotics» more  ICRA 2005»
15 years 3 months ago
Comparison of Alternate Methods for Distributed Motion Planning of Robot Collectives within a Potential Field Framework
– In this paper, we evaluate the performance of two candidate formulations for distributed motion planning of robot collectives within an Artificial Potential Field (APF) framewo...
Leng-Feng Lee, Rajankumar Bhatt, Venkat Krovi
PDIS
1996
IEEE
15 years 2 months ago
Scrambling Query Plans to Cope With Unexpected Delays
Accessing data from numerous widely-distributed sources poses signi cant new challenges for query optimization and execution. Congestion and failures in the network can introduce ...
Laurent Amsaleg, Michael J. Franklin, Anthony Toma...
AIPS
2008
15 years 11 days ago
A Temporal Logic-Based Planning and Execution Monitoring System
As no plan can cover all possible contingencies, the ability to detect failures during plan execution is crucial to the robustness of any autonomous system operating in a dynamic ...
Jonas Kvarnström, Fredrik Heintz, Patrick Doh...