Sciweavers

6957 search results - page 89 / 1392
» Planning before plans
Sort
View
ATAL
2010
Springer
13 years 9 months ago
A general, fully distributed multi-agent planning algorithm
We present a fully distributed multi-agent planning algorithm. Our methodology uses distributed constraint satisfaction to coordinate between agents, and local planning to ensure ...
Raz Nissim, Ronen I. Brafman, Carmel Domshlak
ENTCS
2006
162views more  ENTCS 2006»
13 years 8 months ago
Adaptive Graph Pattern Matching for Model Transformations using Model-sensitive Search Plans
The current paper makes two contributions for the graph pattern matching problem of model transformation tools. First, model-sensitive search plan generation is proposed for patte...
Gergely Varró, Katalin Friedl, Dánie...
ENTCS
2007
75views more  ENTCS 2007»
13 years 8 months ago
Testing Planning Domains (without Model Checkers)
We address the problem of verifying planning domains as used in model-based planning, for example in space missions. We propose a methodology for testing flight rules of planning...
Franco Raimondi, Charles Pecheur, Guillaume Brat
ROBOTICA
2002
72views more  ROBOTICA 2002»
13 years 7 months ago
Point-to-Point trajectory planning of flexible redundant robot manipulators using genetic algorithms
: The paper focuses on the problem of point-to-point trajectory planning for flexible redundant robot manipulators (FRM) in joint space. Compared with irredundant flexible manipula...
Shigang Yue, Dominik Henrich, W. L. Xu, S. K. Tso
CP
2010
Springer
13 years 6 months ago
Heuristics for Planning with SAT
Generic SAT solvers have been very successful in solving hard combinatorial problems in various application areas, including AI planning. There is potential for improved performanc...
Jussi Rintanen