Admissible heuristic

Results: 82



#Item
1AltAlt: Combining the Advantages of Graphplan and Heuristic State Search Romeo Sanchez Nigenda, XuanLong Nguyen & Subbarao Kambhampati Department of Computer Science and Engineering Arizona State University, Tempe AZ 852

AltAlt: Combining the Advantages of Graphplan and Heuristic State Search Romeo Sanchez Nigenda, XuanLong Nguyen & Subbarao Kambhampati Department of Computer Science and Engineering Arizona State University, Tempe AZ 852

Add to Reading List

Source URL: rakaposhi.eas.asu.edu

Language: English - Date: 2000-09-17 18:28:48
2Artificial Intelligence–123  Planning graph as the basis for deriving heuristics for plan synthesis by state space and CSP search ✩ XuanLong Nguyen 1 , Subbarao Kambhampati ∗ , Romeo S. Nigenda Depart

Artificial Intelligence–123 Planning graph as the basis for deriving heuristics for plan synthesis by state space and CSP search ✩ XuanLong Nguyen 1 , Subbarao Kambhampati ∗ , Romeo S. Nigenda Depart

Add to Reading List

Source URL: rakaposhi.eas.asu.edu

Language: English - Date: 2009-07-17 17:36:19
3Informed RRT*: Optimal Sampling-based Path Planning Focused via Direct Sampling of an Admissible Ellipsoidal Heuristic Jonathan D. Gammell1 , Siddhartha S. Srinivasa2 , and Timothy D. Barfoot1 Abstract— Rapidly-explori

Informed RRT*: Optimal Sampling-based Path Planning Focused via Direct Sampling of an Admissible Ellipsoidal Heuristic Jonathan D. Gammell1 , Siddhartha S. Srinivasa2 , and Timothy D. Barfoot1 Abstract— Rapidly-explori

Add to Reading List

Source URL: www.ri.cmu.edu

Language: English - Date: 2014-07-22 11:25:05
4Generating and Evaluating Unsolvable STRIPS Planning Instances for Classical Planning Bachelor’s Thesis  Natural Science Faculty of the University of Basel

Generating and Evaluating Unsolvable STRIPS Planning Instances for Classical Planning Bachelor’s Thesis Natural Science Faculty of the University of Basel

Add to Reading List

Source URL: ai.cs.unibas.ch

Language: English - Date: 2014-08-11 10:56:40
5A Normal Form for Classical Planning Tasks Florian Pommerening and Malte Helmert University of Basel Basel, Switzerland {florian.pommerening,malte.helmert}@unibas.ch

A Normal Form for Classical Planning Tasks Florian Pommerening and Malte Helmert University of Basel Basel, Switzerland {florian.pommerening,malte.helmert}@unibas.ch

Add to Reading List

Source URL: ai.cs.unibas.ch

Language: English - Date: 2015-04-01 08:50:48
6A Pattern Database Approach for Solving the TopSpin Puzzle Problem Pier Paolo Bortoluzzi University of Basel Examinar: Malte Helmert Supervisor: Martin Wehrle

A Pattern Database Approach for Solving the TopSpin Puzzle Problem Pier Paolo Bortoluzzi University of Basel Examinar: Malte Helmert Supervisor: Martin Wehrle

Add to Reading List

Source URL: ai.cs.unibas.ch

Language: English - Date: 2013-01-07 17:29:29
7Additive Counterexample-guided Cartesian Abstraction Refinement Jendrik Seipp and Malte Helmert Universit¨at Basel Basel, Switzerland {jendrik.seipp,malte.helmert}@unibas.ch

Additive Counterexample-guided Cartesian Abstraction Refinement Jendrik Seipp and Malte Helmert Universit¨at Basel Basel, Switzerland {jendrik.seipp,malte.helmert}@unibas.ch

Add to Reading List

Source URL: ai.cs.unibas.ch

Language: English - Date: 2013-06-05 11:45:20
8University Basel  Automatic Selection of Pattern Collections for Domain Independent Planning Master Thesis

University Basel Automatic Selection of Pattern Collections for Domain Independent Planning Master Thesis

Add to Reading List

Source URL: ai.cs.unibas.ch

Language: English - Date: 2014-06-18 14:17:42
9Classical planning  PDBs iPDB procedure

Classical planning PDBs iPDB procedure

Add to Reading List

Source URL: ai.cs.unibas.ch

Language: English - Date: 2013-08-15 12:22:46
10Diverse and Additive Cartesian Abstraction Heuristics Jendrik Seipp  Malte Helmert

Diverse and Additive Cartesian Abstraction Heuristics Jendrik Seipp Malte Helmert

Add to Reading List

Source URL: ai.cs.unibas.ch

Language: English - Date: 2015-01-31 16:37:01