ArvandHerd 2014
نویسندگان
چکیده
ArvandHerd is a sequential satisficing planner that uses a portfolio consisting of LAMA and Arvand. This planner won the multi-core track of the 2011 International Planning Competition. In this paper, we describe the various components of ArvandHerd, the updates made for the 2014 competition, and the modifications that allow ArvandHerd to compete in the single-core sequential satisficing tracks.
منابع مشابه
ArvandHerd: Parallel Planning with a Portfolio
ArvandHerd is a parallel planner that won the multicore 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 conf...
متن کاملFinding Better Candidate Algorithms for Portfolio-Based Planners
In order to construct a high-performance portfolio-based planner, a diverse set of candidate algorithms is needed. In our work, we are looking at the problem of constructing such candidate sets. Below we describe the ArvandHerd planner and use it to demonstrate the importance of selecting a candidate set that uses a variety of heuristic search algorithms. We then describe ways in which candidat...
متن کاملNon Cubic Singularity Surface of Stewart Gough Platform
Article history: Received 19 August 2014 Received in revised form 19 September 2014 Accepted 29 September 2014 Available online 22 October 2014
متن کاملComparing Amusia between Dyslexia students and Normal Students
Article history: Received 25 September 2014 Received in revised form 8 November 2014 Accepted 23 November 2014 Available online 1 December 2014
متن کاملThe Implementation DMAIC Concept Improving the Quality of Production Process
Article history: Received 30 September 2014 Received in revised form 17 November 2014 Accepted 25 November 2014 Available online 13 December 2014
متن کامل