Sciweavers

408 search results - page 20 / 82
» A lookahead strategy for solving large planning problems
Sort
View
AIPS
2009
14 years 10 months ago
Multi-Agent Online Planning with Communication
We propose an online algorithm for planning under uncertainty in multi-agent settings modeled as DEC-POMDPs. The algorithm helps overcome the high computational complexity of solv...
Feng Wu, Shlomo Zilberstein, Xiaoping Chen
EAAI
2008
104views more  EAAI 2008»
14 years 9 months ago
Feasible distributed CSP models for scheduling problems
Nowadays, many real problems can be formalized as Distributed CSPs. A distributed constraint satisfaction problem (DisCSP) is a CSP in which variables and constraints are distribu...
Miguel A. Salido, Adriana Giret
ICRA
2010
IEEE
90views Robotics» more  ICRA 2010»
14 years 8 months ago
Robust robotic assembly through contingencies, plan repair and re-planning
Abstract— Enabling mobile robots to assemble large structures in constrained environments requires planning systems that are both capable of dealing with high complexity and can ...
Frederik W. Heger, Sanjiv Singh
73
Voted
RAS
2006
134views more  RAS 2006»
14 years 9 months ago
Simultaneous planning, localization, and mapping in a camera sensor network
In this paper we examine issues of localization, exploration, and planning in the context of a hybrid robot/camera-network system. We exploit the ubiquity of camera networks to us...
Ioannis M. Rekleitis, David Meger, Gregory Dudek
GECCO
2010
Springer
214views Optimization» more  GECCO 2010»
15 years 1 months ago
Mixed-integer evolution strategy using multiobjective selection applied to warehouse design optimization
This paper reports about the application of a new variant of multiobjective Mixed-Integer Evolution Strategy to a warehouse design optimization problem. The algorithm is able to d...
Edgar Reehuis, Thomas Bäck