Sciweavers

402 search results - page 26 / 81
» Probability, Parallelism and the State Space Exploration Pro...
Sort
View
RSS
2007
147views Robotics» more  RSS 2007»
13 years 9 months ago
Discrete Search Leading Continuous Exploration for Kinodynamic Motion Planning
Abstract— This paper presents the Discrete Search Leading continuous eXploration (DSLX) planner, a multi-resolution approach to motion planning that is suitable for challenging p...
Erion Plaku, Lydia E. Kavraki, Moshe Y. Vardi
CDC
2009
IEEE
156views Control Systems» more  CDC 2009»
13 years 12 months ago
Input design using Markov chains for system identification
This paper studies the input design problem for system identification where time domain constraints have to be considered. A finite Markov chain is used to model the input of the s...
Chiara Brighenti, Bo Wahlberg, Cristian R. Rojas
BMCBI
2010
123views more  BMCBI 2010»
13 years 8 months ago
Decoding HMMs using the k best paths: algorithms and applications
Background: Traditional algorithms for hidden Markov model decoding seek to maximize either the probability of a state path or the number of positions of a sequence assigned to th...
Daniel G. Brown 0001, Daniil Golod
PPSN
2004
Springer
14 years 1 months ago
A Primer on the Evolution of Equivalence Classes of Bayesian-Network Structures
Bayesian networks (BN) constitute a useful tool to model the joint distribution of a set of random variables of interest. To deal with the problem of learning sensible BN models fr...
Jorge Muruzábal, Carlos Cotta
IJCAI
1989
13 years 9 months ago
Coping With Uncertainty in Map Learning
In many applications in mobile robotics, it is important for a robot to explore its environment in order to construct a representation of space useful for guiding movement. We refe...
Kenneth Basye, Thomas Dean, Jeffrey Scott Vitter