348 search results - page 8 / 70 » Using Constraint Networks on Timelines to Model and Solve Pl... |
COR
2007
13 years 7 months ago
2007
We propose a hybrid method designed to solve a problem of dispatching and conflict free routing of automated guided vehicles (AGVs) in a flexible manufacturing system (FMS). Thi...
AAAI
2000
13 years 8 months ago
2000
Recent work has demonstrated that treating resource reasoning separately from causal reasoning can lead to improved planning performance and rational resource management where inc...
IROS
2006
IEEE
14 years 1 months ago
2006
IEEE
– Active SLAM poses the challenge for an autonomous robot to plan efficient paths simultaneous to the SLAM process. The uncertainties of the robot, map and sensor measurements, a...
COR
2008
13 years 7 months ago
2008
The Swath Segment Selection Problem (SSSP) is an NP-hard combinatorial optimization problem arising in the context of planning and scheduling satellite operations. It was defined ...
CEEMAS
2005
Springer
14 years 28 days ago
2005
Springer
Abstract. Distributed Constraint Satisfaction Problems (DCSP) is a general framework for multi-agent coordination and conflict resolution. In most DCSP algorithms, inter-agent com...