Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

33

AIPS
2009

favoriteEmaildiscussreport

84views Artificial Intelligence» more AIPS 2009»

Improving Planning Performance Using Low-Conflict Relaxed Plans

14 years 7 hour ago

Improving Planning Performance Using Low-Conflict Relaxed Plans

Download www.cs.toronto.edu

The FF relaxed plan heuristic is one of the most effective techniques in domain-independent satisficing planning and is used by many state-of-the-art heuristic-search planners. However, it may sometimes provide quite inaccurate information, since its relaxation strategy, which ignores the delete effects of actions, may oversimplify a problem's structure. In this paper, we propose a novel algorithm for computing relaxed plans which

Jorge A. Baier, Adi Botea

Real-time Traffic

AIPS 2009 | Artificial Intelligence | FF Relaxed Plan | Relaxed Plans | State-of-the-art Heuristic-search Planners |

claim paper

Related Content

» Multiple Relaxations in Temporal Planning

» An LPBased Heuristic for Optimal Planning

» Action Elimination and Plan Neighborhood Graph Search Two Algorithms for Plan Improvement

» Active SLAM using Model Predictive Control and Attractor based Exploration

» Using Metareasoning to Improve the Performance of CaseBased Planning

» A lookahead strategy for solving large planning problems

» Subgoal Ordering and Granularity Control for Incremental Planning

» State agnostic planning graphs deterministic nondeterministic and probabilistic planning

» Relaxed Currency and Consistency How to Say Good Enough in SQL

Post Info
More Details (n/a)

Added	08 Nov 2010
Updated	08 Nov 2010
Type	Conference
Year	2009
Where	AIPS
Authors	Jorge A. Baier, Adi Botea

Comments (0)