{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T13:04:51Z","timestamp":1730293491574,"version":"3.28.0"},"reference-count":15,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1109\/robot.2004.1307265","type":"proceedings-article","created":{"date-parts":[[2004,11,13]],"date-time":"2004-11-13T00:14:14Z","timestamp":1100304854000},"page":"908-913 Vol.1","source":"Crossref","is-referenced-by-count":1,"title":["A Delaunay triangulation based node connection strategy for probabilistic roadmap planners"],"prefix":"10.1109","author":[{"family":"Yifeng Huang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K.","family":"Gupta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1002\/rob.1035"},{"key":"ref11","article-title":"V-COLLIDE User's Manual - Release 1.1","author":"pattekar","year":"1998","journal-title":"Department of Computer Science"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/24.2.167"},{"journal-title":"Delaunay Triangulations in higher-dimensional Space Implementation report","year":"1998","author":"seel","key":"ref13"},{"journal-title":"Frequently asked questions in polyhedral computation","year":"0","author":"fukuda","key":"ref14"},{"journal-title":"Optimization Techniques for Probabilistic Roadmaps","year":"2000","author":"kathryn dale","key":"ref15"},{"key":"ref4","first-page":"141","article-title":"On Finding Narrow Passages with Probabilistic Roadmap Planners","author":"hsu","year":"1998","journal-title":"Robotics The Algorithmic Perspective"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.1999.772447"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/70.864240"},{"key":"ref5","first-page":"14","article-title":"The Bridge Test for Sampling Narrow Passages with Probabilistc Roadmap Planners","volume":"3","author":"hsu","year":"2003","journal-title":"Proceedings of the IEEE International Conference on Robotics and Automation"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2000.844107"},{"key":"ref7","first-page":"155","article-title":"OBPRM: An obstacle-based PRM for 3D workspaces","author":"amato","year":"1998","journal-title":"Robotics The Algorithmic Perspective 1998 Workshop on the Algorithmic Foundations of Robotics"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.1999.811662"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/70.508439"},{"key":"ref9","first-page":"10","article-title":"MAPRM:A probabilistic roadrnap planner with sampling on the medial axis of the free space","volume":"2","author":"wilmarth","year":"1999","journal-title":"Proceedings of the IEEE International Conference on Robotics and Automation"}],"event":{"name":"IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA '04. 2004","start":{"date-parts":[[2004,4,26]]},"location":"New Orleans, LA, USA","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\/01307265.pdf?arnumber=1307265","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,14]],"date-time":"2017-03-14T01:29:47Z","timestamp":1489454987000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1307265\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/robot.2004.1307265","relation":{},"subject":[],"published":{"date-parts":[[2004]]}}}