Sciweavers

294 search results - page 12 / 59
» Solving the continuous time multiagent patrol problem
Sort
View
ATAL
2007
Springer
15 years 4 months ago
On opportunistic techniques for solving decentralized Markov decision processes with temporal constraints
Decentralized Markov Decision Processes (DEC-MDPs) are a popular model of agent-coordination problems in domains with uncertainty and time constraints but very difficult to solve...
Janusz Marecki, Milind Tambe
AIPS
2006
14 years 11 months ago
Solving Factored MDPs with Exponential-Family Transition Models
Markov decision processes (MDPs) with discrete and continuous state and action components can be solved efficiently by hybrid approximate linear programming (HALP). The main idea ...
Branislav Kveton, Milos Hauskrecht
IPPS
2006
IEEE
15 years 3 months ago
Ant stigmergy on the grid: optimizing the cooling process in continuous steel casting
The paper presents a new distributed metaheuristic algorithm in an optimal control problem related to the cooling process in the continuous casting of steel. The optimization task...
Peter Korosec, Jurij Silc, Bogdan Filipic, Erkki L...
AAAI
2007
15 years 3 days ago
Optimal Multi-Agent Scheduling with Constraint Programming
We consider the problem of computing optimal schedules in multi-agent systems. In these problems, actions of one agent can influence the actions of other agents, while the object...
Willem Jan van Hoeve, Carla P. Gomes, Bart Selman,...
CCE
2011
14 years 1 months ago
Time representations and mathematical models for process scheduling problems
During the last 15 years, many mathematical models have been developed in order to solve process operation scheduling problems, using discrete or continuous time representations. ...
Sylvain Mouret, Ignacio E. Grossmann, Pierre Pesti...