2014 IEEE International Conference on Robotics and Automation (ICRA) 2014
DOI: 10.1109/icra.2014.6906602
|View full text |Cite
|
Sign up to set email alerts
|

Robust online belief space planning in changing environments: Application to physical mobile robots

Abstract: Abstract-Motion planning in belief space (under motion and sensing uncertainty) is a challenging problem due to the computational intractability of its exact solution. The Feedback-based Information RoadMap (FIRM) framework made an important theoretical step toward enabling roadmap-based planning in belief space and provided a computationally tractable version of belief space planning. However, there are still challenges in applying belief space planners to physical systems, such as the discrepancy between com… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
15
0

Year Published

2014
2014
2021
2021

Publication Types

Select...
6
2

Relationship

3
5

Authors

Journals

citations
Cited by 22 publications
(15 citation statements)
references
References 23 publications
(27 reference statements)
0
15
0
Order By: Relevance
“…Therefore, (20) is satisfied with B = co{B i } m i=1 . Similarly, we can show that if (29) is satisfied, B = co{B i } m i=1 satisfies (21).…”
Section: Pomdp Safety Verification Using Barrier Certificatesmentioning
confidence: 99%
See 1 more Smart Citation
“…Therefore, (20) is satisfied with B = co{B i } m i=1 . Similarly, we can show that if (29) is satisfied, B = co{B i } m i=1 satisfies (21).…”
Section: Pomdp Safety Verification Using Barrier Certificatesmentioning
confidence: 99%
“…Yet, the problem lies in the fact that the reachable belief space is not known a priori and therefore it is hard to make judgements on the convergence rate of a given approximate method. Several techniques have been proposed for estimating the reachable belief space mainly based on heuristics [17], [18], "smarter" sampling methods, such as importance sampling [19], and graph search [20], [21]. However, these methods are difficult to adapt from one problem setting to another and are often ad hoc.…”
Section: Introductionmentioning
confidence: 99%
“…On roadmaps in belief space, the situation is even more complicated, since the controller has to drive the probability distribution over the state to the -neighborhood of a belief node in belief space. Again, if the linearized system in (2) is controllable, using a linear stochastic controller such as the stationary LQG controller, one can drive the robot belief to the belief node [5]. However, if the system is non-stoppable and/or its linearized model is not controllable, the belief stabilization, if possible, is much more difficult than state stabilization.…”
Section: Periodic-node Prmmentioning
confidence: 99%
“…In [5] first FIRM is presented as an abstract framework for graph-based planning in belief space and then Stationary Linear Quadratic Gaussian-FIRM (SLQG-FIRM) is presented as a concrete instantiation of the abstract FIRM framework. The performance of FIRM has been demonstrated on physical mobile robots in changing environments [2]. However, SLQG-FIRM is limited to the systems that are stabilizable to stationary fixed points (with zero velocity) in the state space.…”
Section: Introductionmentioning
confidence: 99%
“…For example, the works in [8], [9] improved the performance of VO localization by actively choosing timing and camera direction to obtain an optimal image sequence using the predictive perception technique. This problem is typically approached by Partially Observable Markov Decision Process (POMDP), or belief-space planning [10], [11], [12], [13], [14], where the planner chooses optimal actions under motion and sensing uncertainty.…”
Section: Introductionmentioning
confidence: 99%