Sciweavers

408 search results - page 8 / 82
» A lookahead strategy for solving large planning problems
Sort
View
66
Voted
ICCBR
1999
Springer
15 years 1 months ago
Flexibly Interleaving Processes
We discuss several problems of analogy-driven proof plan construction which prevent a solution for more diæcult target problems or make a solution very expensive. Some of these pr...
Erica Melis, Carsten Ullrich
AAAI
2011
13 years 9 months ago
Termination and Correctness Analysis of Cyclic Control
The utility of including cyclic flow of control in plans has been long recognized by the planning community. Loops in a plan increase both its applicability and the compactness o...
Siddharth Srivastava, Neil Immerman, Shlomo Zilber...
AAAI
2012
12 years 12 months ago
Real-Time Collaborative Planning with the Crowd
Planning is vital to a wide range of domains, including robotics, military strategy, logistics, itinerary generation and more, that both humans and computers find difficult. Col...
Walter S. Lasecki, Jeffrey P. Bigham, James F. All...
TROB
2008
112views more  TROB 2008»
14 years 9 months ago
A Complete and Scalable Strategy for Coordinating Multiple Robots Within Roadmaps
Abstract--This paper addresses the challenging problem of finding collision-free trajectories for many robots moving toward individual goals within a common environment. Most popul...
Mike Peasgood, Christopher M. Clark, John McPhee
CP
1998
Springer
15 years 1 months ago
Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems
We use a local search method we term Large Neighbourhood Search (LNS) for solving vehicle routing problems. LNS meshes well with constraint programming technology and is analogous...
Paul Shaw