Automatic verification of finite-state concurrent systems using temporal logic specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Proceedings of the first international conference on Principles of knowledge representation and reasoning
O-Plan: the open planning architecture
Artificial Intelligence
Conditional nonlinear planning
Proceedings of the first international conference on Artificial intelligence planning systems
Planning under time constraints in stochastic domains
Artificial Intelligence - Special volume on planning and scheduling
Using temporal logic to control search in a forward chaining planner
New directions in AI planning
Planning control rules for reactive agents
Artificial Intelligence
Representing action: indeterminacy and ramifications
Artificial Intelligence
Artificial Intelligence
Towards collaborative and adversarial learning:: a case study in robotic soccer
International Journal of Human-Computer Studies - Evolution and learning in multiagent systems
An action language based on causal explanation: preliminary report
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of 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
Model checking
Symbolic Model Checking
Reinforcement Learning
parcPlan: A Planning Architecture with Parallel Actions, Resources and Constraints
ISMIS '94 Proceedings of the 8th International Symposium on Methodologies for Intelligent Systems
Planning via Model Checking: A Decision Procedure for AR
ECP '97 Proceedings of the 4th European Conference on Planning: Recent Advances in AI Planning
Reinforcement learning: a survey
Journal of Artificial Intelligence Research
STRIPS: a new approach to the application of theorem proving to problem solving
IJCAI'71 Proceedings of the 2nd international joint conference on Artificial intelligence
Universal plans for reactive robots in unpredictable environments
IJCAI'87 Proceedings of the 10th international joint conference on Artificial intelligence - Volume 2
Fast planning through planning graph analysis
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
Real-time search in non-deterministic domains
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
Pushing the envelope: planning, propositional logic, and stochastic search
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
A robust and fast action selection mechanism for planning
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Searching for an alternative plan
AAMAS '03 Proceedings of the second international joint conference on Autonomous agents and multiagent systems
Searching for close alternative plans
Autonomous Agents and Multi-Agent Systems
The PIM: an innovative robot coordination model based on Java thread migration
Proceedings of the 6th international symposium on Principles and practice of programming in Java
Models and methods for plan diagnosis
Autonomous Agents and Multi-Agent Systems
Model-Based diagnosis through OBDD compilation: a complexity analysis
Reasoning, Action and Interaction in AI Theories and Systems
A universal planning system for hybrid domains
Applied Intelligence
Hi-index | 0.00 |
Recently model checking representation and search techniques were shown to be efficiently applicable to planning, in particular to non-deterministic planning. Such planning approaches use Ordered Binary Decision Diagrams (OBDDS) to encode a planning domain as a non-deterministic finite automaton (NFA) and then apply fast algorithms from model checking to search for a solution. OBDDS can effectively scale and can provide universal plans for complex planning domains. We are particularly interested in addressing the complexities arising in non-deterministic, multi-agent domains. In this chapter, we present UMOP,1 a new universal OBDD-based planning framework for non-deterministic, multi-agent domains, which is also applicable to deterministic singleagent domains as a special case. We introduce a new planning domain description language, NADL,2 to specify non-deterministic multi-agent domains. The language contributes the explicit definition of controllable agents and uncontrollable environment agents. We describe the syntax and semantics of NADL and show how to build an efficient OBDD-based representation of an NADL description. The UMOP planning system uses NADL and different OBDD-based universal planning algorithms. It includes the previously developed strong and strong cyclic planning algorithms [9,10]. In addition, we introduce our new optimistic planning algorithm, which relaxes optimality guarantees and generates plausible universal plans in some domains where no strong or strong cyclic solution exist. We present empirical results from domains ranging from deterministic and single-agent with no environment actions to nondeterministic and multi-agent with complex environment actions. UMOP is shown to be a rich and efficient planning system.