1102 search results - page 35 / 221 » Dynamic Constraint Models for Planning and Scheduling Proble... |
114
Voted
ECP
1997
Springer
15 years 4 months ago
1997
Springer
We provide a reconstruction of Blum and Furst’s Graphplan algorithm, and use the reconstruction to extend and improve the original algorithm in several ways. In our reconstructi...
194
Voted
ICLP
2009
Springer
16 years 1 months ago
2009
Springer
Multiagent planning deals with the problem of generating plans for multiple agents. It requires formalizing ways for the agents to interact and cooperate, in order to achieve their...
131
click to vote
ATAL
2001
Springer
15 years 5 months ago
2001
Springer
Abstract. In distributed resource allocation a set of agents must assign their resources to a set of tasks. This problem arises in many real-world domains such as distributed senso...
101
Voted
AIPS
2008
15 years 2 months ago
2008
We address the problem of coordinating the plans and schedules for a team of agents in an uncertain and dynamic environment. Bounded rationality, bounded communication, subjectivi...
128
Voted
JSAC
2007
15 years 10 days ago
2007
— In WDM optical networks connection requests can be classified into three different types: Permanent Lightpath Demands (PLDs), Scheduled Lightpath Demands (SLDs), and Random Li...