AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Computational complexity of planning and approximate planning in the presence of incompleteness
Artificial Intelligence
Formalizing sensing actions—a transition function based approach
Artificial Intelligence
Conformant planning via symbolic model checking and heuristic search
Artificial Intelligence
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
The FF planning system: fast plan generation through heuristic search
Journal of Artificial Intelligence Research
Journal of Artificial Intelligence Research
Planning graph heuristics for belief space search
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
State agnostic planning graphs: deterministic, non-deterministic, and probabilistic planning
Artificial Intelligence
On the impact of belief state representation in planning under uncertainty
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
Hi-index | 0.00 |
The paper presents novel techniques to process planning problem specifications, expressed in a declarative description language, which enables the description of planning problems with incomplete knowledge. The outcome is improved performance and scalability of conformant planners. The paper proposes two transformations of a planning problem specification, aimed at reducing the size of the initial belief state and the number of actions to be dealt with. The two transformations have been implemented in a static analyzer and in a companion heuristic search conformant planner (CpA +). The performance of the resulting system is compared with other state-of-the-art conformant planners.