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
Principles of artificial intelligence
Principles of artificial intelligence
Efficient implementation of a BDD package
DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
Symbolic Boolean manipulation with ordered binary-decision diagrams
ACM Computing Surveys (CSUR)
Symbolic model checking: 1020 states and beyond
Information and Computation - Special issue: Selections from 1990 IEEE symposium on logic in computer science
Formal methods: state of the art and future directions
ACM Computing Surveys (CSUR) - Special ACM 50th-anniversary issue: strategic directions in computing research
Representing action: indeterminacy and ramifications
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
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Symbolic Model Checking
A Performance Study of BDD-Based Model Checking
FMCAD '98 Proceedings of the Second International Conference on Formal Methods in Computer-Aided Design
Searching Powerset Automata by Combining Explicit-State and Symbolic Model Checking
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Integrating BDD-Based and SAT-Based Symbolic Model Checking
FroCoS '02 Proceedings of the 4th International Workshop on Frontiers of Combining Systems
Open World Planning in the Situation Calculus
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Discovering State Constraints in DISCOPLAN: Some New Results
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Planning via Model Checking: A Decision Procedure for AR
ECP '97 Proceedings of the 4th European Conference on Planning: Recent Advances in AI Planning
Some Results on the Complexity of Planning with Incomplete Information
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
A logic programming approach to knowledge-state planning, II: the DLVk system
Artificial Intelligence
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
SAT-based planning in complex domains: concurrency, constraints and nondeterminism
Artificial Intelligence - special issue on planning with uncertainty and incomplete information
Conformant planning via symbolic model checking
Journal of Artificial Intelligence Research
The automatic inference of state invariants in TIM
Journal of Artificial Intelligence Research
Constructing conditional plans by a theorem-prover
Journal of Artificial Intelligence Research
Heuristic search + symbolic model checking = efficient conformant planning
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
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
Planning as model checking for extended goals in non-deterministic domains
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Conformant planning via heuristic forward search: a new approach
Artificial Intelligence
Strong planning under partial observability
Artificial Intelligence
Theory and Practice of Logic Programming
A Symbolic Model Checking Framework for Safety Analysis, Diagnosis, and Synthesis
Model Checking and Artificial Intelligence
Extending Classical Planning to the Multi-agent Case: A Game-Theoretic Approach
ECSQARU '07 Proceedings of the 9th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
PADL '09 Proceedings of the 11th International Symposium on Practical Aspects of Declarative Languages
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Conformant planning for domains with constraints: a new approach
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 3
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
Dominance and equivalence for sensor-based agents
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
An extension to conformant planning using logic programming
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Journal of Artificial Intelligence Research
Compiling uncertainty away in conformant planning problems with bounded width
Journal of Artificial Intelligence Research
Conformant planning via heuristic forward search: A new approach
Artificial Intelligence
Strong planning under partial observability
Artificial Intelligence
Conformant plans and beyond: Principles and complexity
Artificial Intelligence
Inductive logic programming algorithm for estimating quality of partial plans
MICAI'07 Proceedings of the artificial intelligence 6th Mexican international conference on Advances in artificial intelligence
Simplifying distributed system development
HotOS'09 Proceedings of the 12th conference on Hot topics in operating systems
Compiling Uncertainty Away in Non-Deterministic Conformant Planning
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Approximation of action theories and its application to conformant planning
Artificial Intelligence
Program model checking via action planning
MoChArt'10 Proceedings of the 6th international conference on Model checking and artificial intelligence
An approximation of action theories of AL and its application to conformant planning
LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning
Planning under partial observability by classical replanning: theory and experiments
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three
A conformant planner based on approximation: CpA(H)
ACM Transactions on Intelligent Systems and Technology (TIST) - Special section on agent communication, trust in multiagent systems, intelligent tutoring and coaching systems
International Journal of Approximate Reasoning
Hi-index | 0.00 |
In this paper we tackle the problem of Conformant Planning: find a sequence of actions that guarantees goal achievement regardless of an uncertain initial condition and of nondeterministic action effects. Our approach, set in the framework of search in the belief space, is based on two main intuitions. First, symbolic model checking techniques, Binary Decision Diagrams in particular, can be used to represent and expand the search space, and to provide an efficient computational platform. Second, driving the search solely with reachability information is not effective, and the notion of knowledge has to be taken explicitly into account.We make the following contributions. First, we thoroughly analyze reachability heuristics: we formally prove their admissibility, we show how they can be implemented by means of symbolic techniques, and experimentally evaluate them. Second, we analyze the limitations of reachability heuristics, and propose more informed, yet admissible, heuristics, based on a formal notion of knowledge. Third, we present a practical conformant planning algorithm, where the search is explicitly based on the notion of target knowledge, i.e., the amount of information that has to be available in order to reach the goal. The search alternates between the "Acquire Knowledge" mode, where actions have the precise purpose of gathering necessary information, and the "Reach Goal" mode, where actions are directed towards the goal. Finally, we provide a thorough experimental comparison between several conformant planners. Our approach is sometimes able to outperform the competitor systems by orders of magnitude.