<--- Back to Details
First PageDocument Content
Mathematics / Heuristics / Cognition / Game artificial intelligence / Routing algorithms / Search algorithms / NP-complete problems / A* search algorithm / Applied mathematics / Admissible heuristic / Algorithm / 15 puzzle
Date: 2009-07-17 17:36:19
Mathematics
Heuristics
Cognition
Game artificial intelligence
Routing algorithms
Search algorithms
NP-complete problems
A* search algorithm
Applied mathematics
Admissible heuristic
Algorithm
15 puzzle

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

Download Document from Source Website

File Size: 561,50 KB

Share Document on Facebook

Similar Documents

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

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

DocID: 1nrAT - View Document

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

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

DocID: 1mDLh - View Document

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

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

DocID: 19sVk - View Document

Generating 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

DocID: 18Yz0 - View Document

A 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

DocID: 18YlY - View Document