swMATH17940MaRDI QIDQ29791FDOQ29791
Author name not available (Why is that?)
Official website: https://arxiv.org/abs/1106.4869
Cited In (32)
- Estimating the probability of meeting a deadline in schedules and plans
- HTN-like solutions for classical planning problems: an application to BDI agent systems
- Title not available (Why is that?)
- Computing the minimal relations in point-based qualitative temporal reasoning through metagraph closure
- Group planning with time constraints
- Modular robotic systems: methods and algorithms for abstraction, planning, control, and synchronization
- WSAT
- JavaLog
- GOLOG
- IPC-4
- UDDI
- AspectWerkz
- MWB
- M-TRAN
- Molecubes
- SuperBot
- SWORD
- Hector
- ASSAM
- TEXPLORE
- RiTHM
- Task decomposition on abstract states, for planning under nondeterminism
- Prodigy
- Deliberative acting, planning and learning with hierarchical operational models
- Computing programs for generalized planning using a classical planner
- A controller synthesis framework for automated service composition
- HyperTensioN
- Scheduling of Flow-Shop, Job-Shop, and Combined Scheduling Problems using MOEAs with Fixed and Variable Length Chromosomes
- ML-plan: automated machine learning via hierarchical planning
- A temporal logic programming approach to planning
- A compiler for MSVL and its applications
- Learning action models from plan examples using weighted MAX-SAT
This page was built for software: SHOP2
