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
Fast planning through planning graph analysis
Artificial Intelligence
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
Planning and Learning by Analogical Reasoning
Planning and Learning by Analogical Reasoning
Symbolic Model Checking
Introduction to Reinforcement Learning
Introduction to Reinforcement Learning
Unifying SAT-based and Graph-based Planning
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
parcPlan: A Planning Architecture with Parallel Actions, Resources and Constraints
ISMIS '94 Proceedings of the 8th International Symposium on Methodologies for Intelligent Systems
Extending Planning Graphs to an ADL Subset
ECP '97 Proceedings of the 4th European Conference on Planning: Recent Advances in AI Planning
Planning via Model Checking: A Decision Procedure for AR
ECP '97 Proceedings of the 4th European Conference on Planning: Recent Advances in AI Planning
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
Analogical replay for efficient conditional planning
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
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
Efficient goal-directed exploration
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Symbolic Heuristic Search Using Decision Diagrams
Proceedings of the 5th International Symposium on Abstraction, Reformulation and Approximation
SetA*: an efficient BDD-based heuristic search algorithm
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
Representation and analysis of coordinated attacks
Proceedings of the 2003 ACM workshop on Formal methods in security engineering
Strong planning under partial observability
Artificial Intelligence
State-set branching: Leveraging BDDs for heuristic search
Artificial Intelligence
Supervision and diagnosis of joint actions in multi-agent plans
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 3
Team Cooperation for Plan Recovery in Multi-agent Systems
MATES '07 Proceedings of the 5th German conference on Multiagent System Technologies
The symbolic OBDD scheme for generating mechanical assembly sequences
Formal Methods in System Design
Task decomposition on abstract states, for planning under nondeterminism
Artificial Intelligence
Monitoring the Execution of a Multi-Agent Plan: Dealing with Partial Observability
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Parametric abstraction of behavioral modes for model-based diagnosis
AI Communications
AAAI'06 proceedings of the 21st national conference on Artificial intelligence - Volume 2
Partial-order planning with concurrent interacting actions
Journal of Artificial Intelligence Research
Taming numbers and durations in the model checking integrated planning system
Journal of Artificial Intelligence Research
Planning with durative actions in stochastic domains
Journal of Artificial Intelligence Research
A formalization of equilibria for multiagent planning
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Strong planning under partial observability
Artificial Intelligence
A distributed control loop for autonomous recovery in a multi-agent plan
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Planning under uncertainty and its applications
Reasoning, Action and Interaction in AI Theories and Systems
The general game playing description language is universal
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Towards Automatic Composition of Web Services: SAT-Based Concretisation of Abstract Scenarios
Fundamenta Informaticae
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 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 article, we present UMOP, a new universal OBDD-based planning framework for non-deterministic, multi-agent domains. We introduce a new planning domain description language, NADL, 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. In addition, we introduce our new optimistic planning algorithm that relaxes optimality guarantees and generates plausible universal plans in some domains where no strong nor strong cyclic solution exists. We present empirical results applying UMOP to domains ranging from deterministic and single-agent with no environment actions to non-deterministic and multi-agent with complex environment actions. UMOP is shown to be a rich and efficient planning system.