Sciweavers

1146 search results - page 51 / 230
» On the Complexity of Domain-Independent Planning
Sort
View
WADS
2001
Springer
113views Algorithms» more  WADS 2001»
14 years 8 days ago
Movement Planning in the Presence of Flows
This paper investigates the problem of time-optimum movement planning in two and three dimensions for a point robot which has bounded control velocity through a set of n polygonal...
John H. Reif, Zheng Sun
EVOW
2009
Springer
13 years 11 months ago
Staff Scheduling with Particle Swarm Optimisation and Evolution Strategies
The current paper uses a scenario from logistics to show that modern heuristics, and in particular particle swarm optimization (PSO) can significantly add to the improvement of sta...
Volker Nissen, Maik Günther
ESA
2008
Springer
127views Algorithms» more  ESA 2008»
13 years 9 months ago
The Alcuin Number of a Graph
We consider a planning problem that generalizes Alcuin's river crossing problem (also known as: The wolf, goat, and cabbage puzzle) to scenarios with arbitrary conflict graph...
Péter Csorba, Cor A. J. Hurkens, Gerhard J....
INTERACT
2003
13 years 9 months ago
The Augmented Round Table - a New Interface to Urban Planning and Architectural Design
: The Augmented Round Table provides a collaborative interactive AR environment, where users can interact naturally and intuitively. They may create and manipulate complex 3D geome...
Wolfgang Broll
MAAMAW
1994
Springer
13 years 12 months ago
What Ants Cannot Do
What is the relation between the complexity of agents and the complexity of the goals that they can achieve? It is argued on the basis of a fundamental conservation of complexity ...
Eric Werner