Sciweavers

216 search results - page 21 / 44
» The Complexity of Planning Problems With Simple Causal Graph...
Sort
View
GIS
2008
ACM
14 years 8 months ago
Applying hierarchical graphs to pedestrian indoor navigation
In this paper we propose to apply hierarchical graphs to indoor navigation. The intended purpose is to guide humans in large public buildings and assist them in wayfinding. We sta...
Edgar-Philipp Stoffel, Hans Jürgen Ohlbach, K...
DCG
1998
53views more  DCG 1998»
13 years 7 months ago
Motion Planning in Environments with Low Obstacle Density
We present a simple and e cient paradigm for computing the exact solution of the motionplanning problem in environments with a low obstacle density. Such environments frequently o...
A. Frank van der Stappen, Mark H. Overmars, Mark d...
IJRR
2006
126views more  IJRR 2006»
13 years 7 months ago
Market-based Multirobot Coordination for Complex Tasks
Current technological developments and application-driven demands are bringing us closer to the realization of autonomous multirobot systems performing increasingly complex missio...
Robert Zlot, Anthony Stentz
CP
1998
Springer
13 years 12 months ago
Modelling CSP Solution Algorithms with Petri Decision Nets
The constraint paradigm provides powerful concepts to represent and solve different kinds of planning problems, e. g. factory scheduling. Factory scheduling is a demanding optimiz...
Stephan Pontow
WAW
2009
Springer
138views Algorithms» more  WAW 2009»
14 years 2 months ago
Information Theoretic Comparison of Stochastic Graph Models: Some Experiments
The Modularity-Q measure of community structure is known to falsely ascribe community structure to random graphs, at least when it is naively applied. Although Q is motivated by a ...
Kevin J. Lang