Zobrazeno 1 - 10
of 26
pro vyhledávání: '"Jory Denny"'
Publikováno v:
IEEE Robotics and Automation Letters. 5:6916-6923
Nearest-neighbor finding is a major bottleneck for sampling-based motion planning algorithms. The cost of finding nearest neighbors grows with the size of the roadmap, leading to a significant computational bottleneck for problems which require many
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2672be3dfab612f5bef8754050b0709f
https://doi.org/10.1109/lra.2020.3017472
https://doi.org/10.1109/lra.2020.3017472
Publikováno v:
IEEE Robotics and Automation Letters. 5:6161-6168
Many types of planning problems require discovery of multiple pathways through the environment, such as multi-robot coordination or protein ligand binding. The Probabilistic Roadmap (PRM) algorithm is a powerful tool for this case, but often cannot e
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9acb4f6500ea2fc705c3cebda8dcf7a6
https://doi.org/10.1109/lra.2020.3010487
https://doi.org/10.1109/lra.2020.3010487
Autor:
Jory Denny, Benjamin T. Fine
Publikováno v:
IEEE Robotics & Automation Magazine. 26:102-110
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c272dd3e5840deb517d87ebfc52fed28
https://doi.org/10.1109/mra.2019.2891182
https://doi.org/10.1109/mra.2019.2891182
Publikováno v:
ICRA
One key aspect to planning safe motions for a robot requires maintaining a minimum distance from obstacles. The medial axis, or the set of all points equidistant to two or more obstacles, is useful for planning in this context. However, it is computa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::76d4b05d0a2cf95b5a4d3a82210fe612
https://doi.org/10.1109/icra48506.2021.9562067
https://doi.org/10.1109/icra48506.2021.9562067
Autor:
Jory Denny, Benjamin T. Fine
Publikováno v:
SAC
Multi-agent routing is an important aspect to studying livestock management, traffic patterns, and pedestrian egress. However, much of the literature does not fully account for the underlying dynamics of the agents' group level behavior or fluctuatin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3070b1d5f0fb117a6dcb8539acf1e1b7
https://doi.org/10.1145/3341105.3373965
https://doi.org/10.1145/3341105.3373965
Publikováno v:
Springer Proceedings in Advanced Robotics ISBN: 9783030430887
WAFR
WAFR
Current state-of-the-art motion planners rely on samplingbased planning to explore the problem space for a solution. However, sampling valid configurations in narrow or cluttered workspaces remains a challenge. If a valid path for the robot correlate
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::36d152d1115c2237fdf3f0d8a45c645c
https://doi.org/10.1007/978-3-030-43089-4_41
https://doi.org/10.1007/978-3-030-43089-4_41
Autor:
Jory Denny, Benjamin T. Fine
Publikováno v:
IEEE Robotics & Automation Magazine. 27:10-11
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::dbb3df56c5d223e3f9c69a8e5790743c
https://doi.org/10.1109/mra.2020.2967006
https://doi.org/10.1109/mra.2020.2967006
Publikováno v:
IROS
Many applications of robotic motion planning benefit from considering multiple homotopically distinct paths rather than a single path from start to goal. However, determining whether paths represent different homotopy classes can be difficult to comp
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::56dbd61bf252a3e0a091bdba523b75be
https://doi.org/10.1109/iros.2018.8594325
https://doi.org/10.1109/iros.2018.8594325
Publikováno v:
Springer Proceedings in Advanced Robotics ISBN: 9783319609157
ISRR (2)
ISRR (2)
Sampling-based planning is a common method for solving motion planning problems. However, this paradigm falters in difficult scenarios, such as narrow passages. In contrast, humans can frequently identify these challenges and can sometimes propose an
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::980f6b2c2bb710bece0986f75daec813
https://doi.org/10.1007/978-3-319-60916-4_32
https://doi.org/10.1007/978-3-319-60916-4_32
Publikováno v:
IROS
Sampling-based techniques are often employed to solve various complex motion planning problems —the problem of computing a valid path under various robot and/or obstacle constraints. As these methods are random in nature, the probability of their s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9009f3abc38fc8ef16a253bb3571b8bc
https://doi.org/10.1109/iros.2016.7759704
https://doi.org/10.1109/iros.2016.7759704