A ubiquitous problem in robotics is determining policies that move robots with uncertain process and observation models (partially-observed state systems) to a goal configuration while avoiding collision. We propose a new method to solve this minimum uncertainty navigation problem. We use a continuous partially-observable Markov decision process (POMDP) model and optimize an objective function that considers both probability of collision and uncertainty at the goal position. By using information-theoretic heuristics, we are able to find policies that are effective for both minimizing collisions and stopping near the goal configuration. We additionally introduce a filtering algorithm that tracks collision free trajectories and estimates the ...
Sequential decision making under uncertainty problems often deal with partially observable Markov de...
Projecte final de Màster Oficial fet en col.laboració amb Institut de Robàtica i Informàtica Industr...
Abstract — We introduce a resolution-optimal path planner that considers uncertainty while optimizin...
A ubiquitous problem in robotics is determining policies that move robots with uncertain process and...
Partially observable Markov decision processes (POMDPs) provide a principled, general framework for ...
Abstract — We propose a new minimum uncertainty planning technique for mobile robots localizing with...
RECENT research in the field of robotics has demonstrated the utility of probabilistic models for pe...
Motion planning in uncertain and dynamic environments is critical for reliable operation of autonomo...
Decision-making for autonomous systems acting in real world domains are complex and difficult to for...
This thesis experimentally addresses the issue of planning under uncertainty in robotics, with refer...
Publisher Copyright: IEEENoisy sensing, imperfect control, and environment changes are defining char...
In the real world, robots operate with imperfect sensors providing uncertain and incomplete informat...
POMDPs provide a rich framework for planning and control in partially observable domains. Recent new...
We present a probabilistic method for noisy sensor based robotic navigation in dynamic environments....
Probabilistic Roadmaps (PRM) are a commonly used class of algorithms for robot navigation tasks wher...
Sequential decision making under uncertainty problems often deal with partially observable Markov de...
Projecte final de Màster Oficial fet en col.laboració amb Institut de Robàtica i Informàtica Industr...
Abstract — We introduce a resolution-optimal path planner that considers uncertainty while optimizin...
A ubiquitous problem in robotics is determining policies that move robots with uncertain process and...
Partially observable Markov decision processes (POMDPs) provide a principled, general framework for ...
Abstract — We propose a new minimum uncertainty planning technique for mobile robots localizing with...
RECENT research in the field of robotics has demonstrated the utility of probabilistic models for pe...
Motion planning in uncertain and dynamic environments is critical for reliable operation of autonomo...
Decision-making for autonomous systems acting in real world domains are complex and difficult to for...
This thesis experimentally addresses the issue of planning under uncertainty in robotics, with refer...
Publisher Copyright: IEEENoisy sensing, imperfect control, and environment changes are defining char...
In the real world, robots operate with imperfect sensors providing uncertain and incomplete informat...
POMDPs provide a rich framework for planning and control in partially observable domains. Recent new...
We present a probabilistic method for noisy sensor based robotic navigation in dynamic environments....
Probabilistic Roadmaps (PRM) are a commonly used class of algorithms for robot navigation tasks wher...
Sequential decision making under uncertainty problems often deal with partially observable Markov de...
Projecte final de Màster Oficial fet en col.laboració amb Institut de Robàtica i Informàtica Industr...
Abstract — We introduce a resolution-optimal path planner that considers uncertainty while optimizin...