2018
DOI: 10.1109/tase.2018.2801279
|View full text |Cite
|
Sign up to set email alerts
|

Fast and Bounded Probabilistic Collision Detection for High-DOF Trajectory Planning in Dynamic Environments

Abstract: We present a novel approach to perform probabilistic collision detection between a high-DOF robot and high-DOF obstacles in dynamic, uncertain environments. In dynamic environments with a high-DOF robot and moving obstacles, our approach efficiently computes accurate collision probability between the robot and obstacles with upper error bounds. Furthermore, we describe a prediction algorithm for future obstacle position and motion that accounts for both spatial and temporal uncertainties. We present a trajecto… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
42
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
4
3
2

Relationship

1
8

Authors

Journals

citations
Cited by 41 publications
(62 citation statements)
references
References 45 publications
0
42
0
Order By: Relevance
“…In this way, p-Chekov will not need to waste a long time trying to search for feasible solutions for infeasible cases. Another potential future work direction is to incorporate online obstacle avoidance [36,49,55] into p-Chekov, so that it can handle dynamic obstacles in the execution environment. Additionally, real robot experiments with raw sensor data are also necessary before p-Chekov can be deployed in real-world applications.…”
Section: Discussionmentioning
confidence: 99%
“…In this way, p-Chekov will not need to waste a long time trying to search for feasible solutions for infeasible cases. Another potential future work direction is to incorporate online obstacle avoidance [36,49,55] into p-Chekov, so that it can handle dynamic obstacles in the execution environment. Additionally, real robot experiments with raw sensor data are also necessary before p-Chekov can be deployed in real-world applications.…”
Section: Discussionmentioning
confidence: 99%
“…Monte-Carlo methods can evaluate the probability of collision by sampling, but can be computationally expensive when the likelihood of failure is very small [6]. When the uncertainty is restricted to Gaussian uncertainty on the robot's pose, probabilistic collision checking can yield notable performance improvements [17][13] [12].…”
Section: Related Workmentioning
confidence: 99%
“…We also continuously track the human pose and update the predicted future motion to re-plan safe robot motions. Our approach uses the notion of online probabilistic collision detection [23,26,27] between the robot and the point-cloud data corresponding to human obstacles, to compute reactive costs and integrate them with our optimization-based planner.…”
Section: Online Motion Planningmentioning
confidence: 99%