226 search results - page 45 / 46 » Heuristic Search Planning with BDDs |
CP
2007
Springer
13 years 12 months ago
2007
Springer
Searching for optimal solutions to a problem using lower bounds obtained from a relaxation is a common idea in Heuristic Search and Planning. In SAT and CSPs, however, explicit rel...
SPATIALCOGNITION
2000
Springer
13 years 9 months ago
2000
Springer
The paper analyzes a diagrammatic reasoning problem that consists in finding a graphical layout which simultaneously satisfies a set of constraints expressed in a formal language a...
CHI
2007
ACM
13 years 9 months ago
2007
ACM
With new technology, people can share information about everyday places they go; the resulting data helps others find and evaluate places. Recent applications like Dodgeball and S...
AROBOTS
2011
13 years 23 days ago
2011
Abstract— Many applications require teams of robots to cooperatively execute complex tasks. Among these domains are those where successful coordination solutions must respect con...
ATAL
2009
Springer
14 years 9 days ago
2009
Springer
Previous work in multiagent coordination has addressed the challenge of planning in domains where agents must optimize a global goal, while satisfying local resource constraints. ...