Sciweavers

166 search results - page 11 / 34
» Planning with Action Abstraction and Plan Decomposition Hier...
Sort
View
FOIKS
2008
Springer
14 years 11 months ago
Defeasible Reasoning and Partial Order Planning
Abstract. Argumentation-based formalisms provide a way of considering the defeasible nature of reasoning with partial and often erroneous knowledge in a given environment. This pro...
Diego R. García, Alejandro Javier Garc&iacu...
KR
1992
Springer
15 years 1 months ago
Reasoning About Indefinite Actions
In this paper, we view planning as a special case of reasoning about indefinite actions. We treat actions as predicates defined over a linear temporal order. This formalism permit...
L. Thorne McCarty, Ron van der Meyden
IROS
2007
IEEE
131views Robotics» more  IROS 2007»
15 years 4 months ago
A hybrid approach for complete motion planning
Abstract— We present an efficient algorithm for complete motion planning that combines approximate cell decomposition (ACD) with probabilistic roadmaps (PRM). Our approach uses ...
Liangjun Zhang, Young J. Kim, Dinesh Manocha
JSW
2008
73views more  JSW 2008»
14 years 9 months ago
Teaching Virtual Experts for Multi-Domain Collaborative Planning
Abstract-- This paper presents an approach to rapid development of virtual planning experts that can collaborate to develop plans of action requiring expertise from multiple domain...
Gheorghe Tecuci, Mihai Boicu, Dorin Marcu, Marcel ...
PRICAI
2010
Springer
14 years 8 months ago
Partial Weighted MaxSAT for Optimal Planning
Abstract. We consider the problem of computing optimal plans for propositional planning problems with action costs. In the spirit of leveraging advances in general-purpose automate...
Nathan Robinson, Charles Gretton, Duc Nghia Pham, ...