The UCPOP Planner. Note: UCPOP is an aging system - we recommend Sensory Graphplan (SGP) instead. SGP handles a superset of UCPOP functionality and is much, much faster. Common Lisp source code for the UCPOP partial order planner, version 4.1, is available via anonymous FTP. UCPOP operates with actions that have conditional effects and universally quantified preconditions and effects. It accepts universally quantified goals. In addition, UCPOP 4.1 allows domain axioms and predicates that call Common Lisp code to determine satisfiability. With a conservative search strategy UCPOP is both sound and complete for this representation, but one can add aggressive, domain-dependent search control with convenient declarative rules. Our Common Lisp implementation is simple enough for classroom use, yet quite efficient (requiring between 2-20ms to explore and refine a partial plan).

References in zbMATH (referenced in 39 articles )

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

1 2 next

  1. Messing, Andrew; Hutchinson, Seth: Forward chaining hierarchical partial-order planning (2021)
  2. Gerevini, Alfonso Emilio; Schubert, Lenhart: Discovering state constraints for planning with conditional effects in \textscDiscoplan. I (2020)
  3. Domshlak, Carmel; Hoffmann, Jörg; Katz, Michael: Red-black planning: a new systematic approach to partial delete relaxation (2015)
  4. Alford, Ron; Kuter, Ugur; Nau, Dana; Goldman, Robert P.: Plan aggregation for strong cyclic planning in nondeterministic domains (2014)
  5. Kelareva, Elena; Tierney, Kevin; Kilby, Philip: CP methods for scheduling and routing with time-dependent task costs (2014)
  6. Plaisted, David A.; Miller, Swaha: The relative power of semantics and unification (2013)
  7. Gerevini, Alfonso E.; Saetti, Alessandro; Serina, Ivan: Planning in domains with derived predicates through rule-action graphs and local search (2011)
  8. Norman, Timothy J.; Reed, Chris: A logic of delegation (2010)
  9. da Costa Pereira, Célia; Tettamanzi, Andrea G. B.: Reasoning about actions with imprecise and incomplete state descriptions (2009)
  10. Garrido, Antonio; Arangu, Marlene; Onaindia, Eva: A constraint programming formulation for planning: From plan scheduling to plan generation (2009)
  11. Kahramanoğulları, Ozan: On linear logic planning and concurrency (2009)
  12. Kuter, Ugur; Nau, Dana; Pistore, Marco; Traverso, Paolo: Task decomposition on abstract states, for planning under nondeterminism (2009)
  13. Roberts, Mark; Howe, Adele: Learning from planner performance (2009)
  14. Gupta, Manish; Fu, Jicheng; Bastani, Farokh B.; Khan, Latifur; Yen, I-Ling: Rapid goal-oriented automated software testing using MEA-graph planning. (2007) ioport
  15. Stolle, Reinhard; Hogan, Apollo; Bradley, Elizabeth: Agenda control for heterogeneous reasoners (2005)
  16. Thiébaux, Sylvie; Hoffmann, Jörg; Nebel, Bernhard: In defense of PDDL axioms (2005)
  17. Refanidis, Ioannis; Vlahavas, Ioannis: Multiobjective heuristic state-space planning (2003)
  18. Aler, Ricardo; Borrajo, Daniel; Isasi, Pedro: Using genetic programming to learn and improve control knowledge. (2002)
  19. Bradley, Elizabeth; Easley, Matthew; Stolle, Reinhard: Reasoning about nonlinear system identification (2001)
  20. Horty, J. F.; Pollack, M. E.: Evaluating new options in the context of existing plans (2001)

1 2 next