Sciweavers

920 search results - page 107 / 184
» Generating Satisfiable Problem Instances
Sort
View
ICRA
2005
IEEE
125views Robotics» more  ICRA 2005»
15 years 6 months ago
Temporal Logic Motion Planning for Mobile Robots
— In this paper, we consider the problem of robot motion planning in order to satisfy formulas expressible in temporal logics. Temporal logics naturally express traditional robot...
Georgios E. Fainekos, Hadas Kress-Gazit, George J....
119
Voted
ECAI
2010
Springer
14 years 10 months ago
LTL Goal Specifications Revisited
The language of linear temporal logic (LTL) has been proposed as a formalism for specifying temporally extended goals and search control constraints in planning. However, the seman...
Andreas Bauer 0002, Patrik Haslum
114
Voted
CEC
2009
IEEE
15 years 7 months ago
The multiobjective evolutionary algorithm based on determined weight and sub-regional search
— By dividing the multiobjective optimization of the decision space into several small regions, this paper proposes multi-objective optimization algorithm based on sub-regional s...
Hai-lin Liu, Xueqiang Li
172
Voted
COR
2011
14 years 7 months ago
MIP models for connected facility location: A theoretical and computational study
This article comprises the first theoretical and computational study on mixed integer programming (MIP) models for the connected facility location problem (ConFL). ConFL combines...
Stefan Gollowitzer, Ivana Ljubic
122
Voted
AI
2010
Springer
15 years 26 days ago
Kernel functions for case-based planning
Case-based planning can take advantage of former problem-solving experiences by storing in a plan library previously generated plans that can be reused to solve similar planning p...
Ivan Serina