Sciweavers

543 search results - page 38 / 109
» A Theory of Plan Modification
Sort
View
ICRA
2005
IEEE
111views Robotics» more  ICRA 2005»
15 years 3 months ago
Single-Query Entropy-Guided Path Planning
Motion planning for robots with many degrees of freedom requires the exploration of an exponentially large configuration space. Single-query motion planners restrict exploration ...
Brendan Burns, Oliver Brock
ICTAI
2005
IEEE
15 years 3 months ago
Planning with POMDPs Using a Compact, Logic-Based Representation
Partially Observable Markov Decision Processes (POMDPs) provide a general framework for AI planning, but they lack the structure for representing real world planning problems in a...
Chenggang Wang, James G. Schmolze
ATAL
2008
Springer
14 years 12 months ago
Interaction-driven Markov games for decentralized multiagent planning under uncertainty
In this paper we propose interaction-driven Markov games (IDMGs), a new model for multiagent decision making under uncertainty. IDMGs aim at describing multiagent decision problem...
Matthijs T. J. Spaan, Francisco S. Melo
ISMB
2000
14 years 11 months ago
Intelligent Aids for Parallel Experiment Planning and Macromolecular Crystallization
This paper presents a framework called Parallel Experiment Planning (PEP) that is based on an abstraction of how experiments are performed in the domain of macromolecular crystall...
Vanathi Gopalakrishnan, Bruce G. Buchanan, John M....
CORR
2010
Springer
134views Education» more  CORR 2010»
14 years 10 months ago
Incremental Sampling-based Algorithms for Optimal Motion Planning
During the last decade, incremental sampling-based motion planning algorithms, such as the Rapidly-exploring Random Trees (RRTs), have been shown to work well in practice and to po...
Sertac Karaman, Emilio Frazzoli