{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T07:46:17Z","timestamp":1757576777316},"reference-count":16,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1109\/robot.2004.1307192","type":"proceedings-article","created":{"date-parts":[[2004,11,13]],"date-time":"2004-11-13T00:14:14Z","timestamp":1100304854000},"source":"Crossref","is-referenced-by-count":21,"title":["Artificial potential biased probabilistic roadmap method"],"prefix":"10.1109","author":[{"given":"D.","family":"Aarno","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D.","family":"Kragic","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H.I.","family":"Christensen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","article-title":"Elementary Differential Equations and Boundary Value Problems","author":"boyce","year":"1997"},{"key":"ref11","article-title":"Fysikens Matematiska Metoder","author":"erikson","year":"2001"},{"key":"ref12","article-title":"On probabilistic completeness and expected complexity of probabilistic path planning","author":"svestka","year":"1996","journal-title":"Tech Rep"},{"key":"ref13","article-title":"Data Structures Using C","author":"tenenbaum","year":"1990"},{"key":"ref14","article-title":"Artificial Inteligence: A Modern Approach","author":"russell","year":"1995"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2000.844109"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1985.36"},{"key":"ref4","author":"bohlin","year":"2002","journal-title":"Robot path planning"},{"key":"ref3","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/978-1-4471-1021-7_28","article-title":"A random sampling scheme for path planning","author":"barraquand","year":"1996","journal-title":"Robotics Research"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2003.1242285"},{"key":"ref5","article-title":"Probabilistic roadmaps for path planning in high-dimensional configuration spaces","author":"kavraki","year":"1994","journal-title":"Tech Rep CS-TR-94-1519"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/70.163777"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIC.1992.225141"},{"key":"ref2","article-title":"A probabilistic learning approach to motion planning","author":"overmars","year":"1995","journal-title":"Algorithmic Foundations of Robotics the 1994 Workshop on the Algorithmic Foundations of Robotics"},{"key":"ref1","first-page":"141","article-title":"On finding narrow passages with probabilistic roadmap planners","author":"hsu","year":"1998","journal-title":"Robotics The Algorithmic Perspective"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/136035.136037"}],"event":{"name":"IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA '04. 2004","location":"New Orleans, LA, USA","start":{"date-parts":[[2004,4,26]]},"end":{"date-parts":[[2004,5,1]]}},"container-title":["IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA '04. 2004"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/9126\/29020\/01307192.pdf?arnumber=1307192","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,12,21]],"date-time":"2018-12-21T08:35:00Z","timestamp":1545381300000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1307192\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/robot.2004.1307192","relation":{},"subject":[],"published":{"date-parts":[[2004]]}}}