Sciweavers

810 search results - page 66 / 162
» Solving Time-Dependent Planning Problems
Sort
View
AI
2007
Springer
14 years 2 months ago
Planning in Multiagent Expedition with Collaborative Design Networks
DEC-POMDPs provide formal models of many cooperative multiagent problems, but their complexity is NEXP-complete in general. We investigate a sub-class of DEC-POMDPs termed multiage...
Yang Xiang, Franklin Hanshar
ICRA
2005
IEEE
121views Robotics» more  ICRA 2005»
14 years 1 months ago
Distributed Sampling-Based Roadmap of Trees for Large-Scale Motion Planning
Abstract— High-dimensional problems arising from complex robotic systems test the limits of current motion planners and require the development of efficient distributed motion p...
Erion Plaku, Lydia E. Kavraki
ICRA
2002
IEEE
187views Robotics» more  ICRA 2002»
14 years 1 months ago
Trajectory Planning using Reachable-State Density Functions
:This paper presents a trajectory planning algorithm for mobile robots which may be subject to kinodynamic constraints. Using computational methods from noncommutative harmonic ana...
Richard Mason, Joel W. Burdick
ATAL
2010
Springer
13 years 9 months ago
Distributed coordination of mobile agent teams: the advantage of planning ahead
We consider the problem of coordinating a team of agents engaged in executing a set of inter-dependent, geographically dispersed tasks in an oversubscribed and uncertain environme...
Laura Barbulescu, Zachary B. Rubinstein, Stephen F...
ICML
2003
IEEE
14 years 9 months ago
Planning in the Presence of Cost Functions Controlled by an Adversary
We investigate methods for planning in a Markov Decision Process where the cost function is chosen by an adversary after we fix our policy. As a running example, we consider a rob...
H. Brendan McMahan, Geoffrey J. Gordon, Avrim Blum