- Type Parameters:
I1 - Class of the planning problem
O1 - Class of the planning problem solutions (plans)
I2 - Class of the search problem
O2 - Class of the search problem solutions (paths)
N - node type in search problem
A - edge type in search problem
- All Implemented Interfaces:
- ai.libs.jaicore.basic.algorithm.IAlgorithm<I1,O1>, ai.libs.jaicore.basic.algorithm.ISolutionCandidateIterator<I1,O1>, ai.libs.jaicore.basic.Cancelable, ai.libs.jaicore.basic.ILoggingCustomizable, java.lang.Iterable<ai.libs.jaicore.basic.algorithm.events.AlgorithmEvent>, java.util.concurrent.Callable<O1>, java.util.Iterator<ai.libs.jaicore.basic.algorithm.events.AlgorithmEvent>
- Direct Known Subclasses:
- CostSensitiveGraphSearchBasedPlanningAlgorithm, STRIPSPlanner
public class GraphSearchBasedPlanningAlgorithm<I1,O1 extends IGraphSearchBasedPlan<N,A>,I2 extends ai.libs.jaicore.search.probleminputs.GraphSearchInput<N,A>,O2 extends ai.libs.jaicore.search.model.other.SearchGraphPath<N,A>,N,A>
extends ai.libs.jaicore.basic.algorithm.reduction.AReducingSolutionIterator<I1,O1,I2,O2>