Handbook of theoretical computer science (vol. B)
Symbolic model checking: 1020 states and beyond
Information and Computation - Special issue: Selections from 1990 IEEE symposium on logic in computer science
Planning control rules for reactive agents
Artificial Intelligence
Automatic OBDD-based generation of universal plans in non-deterministic domains
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Planning for temporally extended goals
Annals of Mathematics and Artificial Intelligence
Symbolic Controller Synthesis for Discrete and Timed Systems
Hybrid Systems II
Automata-Theoretic Approach to Planning for Temporally Extended Goals
ECP '99 Proceedings of the 5th European Conference on Planning: Recent Advances in AI Planning
Strong Cyclic Planning Revisited
ECP '99 Proceedings of the 5th European Conference on Planning: Recent Advances in AI Planning
Planning in nondeterministic domains under partial observability via symbolic model checking
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Linear Time Logic, Conditioned Models, and Planning with Incomplete Knowledge
TABLEAUX '02 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Planning with a language for extended goals
Eighteenth national conference on Artificial intelligence
Weak, strong, and strong cyclic planning via symbolic model checking
Artificial Intelligence - special issue on planning with uncertainty and incomplete information
Conformant planning via symbolic model checking and heuristic search
Artificial Intelligence
Tableau-based automata construction for dynamic linear time temporal logic*
Annals of Mathematics and Artificial Intelligence
Strong planning under partial observability
Artificial Intelligence
A Symbolic Model Checking Framework for Safety Analysis, Diagnosis, and Synthesis
Model Checking and Artificial Intelligence
Using α-ctl to Specify Complex Planning Goals
WoLLIC '08 Proceedings of the 15th international workshop on Logic, Language, Information and Computation
Planning and Interaction Levels for TV Storytelling
ICIDS '08 Proceedings of the 1st Joint International Conference on Interactive Digital Storytelling: Interactive Storytelling
Task decomposition on abstract states, for planning under nondeterminism
Artificial Intelligence
Creating automated plans for Semantic Web applications through planning as model checking
Expert Systems with Applications: An International Journal
Automated Web Services Composition Using Extended Representation of Planning Domain
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Goal specification, non-determinism and quantifying over policies
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Non-monotonic temporal logics that facilitate elaboration tolerant revision of goals
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Fusing procedural and declarative planning goals for nondeterministic domains
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 2
Taming numbers and durations in the model checking integrated planning system
Journal of Artificial Intelligence Research
Decision-theoretic planning with non-Markovian rewards
Journal of Artificial Intelligence Research
The planning spectrum: one, two, three, infinity
Journal of Artificial Intelligence Research
Observation reduction for strong plans
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Planning in nondeterministic domains under partial observability via symbolic model checking
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Strong planning under partial observability
Artificial Intelligence
Structured plans and observation reduction for plans with contexts
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Action Planning for Directed Model Checking of Petri Nets
Electronic Notes in Theoretical Computer Science (ENTCS)
Incremental Verification for On-the-Fly Controller Synthesis
Electronic Notes in Theoretical Computer Science (ENTCS)
Automated composition of Web services via planning in asynchronous domains
Artificial Intelligence
Comparison between two languages used to express planning goals: CTL and EAGLE
PRICAI'06 Proceedings of the 9th Pacific Rim international conference on Artificial intelligence
Active learning of plans for safety and reachability goals with partial observability
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Designing petri net supervisors for multi-agent systems from LTL specifications
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 3
Anytime state-based solution methods for decision processes with non-Markovian rewards
UAI'02 Proceedings of the Eighteenth conference on Uncertainty in artificial intelligence
Planning under uncertainty and its applications
Reasoning, Action and Interaction in AI Theories and Systems
Reasoning about web services in a temporal action logic
Reasoning, Action and Interaction in AI Theories and Systems
Software Engineering for Multi-Agent Systems III
Logical foundations for a rational BDI agent programming language
ProMAS'11 Proceedings of the 9th international conference on Programming Multi-Agent Systems
SAP speaks PDDL: exploiting a software-engineering model for planning in business process management
Journal of Artificial Intelligence Research
Automatic behavior composition synthesis
Artificial Intelligence
Reasoning about nondeterminism in programs
Proceedings of the 34th ACM SIGPLAN conference on Programming language design and implementation
A distributed multi-agent planning approach for automated web services composition
Web Intelligence and Agent Systems
| Hi-index | 0.00 |
Recent research has addressed the problem of planning in non-deterministic domains. Classical planning has also been extended to the case of goals that can express temporal properties. However, the combination of these two aspects is not trivial. In non-deterministic domains, goals should take into account the fact that a plan may result in many possible different executions and that some requirements can be enforced on all the possible executions, while others may be enforced only on some executions. In this paper we address this problem. We define a planning algorithm that generates automatically plans for extended goals in nondeterministic domains. We also provide preliminary experimental results based on an implementation of the planning algorithm that uses symbolic model checking techniques.