Sciweavers

294 search results - page 5 / 59
» Solving the continuous time multiagent patrol problem
Sort
View
IJRR
2008
92views more  IJRR 2008»
14 years 9 months ago
Robust and Efficient Covering of Unknown Continuous Domains with Simple, Ant-Like A(ge)nts
We propose a new `Mark-Ant-Walk' algorithm for robust and efficient covering of continuous domains by ant-like robots with very limited capabilities. The robots can mark plac...
Eliyahu Osherovich, Vladimir Yanovski, Israel A. W...
ATAL
2007
Springer
15 years 3 months ago
Approximate state estimation in multiagent settings with continuous or large discrete state spaces
We present a new method for carrying out state estimation in multiagent settings that are characterized by continuous or large discrete state spaces. State estimation in multiagen...
Prashant Doshi
AAAI
2007
15 years 2 days ago
Improved State Estimation in Multiagent Settings with Continuous or Large Discrete State Spaces
State estimation in multiagent settings involves updating an agent’s belief over the physical states and the space of other agents’ models. Performance of the previous approac...
Prashant Doshi
ICML
2006
IEEE
15 years 10 months ago
Probabilistic inference for solving discrete and continuous state Markov Decision Processes
Inference in Markov Decision Processes has recently received interest as a means to infer goals of an observed action, policy recognition, and also as a tool to compute policies. ...
Marc Toussaint, Amos J. Storkey
ATAL
2004
Springer
15 years 3 months ago
Unifying Temporal and Structural Credit Assignment Problems
Single-agent reinforcement learners in time-extended domains and multi-agent systems share a common dilemma known as the credit assignment problem. Multi-agent systems have the st...
Adrian K. Agogino, Kagan Tumer