Sciweavers

774 search results - page 51 / 155
» Markov incremental constructions
Sort
View
152
Voted
AAAI
2012
13 years 5 months ago
Tree-Based Solution Methods for Multiagent POMDPs with Delayed Communication
Planning under uncertainty is an important and challenging problem in multiagent systems. Multiagent Partially Observable Markov Decision Processes (MPOMDPs) provide a powerful fr...
Frans Adriaan Oliehoek, Matthijs T. J. Spaan
124
Voted
PE
2002
Springer
132views Optimization» more  PE 2002»
15 years 2 months ago
Performance evaluation with temporal rewards
Today many formalisms exist for specifying complex Markov chains. In contrast, formalisms for specifying rewards, enabling the analysis of long-run average performance properties,...
Jeroen Voeten
ICRA
1994
IEEE
102views Robotics» more  ICRA 1994»
15 years 7 months ago
Sensor-Based Planning and Nonsmooth Analysis
This paper describes some initial steps towards sensor based path planning in an unknown static environment. The method is a based on a sensor-based incremental construction of a o...
Howie Choset, Joel W. Burdick
MONET
2002
120views more  MONET 2002»
15 years 3 months ago
Energy-Efficient Broadcast and Multicast Trees in Wireless Networks
The wireless networking environment presents formidable challenges to the study of broadcasting and multicasting problems. In this paper we focus on the problem of multicast tree c...
Jeffrey E. Wieselthier, Gam D. Nguyen, Anthony Eph...
108
Voted
EPEW
2007
Springer
15 years 9 months ago
Closed Form Absorption Time Bounds
We consider a class of Markov chains known for its closed form transient and steady-state distributions. We show that some absorbing chains can be also seen as members of this clas...
Ana Busic, Nihal Pekergin