{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T16:18:23Z","timestamp":1754151503811,"version":"3.41.2"},"reference-count":14,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,6,30]],"date-time":"2025-06-30T00:00:00Z","timestamp":1751241600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,6,30]],"date-time":"2025-06-30T00:00:00Z","timestamp":1751241600000},"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":[[2025,6,30]]},"DOI":"10.1109\/ur65550.2025.11078090","type":"proceedings-article","created":{"date-parts":[[2025,7,18]],"date-time":"2025-07-18T17:42:30Z","timestamp":1752860550000},"page":"282-287","source":"Crossref","is-referenced-by-count":0,"title":["H* Algorithm: Enhancing A* for Smoother and More Feasible Robot Navigation"],"prefix":"10.1109","author":[{"given":"Sergei","family":"Gabrielov","sequence":"first","affiliation":[{"name":"University of Houston-Downtown,Department of Computer Science,Houston,USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Azadeh","family":"Izadi","sequence":"additional","affiliation":[{"name":"University of Houston-Downtown,Department of Computer Science,Houston,USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v25i1.7819"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ainit61980.2024.10581675"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TSSC.1968.300136"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1609\/socs.v3i1.18254"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1609\/icaps.v24i1.13633"},{"key":"ref6","first-page":"1177","article-title":"Theta: Any-angle path planning on grids","volume":"7","author":"Nash","year":"2007","journal-title":"AAAI"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1613\/jair.2994"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1002\/rob.20109"},{"issue":"1","key":"ref9","first-page":"1","article-title":"Near optimal hierarchical path-finding","volume":"1","author":"Botea","year":"2004","journal-title":"J. Game Dev."},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2004.1313367"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-47922-8_4"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.ecolmodel.2007.03.041"},{"key":"ref13","volume-title":"Red Blob Games","author":"Patel.","year":"2024"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.3390\/s22062298"}],"event":{"name":"2025 22nd International Conference on Ubiquitous Robots (UR)","location":"College Station, TX, USA","start":{"date-parts":[[2025,6,30]]},"end":{"date-parts":[[2025,7,2]]}},"container-title":["2025 22nd International Conference on Ubiquitous Robots (UR)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11078013\/11077977\/11078090.pdf?arnumber=11078090","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,19]],"date-time":"2025-07-19T04:57:24Z","timestamp":1752901044000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11078090\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,30]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/ur65550.2025.11078090","relation":{},"subject":[],"published":{"date-parts":[[2025,6,30]]}}}