Package graphplan.graph.planning

Examples of graphplan.graph.planning.PlanningGraphException

397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
        if(planFound) {
          logger.info("Plan found with "+((int)this.planningGraph.size()/2)+" steps");
        } else {
          logger.info("Plan not found with "+((int)this.planningGraph.size()/2)+" steps");
          if(!planPossible()) {
            throw new PlanningGraphException("Graph has levelled off, plan is not possible.",this.planningGraph.levelOffIndex());
          }
        }
      } else {
        logger.info("Goals not possible with "+((int)this.planningGraph.size()/2)+" steps");
        //If the goals are not possible, and the graph has levelled off,
        //then this problem has no possible plan
        if(this.planningGraph.levelledOff()) {
          throw new PlanningGraphException("Goals are not possible and graph has levelled off, plan is not possible.",this.planningGraph.levelOffIndex());
        }
      }
    }
   
    return this.solutionExtraction.getPlanResult();
View Full Code Here
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
            logger.info("Planner timed out after "+timeout+" milliseconds");
            throw new TimeoutException("No plan possible in "+timeout+" milliseconds");
          }
          logger.info("Plan not found with "+((int)this.planningGraph.size()/2)+" steps");
          if(!planPossible()) {
            throw new PlanningGraphException("Graph has levelled off, plan is not possible.",this.planningGraph.levelOffIndex());
          }
        }
      } else {
        logger.info("Goals not possible with "+((int)this.planningGraph.size()/2)+" steps");
        //If the goals are not possible, and the graph has levelled off,
        //then this problem has no possible plan
        if(this.planningGraph.levelledOff()) {
          throw new PlanningGraphException("Goals are not possible and graph has levelled off, plan is not possible.",this.planningGraph.levelOffIndex());
        }
      }
    }
   
    return solutionExtraction.getPlanResult();
View Full Code Here
107
108
109
110
111
112
113
114
115
116
117
    //Piece of crap algorithm used before has been replaced by this call
   
    try {
      opSet.addAll(opFactory.getAllPossibleInstantiations(new ArrayList<Operator>(opTemplateSet), preconds));
    } catch (OperatorFactoryException e) {
      throw new PlanningGraphException(e.getMessage(),propositionLevel.getIndex()+1);
    }
   
    for (Operator operator : opSet) {
      actionLevel.addAction(operator);
    }
View Full Code Here
77
78
79
80
81
82
83
84
85
86
87
        opFactory.setTypes(this.getTypes());
        opFactory.setParameterTypes(this.getParameterTypes());
        opSet.addAll(opFactory.getAllPossibleInstantiations(new ArrayList<Operator>(opTemplateSet), preconds, initialState));
      } else opSet.addAll(opFactory.getAllPossibleInstantiations(new ArrayList<Operator>(opTemplateSet), preconds));
    } catch (OperatorFactoryException e) {
      throw new PlanningGraphException(e.getMessage(),propositionLevel.getIndex()+1);
    }
   
    for (Operator operator : opSet) {
      actionLevel.addAction(operator);
    }
View Full Code Here
TOP

Related Classes of graphplan.graph.planning.PlanningGraphException

  • graphplan.graph.algorithm.impl.LevelGeneratorClosedWorldAssumptionImpl
  • graphplan.graph.algorithm.impl.LevelGeneratorImpl
  • graphplan.Graphplan
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.