2010 IEEE Intelligent Vehicles Symposium 2010
DOI: 10.1109/ivs.2010.5548026
|View full text |Cite
|
Sign up to set email alerts
|

Sensing requirements for a 13,000 km intercontinental autonomous drive

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
21
0
2

Year Published

2011
2011
2024
2024

Publication Types

Select...
4
4
1

Relationship

1
8

Authors

Journals

citations
Cited by 34 publications
(23 citation statements)
references
References 5 publications
0
21
0
2
Order By: Relevance
“…The most time-consuming step of the SGM algorithm is path accumulation, since it must be performed for each pixel, disparity, and path: to speed up the processing, for each path direction the pixels are split into several independent slices that are processed in parallel; moreover only the accumulated value is saved into memory, while temporary data needed for incremental processing is kept into the CPU registers 1 . Finally, when computing the results of Eq.…”
Section: A Stereo Reconstructionmentioning
confidence: 99%
“…The most time-consuming step of the SGM algorithm is path accumulation, since it must be performed for each pixel, disparity, and path: to speed up the processing, for each path direction the pixels are split into several independent slices that are processed in parallel; moreover only the accumulated value is saved into memory, while temporary data needed for incremental processing is kept into the CPU registers 1 . Finally, when computing the results of Eq.…”
Section: A Stereo Reconstructionmentioning
confidence: 99%
“…where µ (c) has been defined above, and c is the distance from R to the cell 3 . In practice, for two cells with equal µ (c) = 0, the nearest one will yield the highest potential.…”
Section: System Characteristicsmentioning
confidence: 99%
“…A great amount of robotics research focuses on vehicle guidance, with the goal of automatically reproducing the tasks usually performed by humans [2], [3]. Among others, an important task is obstacle avoidance, i.e., computing a control such that the trajectory generated is collision-free, and drives the robot to the goal [4].…”
Section: Introductionmentioning
confidence: 99%
“…Today's vehicle-like robots have more complex functions with features of object detection and positioning capabilities Stanek et al [9], specially longterm navigational tasks Broggi et al [8]. Numerous kinematic planners that compute the shortest manoeuvring feasible path for vehicles explicitly considering vehicle dynamics is found in Moriwaki and Tanaka [12]; and similarly Werling et al [6] presented a search for an optimal path using dynamic simulations to determine the traversable or cost of specific terrain segments.…”
Section: Introductionmentioning
confidence: 99%