STAN is a domain-independent planner developed within the Strathclyde Planning Group. It has been developed through a succession of versions, currently at version 4. The original version of STAN, based on Graphplan, competed in the first international planning competition at AIPS’98 and demonstrated interesting performance. STAN extended basic Graphplan in several ways, including exploiting a powerful representational structure for the core plan-graph and using a wave-front mechanism to reduce search and graph construction costs once the plan-graph structure reaches a stable state. STAN has also always exploited a parallel domain analysis system, TIM, which can be used as a stand-alone component. The extent to which STAN has used the information TIM can supply has been extended significantly as it has been developed through subsequent versions.

References in zbMATH (referenced in 38 articles , 1 standard article )

Showing results 1 to 20 of 38.
Sorted by year (citations)

1 2 next

  1. Bernardini, Sara; Fagnani, Fabio; Smith, David E.: Extracting mutual exclusion invariants from lifted temporal planning domains (2018)
  2. Steinmetz, Marcel; Hoffmann, Jörg: State space search nogood learning: online refinement of critical-path dead-end detectors in planning (2017)
  3. Bryce, Daniel; Cushing, William; Kambhampati, Subbarao: State agnostic planning graphs: deterministic, non-deterministic, and probabilistic planning (2011)
  4. Fox, Maria; Long, Derek: Efficient implementation of the plan graph in STAN (2011) ioport
  5. Gerevini, Alfonso E.; Saetti, Alessandro; Serina, Ivan: Planning in domains with derived predicates through rule-action graphs and local search (2011)
  6. Ebendt, Rüdiger; Drechsler, Rolf: Weighted (A^*) search - unifying view and application (2009)
  7. Roberts, Mark; Howe, Adele: Learning from planner performance (2009)
  8. Steenhuisen, J. Renze; Witteveen, Cees; Zhang, Yingqian: Plan-coordination mechanisms and the price of autonomy (2009)
  9. Surynek, Pavel: A global filtration for satisfying goals in mutual exclusion networks (2008)
  10. Coles, A. I.; Smith, A. J.: Marvin: a heuristic search planner with online macro-action learning (2007)
  11. Chen, Yixin; Wah, Benjamin W.; Hsu, Chih-Wei: Temporal planning using subgoal partitioning and resolution in SGPlan (2006)
  12. Jefferson, Christopher; Miguel, Angela; Miguel, Ian; Tarim, S. Armagan: Modelling and solving English peg solitaire (2006)
  13. Sebastia, Laura; Onaindia, Eva; Marzal, Eliseo: Decomposition of planning problems (2006)
  14. Wah, Benjamin W.; Chen, Yixin: Constraint partitioning in penalty formulations for solving temporal planning problems (2006)
  15. Zimmerman, T.; Kambhampati, S.: Using memory to transform search on the planning graph (2005)
  16. Baioletti, Marco; Milani, Alfredo; Poggioni, Valentina: Planning with fuzzy resources (2003)
  17. Castellini, Claudio; Giunchiglia, Enrico; Tacchella, Armando: SAT-based planning in complex domains: Concurrency, constraints and nondeterminism (2003)
  18. Do, M.; Kambhampati, S.: SAPA: A multi-objective metric temporal planner (2003)
  19. Edelkamp, S.: Taming numbers and durations in the model checking integrated planning system (2003)
  20. Edelkamp, Stefan: Promela planning (2003)

1 2 next