2012 IEEE/RSJ International Conference on Intelligent Robots and Systems 2012
DOI: 10.1109/iros.2012.6386059
|View full text |Cite
|
Sign up to set email alerts
|

A "capacitor" bridge builder based safe path planner for difficult regions identification in changing environments

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
5
0

Year Published

2013
2013
2022
2022

Publication Types

Select...
5
1
1

Relationship

2
5

Authors

Journals

citations
Cited by 8 publications
(5 citation statements)
references
References 17 publications
0
5
0
Order By: Relevance
“…Safe motion planning has been studied in several works and is important to guarantee the robot's security and reduce total planning cost. As a variant of DBB, Capacitor Bridge Builder (CBB) is proposed to identify difficult but relatively safe regions in changing environments [14]. Nevertheless, CBB does not pay attention to the variation trend of narrow passage in the C-space, which is crucial for the security of planning.…”
Section: Related Workmentioning
confidence: 99%
See 2 more Smart Citations
“…Safe motion planning has been studied in several works and is important to guarantee the robot's security and reduce total planning cost. As a variant of DBB, Capacitor Bridge Builder (CBB) is proposed to identify difficult but relatively safe regions in changing environments [14]. Nevertheless, CBB does not pay attention to the variation trend of narrow passage in the C-space, which is crucial for the security of planning.…”
Section: Related Workmentioning
confidence: 99%
“…Points in P record the fundamental structure of C-space. In order to describe the validity toggle of points in P, we follow a similar definition of P + and Pto that introduced in [14]: p! P + " #p!…”
Section: Hierarchical Sampling Strategymentioning
confidence: 99%
See 1 more Smart Citation
“…In [28], sampled points using methods from [26] are used with RRT-Connect [29]. In [30], narrow passage samples are generated by building capacitor bridges between positive and negative toggled points in C-space by flagging boundaries of moving obstacles. In [31], fixed length line segments are uniformly distributed in C-space and their intersection points with C-obstacle surfaces as retained as roadmap nodes.…”
Section: Introductionmentioning
confidence: 99%
“…Recently, [15,16,17] followed the idea that pays attention to the information about obstacles, also biasing the sampling to the difficult region [18,19]. However, all these methods have great computational cost in return and may get a slower result even to a basic RRT method when difficult regions do not exist in the free space.…”
Section: Introductionmentioning
confidence: 99%