37 search results - page 6 / 8 » Planning with Time Limits in BDI Agent Programming Languages |
CP
2004
Springer
15 years 2 months ago
2004
Springer
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve planning and scheduling problems. Tasks are allocated to facilities using MILP and sche...
KI
2001
Springer
15 years 1 months ago
2001
Springer
High-level controllers that operate robots in dynamic, uncertain domains are concerned with at least two reasoning tasks dealing with the effects of noisy sensors and effectors: T...
82
Voted
ATAL
2009
Springer
15 years 4 months ago
2009
Springer
We introduce an adversarial planning algorithm based on game tree search, which is applicable in large-scale multiplayer domains. In order to tackle the scalability issues of game...
79
Voted
AAAI
2010
14 years 11 months ago
2010
The selection of the action to do next is one of the central problems faced by autonomous agents. In AI, three approaches have been used to address this problem: the programming-b...
JAIR
2010
14 years 8 months ago
2010
Because an agent’s resources dictate what actions it can possibly take, it should plan which resources it holds over time carefully, considering its inherent limitations (such a...