Richard Anthony Valenzano

ArvandHerd: parallel planning with a portfolio

ArvandHerd is a parallel planner that won the multi-core sequential satisficing track of the 2011 International Planning Competition (IPC 2011). It assigns processors to run different members of an algorithm portfolio which contains several configurations of each of two different planners: LAMA-2008 and Arvand. In this paper, we demonstrate that simple techniques for using different planner configurations can significantly improve the coverage of both of these planners. We then show that these two planners, when using multiple configurations, can be combined to construct a high performance parallel planner. In particular, we will show that ArvandHerd can solve more IPC benchmark problems than even a perfect parallelization of LAMA-2011, which won the satisficing track at IPC 2011. We will also show that the coverage of ArvandHerd can be further improved if LAMA-2008 is replaced by LAMA-2011 in the portfolio.

On polygon numbers of circle graphs and distance hereditary graphs

Circle graphs are intersection graphs of chords in a circle and

Adding Exploration to Greedy Best-First Search

k

Advice-Based Exploration in Model-Based Reinforcement Learning

-polygon graphs are intersection graphs of chords in a convex

Probably Bounded Suboptimal Heuristic Search

k

Evaluating state-space abstractions in extensive-form games

-sided polygon where each chord has its endpoints on distinct sides. The

Simultaneously Searching with Multiple Settings: An Alternative to Parameter Tuning for Suboptimal Single-Agent Search Algorithms

k

Simultaneously searching with multiple settings: an alternative to parameter tuning for suboptimal single-agent search algorithms

-polygon graphs, for

A comparison of knowledge-based GBFS enhancements and knowledge-free exploration

k \ge 2

Using alternative suboptimality bounds in Heuristic Search

, form an infinite chain of graph classes, each of which contains the class of permutation graphs. The union of all of those graph classes is the class of circle graphs. The polygon number