{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,6]],"date-time":"2025-06-06T14:48:18Z","timestamp":1749221298695,"version":"3.28.0"},"reference-count":7,"publisher":"IEEE","license":[{"start":{"date-parts":[[1986,1,1]],"date-time":"1986-01-01T00:00:00Z","timestamp":504921600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[1986,1,1]],"date-time":"1986-01-01T00:00:00Z","timestamp":504921600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1986]]},"DOI":"10.1109\/robot.1986.1087478","type":"proceedings-article","created":{"date-parts":[[2005,3,23]],"date-time":"2005-03-23T19:54:47Z","timestamp":1111607687000},"page":"1897-1900","source":"Crossref","is-referenced-by-count":7,"title":["An efficient parallel solution for Euclidean shortest path in three dimensions"],"prefix":"10.1109","author":[{"given":"C.","family":"Bajaj","sequence":"first","affiliation":[{"name":"Purdue University, West Lafayette, IN"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref4","first-page":"560","volume":"22","author":"lozano-perez","year":"1979","journal-title":"An Algorithm for Planning Collision-free Paths among Polyhedral Obstacles"},{"journal-title":"Generalized Unfoldings for Shortest Paths in Euclidean 3-Space","year":"1985","author":"bajaj","key":"ref3"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(85)90029-8"},{"journal-title":"Iterative Solution of Nonlinear Equations in Several Variables","year":"1970","author":"ortega","key":"ref5"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/800057.808676"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/32439.32453"},{"key":"ref1","first-page":"510","article-title":"The Algebraic Complexity of Shortest Paths in Polyhedral Spaces","author":"bajaj","year":"1985","journal-title":"Proc 23rd Allerton Conference on Comm Control and Computing"}],"event":{"name":"1986 IEEE International Conference on Robotics and Automation","start":{"date-parts":[[1986,4,7]]},"location":"San Francisco, CA, USA","end":{"date-parts":[[1986,4,10]]}},"container-title":["Proceedings. 1986 IEEE International Conference on Robotics and Automation"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8152\/23643\/01087478.pdf?arnumber=1087478","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,29]],"date-time":"2024-04-29T17:30:52Z","timestamp":1714411852000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/1087478\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986]]},"references-count":7,"URL":"https:\/\/doi.org\/10.1109\/robot.1986.1087478","relation":{},"subject":[],"published":{"date-parts":[[1986]]}}}