Sciweavers

181 search results - page 22 / 37
» Online Planning Algorithms for POMDPs
Sort
View
SASO
2008
IEEE
15 years 6 months ago
Connectivity Service for Mobile Ad-Hoc Networks
Abstract—We present a distributed connectivity service that allows agents in a mobile ad-hoc network to move while preserving connectivity. This allows unmodified motion plannin...
Alejandro Cornejo, Nancy A. Lynch
SIGECOM
2010
ACM
170views ECommerce» more  SIGECOM 2010»
15 years 4 months ago
Optimal online assignment with forecasts
Motivated by the allocation problem facing publishers in display advertising we formulate the online assignment with forecast problem, a version of the online allocation problem w...
Erik Vee, Sergei Vassilvitskii, Jayavel Shanmugasu...
ATAL
2010
Springer
15 years 26 days ago
Heuristic search for identical payoff Bayesian games
Bayesian games can be used to model single-shot decision problems in which agents only possess incomplete information about other agents, and hence are important for multiagent co...
Frans A. Oliehoek, Matthijs T. J. Spaan, Jilles St...
IROS
2008
IEEE
113views Robotics» more  IROS 2008»
15 years 6 months ago
Motion planning for urban driving using RRT
— This paper provides a detailed analysis of the motion planning subsystem for the MIT DARPA Urban Challenge vehicle. The approach is based on the Rapidly-exploring Random Trees ...
Yoshiaki Kuwata, Gaston A. Fiore, Justin Teo, Emil...
ATMOS
2010
128views Optimization» more  ATMOS 2010»
14 years 10 months ago
Robust Train Routing and Online Re-scheduling
Train Routing is a problem that arises in the early phase of the passenger railway planning process, usually several months before operating the trains. The main goal is to assign...
Alberto Caprara, Laura Galli, Leo G. Kroon, G&aacu...